Minimum‐cost mixtures of area and point defenses assuming simultaneous attack

Richard M. Soland

Naval Research Logistics (NRL), 1987, vol. 34, issue 3, 337-363

Abstract: 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.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198706)34:33.0.CO;2-Z

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:34:y:1987:i:3:p:337-363

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().