A Model for Allocating Interceptors from Overlapping Batteries: A Method of Dynamic Programming

This paper develops a model for the optimum allocation of fixed stockpiles of interceptors. Imbedded dynamic programming and successive approximations serve as the format for the computational scheme. This procedure leads to a local optimum solution in general and to the global optimum in certain instances. A method for determining upper bounds is included in the algorithm so that optimal stopping rules may be used to choose a final solution.