Stochastic Sensitivity Analysis of Maximum Flow and Shortest Route Networks

Richard D. Wollmer
Additional contact information
Richard D. Wollmer: The RAND Corporation

Management Science, 1968, vol. 14, issue 9, 551-564

Abstract: This paper presents an algorithm that can be used to solve two types of network sensitivity problems. In the first, arcs are subject to breakdowns that degrade their capacities. It is required, within certain confidence limits, to find the maximum possible effect of n breakdowns on maximum flow. In the second, arcs are subject to improvements that reduce their lengths. It is required, also within certain confidence limits, to find the maximum possible effect n total improvements can have on shortest path length. Capacities resulting from breakdowns and lengths resulting from improvements are random variables specified by their mean values and variances.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.14.9.551 (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:ormnsc:v:14:y:1968:i:9:p:551-564

Access Statistics for this article

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