---
title: Lemke's algorithm
slug: lemke-s-algorithm
qid: 
snapshot: enwiki-001333127795
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1333127795
tags: [23468805, 23617828, 28696367]
---

# Lemke's algorithm

> [!note] Provenance
> Snapshot `enwiki-001333127795` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1333127795> · Licensed CC BY-SA 4.0

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
