Efficiency of the Simplex Method

  • Robert J. Vanderbei
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 196)


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.


  1. Adler, I., and Megiddo, N. (1985). A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Journal of the ACM, 32, 871–895.CrossRefGoogle Scholar
  2. 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
  3. Borgwardt, K. -H. (1987a). Probabilistic analysis of the simplex method. In Operations research proceedings, 16th DGOR meeting, (pp. 564–576).Google Scholar
  4. Borgwardt, K. -H. (1987b). The simplex method—A probabilistic approach. Berlin/Heidelberg/New York: Springer.Google Scholar
  5. Garey, M., and Johnson, D. (1977). Computers and intractability. San Francisco: W.H. Freeman.Google Scholar
  6. 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
  7. 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
  8. Smale, S. (1983). On the average number of steps of the simplex method of linear programming. Mathematical Programming, 27, 241–262.CrossRefGoogle Scholar
  9. Todd, M. (1986). Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming. Mathematical Programming, 35, 173–192.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Department of Operations Research and Financial EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations