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.

Algorithms, Weapons, Nuclear weapons, Algorithm, Military, Missiles, Theory

---

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.

Management science, Modeling, Data modeling software, Operations Research, Search Strategy, Searching, Approximation, Monte Carlo Methods

---

Similar abstracts:

• Abstracts: Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem. Interval Estimation after Sequential Testing Based on the Total Time on Test

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.