Skip to main content
Log in

A note on an open problem in linear complementarity

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible, then the problem (q, M) has a solution. Recently, a characterization ofK has been obtained by Mangasarian [5] in his study of solving linear complementarity problems as linear programs. This note proves a result which improves on such a characterization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. R.W. Cottle and J.S. Pang, “On solving linear complementarity problems as linear programs”, Tech. Rept. SOL 76-5, Systems Optimization Laboratory, Stanford University, Stanford (March 1976).

    Google Scholar 

  2. R.W. Cottle and J.S. Pang, “A least-element theory of solving linear complementarity problems as linear programs”, MRC Tech. Rept. #1702, Mathematics Research Center, University of Wisconsin-Madison (December 1976).

  3. O.L. Mangasarian, “Linear complementarity problems solvable by a single linear program”,Mathematical Programming 10 (1976) 263–270.

    Google Scholar 

  4. O.L. Mangasarian, “Solution of linear complementarity problems by linear programming”, in: G.W. Watson, ed.,Numerical analysis, Dundee 1975, Lecture Notes in Mathematics, No. 506 (Springer, Berlin, 1976) pp. 166–175.

    Google Scholar 

  5. O.L. Mangasarian, “Characterization of linear complementarity problems as linear programs”, Tech. Rept. 271, Computer Sciences Department, University of Wisconsin-Madison (May 1976).

  6. J.S. Pang, “Least element complementarity theory”, Ph.D. dissertation, Department of Operations Research, Stanford University (September 1976).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research sponsored by the United States Army under Contract No. DAAG29-75-C-0024 and the National Science Foundation under Grant No. MCS75-17385.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pang, JS. A note on an open problem in linear complementarity. Mathematical Programming 13, 360–363 (1977). https://doi.org/10.1007/BF01584349

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584349

Key words

Navigation