Optimal Redundancy Allocation by Dynamic Programming

This tutorial paper presents the problem of optimal allocation of parallel redundancy under multiple linear constraints by the method of dynamic programming. The problem is approached with a standard dynamic programming formulation; the concept of dominating system configurations is introduced to reduce the number of computations involved; and a simple procedure is presented. Solutions to three numerical examples are presented.