Approximating two-stage chance-constrained programs with classical probability bounds
- 43 Downloads
We consider a joint-chance constraint (JCC) as a union of sets, and approximate this union using bounds from classical probability theory. When these bounds are used in an optimization model constrained by the JCC, we obtain corresponding upper and lower bounds on the optimal objective function value. We compare the strength of these bounds against each other under two different sampling schemes, and observe that a larger correlation between the uncertainties tends to result in more computationally challenging optimization models. We also observe the same set of inequalities to provide the tightest upper and lower bounds in our computational experiments.
KeywordsChance-constrained optimization Bonferroni inequalities Union bounds Stochastic optimization Approximations
We thank David Morton and Shabbir Ahmed for helpful discussions. This work was supported in part by Sandia’s Laboratory Directed Research and Development (LDRD) program. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology and Engineering Solutions of Sandia, LLC., a wholly owned subsidiary of Honeywell International, Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA-0003525. This paper describes objective technical results and analysis. Any subjective views or opinions that might be expressed in the paper do not necessarily represent the views of the U.S. Department of Energy or the United States Government. SAND2019-0432 J.
- 1.Ahmed, S., Shapiro, A.: Solving chance-constrained stochastic programs via sampling and integer programming. Tutor. Oper. Res. 10, 261–269 (2008)Google Scholar
- 4.Brook, A., Kendrick, D., Meeraus, A.: GAMS, a user’s guide (1988)Google Scholar
- 25.Singh, B.: Optimal spatiotemporal resource allocation in public health and renewable energy. Ph.D. thesis, The University of Texas at Austin (2016)Google Scholar