Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- 1 April 1988
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 57 (1) , 123-149
- https://doi.org/10.1007/bf00939332
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- A SPECIAL CLASS OF LARGE QUADRATIC PROGRAMS11This research was supported by Air Force Office of Scientific Research Contract F44620-74-C-0079.Published by Elsevier ,1978
- An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower boundsPublished by Springer Nature ,1978
- On solving linear complementarity problems as linear programsPublished by Springer Nature ,1978
- Robust implementation of Lemke's method for the linear complementarity problemPublished by Springer Nature ,1978
- On the solution of large, structured linear complementarity problems: The block partitioned caseApplied Mathematics & Optimization, 1977
- On the solution of large, structured linear complementarity problems: The tridiagonal caseApplied Mathematics & Optimization, 1976
- Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functionsLinear Algebra and its Applications, 1972
- On pseudo-convex functions of nonnegative variablesMathematical Programming, 1971
- Technical Note—Complementary ProgrammingOperations Research, 1971
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965