A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases

A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases

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 i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research 1973-01, Vol.21 (1), p.30-36
Hauptverfasser: Bracken, Jerome, McGill, James T
Format: Artikel
Sprache:eng
Schlagworte:
Bomber aircraft
Flight time
Integers
Mathematical tables
Military bases
Missiles
Objective functions
Programming models
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.21.1.30