Abstract
In this chapter we present the simplex method as it applies to linear programming problems in standard form.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Dantzig, G. (1963), Linear Programming and Extensions, Princeton University Press, Princeton, Princeton.
Chv’atal, V. (1983), Linear Programming, Freeman, New York.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Robert J.Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2008). The Simplex Method. In: Linear Programming. International Series in Operations Research & Management Science, vol 114. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74388-2_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-74388-2_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74387-5
Online ISBN: 978-0-387-74388-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)