A Strategic Weapons Exchange Allocation Model

We formulate a two-strike strategic weapons exchange, model as a max-min problem with the first striker's allocation affecting the second striker's feasible region. The max-min problem is shown to be equivalent to a separable, nonconvex program, to which an algorithm designed to locate an approximate global solution is then applied. The solution of three example problems is given.