Practical finite pivoting rules for the simplex method
暂无分享,去创建一个
[1] V. Klee. A class of linear programming problems requiring a large number of iterations , 1965 .
[2] Robert G. Jeroslow,et al. The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..
[3] A. Charnes. Optimality and Degeneracy in Linear Programming , 1952 .
[4] David I. Steinberg,et al. Letter to the Editor - On the Possibility of Cycling with the Simplex Method , 1978, Oper. Res..
[5] Donald Goldfarb,et al. A practicable steepest-edge simplex algorithm , 1977, Math. Program..
[6] Robert G. Bland,et al. New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..
[7] P. Wolfe. A Technique for Resolving Degeneracy in Linear Programming , 1963 .
[8] J. Farkas. Theorie der einfachen Ungleichungen. , 1902 .
[9] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[10] William Y. Sit,et al. Worst case behavior of the steepest edge simplex method , 1979, Discret. Appl. Math..
[11] V. Klee,et al. HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .