Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- 1 June 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (2) , 189-198
- https://doi.org/10.1007/bf02124679
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Equivalence of some quadratic programming algorithmsMathematical Programming, 1984
- Least-index resolution of degeneracy in quadratic programmingMathematical Programming, 1980
- Oriented matroidsJournal of Combinatorial Theory, Series B, 1978
- Orientability of matroidsJournal of Combinatorial Theory, Series B, 1978
- A combinatorial abstraction of linear programmingJournal of Combinatorial Theory, Series B, 1977
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- The general quadratic optimization problemMathematical Programming, 1973
- Duality Theory of Linear Programs: A Constructive Approach with ApplicationsSIAM Review, 1969
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- On quadratic prorammingNaval Research Logistics Quarterly, 1959