Robust implementation of Lemke's method for the linear complementarity problem

DOI10.1007/BFb0120781zbMath0378.90055MaRDI QIDQ4159162

No author found.

Publication date: 1978

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, Generalization of Murty's direct algorithm to linear and convex quadratic programming, A global Newton method to compute Nash equilibria., Models and methods of solution of quadratic integer programming problems, George B. Dantzig and systems optimization, Parallel pivotal algorithm for solving the linear complementarity problem, A decomposition algorithm for quadratic programming, Large-scale linearly constrained optimization, A symplectic pseudospectral method for constrained time-delayed optimal control problems and its application to biological control problems

Uses Software

• DEVEX