The Simplex Algorithm
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.
KeywordsSimplex Algorithm Neighboring Vertex Basic Column Pivot Rule Pivot Column
Unable to display preview. Download preview PDF.
- 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
- D. Avis and V. Chvátal, “Notes on Bland’s Pivoting Rule,” Mathematical Programming Study 8 (1978), 24-34.Google Scholar
- J. E. Calvert and W. L. Voxman, Linear Programming, Harcourt Brace Jovanovich, New York, NY, 1989.Google Scholar
- A. J. Hoffman, “Cycling in the Simplex Algorithm,” Report No. 2974, National Bureau of Standards, Washington, DC, 1953.Google Scholar
- 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
- H. W. Kuhn, class notes, Princeton University, Princeton, NJ, 1976.Google Scholar
- 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
- G. Strang, Linear Algebra and Its Applications, third edition, Harcourt Brace Jovanovich, San Diego, CA, 1988.Google Scholar