Network Optimization Models for Resource Allocation in Developing Military Countermeasures

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

[1]  M. Kamien,et al.  Expenditure patterns for risky R and D projects , 1971, Journal of Applied Probability.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Craig Carlyle Etcheson Arms Race Theory: Strategy and Structure of Behavior , 1989 .

[4]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[5]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[6]  W. M. Burnett,et al.  How the Gas Research Institute (GRI) Helped Transform the US Natural Gas Industry , 1993 .

[7]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[8]  Dror Zuckerman,et al.  Expenditure patterns and timing of patent protection in a competitive R&D environment , 1997, Oper. Res. Lett..

[9]  V. Koubi Military Technology Races , 1999, International Organization.

[10]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[11]  I. Dumitrescu,et al.  Algorithms for the Weight Constrained Shortest Path Problem , 2001 .

[12]  Meinolf Sellmann,et al.  Shorter Path Constraints for the Resource Constrained Shortest Path Problem , 2005, CPAIOR.

[13]  Johannes O. Royset,et al.  Lagrangian relaxation and enumeration for solving constrained shortest‐path problems , 2008, Networks.

[14]  Uriel G. Rothblum,et al.  Optimal investment in development projects , 2008, Oper. Res. Lett..

[15]  Götz Neuneck The revolution in military affairs: Its driving forces, elements, and complexity , 2008 .

[16]  Götz Neuneck,et al.  The revolution in military affairs: Its driving forces, elements, and complexity , 2008, Complex..

[17]  U. Rothblum,et al.  Resource allocation in an asymmetric technology race with temporary advantages , 2012 .