EconPapers    
Economics at your fingertips  
 

Optimal Allocation of Risk-Reduction Resources in Event Trees

Hanif D. Sherali (), Jitamitra Desai () and Theodore S. Glickman ()
Additional contact information
Hanif D. Sherali: Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061
Jitamitra Desai: Department of Industrial and Systems Engineering, University of Arizona, Tucson, Arizona 85719
Theodore S. Glickman: Department of Decision Sciences, The George Washington University, Washington, D.C. 20052

Management Science, 2008, vol. 54, issue 7, 1313-1321

Abstract: In this paper, we present a novel quantitative analysis for the strategic planning decision problem of allocating certain available prevention and protection resources to, respectively, reduce the failure probabilities of system safety measures and the total expected loss from a sequence of events. Using an event tree optimization approach, the resulting risk-reduction scenario problem is modeled and then reformulated as a specially structured nonconvex factorable program. We derive a tight linear programming relaxation along with related theoretical insights that serve to lay the foundation for designing a tailored branch-and-bound algorithm that is proven to converge to a global optimum. Computational experience is reported for a hypothetical case study, as well as for several realistic simulated test cases, based on different parameter settings. The results on the simulated test cases demonstrate that the proposed approach dominates the commercial software BARON v7.5 when the latter is applied to solve the original model by more robustly yielding provable optimal solutions that are at an average of 16.6% better in terms of objective function value; and it performs competitively when both models are used to solve the reformulated problem, particularly for larger test instances.

Keywords: risk management; risk reduction; event trees; system safety; global optimization; factorable programming; branch-and-bound (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1070.0844 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:54:y:2008:i:7:p:1313-1321

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ormnsc:v:54:y:2008:i:7:p:1313-1321