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

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)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1962
Accession Number
AD0291753

Entities

People

  • William Sacco

Organizations

  • Ballistic Research Laboratory

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Dynamic Programming
  • Equations
  • Heuristic Methods
  • Mathematical Models
  • Mathematics
  • Models
  • Weapon Systems
  • Weapons

Readers

  • Operations Research
  • Snow Cover Descriptors for Reptiles and Their Illustrations.