On the Character and Complexity of Certain Defensive Resource Allocation Problems
Abstract
In this article we consider two classes of static defensive resource allocation problems, these are, the static "target-value based" weapon target allocation and the static "asset-value based" weapon allocation problem. It is shown that the target-value based problem can be recast, (using indicator functions), into an instantiation of the so-called transportation problem. The transportation problem can be solved by numerous polynomial-time algorithms and has received considerable attention in the literature. We also consider the so-called "asset-based" weapon target allocation problem. This problem is shown to be somewhat more difficult than the target value based problem. A simulation study is presented for the target-value allocation problem, with emphasis upon sensitivity to uncertain target-elimination probabilities.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 2004
- Accession Number
- ADA426110
Entities
People
- W. P. Malcolm
Organizations
- Defence Science and Technology Group