Reliability Optimization With The Lagrange-Multiplier and Branch-And-Bound Technique

Way Kuo, Hsin-Hui Lin, Zhongkai Xu, Weixing Zhang

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

88 Citations (Scopus)

Abstract

A method has been developed for constrained reliability optimization problems. This method incorporates the Lagrange multiplier method and the branch-and-bound technique. The Lagrange multiplier method treats the number of redundancies as real numbers. Once a real number solution is obtained, the branch-and-bound technique is used to obtain the integer solution. With our method, a 4-stage series system with two linear constraints is illustrated for the redundancy allocation problem, and a 5-stage series system with three nonlinear constraints is illustrated for the reliability-redundancy allocation problem. The results show that our method is better than previous methods for both the redundancy allocation problem and the mixed integer-type reliability-redundancy allocation problem. Our method also provides more reasonable explanations when solving reliability optimization problems.-ReaderAids Purpose: Widen state of the art Special math needed for explanations.:. Lagrange multiplier method and Kuhn-Tucker conditions Special math needed to use results: None Results useful to: Reliability analysts and system engineers. Copyright © 1987 by The Institute of Electrical and Electronics Engineers, Inc.
Original languageEnglish
Pages (from-to)624-630
JournalIEEE Transactions on Reliability
VolumeR-36
Issue number5
DOIs
Publication statusPublished - Dec 1987
Externally publishedYes

Research Keywords

  • Branch-and-bound
  • Integer programming
  • Kuhn-Tucker conditions
  • Lagrange multiplier method
  • Mixed integer programming
  • Newton's method
  • Reliability optimization

Fingerprint

Dive into the research topics of 'Reliability Optimization With The Lagrange-Multiplier and Branch-And-Bound Technique'. Together they form a unique fingerprint.

Cite this