Computational techniques for optimizing systems with standby redundancy

Claude Henin

Naval Research Logistics Quarterly, 1972, vol. 19, issue 2, 293-308

Abstract: Three methods are used to solve the following problem: For P, a positive constant, maximize (P. Reliability‐cost) of a system with standby redundancy. The results show that a method which rounds a noninteger solution to the nearest integer solution can lead to tremendous mistakes. However, neither a well known dynamic programming algorithm nor a previously developed branch and bound technique are able to solve large size problems. The solution of problems of large dimension thus requires the use of the noninteger solution of the first method to limit the number of possible solutions when using either the dynamic programming algorithm or a modified branch and bound technique. With this assistance, the branch and bound technique is able to solve large problems in a short amount of computational time.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800190207

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:19:y:1972:i:2:p:293-308

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().