Skip to main content
Log in

More with the Lemke complementarity algorithm

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

In the case that the matrix of a linear complementarity problem consists of the sum of a positive semi-definite matrix and a co-positive matrix a general condition is deduced implying that the Lemke algorithm will terminate with a complementarity solution. Applications are presented on bi-matrix games, convex quadratic programming and multi-period programs.

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. M. Bastian,Lineare Komplementärprobleme im O.R. und in der Wirtschaftstheorie (Verlag Anton Hain, Meisenheim am Glan, 1976).

  2. R. Cottle and B. Dantzig, “Complementarity pivot theory of mathematical programming”, in: G. Dantzig, ed.,Mathematics of the decision sciences (Stanford Univ. 1968).

  3. B. Dantzig, and A. Manne, Research Report '73, I.I.A.S.A., Austria.

  4. T.G.M. De Beer, “An economic growth model with an infinite horizon”, Masters Thesis, Tilburg Univ. (1975).

  5. B.C. Eaves, “The linear complementary problem”,Management Science 17 (1971).

  6. J.J.M. Evers,Linear programming over an infinite horizon (Tilburg University Press, 1973).

  7. J.J.M. Evers, “The Lemke—Howson algorithm and linear infinite horizon programming”, Res. Memorandum 56, Tilburg University (1973).

  8. J.J.M. Evers, “On the existence of balanced solutions in optimal economical growth and investment problems”, Res. Memorandum 51, Tilburg University (1974).

  9. T. Hansen and T. Koopmans “On the definition and computation of a capital stock invariant under optimization”,Journal of Economic Theory 5 (1972).

  10. Philip C. Jones, “Computation of an optimal invariant capital stock”, ORC 77-9, University of California, Berkeley (April 1977).

    Google Scholar 

  11. C. Lemke, “On complementary pivot theory”, in: G. Dantzig, ed.,Mathematics of the decision sciences (Stanford University 1968).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Contributed to the XXIII TIMS Meeting, Athens, July 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evers, J.J.M. More with the Lemke complementarity algorithm. Mathematical Programming 15, 214–219 (1978). https://doi.org/10.1007/BF01609020

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation