IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v14y1968i9p551-564.html
   My bibliography  Save this article

Stochastic Sensitivity Analysis of Maximum Flow and Shortest Route Networks

Author

Listed:
  • Richard D. Wollmer

    (The RAND Corporation)

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.

Suggested Citation

  • Richard D. Wollmer, 1968. "Stochastic Sensitivity Analysis of Maximum Flow and Shortest Route Networks," Management Science, INFORMS, vol. 14(9), pages 551-564, May.
  • Handle: RePEc:inm:ormnsc:v:14:y:1968:i:9:p:551-564
    DOI: 10.1287/mnsc.14.9.551
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.14.9.551
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.14.9.551?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. David L. Alderson & Gerald G. Brown & W. Matthew Carlyle & R. Kevin Wood, 2018. "Assessing and Improving the Operational Resilience of a Large Highway Infrastructure System to Worst-Case Losses," Transportation Science, INFORMS, vol. 52(4), pages 1012-1034, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:14:y:1968:i:9:p:551-564. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.