Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls

Published Online:https://doi.org/10.1287/opre.2022.2330

References

  • Arrigo A, Ordoudis C, Kazempour J, De Grève Z, Toubeau J-F, Vallée F (2022) Wasserstein distributionally robust chance-constrained optimization for energy and reserve dispatch: An exact and physically-bounded formulation. Eur. J. Oper. Res. 296(1):304–322.CrossrefGoogle Scholar
  • Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (SIAM, Philadelphia).CrossrefGoogle 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.CrossrefGoogle Scholar
  • Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2):565–600.LinkGoogle Scholar
  • Blanchet J, Kang Y, Murthy K (2019) Robust Wasserstein profile inference and applications to machine learning. J. Appl. Probab. 56(3):830–857.CrossrefGoogle Scholar
  • Carlsson JG, Behroozi M, Mihic K (2018) Wasserstein distance and the distributionally robust TSP. Oper. Res. 66(6):1603–1624.LinkGoogle Scholar
  • Chen Z, Xie W (2021) Sharing the value-at-risk under distributional ambiguity. Math. Finance 31(1):531–559.CrossrefGoogle Scholar
  • Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.LinkGoogle Scholar
  • Dert C, Oldenkamp B (2000) Optimal guaranteed return portfolios and the casino effect. Oper. Res. 48(5):768–775.LinkGoogle 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
  • Gao R, Chen X, Kleywegt AJ (2017) Distributional robustness and regularization in statistical learning. Preprint, submitted December 17, https://arxiv.org/abs/1712.06050.Google Scholar
  • Ghosal S, Wiesemann W (2020) The distributionally robust chance-constrained vehicle routing problem. Oper. Res. 68(3):716–732.LinkGoogle Scholar
  • Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4):902–917.LinkGoogle Scholar
  • Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3):677–693.LinkGoogle Scholar
  • Ho-Nguyen N, Kilinç-Karzan F, Küçükyavuz S, Lee D (2020) Strong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity. Preprint, submitted July 14, https://arxiv.org/abs/2007.06750.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
  • Hu Z, Hong J (2013) Kullback-Leibler divergence constrained distributionally robust optimization. Available at Optimization Online. http://www.optimization-online.org/DB_HTML/2012/11/3677.html.Google Scholar
  • Jiang R, Guan Y (2016) Data-driven chance constrained stochastic program. Math. Programming 158(1–2):291–327.CrossrefGoogle Scholar
  • Jiang R, Guan Y (2018) Risk-averse two-stage stochastic program with distributional ambiguity. Oper. Res. 66(5):1390–1405.LinkGoogle Scholar
  • Jiang Z, Ji R, Dong S (2021) A distributionally robust chance-constrained model for humanitarian relief network design. Preprint, submitted September 24, https://dx.doi.org/10.2139/ssrn.3929286.Google Scholar
  • Küçükyavuz S (2012) On mixing sets arising in chance-constrained programming. Math. Programming 132(1–2):31–56.CrossrefGoogle Scholar
  • Lam H (2019) Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization. Oper. Res. 67(4):1090–1105.AbstractGoogle Scholar
  • Luedtke J, Ahmed S, Nemhauser GL (2010) An integer programming approach for linear programs with probabilistic constraints. Math. Programming 122(2):247–272.CrossrefGoogle 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–2):1–52.CrossrefGoogle Scholar
  • Pflug G, Wozabal D (2007) Ambiguity in portfolio selection. Quant. Finance 7(4):435–442.CrossrefGoogle Scholar
  • Rujeerapaiboon N, Kuhn D, Wiesemann W (2016) Robust growth-optimal portfolios. Management Sci. 62(7):2090–2109.LinkGoogle Scholar
  • Serfling RJ (2009) Approximation Theorems of Mathematical Statistics, vol. 162 (John Wiley & Sons, New York).Google Scholar
  • Shafieezadeh-Abadeh S, Kuhn D, Mohajerin Esfahani P (2019) Regularization via mass transportation. J. Machine Learn. Res. 20(103):1–68.Google Scholar
  • Shen H, Jiang R (2021) Convex chance-constrained programs with Wasserstein ambiguity. Preprint, submitted November 3, https://arxiv.org/abs/2111.02486.Google Scholar
  • Sinha A, Namkoong H, Duchi J (2017) Certifiable distributional robustness with principled adversarial training. Preprint, submitted October 29, https://arxiv.org/abs/1710.10571.Google Scholar
  • Wang J (2007) The β-reliable median on a network with discrete probabilistic demand weights. Oper. Res. 55(5):966–975.LinkGoogle Scholar
  • Wiesemann W, Kuhn D, Rustem B (2012) Multi-resource allocation in stochastic project scheduling. Ann. Oper. Res. 193(1):193–220.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.LinkGoogle Scholar
  • Xie W (2019) On distributionally robust chance constrained programs with Wasserstein distance. Math. Programming 186:115–155.CrossrefGoogle Scholar
  • Xie W, Ahmed S (2020) Bicriteria approximation of chance-constrained covering problems. Oper. Res. 68(2):516–533.AbstractGoogle Scholar
  • Yanagisawa H, Osogami T (2013) Improved integer programming approaches for chance-constrained stochastic programming. Proc. 23rd Internat. Joint Conf. Artificial Intelligence, 2938–2944.Google Scholar
  • Zhang Y, Dong J (2021) Building load control using distributionally robust chance-constrained programs with right-hand side uncertainty and the risk-adjustable variants. Preprint, submitted April 22, https://arxiv.org/abs/2104.11312.Google Scholar
  • Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with Wasserstein metric. Oper. Res. Lett. 46(2):262–267.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.