The Nested Event Tree Model with Application to Combating Terrorism

Authors:
Brian J. Lunday;Hanif D. Sherali;Theodore S. Glickman
Affiliations:
Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061;Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061;Department of Decision Sciences, School of Business, George Washington University, Washington, DC 20052
Venue:
INFORMS Journal on Computing
Year:
2010

Citing 8
Cited 0

Comparison of Two Reformulation-Linearization TechniqueBased Linear Programming Relaxations for Polynomial Programming Problems

Journal of Global Optimization
Including technical and security risks in the management of information systems: A programmatic risk management model

Systems Engineering
A bilevel mixed-integer program for critical infrastructure protection planning

Computers and Operations Research
Government preparedness: Using simulation to prepare for a terrorist attack

Computers and Operations Research
Optimal Allocation of Risk-Reduction Resources in Event Trees

Management Science
Balancing Terrorism and Natural Disasters---Defensive Strategy with Endogenous Attacker Effort

Operations Research
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

Operations Research
On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we model and solve the strategic problem of minimizing the expected loss inflicted by a hostile terrorist organization. An appropriate allocation of certain capability-related, intent-related, vulnerability-related, and consequence-related resources is used to reduce the probabilities of success in the respective attack-related actions and to ameliorate losses in case of a successful attack. We adopt a nested event tree optimization framework and formulate the problem as a specially structured nonconvex factorable program. We develop two branch-and-bound schemes based, respectively, on utilizing a convex nonlinear relaxation and a linear outer approximation, both of which are proven to converge to a global optimal solution. We also design an alternative direct mixed-integer programming model representation for this case, and we investigate a fundamental special-case variant for this scheme that provides a relaxation and affords an optimality gap measure. Several range reduction, partitioning, and branching strategies are proposed, and extensive computational results are presented to study the efficacy of different compositions of these algorithmic ingredients, including comparisons with the commercial software BARON. A sensitivity analysis is also conducted to explore the effect of certain key model parameters.