Linear Programming and Generalizations pp 297-327 | Cite as
Flows in Networks
Chapter
First Online:
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.
Keywords
Span Tree Assignment Problem Shipping Cost Simplex Method Transportation Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Copyright information
© Springer Science+Business Media, LLC 2011