Efficiency of the simplex method

Robert J. Vanderbei

Research output: Chapter in Book/Report/Conference proceedingChapter


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.

Original languageEnglish (US)
Title of host publicationInternational Series in Operations Research and Management Science
Number of pages16
StatePublished - 2020
Externally publishedYes

Publication series

NameInternational Series in Operations Research and Management Science
ISSN (Print)0884-8289
ISSN (Electronic)2214-7934

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Applied Mathematics


Dive into the research topics of 'Efficiency of the simplex method'. Together they form a unique fingerprint.

Cite this