Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Lemke's algorithm
By Carlton Lemke

In mathematical optimization, Lemke's algorithm is a procedure for solving linear complementarity problems, and more generally mixed linear complementarity problems. It is named after Carlton E. Lemke.

Lemke's algorithm is of pivoting or basis-exchange type. Similar algorithms can compute Nash equilibria for two-person matrix and bimatrix games.

  • Cottle, Richard W.; Pang, Jong-Shi; Stone, Richard E. (1992). The linear complementarity problem. Computer Science and Scientific Computing. Boston, MA: Academic Press, Inc. pp. xxiv+762 pp. ISBN 0-12-192350-9. MR 1150683.
  • Murty, K. G. (1988). Linear complementarity, linear and nonlinear programming. Sigma Series in Applied Mathematics. Vol. 3. Berlin: Heldermann Verlag. pp. xlviii+629 pp. ISBN 3-88538-403-5. Archived from the original on 2010-04-01. (Available for download at the website of Professor Katta G. Murty.) MR949214
We don't have any images related to Lemke's algorithm yet.
We don't have any YouTube videos related to Lemke's algorithm yet.
We don't have any PDF documents related to Lemke's algorithm yet.
We don't have any Books related to Lemke's algorithm yet.
We don't have any archived web articles related to Lemke's algorithm yet.