A MISSILE TARGETING PROBLEM
Abstract
The following missile assignment problem is considered. Missiles are to be assigned to targets in two distinct steps. First, each missile is programmed so that it can be fired at any one of a small number of targets, the number of targets being the missile capability. The programming of the missiles is represented by a qualification matrix Q. Second, if battle occurs, all missiles are to be assigned to targets and launched. Each missile must be assigned to a target for which it is programmed. It is assumed that only a random subset X of the missiles will actually be available for battle, and so the assignment must be made for a reduced qualification matrix Q(X). The questions considered are 'what is an optimal assignment given the reduced qualification matrix Q(X).,' and 'what can be expected from this assignment.' Use of a damage function is proposed. An optimal assignment is one which maximizes the value of the damage function. The damage function may be chosen to represent a wide variety of optimization requirements. The main part of the paper describes Monte Carlo procedures for estimating the expected damage and the probability that the damage will be at least c for any number c.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1964
- Accession Number
- AD0603583
Entities
People
- David W. Walkup
- M. D. Maclaren
Organizations
- Boeing