Abstract
Specially structured linear complementarity problems (LCPs) and their solution by the criss-cross method are examined. The criss-cross method is known to be finite for LCPs with positive semidefinite bisymmetric matrices and with P-matrices. It is also a simple finite algorithm for oriented matroid programming problems. Recently Cottle, Pang, and Venkateswaran identified the class of (column, row) sufficient matrices. They showed that sufficient matrices are a common generalization of P- and PSD matrices. Cottle also showed that the principal pivoting method (with a clever modification) can be applied to row sufficient LCPs. In this paper the finiteness of the criss-cross method for sufficient LCPs is proved. Further it is shown that a matrix is sufficient if and only if the criss-cross method processes all the LCPs defined by this matrix and all the LCPs defined by the transpose of this matrix and any parameter vector.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
