Accession Number:

AD0291753

Title:

A DYNAMIC PROGRAMMING SOLUTION FOR A COMBINATORIAL PROBLEM INVOLVING THE SELECTION OF A SET OF OPTIMUM WEAPON YIELDS

Descriptive Note:

Memorandum rept.

Corporate Author:

BALLISTIC RESEARCH LABS ABERDEEN PROVING GROUND MD

Personal Author(s):

Report Date:

1962-10-01

Pagination or Media Count:

23.0

Abstract:

Identifer Weapon yields, Mathematical models, algorithms.A combinatorial problem of c rrent interest to the weapon Systems Laboratory, BRL, involves a determination of optimal weapon yields. Previously solutions were obtained on BRLESC by exhaustive search techniques. Problems which admit large numbers of possible solutions prove to be time consuming and in some cases practically impossible. The problem is reformulated using the functional equation approach of dynamic programming. A computational algorithm is given which results in significant reduction in the computing times required to obtain sol tions. One solution, which had required more than seven hours computing time on BRLESC using the exhaustive searc technique, was obtained in less than one secon by means of the new method. Many other cases of interest for which results were not attainable u ing the previous algorithm can now be resolved in a routine manner. Author

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE