Mathematical Programming

, Volume 57, Issue 1–3, pp 341–374 | Cite as

Steepest-edge simplex algorithms for linear programming

  • John J. Forrest
  • Donald Goldfarb


We present several new steepest-edge simplex algorithms for solving linear programming problems, including variants of both the primal and the dual simplex method. These algorithms differ depending upon the space in which the problem is viewed as residing, and include variants in which this space varies dynamically. We present computational results comparing steepest-edge simplex algorithms and approximate versions of them against simplex algorithms that use standard pivoting rules on truly large-scale realworld linear programs with as many as tens of thousands of rows and columns. These results demonstrate unambiguously the superiority of steepest-edge pivot selection criteria to other pivot selection criteria in the simplex method.

Key words

Steepest-edge simplex method large-scale linear programming Devex variants 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. R.E. Bixby, “Implementing the simplex method: The initial basis,” Technical Report TR90-32, Department of Mathematical Sciences, Rice University (Houston, TX, 1990).Google Scholar
  2. J.J.H. Forrest and J.A. Tomlin, “Updating triangular factors of the basis matrix to maintain sparsity in the product form simplex method,”Mathematical Programming 2 (1972) 263–278.Google Scholar
  3. J.J.H. Forrest and J.A. Tomlin, “Vector processing in simplex and interior methods for linear programming,”Annals of Operations Research 22 (1990) 71–100.Google Scholar
  4. J.J.H. Forrest and J.A. Tomlin, “Implementing the simplex method for the optimization subroutine library,”IBM Systems Journal 31 (1992) 11–25.Google Scholar
  5. D.M. Gay, “Electronic mail distribution of linear programming test problems,”Mathematical Programming Society COAL Newsletter (1985).Google Scholar
  6. D. Goldfarb, “Using the steepest-edge simplex algorithm to solve sparse linear programs,” in: J. Bunch and D. Rose, eds.,Sparse Matrix Computations (Academic Press, New York, 1976) pp. 227–240.Google Scholar
  7. D. Goldfarb and J.K. Reid, “A practical steepest-edge simplex algorithm,”Mathematical Programming 12 (1977) 361–371.Google Scholar
  8. H. Greenberg and J.E. Kalan, “An exact update for Harris' tread,”Mathematical Programming Study 4 (1975) 26–29.Google Scholar
  9. P.M.J. Harris, “Pivot selection methods of the Devex LP code,”Mathematical Programming 5 (1973) 1–28.Google Scholar
  10. IBM Corp., “Optimizing subroutine library guide and reference,” Document Number SC23-0519-2 (1991).Google Scholar
  11. H.W. Kuhn and R.E. Quandt, “An experimental study of the simplex method,” in: Metropolis et al., eds.,Proceedings of Symposia in Applied Maths, Vol. XV (Amer. Math. Soc., Providence, RI, 1963).Google Scholar
  12. I.J. Lustig, “An analysis of an available set of linear programming test problems,”Computers and Operations Research 16 (1989) 173–184.Google Scholar
  13. M.A. Saunders, The complexity of LU updating in the simplex method,” in: R.S. Anderssen and R.P. Brent, eds.,The Complexity of Computational Problem Solving (Queensland University Press, Queensland, 1976) pp. 214–230.Google Scholar
  14. U.H. Suhl and L.M. Suhl, “Computing sparse LU-factorizations for large-scale linear programming,”ORSA Journal of Computing 2 (1990) 325–335.Google Scholar
  15. P. Wolfe, “The composite simplex algorithm,”SIAM Review 7 (1965).Google Scholar
  16. P. Wolfe and L. Cutler, “Experiments in linear programming,” in: Graves and Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963).Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1992

Authors and Affiliations

  • John J. Forrest
    • 1
  • Donald Goldfarb
    • 2
  1. 1.IBM Research DivisionT.J. Watson Research CenterYorktown HeightsUSA
  2. 2.Department of Industrial Engineering and Operations ResearchColumbia UniversityNew YorkUSA

Personalised recommendations