Capacity of a Network with Increasing Demands and Arcs Subject to Failure

P. J. Doulliez and M. R. Rao
Additional contact information
P. J. Doulliez: Société de Traction et d'Electricité, Brussels, Belgium
M. R. Rao: University of Rochester, Rochester, New York

Operations Research, 1971, vol. 19, issue 4, 905-915

Abstract: This paper considers a multiple-sink network with demand at some nodes of the network being an increasing function of time. It gives, for source-sink planar networks, an algorithm for finding the maximum time up to which all demands can be satisfied. This algorithm is applicable even if any set of a specified number of arcs of the network has the arc capacities reduced to given lower values. The method presented is based upon the properties of the dual network. Finally, the paper works out a numerical example and discusses an application of the method to the optimal-capacity planning of a network.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.905 (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:19:y:1971:i:4:p:905-915

Access Statistics for this article

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