Premium
Minimum‐cost mixtures of area and point defenses assuming simultaneous attack
Author(s) -
Soland Richard M.
Publication year - 1987
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198706)34:3<337::aid-nav3220340304>3.0.co;2-z
Subject(s) - point (geometry) , bounded function , function (biology) , integer programming , mathematical optimization , integer (computer science) , upper and lower bounds , computer science , mathematics , geometry , mathematical analysis , evolutionary biology , biology , programming language
It is desired to select numbers of area and point interceptors that minimize the cost of such defensive missiles under the condition that the maximum total expected damage produced by an unknown number of attacking missiles A be bounded above by a given function of A . Area coverages may overlap. The attacker is assumed to know the numbers of area and point interceptors and to launch a simultaneous attack (of arbitrary size A ) against all targets, which is optimal against the given defenses. The defender is assumed to observe the attack and then allocate his area and point interceptors against attacking missiles so as to minimize the total expected damage. Upper and lower bounds on the minimal cost are obtained by solving integer programming problems.