Abstract
There are several ways to solve linear programs, but even after its invention in 1947 and the emergence of many new rivals, George B. Dantzig’s Simplex Algorithm stands out as the foremost method of all.
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
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media LLC
About this chapter
Cite this chapter
Cottle, R.W., Thapa, M.N. (2017). THE SIMPLEX ALGORITHM. In: Linear and Nonlinear Optimization. International Series in Operations Research & Management Science, vol 253. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7055-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4939-7055-1_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-7053-7
Online ISBN: 978-1-4939-7055-1
eBook Packages: Business and ManagementBusiness and Management (R0)