Optimal Reliability Allocation by Branch-and-Bound Technique

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.