Article ID: | iaor2008859 |
Country: | United States |
Volume: | 53 |
Issue: | 5 |
Start Page Number: | 745 |
End Page Number: | 753 |
Publication Date: | Sep 2005 |
Journal: | Operations Research |
Authors: | Wood Kevin, Carlyle W. Matthew, Brown Gerald, Diehl Douglas, Kline Jeffrey |
Keywords: | programming: integer |
We describe JOINT DEFENDER, a new two-sided optimization model for planning the pre-positioning of defensive missile interceptors to counter an attack threat. In our basic model, a defender pre-positions ballistic missile defense platforms to minimize the worst-case damage an attacker can achieve; we assume that the attacker will be aware of defensive pre-positioning decisions, and that both sides have complete information as to target values, attacking-missile launch sites, weapon system capabilities, etc. Other model variants investigate the value of secrecy by restricting the attacker's and/or defender's access to information. For a realistic scenario, we can evaluate a completely transparent exchange in a few minutes on a laptop computer, and can plan near-optimal secret defenses in seconds. JOINT DEFENDER's mathematical foundation and its computational efficiency complement current missile-defense planning tools that use heuristics or supercomputing. The model can also provide unique insight into the value of secrecy and deception to either side. We demonstrate with two hypothetical North Korean scenarios.