Accession Number : AD0780684
Title : Sortie Allocation by a Nonlinear Programming Model for Determining a Munitions Mix,
Corporate Author : RAND CORP SANTA MONICA CALIF
Personal Author(s) : Clasen,R. J. ; Graves,G. W. ; Lu,J. Y.
Report Date : MAR 1974
Pagination or Media Count : 82
Abstract : The report presents a mathematical programming approach to maximize a military objective function which is subject to resource constraints. The formulation takes account of the diminishing returns obtained with incremental capability increases, thus producing a problem of the convex programming type. A very general nonlinear programming algorithm is presented, along with a discussion of its numerical properties and a proof of its convergence for the convex programming problem. This is followed by a description of the computer input for the specific problem studied, and by an example problem with its associated computer output. An appendix details the use of the general algorithm for applications that differ from the one considered here. This usage involves altering several PL/1 procedures to the form desired.
Descriptors : *Military operations, *Missions, *Nonlinear programming, Ammunition, Air to surface, Air Force operations, Naval operations, Kill probabilities, Mathematical models, Computer programming
Subject Categories : Operations Research
Naval Surface Warfare
Distribution Statement : APPROVED FOR PUBLIC RELEASE