Accession Number : AD0746483
Title : Optimal Defensive Missile Allocation: A Discrete Min-Max Problem.
Descriptive Note : Research rept.,
Corporate Author : TEXAS UNIV AUSTIN CENTER FOR CYBERNETIC STUDIES
Personal Author(s) : Soland,Richard M.
Report Date : JAN 1972
Pagination or Media Count : 21
Abstract : The paper considers the problem of choosing the anti-ballistic missile (ABM) defense levels of reliable subtractive area and point defenses protecting a set of cities so as to minimize the total damage done to the cities by an optimal attack by a given number of reliable offensive missiles of one type. It is assumed that the offensive side knows the ABM defense levels chosen and that the defensive side knows the ABM defense levels chosen and that the defensive side knows the number of missiles possessed by the offensive side. The cost of the defensive allocation chosen must not exceed a stated budget level. The 0-1 implicit enumeration scheme of Lawler and Bell is combined with a branch and bound procedure to effect a solution. (Author)
Descriptors : (*ANTIMISSILE DEFENSE SYSTEMS, MATHEMATICAL MODELS), MINIMAX TECHNIQUE, DEPLOYMENT, MATHEMATICAL PROGRAMMING, OPTIMIZATION
Subject Categories : Operations Research
Antimissile Defense Systems
Distribution Statement : APPROVED FOR PUBLIC RELEASE