Not Only the Simplex Method

  • Jiří Matoušek
  • Bernd Gärtner
Part of the Universitext book series (UTX)


Tens of different algorithms have been suggested for linear programming over the years. Most of them didn't work very well, and only very few have turned out as serious competitors to the simplex method, the historically first algorithm. But at least two methods raised great excitement at the time of discovery and they are surely worth mentioning.


Arithmetic Operation Simplex Method Interior Point Method Polynomial Algorithm Central Path 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  • Jiří Matoušek
    • 1
  • Bernd Gärtner
    • 2
  1. 1.Department of Applied MathematicsCharles UniversityPraha 1Czech Republic
  2. 2.Institute of Theoretical Computer ScienceETH ZurichZurichSwitzerland

Personalised recommendations