A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases

Abstract

This paper formulates a convex programming model allocating submarine-launched ballistic missiles (SLBMs) to launch areas and providing simultaneously an optimal targeting pattern against a specified set of bomber bases. Flight times of missiles from launch areas to bases vary and targets decrease in value over time. A nonseparable concave objective function is given for expected destruction of bombers. An example is presented.