Abstract
Our final application of linear programming occurs in the graph-theoretic domain. In fact, we will see that the transportation and assignment problems of the previous chapter can be reformulated as a certain type of network-flow problem. In view of this, network-flow problems encompass a wide range of linear programming problems. As with the transportation and assignment problems, the network-flow problems of this chapter are solvable by using the techniques of Chapter 2–4 directly. We, however, opt for easier and more direct graph-theoretic algorithms, one of which has its roots in duality theory.
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
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Strayer, J.K. (1989). Network-Flow Problems. In: Linear Programming and Its Applications. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1009-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1009-2_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6982-3
Online ISBN: 978-1-4612-1009-2
eBook Packages: Springer Book Archive