Abstract
This paper generalizes the answers that were given by R.W. Cottle to questions that were originally raised by G. Maier.
Essentially, we give necessary and sufficient conditions for some notions of monotonicity of solutions for the parametric linear complementarity problem. Our proofs are direct ones and not algorithmic, as Cottle's proofs are, and also cover a broader class of matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.W. Cottle, “Monotone solutions of the parametric linear complementarity problem”,Mathematical Programming 3 (1972) 210–224.
R.W. Cottle and A.F. Veinott Jr., “Polyhedral sets having a least element”,Mathematical Programming 3 (1972) 238–249.
S. Karamardian, “The complementarity problem”,Mathematical Programming 2 (1972) 107–129.
C.E. Lemke, “Recent results on complementarity problems”, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970).
G. Maier, “Problem—on parametric linear complementarity problems”,SIAM Review 14 (1972) 364–365.
K.G. Murty, “On the parametric linear complementarity problem”, Engineering Summer Conference Notes, University of Michigan Ann Arbor, MI (August 1971).
H. Samelson, R.M. Thrall and O. Wesler, “A partition theorem for euclideann-space”,Proceedings of the American Mathematical Society 9 (1958) 805–807.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Megiddo, N. On monotonicity in parametric linear complementarity problems. Mathematical Programming 12, 60–66 (1977). https://doi.org/10.1007/BF01593769
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01593769