A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases

Jerome Bracken and James T. McGill
Additional contact information
Jerome Bracken: Institute for Defense Analyses, Arlington, Virginia
James T. McGill: Institute for Defense Analyses, Arlington, Virginia

Operations Research, 1973, vol. 21, issue 1, 30-36

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.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.30 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:1:p:30-36

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().