Network optimization models for resource allocation in developing military countermeasures

Thumbnail Image
Files
inc_Kress_2012.pdf (510.65 KB)
Authors
Golany, Boaz
Kress, Moshe
Penn, Michael
Rothblum, Uriel G.
Subjects
arms race
network optimization
constrained shortest path
Advisors
Date of Issue
2012-01
Date
Publisher
INFORMS
Language
Abstract
A military arms race is characterized by an iterative development of measures and countermeasures. An attacker attempts to introduce new weapons in order to gain some advantage, whereas a defender attempts to develop countermeasures that can mitigate or even eliminate the effects of the weapons. This paper addresses the the defender's decision problem: given limited resources, which countermeasures should be developed and how much should be invested in their development to minimize the damage caused by the attacker's weapons over a certain time horizon. We formulate several optimization models, corresponding to different operational settings, as constrained shortest-path problems and variants thereof. We then demonstrate the potential applicability and robustness of this approach with respect to various scenarios.
Type
Article
Description
The article of record as published may be found at: http://dx.doi.org/10.1287/opre.1110.1002
URI
https://hdl.handle.net/10945/39570
Series/Report No
Department
Operations Research
Organization
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Operations Research, v.60, no.1 Jan-Feb 2012, pp. 48-63.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications