A modified separable programming approach to weapon system allocation problems.
Loading...
Authors
McLaughlin, Thomas Robert Jr.
Subjects
weapon system allocation problems
separable programming
Danskin's algorithm
nonlinear allocation models
computational algorithm
separable programming
Danskin's algorithm
nonlinear allocation models
computational algorithm
Advisors
Taylor, James G.
Date of Issue
1973-03
Date
March 1973
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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.
Type
Thesis
Description
Series/Report No
Department
Operations Analysis and Administrative Sciences
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This 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.