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

Optimal Reliability Allocation with Discrete Cost-Reliability Data for Components

Author

Listed:
  • Subba Rao V. Majety

    (Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania 15261)

  • Milind Dawande

    (IBM T.J. Watson Research Center, Yorktown Heights, New York 10598)

  • Jayant Rajgopal

    (Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania 15261)

Abstract

This paper addresses the optimal allocation of reliability among components that are to be assembled into a system. While it is a generally accepted notion that a component's cost is an increasing function of its reliability, most research to date adopts exponentially increasing, closed-form functions to relate cost and reliability. However, in practice such functions are often unknown or difficult to construct, and it is often more reasonable to describe cost-reliability relationships via discrete data sets. We consider such situations, where each component is available at several reliability levels with corresponding costs. The design optimization problem results in a nonlinear integer program. Because every system configuration has an equivalent representation as either a series connection of parallel subsystems or a parallel connection of series subsystems, we provide formulations, linear relaxations, and algorithms for these two.

Suggested Citation

  • Subba Rao V. Majety & Milind Dawande & Jayant Rajgopal, 1999. "Optimal Reliability Allocation with Discrete Cost-Reliability Data for Components," Operations Research, INFORMS, vol. 47(6), pages 899-906, December.
    • Handle: RePEc:inm:oropre:v:47:y:1999:i:6:p:899-906
    DOI: 10.1287/opre.47.6.899
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. F. A. Tillman & J. M. Liittschwager, 1967. "Integer Programming Formulation of Constrained Reliability Problems," Management Science, INFORMS, vol. 13(11), pages 887-899, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Yu, Haiyang & Yalaoui, Farouk & Châtelet, Ėric & Chu, Chengbin, 2007. "Optimal design of a maintainable cold-standby system," Reliability Engineering and System Safety, Elsevier, vol. 92(1), pages 85-91.
    2. U. Dinesh Kumar & J. E. Ramírez-Márquez & D Nowicki & D Verma, 2007. "Reliability and maintainability allocation to minimize total cost of ownership in a series-parallel system," Journal of Risk and Reliability, , vol. 221(2), pages 133-140, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M Bachlaus & N Shukla & M. K. Tiwari & R Shankar, 2006. "Optimization of system reliability using chaos-embedded self-organizing hierarchical particle swarm optimization," Journal of Risk and Reliability, , vol. 220(2), pages 77-91, December.
    2. Christopher Garcia, 2018. "Optimal multiunit transfer over adversarial paths with increasing intercept probabilities," IISE Transactions, Taylor & Francis Journals, vol. 50(11), pages 989-996, November.

    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:47:y:1999:i:6:p:899-906. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.