IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v22y1974i3p639-653.html
   My bibliography  Save this article

The Elementary Redundancy-Optimization Problem: A Case Study in Probabilistic Multiple-Goal Programming

Author

Listed:
  • G. G. Hendrix

    (The University of Texas at Austin, Austin, Texas)

  • A. C. Stedry

    (Oakland University, Rochester, Michigan)

Abstract

This paper deals with systems (such as electronic devices and corporations) that are designed to accomplish multiple goals and whose internal structures are characterized by networks of interacting component parts. Each component of such a system is typically associated with a probability of failure, while each system goal is associated with a reward value. Failure of any network component may ultimately result in the inability to achieve one or more goals and force the forfeiture of the associated rewards. A basic problem in component-system design is to determine how the expectation of total reward may be maximized through the cost-limited acquisition of redundant (backup) components. This paper provides a formal statement of this redundancy-optimization problem and argues that the problem may not be solved easily by standard linear or integer programming techniques. It introduces an algorithm to solve this problem, proves its convergence, and presents computational results taken from a battery of test problems and an algorithm-efficiency study based on these tests.

Suggested Citation

  • G. G. Hendrix & A. C. Stedry, 1974. "The Elementary Redundancy-Optimization Problem: A Case Study in Probabilistic Multiple-Goal Programming," Operations Research, INFORMS, vol. 22(3), pages 639-653, June.
    • Handle: RePEc:inm:oropre:v:22:y:1974:i:3:p:639-653
    DOI: 10.1287/opre.22.3.639
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.22.3.639
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.22.3.639?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
    ---><---

    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:oropre:v:22:y:1974:i:3:p:639-653. 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.