A branch and bound algorithm for designing reliable systems at a minimum cost

A branch and bound algorithm for designing reliable systems at a minimum cost

0.00 Avg rating0 Votes
Article ID: iaor20023732
Country: United States
Volume: 118
Issue: 2/3
Start Page Number: 247
End Page Number: 259
Publication Date: Mar 2001
Journal: Applied Mathematics and Computation
Authors: ,
Keywords: programming: branch and bound
Abstract:

A nonlinear integer programming model for the optimal design of a series/parallel reliability system is presented, together with an enumeration algorithm for its solution and an example. The algorithm is based on an efficient procedure for solving the continuous relaxation of the mathematical model.

Reviews

Required fields are marked *. Your email address will not be published.