A Class of Dynamic Nonlinear Resource Allocation Problems

Abstract

We consider a class of dynamic resource allocation problems a specific example of which is the Weapon-Target Assignment problem. This problem is concerned with the optimal assignment of resources in a military engagement. These problems are, in general, NP-Complete, so our aim is to provide insight into the problem and its solution. We will provide analytical results for simple cases of the problem. We will also provide sub-optimal algorithms, together with bounds on the objective function, under certain assumptions. The battle scenario of the military engagement being modeled is as follows. The offense launches a number of weapons ( the targets) which are aimed at valuable assets of the defense. The defense has a number of defensive weapons each of which can engage at most one target. The outcome of such an engagement is stochastic. In the static scenario all weapons are fired simultaneously. In the dynamic scenario some weapons are assigned and fired and the outcomes of these engagements are observed before further assignments are made.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1989
Accession Number
ADA215008

Entities

People

  • Patrick A. Hosein

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Command And Control
  • Computational Complexity
  • Computational Science
  • Computer Programming
  • Computers
  • Contracts
  • Dynamic Programming
  • Geometry
  • Kill Probabilities
  • Massachusetts
  • Mathematical Models
  • Mathematical Programming
  • Optimization
  • Quantum Mechanics
  • Random Variables
  • Value

Readers

  • Missile Defense Systems.
  • Operations Research