A Convex Programming Model for Resource Allocation with Time-Dependent Objectives: SLBM Attack of Bomber Bases.
Abstract
An allocation model involving distribution of resources to a set of feasible interim locations and then to an expanded set of final locations is formulated and shown to be convex programming problem. The objective is to maximize the expected value of a specified performance measure. The contribution of the resources to this measure may vary over time due to differing transit times between interim and final locations and to deteriorating values associated with final locations. The objective function is non-separable and concave, and the constraints are linear. An example is presented in which the expected number of bombers destroyed in an SLBM attack on bomber bases is maximized. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1970
- Accession Number
- AD0721855
Entities
People
- James T. Mcgill
- Jerome Bracken
Organizations
- Institute for Defense Analyses