A modified separable programming approach to weapon system allocation problems.
McLaughlin, Thomas Robert Jr.
Taylor, James G.
MetadataShow full item record
This thesis considers mathematical techniques for computing the optimal allocation of weapons from m different systems against n undefended targets. A standard nonlinear programming problem is considered. A discussion is given on John Danskin's Algorithm for the determination of the optimal values of the lagrange multipliers for this problem Using a transformation of variables, the nonlinear problem is reformulated as a separable problem and solved by separable programming. A new method, the hybrid algorithm, for the determination of the optimal lagrange multipliers is developed.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Application of differential games to problems of military conflict: Tactical allocation problems, Part III - Appendices C and D Taylor, James G. (Monterey, California. Naval Postgraduate School, 1974-11); NPS55TW74112The mathematical theory of differential games is used to study the structure of optimal allocation strategies for some time-sequential combat games with combat described by Lanchester-type equations of warfare. Several ...
Taylor, James G. (Wiley Online, 1975-12);The treatment of force‐level constraints in time‐sequential combat optimization problems is illustrated by further studying the fire‐programming problem of Isbell and Marlow. By using the theory of state variable inequality ...
Kim, Kwang Bog (Monterey, California. Naval Postgraduate School, 1978-03);Decision makers are often confronted with problems for which there exist several distinct measures of success. Such problems can often be expressed in terms of linear or nonlinear programming models with several "criterion" ...