On the Computational Solution of Dynamic-Programming Processes-XIV
One of a series of studies that applies dynamic-programming techniques to the computational solution of mathematical problems involving multistage decision processes. This memorandum applies the dynamic-programming technique to problems involving the optimal allocation of attack against a target system and the optimal allocation of defense against this attack. In the case of two types of attackers (either manned aircraft and decoys, or missiles of different capabilities), the Lagrange-multiplier technique is applied to reduce the computational solution to one involving sequences of functions of one variable. Large-scale target allocations are resolved computationally in a reasonable period of time with the use of such computers as the RAND JOHNNIAC or the IBM 704.