Parametric Network Flows

Edward Minieka
Additional contact information
Edward Minieka: Quantitative Methods Department, University of Illinois, Chicago, Illinois

Operations Research, 1972, vol. 20, issue 6, 1162-1170

Abstract: This paper considers a directed capacitated network in which the supply at each source node and the demand at each sink node is a linear function of a parameter t . It presents two algorithms that determine the range of values for the parameter t ; they correspond to the primal and dual linear-programming algorithms that solve this problem. The dual algorithm appears to have a simpler structure.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.6.1162 (application/pdf)

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:inm:oropre:v:20:y:1972:i:6:p:1162-1170

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().