2008
DOI: 10.1287/mnsc.1070.0844
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Allocation of Risk-Reduction Resources in Event Trees

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
21
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 27 publications
(22 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…Then it can be verified thatp ∈ (see Sherali et al 2008 for a similar construction). Thus, ifp ∈ P , we have that x ȳ p C is feasible to NETO, and its objective value in (1) yields an upper bound on the optimal values for both problems NETO and NETO( ).…”
Section: Algorithm 1: Convex Relaxationsmentioning
confidence: 95%
See 3 more Smart Citations
“…Then it can be verified thatp ∈ (see Sherali et al 2008 for a similar construction). Thus, ifp ∈ P , we have that x ȳ p C is feasible to NETO, and its objective value in (1) yields an upper bound on the optimal values for both problems NETO and NETO( ).…”
Section: Algorithm 1: Convex Relaxationsmentioning
confidence: 95%
“…Although similar in concept to Sherali et al (2008Sherali et al ( , 2010, in which the authors reformulate the original problem as per Sherali and Wang (2001), our solution methodology exploits the particular structure of the NETO problem, and we also design different tailored procedures to solve a fundamental special case of our model. We then construct a polyhedral outer approximation to these isolated nonconvex sets and embed this in a branchand-bound algorithm, which ensures that a sequence of convex programs solved over recursively partitioned hyperrectangles will yield an optimal solution to NETO (within any prescribed -optimality tolerance).…”
Section: Algorithm 1: Convex Relaxationsmentioning
confidence: 99%
See 2 more Smart Citations
“…In a later work, Goel et al (2003) extended the system effectiveness approach to incorporate the initial availability of each process in the system as a degree of freedom. Sherali et al (2008) studied the optimal allocation of risk-reduction resources using an event tree representation. Some resources are used to prevent events in the tree from happening, while others are used to minimize the loss once the events occur.…”
Section: Introductionmentioning
confidence: 99%