Lemke's algorithm

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

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 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.

References

edit edit source edit edit source Complementarity problems and algorithmsComplementarity Problems Basis-exchange algorithms Optimization: Algorithms, methods, and heuristics Hessians Network flows

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 2026-01-15 · not yet sealed in the ledger · verify the chain · 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

6 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.