Reliability optimization of a series system with multiple-choice and budget constraints

This paper considers a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized a...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 127; no. 1; pp. 159 - 171
Main Authors Sung, C.S., Cho, Y.K.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.11.2000
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Branch-and-bound algorithm
Multiple-choice
Operations research
Optimization
Reliability optimization
Series system
Studies
Reliability optimization
Series system
Branch-and-bound algorithm
Multiple-choice
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/S0377-2217(99)00330-6

Cover

More Information
Summary:This paper considers a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. In the problem analysis, some solution properties are characterized to reduce the solution space in advance. A branch-and-bound solution algorithm is then derived based on the reduced solution space to search for the optimal solution. The algorithm is tested for its efficiency with randomly generated numerical examples.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(99)00330-6