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
  • 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.) MR 0949214
edit

📚 Artikel Terkait di Wikipedia

Lemke–Howson algorithm

The Lemke–Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T.

Lemke

Lemke may refer to: Lemke (surname) Lemke (Marklohe), a small village in Germany 14327 Lemke, an asteroid Lemke's algorithm, by Carlton Lemke This disambiguation

Simplex algorithm

optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived from the concept

Linear complementarity problem

any algorithm for solving (strictly) convex QPs can solve the LCP. Specially designed basis-exchange pivoting algorithms, such as Lemke's algorithm and

Levenberg–Marquardt algorithm

In mathematics and computing, the Levenberg–Marquardt algorithm (LMA or just LM), also known as the damped least-squares (DLS) method, is used to solve

Ant colony optimization algorithms

computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems

Edmonds–Karp algorithm

In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in

Approximation algorithm

computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems