Interdicting a Nuclear-Weapons Project

A “proliferator” seeks to complete a first small batch of fission weapons as quickly as possible, whereas an “interdictor” wishes to delay that completion for as long as possible. We develop and solve a max-min model that identifies resource-limited interdiction actions that maximally delay completion time of the proliferator's weapons project, given that the proliferator will observe any such actions and adjust his plans to minimize that time. The model incorporates a detailed project-management (critical path method) submodel, and standard optimization software solves the model in a few minutes on a personal computer. We exploit off-the-shelf project-management software to manage a database, control the optimization, and display results. Using a range of levels for interdiction effort, we analyze a published case study that models three alternate uranium-enrichment technologies. The task of “cascade loading” appears in all technologies and turns out to be an inherent fragility for the proliferator at all levels of interdiction effort. Such insights enable policy makers to quantify the effects of interdiction options at their disposal, be they diplomatic, economic, or military.

[1]  Roger C Herdman,et al.  Technologies Underlying Weapons of Mass Destruction , 1993 .

[2]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[3]  Gary B. Shelly,et al.  Microsoft Office , 1995 .

[4]  Jonathan F. Bard.  An Algorithm for Solving the General Bilevel Programming Problem , 1983, Math. Oper. Res..

[5]  A. Propoi.  On the Theory of Max-Min , 1977 .

[6]  D. Malcolm,et al.  Application of a Technique for Research and Development Program Evaluation , 1959 .

[7]  Gerald G. Brown,et al.  Defending Critical Infrastructure , 2006, Interfaces.

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  Robert F. Dell,et al.  Optimization and Persistence , 1997 .

[10]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[11]  R. Kevin Wood,et al.  Shortest‐path network interdiction , 2002, Networks.

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  K. Lützenkirchen,et al.  Consequences of a Radiological Dispersal Event with Nuclear and Radioactive Sources , 2007 .

[14]  Wallace B. S. Crowston,et al.  Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects , 1967, Oper. Res..

[15]  E. Bulman,et al.  Global security , 1991, SGSC.

[16]  William Creager,et al.  Office of Technology Assessment (OTA) , 2001 .

[17]  Eric M. Skroch.  How to optimally interdict a belligerent project to develop a nuclear weapon , 2004 .

[18]  Gz,et al.  命运多舛——MicroSoft Office传奇 , 2006 .

[19]  M. Ivimey.  Annual report , 1958, IRE Transactions on Engineering Writing and Speech.

[20]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[21]  Edwin Brown Firmage,et al.  The Treaty on the Non-Proliferation of Nuclear Weapons , 1969 .

[22]  Brian K. Reed.  Models for Proliferation Interdiction Response Analysis. , 1994 .

[23]  Gerald G. Brown,et al.  Anatomy of a Project to Produce a First Nuclear Weapon , 2006 .

[24]  James A. Mowbray,et al.  Dark Sun: The Making of the Hydrogen Bomb , 1996 .

[25]  E. W. Davis,et al.  Project Management With Cpm, Pert and Precedence Diagramming , 1983 .

[26]  Johannes O. Royset,et al.  On the Complexity of Delaying an Adversary’s Project , 2005 .