A bound dynamic programming for solving reliability redundancy optimization

Abstract This paper presents a bound dynamic programming for solving reliability optimization problems, in which the optimal solution is obtained in the bound region of the problem by using dynamic programming. This algorithm is based on the studies of the characters of the problem and Misra [IEEE Trans. Reliability 40, 81–91 (1991)] bound search technique. With some examples, the proposed algorithm has been found to be more economical and effective than Misra integer programming to obtain the exact solutions of reliability redundancy optimization problems.