Article ID: | iaor19931158 |
Country: | Netherlands |
Volume: | 11 |
Issue: | 5 |
Start Page Number: | 309 |
End Page Number: | 315 |
Publication Date: | Jun 1992 |
Journal: | Operations Research Letters |
Authors: | Chern Maw-Sheng |
Keywords: | computational analysis |
Finding the optimal redundancy that maximizes the system reliability is one of the important problems in reliability theory. A good deal of effort has been done in this field. This paper proves that some reliability redundancy optimization problems are NP-hard. It also derives alternative proofs for the NP-hardness of some special cases of the knapsack problem.