L-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program
- 59 Downloads
The classes ofL 1-matrices,L 2-matrices,L 3-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example.
Key WordsLinear complementarity problems linear programs
AMS subject classification90C05 90C33
Unable to display preview. Download preview PDF.
- Aganagic M. and Cottle R.W. (1987). A constructive characterization ofQ 0-matrices with nonnegative principal minors.Mathematical Programming 37, 227–231.Google Scholar
- Al-Khayyal F.A. (1989). On characterizing linear complementarity problems as linear programs.Optimization 20, 715–724.Google Scholar
- Cottle R.W., Pang J.S. and Stone R.E. (1992).The Linear Complementarity Problem. Academic Press.Google Scholar
- Li Y.J., Wang S.Y. and Wang R.S. (1995a). Minimum principles for a monotone linear complementarity problem.Systems Science and Mathematical Sciences 16, 235–243.Google Scholar
- Li Y.J., Wang S.Y. and Wang R.S. (1995b). Error bounds for a monotone linear complementarity problem.Systems Science and Mathematical Sciences 16, 316–325.Google Scholar
- Mangasarian O.L. (1976b). Solutions of linear complementarity problems by linear programming. In: Watson G.W. (ed.),Numerical Analysis Dundee, Lecture Notes on Mathematics, 506. Springer-Verlag, 166–175.Google Scholar