Abstract
In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are known as “network flow models.” You will also see that if a network flow model has “integer-valued data,” the simplex method finds an optimal solution that is integer-valued.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Norman Zadeh, “A bad network problem for the simplex method and other minimum cost flow algorithms, “Mathematical Programming, V. 5, p 255-266, 1973.
- 2.
H, K. Kuhn, “The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, V 2, pp. 83-97, 1955.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Denardo, E.V. (2011). Flows in Networks. In: Linear Programming and Generalizations. International Series in Operations Research & Management Science, vol 149. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6491-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6491-5_9
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6490-8
Online ISBN: 978-1-4419-6491-5
eBook Packages: Business and EconomicsBusiness and Management (R0)