A new partial bound enumeration technique is introduced to solve reliability redundancy optimization problems. The algorithm is based on the studies of the characters of the problems and the bound dynamic programming and the Misra integer programming. Some examples show that the proposed algorithm can obtain economically and effectively exact solutions of reliability redundancy optimization problems in many cases, especially when the numbers of the dimension size or the feasible region of the problem are very large.