Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity

References

• Abdi A, Fukasawa R (2016) On the mixing set with a knapsack constraint. Math. Programming 157(1):191–217.Google Scholar
• Atamtürk A, Nemhauser GL, Savelsbergh MW (2000) The mixed vertex packing problem. Math. Programming 89(1):35–53.Google Scholar
• Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2):565–600.Link, Google Scholar
• Calafiore G, Campi M (2005) Uncertain convex programs: Randomized solutions and confidence levels. Math. Programming 102(1):25–46.Google Scholar
• Calafiore G, El Ghaoui L (2006) On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1):1–22.Google Scholar
• Campi M, Garatti S (2011) A sampling-and-discarding approach to chance-constrained optimization: Feasibility and optimality. J. Optim. Theory Appl. 148:257–280.Google Scholar
• Chen Z, Xie W (2021) Sharing the value-at-risk under distributional ambiguity. Math. Finance 31(1):531–559.Google Scholar
• Chen Z, Kuhn D, Wiesemann W (2022) Data-driven chance constrained programs over Wasserstein balls. Oper. Res., ePub ahead of print July 21, https://doi.org/10.1287/opre.2022.2330.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
• Gao R, Kleywegt AJ (2022) Distributionally robust stochastic optimization with Wasserstein distance. Math. Oper. Res., ePub ahead of print August 5, https://doi.org/10.1287/moor.2022.1275.Google Scholar
• Günlük O, Pochet Y (2001) Mixing mixed-integer inequalities. Math. Programming 90(3):429–457.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.Google Scholar
• Ho-Nguyen N, Kilinç-Karzan F, Küçükyavuz S, Lee D (2021) Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity. Math. Programming 1–32.Google Scholar
• Hota AR, Cherukuri A, Lygeros J (2019) Data-driven chance constrained optimization under Wasserstein ambiguity sets. Proc. Amer. Control Conf. (IEEE), 1501–1506.Google Scholar
• Ji R, Lejeune MA (2021) Data-driven distributionally robust chance-constrained optimization with Wasserstein metric. J. Global Optim. 79(4):779–811.Google Scholar
• Jiang R, Guan Y (2016) Data-driven chance constrained stochastic program. Math. Programming 158(1):291–327.Google Scholar
• Kilinç-Karzan F, Küçükyavuz S, Lee D (2021) Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. Math. Programming 1–44.Google Scholar
• Küçükyavuz S (2012) On mixing sets arising in chance-constrained programming. Math. Programming 132(1–2):31–56.Google Scholar
• Küçükyavuz S, Jiang R (2022) Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness. EURO J. Comput. Optim. 10:100030.Google Scholar
• Li B, Jiang R, Mathieu JL (2019) Ambiguous risk constraints with moment and unimodality information. Math. Programming 173(1):151–192.Google Scholar
• Liu X, Küçükyavuz S, Luedtke J (2016) Decomposition algorithms for two-stage chance-constrained programs. Math. Programming 157(1):219–243.Google Scholar
• Liu X, Kilinç-Karzan F, Küçükyavuz S (2019) On intersection of two mixing sets with applications to joint chance-constrained programs. Math. Programming 175(1–2):29–68.Google Scholar
• Luedtke J (2012) Online supplement to “A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support.” Technical report, University of Wisconsin at Madison, Madison, WI.Google Scholar
• Luedtke J (2014) A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Programming 146(1):219–244.Google Scholar
• Luedtke J, Ahmed S (2008) A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2):674–699.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.Google Scholar
• Mohajerin Esfahani P, 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
• Rahimian H, Mehrotra S (2022) Frameworks and results in distributionally robust optimization. Open J. Math. Optim. 3:1–85.Google Scholar
• Ruszczyński A (2002) Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Programming 93(2):195–215.Google Scholar
• Shen H, Jiang R (2022) Chance-constrained set covering with Wasserstein ambiguity. Math. Programming 1–54.Google Scholar
• Song Y, Küçükyavuz S, Luedtke J (2014) Chance-constrained binary packing problems. INFORMS J. Comput. 26(4):735–747.Link, Google Scholar
• Wang S, Li J, Mehrotra S (2022) A solution approach to distributionally robust joint-chance-constrained assignment problems. INFORMS J. Optim. 4(2):125–147.Link, Google Scholar
• Xie W (2021) On distributionally robust chance constrained programs with Wasserstein distance. Math. Programming 186(1):115–155.Google Scholar
• Xie W, Ahmed S (2018a) On deterministic reformulations of distributionally robust joint chance constrained optimization problems. SIAM J. Optim. 28(2):1151–1182.Google Scholar
• Xie W, Ahmed S (2018b) On quantile cuts and their closure for chance constrained optimization problems. Math. Programming 172(1):621–646.Google Scholar
• Xie W, Ahmed S (2020) Bicriteria approximation of chance constrained covering problems. Oper. Res. 68(2):516–533.Abstract, Google Scholar
• Zhang Y, Dong J (2022) Building load control using distributionally robust chance-constrained programs with right-hand side uncertainty and the risk-adjustable variants. INFORMS J. Comput. 34(3):1531–1547.Link, Google Scholar
• Zhang Y, Jiang R, Shen S (2018) Ambiguous chance-constrained binary programs under mean-covariance information. SIAM J. Optim. 28(4):2922–2944.Google Scholar
• Zhao M, Huang K, Zeng B (2017) A polyhedral study on chance constrained program with random right-hand side. Math. Programming 166(1–2):19–64.Google Scholar