Application of disjunctive programming to the linear complementarity problem
- 1 December 1984
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 31 (4) , 589-600
- https://doi.org/10.1002/nav.3800310408
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Characterizations of bounded solutions of linear complementarity problemsPublished by Springer Nature ,1982
- On the generation of deep disjunctive cutting planesNaval Research Logistics Quarterly, 1980
- The Indefinite Quadratic Programming ProblemOperations Research, 1979
- Disjunctive ProgrammingPublished by Elsevier ,1979
- Cutting-Planes for Complementarity ConstraintsSIAM Journal on Control and Optimization, 1978
- Characterization of linear complementarity problems as linear programsPublished by Springer Nature ,1978
- Cutting-Plane Theory: Disjunctive MethodsPublished by Elsevier ,1977
- Polyhedral annexation in mixed integer and combinatorial programmingMathematical Programming, 1975
- Polyhedral convexity cuts and negative edge extensionsMathematical Methods of Operations Research, 1974
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968