By Topic

Optimal Reliability Allocation by Branch-and-Bound Technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nakagawa, Yuji ; Institute of Atomic. Energy;. Kyoto University; Uji, Kyoto 611 JAPAN. ; Nakashima, K. ; Hattori, Yoshio

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.

Published in:

Reliability, IEEE Transactions on  (Volume:R-27 ,  Issue: 1 )