An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds
- 1 January 1978
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A note on A complementary variant of Lemke's methodMathematical Programming, 1976
- Methods for Computing and Modifying the LDV Factors of a MatrixMathematics of Computation, 1975
- A complementary variant of Lemke's method for the linear complementary problemMathematical Programming, 1974
- Projection methods for non-linear programmingMathematical Programming, 1973
- The Linear Complementarity ProblemManagement Science, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964