An approximating algorithm for an optimum aim‐points problem

Sidney I. Firstman

Naval Research Logistics Quarterly, 1960, vol. 7, issue 2, 151-167

Abstract: This paper describes the development and employment of an algorithm that obtains approximate solutions in integers to the problem of assigning weapons to aim points within a target complex so as to minimize the expected target value remaining after the attack. The target complex contains two or more independent targets located such that (a) a nuclear weapon aimed at one target has a nonzero probability of also destroying another target in the complex, (b) a nuclear weapon directed between two or more targets has a nonzero probability of destroying more than one of the targets, or (c) both conditions exist. Also discussed is the extension of the basic technique to the problem of finding the marginal return per weapon allocated. Then, with a dynamic‐programming formulation, a method of solving the larger problem of optimum allocation of a stockpile of weapons over a set of target complexes is demonstrated. This broader allocation uses the results of the algorithm. The algorithm and several useful subroutines have been programmed fox the IBM‐704 computer.

Date: 1960
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800070205

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:navlog:v:7:y:1960:i:2:p:151-167

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().