Flows in Networks

Eric V. Denardo ()
Additional contact information
Eric V. Denardo: Yale University

Chapter Chapter 9 in Linear Programming and Generalizations, 2011, pp 297-327 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-6491-5_9

Ordering information: This item can be ordered from
http://www.springer.com/9781441964915

DOI: 10.1007/978-1-4419-6491-5_9

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().