References
- Bland , R.G. 1977 . A new pivoting rule for the simplex method . Mathematics of Operations Research , 2 : 102 – 108 .
- chang Y.-Y. Least-index resolution of degeneracy in linear complementarity problems Technical Report 79-14. Department of Operations Research, Stanford Univ. Stanford, , CA 1979
- Cottle , R.W. and Dantzig , G.B. 1968 . Complementarity pivot theory of mathematical programming . Linear Algebra Appl , 1 : 103 – 125 .
- Fathi , Y. 1979 . Computational complexity of LCPs associated with positive definite symmetric matrices . Math.Programming , 17 : 335 – 344 .
- Fukuda , K. and Matsui , T. 1991 . On the finiteness of the criss-cross method . European J.Oper.Res , 52 : 119 – 124 .
- Den Hertog D. Roos C. Terlaky T. The linear complementarity problem, sufficient matrices and the Criss-Cross method. Journal Linear Algebra and Its Applications Submitted to the
- Keller , E.L. 1973 . The general quadratic optimization problem . Math.Programming , 5 : 311 – 337 .
- Klafszky E. Terlaky T. Some generalizations of the Criss-Cross method for quadratic programming Optimization To appear
- Murty , K.G. 1988 . Linear Complementarity, Linear and Nonlinear Programming , Berlin : Helderman .
- Roos , C. 1990 . An exponential example for Terlaky's pivoting rule for the Criss-Cross simplex method . Math.Programming , 46 : 79 – 84 .
- Terlaky , T. 1985 . A convergent Criss-Cross method . Optimization , 16 : 683 – 690 .