Abstract
In this note we settle an open problem posed by Al-Khayyal on a condition being sufficient for a matrix to belong to the class ofQ 0-matrices. The answer is in the affirmative and we further relax the condition and obtain a sufficient condition forQ 0-matrices. The results yield a class of matrices for which the linear complementarity problems can be solved as simple linear programs.
Similar content being viewed by others
References
M. Aganagic and R.W. Cottle, “A constructive characterization ofQ 0-matrices with nonnegative principal minors,”Mathematical Programming 37 (1987) 223–231.
F. A. Al-Khayyal, “Necessary and sufficient conditions for the existence of complementary solutions and characterizations of matrix classesQ andQ 0,”Mathematical Programming 51 (1991) 247–255.
R.W. Cottle and J.S. Pang, “On solving linear complementarity problems as linear programs,”Mathematical Programming Study 7 (1978) 88–107.
R.D. Doverspike and C.E. Lemke, “A partial characterization of a class of matrices defined by solutions to the linear complementarity problem,”Mathematics of Operations Research 7 (1982) 272–294.
B.C. Eaves, “The linear complementary problem,”Management Science 17 (1971) 612–634.
C.B. Garcia, “Some classes of matrices in linear complementarity theory,”Mathematical Programming 5 (1973) 299–310.
O.L. Mangasarian, “Characterizations of linear complementarity problems as linear programs,”Mathematical Programming Study 7 (1978) 74–87.
O.L. Mangasarian, “Simplified characterizations of linear complementarity problems solvable as linear programs,”Mathematics of Operations Research 4 (1979) 268–273.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Murthy, G.S.R. A note on sufficient conditions forQ 0 andQ 0 ⋂P 0 matrices. Mathematical Programming 61, 345–349 (1993). https://doi.org/10.1007/BF01582155
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582155