Advertisement

Flows in Networks

  • Eric V. Denardo
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 149)

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

Authors and Affiliations

  1. 1.Yale UniversityNew HavenUSA

Personalised recommendations