线性规划的进展

The Average number of pivot steps required by the Simplex-Method is polynomial[J] . K. -H. Borgwardt. &nbspZeitschrift für Operations Research . 1982 (1)

Computer Solution of large sparse positive definite systems, prentice-Hall. George,J. A. and Lui,J. W. . 1981

Linear Programming and extensions, Princeton University press, Princeton. Dantzig,G. B. N. J . 1963

An extension of Karmarkar’s algorithm for linear programming using dual variables, Report 648, School of Operations Research and Industrial Engineering, Cornel University, Ithaca. Todd,N. J. and Burrell,B. P. New York . 1985

The Average number of pivot steps required by the Simplex-Method is polynomial[J] . K. -H. Borgwardt. &nbspZeitschrift für Operations Research . 1982 (1)

Computer Solution of large sparse positive definite systems, prentice-Hall. George,J. A. and Lui,J. W. . 1981

Linear Programming and extensions, Princeton University press, Princeton. Dantzig,G. B. N. J . 1963

An extension of Karmarkar’s algorithm for linear programming using dual variables, Report 648, School of Operations Research and Industrial Engineering, Cornel University, Ithaca. Todd,N. J. and Burrell,B. P. New York . 1985