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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
