Stochastic Sensitivity Analysis of Maximum Flow and Shortest Route Networks

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...

Full description

Saved in:
Bibliographic Details
Published inManagement science Vol. 14; no. 9; pp. 551 - 564
Main Author Wollmer, Richard D
Format Journal Article
LanguageEnglish
Published Hanover, MD., etc INFORMS 01.05.1968
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
Corporations
Cut sets
Mathematical procedures
Random variables
Sensitivity analysis
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.14.9.551