A Missile Allocation Problem

Harry J. Piccariello
Additional contact information
Harry J. Piccariello: Analytic Services Inc., Bailey's Crossroads, Virginia

Operations Research, 1962, vol. 10, issue 6, 795-798

Abstract: The problem of finding the allocation of weapons to a target system that results in the largest payoff is present in almost every war gaming exercise. A technique often employed to find a solution to such a problem is to consider the problem as a continuous allocation process. However, the continuous solution may not furnish the solution to the actual problem, which is a discrete allocation process. This paper presents a solution to a missile allocation problem when the problem is considered in its continuous form. This same problem is investigated in its discrete form and it is shown that the solution in the continuous case is not, in general, a solution for the discrete case. Further, a necessary condition is derived for the existence of a solution for the discrete problem that differs from the solution for the corresponding continuous problem.

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.6.795 (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:10:y:1962:i:6:p:795-798

Access Statistics for this article

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