Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
