This thesis is concerned with developing an optimal launching schedule for ABM's deployed for defense of a number of point targets, i.e. an ICBM complex. Let the attack occur in N stages with an offensive strategy of saturation. A dynamic programming model is developed for formulating the problem and a linear programming model is used in its solution. Equations are developed for determining the optimal number of ABM's to launch on each stage of the attack so as to maximize the expected number of silos surviving. Multivalued point target defense is discussed and formulated but no specific solutions are offered. The ABM system (including radars, computers, etc.) is not considered subject to attack. Some discussion of this aspect of the problem is offered. Single ABM launchings per re-entry vehicle are assumed. A test is developed to determine for what parameters single launchings are preferred over multiple launchings, under the assumptions of the attack.
Naval Postgraduate School (U.S.)
Naval Postgraduate School
M.S. in Operations Research
Approved for public release; distribution is unlimited.