Optimal Defensive Missile Allocation: A Discrete Min-Max Problem

Richard M. Soland
Additional contact information
Richard M. Soland: The University of Texas, Austin, Texas

Operations Research, 1973, vol. 21, issue 2, 590-596

Abstract: This paper considers the problem of choosing the discrete antiballistic missile (ABM) defense levels of reliable subtractive area and point defenses protecting a set of targets so as to minimize the total damage done to the targets by on optimal attack by a given number of reliable offensive missiles of one type. It assumes that the offensive 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 cost function need not be continuous or separable. The 0-1 implicit enumeration scheme of Lawler and Bell is combined with a branch-and-bound procedure to effect a solution.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.2.590 (application/pdf)

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:inm:oropre:v:21:y:1973:i:2:p:590-596

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().