Jump to content

Lemke's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Numsgil (talk | contribs) at 17:46, 16 July 2009 (Adding mathematical programming template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Lemke's algorithm is a method for solving mixed linear complementarity problems and linear complementarity problems.

References