A Modified Separable Programming Approach to Weapon System Allocation Problems.
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Pagination or Media Count:
The 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 Danskins 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. Author
- Operations Research
- Military Operations, Strategy and Tactics