Summary
Dynamic programming formulation for obtaining the optimum number of redundancies at each stage in a system is explained in detail. It is also emphasized and illustrated by examples, that the ‘summation’ form of functional equations, as suggested in the paper, provide a faster solution to an otherwise computationally voluminous method.