A Linear Programming Approach to Weapon Allocation
Abstract
A two-step optimization procedure using linear programming is employed to obtain a near-optimal solution to the large-scale, multiple-weapon type allocation problem. Initially, the target system is partitioned into target categories, each of which contains targets of equal worth and similar characteristics. Then, depending upon the requirements of the particular problem addressed, one of three different linear programming models is used to allocate the available supply of weapons among the target categories. Instead of inputing a point value for each target category, as is frequently done in other allocation models, in these models the user indicates a desired ratio of the probability of survival of the various categories. After the allocation of weapons among the categories has been accomplished, an integer programming model is used to assign weapons to individual targets within each category so as to minimize the average probability of survival of the category. These models have been programmed for an IBM 7090 computer at Headquarters Strategic Air Command.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1971
- Accession Number
- AD0721458
Entities
People
- William G. Goodyear
- William T. Hodson Iii
- Wolfhart B. Goethert
Organizations
- United States Air Force Academy