533

The Extended Linear Complementarity Problem
– O. L. Mangasarian, JongShi Pang
 1993

9

Some Generalizations of the CrissCross Method for the Linear Complementarity Problem of Oriented Matroids
– E Klafszky, T Terlaky
 1989

8

Least index resolution of degeneracy in linear complementarity problems
– Y Y Chang
 1979

12

Linear Complementarity and Oriented Matroids
– Komei Fukuda, Tamas Terlaky
 1990

17

A finite crisscross method for oriented matroids
– T Terlaky
 1987

15

Linear and Quadratic Programming in Oriented Matroids
– M Todd
 1985

6

A Note on a Bard Type Scheme for Solving the Complementarity Problem
– K G Murty
 1974

14

A conformal elimination free algorithm for oriented matroid programming
– Z Wang
 1987

19

A combinatorial abstraction of linear programming
– Robert G Bland
 1977

21

Oriented matroid programming
– K Fukuda
 1982

816

Linear Programming and Extensions
– G B Dantzig
 1963

4

The Principal Pivoting Method Revisited
– R W Cottle
 1989

10

Dantzig, "Complementary Pivot Theory of Mathematical Programming
– R W Cottle, G B
 1968

4

On extremal behaviors of Murty's least index method
– K Fukuda, M Namiki
 1994

6

The Linear Complementarity Problem, Sufficient Matrices and the CrissCross Method
– D. Den Hertog, C. Roos, T. Terlaky
 1990

11

Complementarity in Oriented Matroids
– M J Todd
 1984

5

The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra
– Emil Klafszky, Tamás Terlaky, T. U. Miskolc
 1991

98

complementarity, linear and nonlinear programming
– Murty K G Linear
 1988

5

A General Algorithmic Framework for Quadratic Programming and a Generalization of EdmondsFukuda Rule as a Finite Version of Van de PanneWhinston Method, Mathematical Programming (to appear
– K Fukuda, T Terlaky
 1989
