1. Linear programming and extensions;Dantzig,1963
2. A primal-dual simplex method for linear problems;Curet;Operations Research Letters,1974
3. A variant of the dual pivoting rule in linear programming;Pan;Journal of Information & Optimization Sciences,1994
4. Orden A, wolfe P;DantzigG.B.;The generalized simplex method for minimizing a linear form under linear inequality restraints. Pacific Journal ofMathematics,1955
5. A polynomial algorithm for linear programming;Khachiyan;SovietMathematics Doklady,1979