Efficiency of the Simplex Method
In the previous chapter, we saw that the simplex method (with appropriate pivoting rules to guarantee no cycling) will solve any linear programming problem for which an optimal solution exists. In this chapter, we investigate just how fast it will solve a problem of a given size.
- Borgwardt, K. -H. (1982). The average number of pivot steps required by the simplex-method is polynomial. Zeitschrift für Operations Research, 26, 157–177.Google Scholar
- Borgwardt, K. -H. (1987a). Probabilistic analysis of the simplex method. In Operations research proceedings, 16th DGOR meeting, (pp. 564–576).Google Scholar
- Borgwardt, K. -H. (1987b). The simplex method—A probabilistic approach. Berlin/Heidelberg/New York: Springer.Google Scholar
- Garey, M., and Johnson, D. (1977). Computers and intractability. San Francisco: W.H. Freeman.Google Scholar
- Khachian, L. (1979). A polynomial algorithm in linear programming. Doklady Academiia Nauk SSSR, 244, 191–194 (in Russian) (English translation: Soviet Mathematics Doklady, 20, 191–194)Google Scholar
- Klee, V., and Minty, G. (1972). How good is the simplex algorithm? In O. Shisha (Ed.), Inequalities–III (pp. 159–175). New York: Academic.Google Scholar