A modified separable programming approach to weapon system allocation problems.

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.