Bicriteria Approximation of Chance-Constrained Covering Problems

References

• Ahmed S (2014) Convex relaxations of chance constrained optimization problems. Optim. Lett. 8(1):1–12.Crossref, Google Scholar
• Ahmed S, Luedtke J, Song Y, Xie W (2017) Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. Math. Programming 162(1–2):51–81.Crossref, Google Scholar
• Alon N, Arora S, Manokaran R, Moshkovitz D, Weinstein O (2011) Inapproximability of densest k-subgraph from average case hardness. Working paper, Tel Aviv University, Tel Aviv, Israel.Google Scholar
• Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2 (SIAM, Philadelphia).Crossref, Google Scholar
• Beraldi P, Ruszczyński A (2002) A branch and bound method for stochastic integer problems under probabilistic constraints. Optim. Methods Software 17(3):359–382.Crossref, Google Scholar
• Bonnans JF, Shapiro A (2000) Perturbation Analysis of Optimization Problems (Springer Science & Business Media, New York).Crossref, Google Scholar
• Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2):270–286.Link, Google Scholar
• Calafiore GC, Campi MC (2006) The scenario approach to robust control design. IEEE Trans. Automatic Control 51(5):742–753.Crossref, Google Scholar
• Calafiore GC, El Ghaoui L (2006) On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1):1–22.Crossref, Google Scholar
• Chen W, Sim M, Sun J, Teo C-P (2010) From CVaR to uncertainty set: Implications in joint chance-constrained optimization. Oper. Res. 58(2):470–485.Link, Google Scholar
• Chen Z, Kuhn D, Wiesemann W (2018) Data-driven chance constrained programs over Wasserstein balls. Working paper, Imperial College London, London.Google Scholar
• Cheon M-S, Ahmed S, Al-Khayyal F (2006) A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. Math. Programming 108(2–3):617–634.Crossref, Google Scholar
• Dentcheva D, Prékopa A, Ruszczynski A (2000) Concavity and efficient points of discrete distributions in probabilistic programming. Math. Programming 89(1):55–77.Crossref, Google Scholar
• Durrett R (1996) Probability: Theory and Examples (Cambridge University Press, New York).Google Scholar
• El Ghaoui L, Oks M, Oustry F (2003) Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. 51(4):543–556.Link, Google Scholar
• Esfahani PM, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1):115–166.Google Scholar
• Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint submitted April 8, https://arxiv.org/abs/1604.02199.Google Scholar
• Goyal V, Ravi R (2008) Approximation algorithms for robust covering problems with chance constraints. Accessed December 31, 2017, http://repository.cmu.edu/cgi/viewcontent.cgi?article=1365&context=tepper.Google Scholar
• Goyal V, Ravi R (2010) A PTAS for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3):161–164.Crossref, Google Scholar
• Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169–197.Crossref, Google Scholar
• Gupta A, Nagarajan V (2014) Approximating sparse covering integer programs online. Math. Oper. Res. 39(4):998–1011.Link, Google Scholar
• Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2015) A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Programming 151(1):35–62.Crossref, Google Scholar
• Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2017) Ambiguous joint chance constraints under mean and dispersion information. Oper. Res. 65(3):751–767.Link, Google Scholar
• Hu Z, Hong JL (2012) Kullback-Leibler divergence constrained distributionally robust optimization. Working paper, Tongji University, Shanghai, China.Google Scholar
• Jiang R, Guan Y (2016) Data-driven chance constrained stochastic program. Math. Programming 158(1–2):291–327.Crossref, Google Scholar
• Kataoka S (1963) A stochastic programming model. Econometrica 31(1–2):181–196.Crossref, Google Scholar
• Luedtke J, Ahmed S, Nemhauser GL (2010) An integer programming approach for linear programs with probabilistic constraints. Math. Programming 122(2):247–272.Crossref, Google Scholar
• Nemirovski A, Shapiro A (2006) Convex approximations of chance constrained programs. SIAM J. Optim. 17(4):969–996.Crossref, Google Scholar
• Pagnoncelli BK, Ahmed S, Shapiro A (2009) Sample average approximation method for chance constrained programming: Theory and applications. J. Optim. Theory Appl. 142(2):399–416.Crossref, Google Scholar
• Qiu F, Ahmed S, Dey SS, Wolsey LA (2014) Covering linear programming with violations. INFORMS J. Comput. 26(3):531–546.Link, Google Scholar
• Shapiro A (2017) Distributionally robust stochastic programming. SIAM J. Optim. 27(4):2258–2275.Crossref, Google Scholar
• Swamy C (2011) Risk-averse stochastic optimization: Probabilistically-constrained models and algorithms for black-box distributions. Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1627–1646.Google Scholar
• Talluri S, Narasimhan R, Nair A (2006) Vendor performance with supply risk: A chance-constrained dea approach. Internat. J. Production Econom. 100(2):212–222.Crossref, Google Scholar
• Vazirani VV (2001) Approximation Algorithms (Springer Science & Business Media, New York).Google Scholar
• Xie W (2018) On distributionally robust chance constrained program with Wasserstein distance. Working paper, Virginia Tech, Blacksburg.Google Scholar
• Xie W, Ahmed S (2018a) Distributionally robust chance constrained optimal power flow with renewables: A conic reformulation. IEEE Trans. Power Systems 33(2):1860–1867.Crossref, Google Scholar
• Xie W, Ahmed S (2018b) On deterministic reformulations of distributionally robust joint chance constrained optimization problems. SIAM J. Optim. 28(2):1151–1182.Crossref, Google Scholar
• Xie W, Ahmed S, Jiang R (2017) Optimized Bonferroni approximations of distributionally robust joint chance constraints. Working paper, Virginia Tech, Blacksburg.Google Scholar
• Yang W, Xu H (2016) Distributionally robust chance constraints for non-linear uncertainties. Math. Programming 155(1–2):231–265.Crossref, Google Scholar
• Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with Wasserstein metric. Oper. Res. Lett. 46(2):262–267.Crossref, Google Scholar
• Zymler S, Kuhn D, Rustem B (2013) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.Google Scholar