Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- 28 February 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 24 (2) , 216-227
- https://doi.org/10.1016/0377-2217(86)90043-3
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP'sMathematical Programming, 1983
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- A complementarity approach for solving Leontief substitution systems and (generalized) Markov decision processesRairo-Operations Research, 1979
- On solving linear complementarity problems as linear programsPublished by Springer Nature ,1978
- Bilinear programming: An exact algorithmMathematical Programming, 1977
- A cutting plane algorithm for solving bilinear programsMathematical Programming, 1976
- Plastic-elastic torsion, optimal stopping and free boundariesJournal of Engineering Mathematics, 1975
- A linear max—min problemMathematical Programming, 1973
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965