Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Matoušek, J., Gärtner, B. (2007). Not Only the Simplex Method. In: Understanding and Using Linear Programming. Universitext. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30717-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30717-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30697-9
Online ISBN: 978-3-540-30717-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)