Optimal strategies for problems of simultaneous attack against an area defense with impact‐point prediction

Norman T. O'Meara and Richard M. Soland

Naval Research Logistics (NRL), 1992, vol. 39, issue 1, 1-28

Abstract: An area to be defended consists of separated point targets. These targets are subject to an attack in which the offensive weapons are assumed to arrive simultaneously. The defense has area defenders, each of which is capable of intercepting any attacker'. Furthermore, the defense has impact‐point prediction, i.e., it has knowledge of each attacker's intended target prior to allocation of the area interceptors. For a given attack, the defense wishes to allocate its interceptors against attackers so as to maximize the expected total survival value of the targets. In its first move, the offense seeks an attack allocation which will minimize expected total surviving value against best defense. We develop an algorithm to determine optimal attack and defense strategies and the optimal value of this sequential min‐max problem. Branch‐and‐bound techniques are used to obtain integer solutions, and illustrative computational results are provided.

Date: 1992
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(199202)39:13.0.CO;2-#

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:39:y:1992:i:1:p:1-28

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 ().