IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v133y2005i1p129-14810.1007-s10479-004-5028-8.html
   My bibliography  Save this article

An Exact Solution Method for Reliability Optimization in Complex Systems

Author

Listed:
  • Duan Li
  • Xiaoling Sun
  • Ken McKinnon

Abstract

Systems reliability plays an important role in systems design, operation and management. Systems reliability can be improved by adding redundant components or increasing the reliability levels of subsystems. Determination of the optimal amount of redundancy and reliability levels among various subsystems under limited resource constraints leads to a mixed-integer nonlinear programming problem. The continuous relaxation of this problem in a complex system is a nonconvex nonseparable optimization problem with certain monotone properties. In this paper, we propose a convexification method to solve this class of continuous relaxation problems. Combined with a branch-and-bound method, our solution scheme provides an efficient way to find an exact optimal solution to integer reliability optimization in complex systems. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Duan Li & Xiaoling Sun & Ken McKinnon, 2005. "An Exact Solution Method for Reliability Optimization in Complex Systems," Annals of Operations Research, Springer, vol. 133(1), pages 129-148, January.
    • Handle: RePEc:spr:annopr:v:133:y:2005:i:1:p:129-148:10.1007/s10479-004-5028-8
    DOI: 10.1007/s10479-004-5028-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-004-5028-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-004-5028-8?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Omprakash K. Gupta & A. Ravindran, 1985. "Branch and Bound Experiments in Convex Nonlinear Integer Programming," Management Science, INFORMS, vol. 31(12), pages 1533-1546, December.
    2. Harold P. Benson, 1996. "Deterministic algorithms for constrained concave minimization: A unified critical survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 765-795, September.
    3. Bennett Fox, 1966. "Discrete Optimization Via Marginal Analysis," Management Science, INFORMS, vol. 13(3), pages 210-216, November.
    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. Hamideh Jeddi & Mahdi Doostparast, 2022. "Allocation of redundancies in systems: a general dependency-base framework," Annals of Operations Research, Springer, vol. 312(1), pages 259-273, May.
    2. Kuei-Hu Chang, 2016. "A novel reliability allocation approach using the OWA tree and soft set," Annals of Operations Research, Springer, vol. 244(1), pages 3-22, September.

    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. Mustafa Doğru & A. Kok & G. Houtum, 2013. "Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 541-559, September.
    2. Xiuli Chao & Liming Liu & Shaohui Zheng, 2003. "Resource Allocation in Multisite Service Systems with Intersite Customer Flows," Management Science, INFORMS, vol. 49(12), pages 1739-1752, December.
    3. Anh Ninh & Benjamin Melamed & Yao Zhao, 2020. "Analysis and optimization of recruitment stocking problems," Annals of Operations Research, Springer, vol. 295(2), pages 747-767, December.
    4. Kochel, P., 2007. "Order optimisation in multi-location models with hub-and-spoke structure," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 368-387, July.
    5. Yossi Aviv & Awi Federgruen, 2001. "Design for Postponement: A Comprehensive Characterization of Its Benefits Under Unknown Demand Distributions," Operations Research, INFORMS, vol. 49(4), pages 578-598, August.
    6. Terzi, Mourad & Ouazene, Yassine & Yalaoui, Alice & Yalaoui, Farouk, 2023. "Lot-sizing and pricing decisions under attraction demand models and multi-channel environment: New efficient formulations," Operations Research Perspectives, Elsevier, vol. 10(C).
    7. David E. Bernal & Zedong Peng & Jan Kronqvist & Ignacio E. Grossmann, 2022. "Alternative regularizations for Outer-Approximation algorithms for convex MINLP," Journal of Global Optimization, Springer, vol. 84(4), pages 807-842, December.
    8. Li Ding & Kevin D. Glazebrook & Christopher Kirkbride, 2008. "Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population," Management Science, INFORMS, vol. 54(3), pages 594-607, March.
    9. Sridhar Seshadri & Jayashankar M. Swaminathan, 2003. "A componentwise index of service measurement in multi‐component systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(2), pages 184-194, March.
    10. Driessen, M.A. & van Houtum, G.J. & Zijm, W.H.M. & Rustenburg, W.D., 2020. "Capacity assignment in repair shops with high material uncertainty," International Journal of Production Economics, Elsevier, vol. 221(C).
    11. Christiane B. Haubitz & Ulrich W. Thonemann, 2021. "How to Change a Running System—Controlling the Transition to Optimized Spare Parts Inventory Policies," Production and Operations Management, Production and Operations Management Society, vol. 30(5), pages 1386-1405, May.
    12. Xiao Yu & Armagan Bayram, 2021. "Managing capacity for virtual and office appointments in chronic care," Health Care Management Science, Springer, vol. 24(4), pages 742-767, December.
    13. Gergely Mincsovics & Nico Dellaert, 2010. "Stochastic dynamic nursing service budgeting," Annals of Operations Research, Springer, vol. 178(1), pages 5-21, July.
    14. Kumar Abhishek & Sven Leyffer & Jeff Linderoth, 2010. "FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 555-567, November.
    15. Shyamal Gondkar & Sivakumar Sreeramagiri & Edwin Zondervan, 2012. "Methodology for Assessment and Optimization of Industrial Eco-Systems," Challenges, MDPI, vol. 3(1), pages 1-21, June.
    16. Francisco Trespalacios & Ignacio E. Grossmann, 2016. "Cutting Plane Algorithm for Convex Generalized Disjunctive Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 209-222, May.
    17. Corazza, Marco & Favaretto, Daniela, 2007. "On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1947-1960, February.
    18. Jin, Tongdan & Tian, Yu, 2012. "Optimizing reliability and service parts logistics for a time-varying installed base," European Journal of Operational Research, Elsevier, vol. 218(1), pages 152-162.
    19. Sönke Behrends & Ruth Hübner & Anita Schöbel, 2018. "Norm bounds and underestimators for unconstrained polynomial integer minimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 73-107, February.
    20. Wendel Melo & Marcia Fampa & Fernanda Raupp, 2020. "An overview of MINLP algorithms and their implementation in Muriqui Optimizer," Annals of Operations Research, Springer, vol. 286(1), pages 217-241, March.

    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:spr:annopr:v:133:y:2005:i:1:p:129-148:10.1007/s10479-004-5028-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.