Advertisement

The Simplex Algorithm

  • Howard Karloff
Part of the Modern Birkhäuser Classics book series (MBC)

Abstract

Designed in 1947 by G. Dantzig, the Simplex Algorithm was the method of choice used to solve linear programs for decades. Though not a polynomial-time algorithm in the worst case, the Simplex Algorithm is remarkably fast in practice. Problems with thousands of variables and constraints are routinely solved by the Simplex Algorithm. Only since the appearance of Karmarkar’s Algorithm in 1984 and the more recent interior-point methods have contenders for “best practical linear programming algorithm” existed.

Keywords

Simplex Algorithm Neighboring Vertex Basic Column Pivot Rule Pivot Column 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    I. Adler, “The Expected Number of Pivots Needed to Solve Parametric Linear Programs and the Efficiency of the Self-Dual Simplex Method,” manuscript, Dept. of Industrial Engineering and Operations Research, University of California, Berkeley, 1983.Google Scholar
  2. [2]
    I. Adler, R. M. Karp and R. Shamir, “A Family of Simplex Variants Solving an m x d Linear Program in Expected Number of Pivots Depending on d Only,” Mathematics of Operations Research 11 (1986), 570-590.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    I. Adler, R. M. Karp and R. Shamir, “A Simplex Variant Solving an m X d Linear Program in O (min(m 2, d 2)) Expected Number of Pivot Steps,” Journal of Complexity 3 (1987), 372-387.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    I. Adler and N. Megiddo, “A Simplex Algorithm Whose Average Number of Steps is Bounded Between Two Quadratic Functions of the Smaller Dimension,” Journal of the ACM 32 (1985), 871-895.MATHCrossRefMathSciNetGoogle Scholar
  5. [8]
    D. Avis and V. Chvátal, “Notes on Bland’s Pivoting Rule,” Mathematical Programming Study 8 (1978), 24-34.Google Scholar
  6. [11]
    R. G. Bland, “New Finite Pivoting Rules for the Simplex Method,” Mathematics of Operations Research 2 (1977), 103-107.MATHCrossRefMathSciNetGoogle Scholar
  7. [13]
    K. H. Borgwardt, The Simplex Method: A Probabilistic Analysis, Springer-Verlag, New York, NY, 1987.MATHGoogle Scholar
  8. [14]
    G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Prentice Hall, Englewood Cliffs, NJ, 1988.MATHGoogle Scholar
  9. [15]
    J. E. Calvert and W. L. Voxman, Linear Programming, Harcourt Brace Jovanovich, New York, NY, 1989.Google Scholar
  10. [16]
    V. Chvátal, Linear Programming, Freeman, New York, NY, 1983.MATHGoogle Scholar
  11. [17]
    G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.MATHGoogle Scholar
  12. [22]
    S. I. Gass, Linear Programming Methods and Applications, fourth edition, McGraw-Hill, New York, NY, 1975.MATHGoogle Scholar
  13. [23]
    A. M. Glicksman, An Introduction to Linear Programming and the Theory of Games, Wiley, New York, NY, 1963.MATHGoogle Scholar
  14. [28]
    G. Hadley, Linear Programming, Addison-Wesley, Reading, MA, 1962.MATHGoogle Scholar
  15. [30]
    A. J. Hoffman, “Cycling in the Simplex Algorithm,” Report No. 2974, National Bureau of Standards, Washington, DC, 1953.Google Scholar
  16. [32]
    R. G. Jeroslow, “The Simplex Algorithm with the Pivot Rule of Maximizing Criterion Improvement,” Discrete Mathematics 4 (1973), 367-377.MATHCrossRefMathSciNetGoogle Scholar
  17. [35]
    L. G. Khachiyan, “A Polynomial Algorithm for Linear Programming” (in Russian), Doklady Akademiia Nauk USSR 244 (1979), 1093-1096. A translation appears in Soviet Mathematics Doklady 20 (1979), 191-194.MATHMathSciNetGoogle Scholar
  18. [36]
    V. Klee and G. J. Minty, “How Good is the Simplex Algorithm?”, in Inequalities-III, 0. Shisha, ed., Academic Press, New York, NY, 1972, 159-175.Google Scholar
  19. [37]
    H. W. Kuhn, class notes, Princeton University, Princeton, NJ, 1976.Google Scholar
  20. [44]
    C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Engle-wood Cliffs, NJ, 1982.MATHGoogle Scholar
  21. [48]
    R. Shamir, “The Efficiency of the Simplex Method: A Survey,” Management Science 33 (1987), 301-334.MATHCrossRefMathSciNetGoogle Scholar
  22. [53]
    M. Simonnard, Linear Programming, Prentice Hall, Engle-wood Cliffs, NJ, 1966.MATHGoogle Scholar
  23. [54]
    S. Smale, “The Problem of the Average Speed of the Simplex Method,” in Mathematical Programming: The State of the Art (Bonn 1982), A. Bachem et al., eds., Springer-Verlag, Berlin, 1983, 530-539.Google Scholar
  24. [55]
    S. Smale, “On the Average Number of Steps in the Simplex Method of Linear Programming,” Mathematical Programming 27 (1983), 241-262.MATHCrossRefMathSciNetGoogle Scholar
  25. [56]
    G. Strang, Linear Algebra and Its Applications, third edition, Harcourt Brace Jovanovich, San Diego, CA, 1988.Google Scholar

Copyright information

© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Howard Karloff
    • 1
  1. 1.College of Computing, Georgia TechAtlantaUSA

Personalised recommendations