Optimal Reliability Allocation by Branch-and-Bound Technique
- 1 April 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-27 (1) , 31-38
- https://doi.org/10.1109/tr.1978.5220232
Abstract
The paper presents an efficient method for finding the exact optimal solutions of reliability allocation problems that are formulated as an integer nonlinear programming problem generalized to handle nonlinear constraints and nonseparable problems. The method is based on branch-and-bound and developed by considering separation and relaxation techniques.Keywords
This publication has 21 references indexed in Scilit:
- Optimization of System Reliability by Branch-and-BoundIEEE Transactions on Reliability, 1976
- AN OPTIMIZING METHOD IN SYSTEM RELIABILITY WITH FAILURE-MODES BY IMPLICIT ENUMERATION ALGORITHMJournal of the Operations Research Society of Japan, 1976
- Technical Note—Numerical Investigation of Optimal Parallel Redundancy in Series SystemsOperations Research, 1974
- Technical Note—On an Algorithm of Ghare and TaylorOperations Research, 1973
- Reliability optimization of a system by zero-one programmingMicroelectronics Reliability, 1973
- Redundancy allocations in a system with many stagesMicroelectronics Reliability, 1973
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- Optimal Redundancy for Reliability in Series SystemsOperations Research, 1969
- A Method for Solving Discrete Optimization ProblemsOperations Research, 1966