On the Computational Complexity of Reliability Redundancy Allocation in a Series System

[[abstract]]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. In this paper, we prove that some reliability redundancy optimization problems are NP-hard. We also derive alternative proofs for the NP-hardness of some special cases of the knapsack problem.[[fileno]]2020416010036[[department]]工工