Cover: An approximating algorithm for an optimum aim-points problem.

An approximating algorithm for an optimum aim-points problem.

Published 1959

by Sidney I. Firstman

Purchase Print Copy

 Format Price
Add to Cart Paperback28 pages $15.00

An algorithm that will yield approximate solutions in integers for the problem of assigning missiles to aim points so as to maximize the resultant expected target destruction. The target complex is such that a weapon aimed at one target can destroy another, or a weapon aimed between several targets can destroy more than one. A precise statement of the algorithm and an example of its use are given.

This report is part of the RAND paper series. The paper was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.