Integer Prim-Read Solutions to a Class of Target Defense Problems
Article Abstract:
The Prim-Read missile deployment strategy concerns deploying and firing interceptor missiles in such a manner as to equalize the probabilities that each of a specified number of weapons destroys the target. This strategy has played a major role in U.S. strategic defense policy. The present paper focuses on a class of Prim-Read type deployments that requires a) that the number of defending interceptors assigned to each missile be an integer, and that b) these deployment problems have noninteger versions that have Prim-Read solutions. At issue is to minimize the required number of receptors for defending T targets against k missiles, where neither T nor k is known to the defense in advance. Solutions to the single target case are shown; the 'Greedy Algorithm' solves the case. Examples are presented. Tables and graphs illustrate solution of the single target case.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1985
User Contributions:
Comment about this article or add new information about this topic:
The Process of Search Planning: Current Approaches and Continuing Problems
Article Abstract:
An approach to search planning is discussed. The planner blends subjective and objective methods. Plans are produced that are a compromise between theoretical optimality and operational feasibility. A diagram shows a target location map of time of initial distress. A graph shows the detection probability for search.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1983
User Contributions:
Comment about this article or add new information about this topic: