11

Complementarity in Oriented Matroids
–
 1984

4

The equivalence of Dantzig's SelfDual Parametric Algorithm for Linear Programs to Lemke's Algorithm for Linear Complementarity Problems Applied to Linear Programming
–
 1987

15

Linear and Quadratic Programming in Oriented Matroids
–
 1985

21

Oriented matroid programming
–
 1982

816

Linear Programming and Extensions
–
 1963

11

The crisscross method for solving linear programming problems
–
 1969

2

The Simplex Algorithm with a New Primal and Dual Pivot Rule
–
 1993

1

Resolution of the problem of degeneracy in a primal and dual simplex algorithm
–
 1997

1

An interiorpoint method for fractional programs with convex constraints. Mathematical Programming 67
–
 2005

1

A Parametric Method for Solving the Linear Fractional Programming Problem
–
 1985

3

A feasible direction method for linear programming
–
 1984

3

A new efficient primal dual simplex algorithm
–

16

Combining interiorpoint and pivoting algorithms for linear programming
–
 1995

284

Introduction to Operations Research
–
 2008

2

Optimality and degeneracy in linear programming, Econometrica 20(1952)160170
–
 1952

2

A class of cycling counterexamples to the EXPAND anticycling procedure
–
 1998

2

Cycling in the simplex method
–
 1953

3

Notes on linear programming: Part I  The generalized simplex method for minimizing a linear form under linear inequality restrictions
–
 1955

9

Cycling in the dual simplex algorithm
–
