Abstract
So far, we have concentrated on the simplex method as the solution technique of choice for linear programming problems. While being extremely successful in practice for the last half century, the simplex method is by no means the only solution method for linear programming. Interestingly enough, the first alternative solution technique to the simplex method, a method by Brown and Koopmans (1951), was published in the same volume in which Dantzig presented his simplex method in 1951.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Non-Simplex Based Solution Methods. In: Linear Programming and its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73671-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-73671-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73670-7
Online ISBN: 978-3-540-73671-4
eBook Packages: Business and EconomicsBusiness and Management (R0)