Lemke's algorithm

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

External links

OMatrix manual on Lemke Chris Hecker's GDC presentation on MLCPs and Lemke Linear Complementarity and Mathematical (Non-linear) Programming Siconos/Numerics open-source GPL implementation in C of Lemke's algorithm and other methods to solve LCPs and MLCPs

Text derived from https://en.wikipedia.org/w/index.php?oldid=1333127795 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001333127795 · captured 1768510616.0 · version history

Cite this page as: encyclopegia.org, “Lemke's algorithm”, snapshot enwiki-001333127795. https://encyclopegia.org/a/lemke-s-algorithm

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.