Convex Chance-Constrained Programs with Wasserstein Ambiguity

References

• Auslender A (1976) Optimisation. Méthodes Numériques (Masson, Paris).Google Scholar
• Beck A (2015) On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM J. Optim. 25(1):185–209.Crossref, Google Scholar
• Beck A, Tetruashvili L (2013) On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4):2037–2060.Crossref, Google Scholar
• Beraldi P, Ruszczyński A (2002) The probabilistic set-covering problem. Oper. Res. 50(6):956–967.Link, Google Scholar
• Bertsekas D (2016) Nonlinear Programming (Athena Scientific, Belmont, MA).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
• Charnes A, Cooper WW (1959) Chance-constrained programming. Management Sci. 6(1):73–79.Link, Google Scholar
• Charnes A, Cooper WW, Symonds GH (1958) Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil. Management Sci. 4(3):235–263.Link, Google Scholar
• Chen W, Sim M, Sun J, Teo CP (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 (2024) Data-driven chance constrained programs over Wasserstein balls. Oper. Res. 72(1):410–424.Google Scholar
• Chen Z, Xie W (2021) Sharing the value-at-risk under distributional ambiguity. Math. Finance 31(1):531–559.Crossref, Google Scholar
• Deng Y, Shen S (2016) Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints. Math. Programming 157(1):245–276.Crossref, 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
• Fathabad AM, Cheng J, Pan K, Yang B (2023) Asymptotically tight conic approximations for chance-constrained AC optimal power flow. Eur. J. Oper. Res. 305(2):738–753.Google Scholar
• Grippof L, Sciandrone M (1999) Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Software 10(4):587–637.Crossref, 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
• Ji R, Lejeune MA (2020) Data-driven distributionally robust chance-constrained optimization with Wasserstein metric. J. Global Optim. 79(4):779–811.Crossref, Google Scholar
• Jiang N, Xie W (2022) ALSO-X and ALSO-X+: Better convex approximations for chance constrained programs. Oper. Res. 70(6):3581–3600.Link, Google Scholar
• Küçükyavuz S (2012) On mixing sets arising in chance-constrained programming. Math. Programming 132(1–2):31–56.Crossref, Google Scholar
• Küçükyavuz S, Jiang R (2021) Chance-constrained optimization: A review of mixed-integer conic formulations and applications. Preprint, submitted January 21, https://arxiv.org/abs/2101.08746.Google Scholar
• Kuhn D, Esfahani PM, Nguyen VA, Shafieezadeh-Abadeh S (2019) Wasserstein distributionally robust optimization: Theory and applications in machine learning. Oper. Res. Management Sci. Age Analytics, 130–166.Link, Google Scholar
• Lagoa C, Li X, Sznaier M (2001) Application of probabilistically constrained linear programs to risk-adjusted controller design. Krogh BH, ed. Proc. Amer. Control Conf., vol. 2 (IEEE, Piscataway, NJ), 738–743.Google Scholar
• Li S (1995) An insurance and investment portfolio model using chance constrained programming. Omega 23(5):577–585.Crossref, Google Scholar
• Li B, Jiang R, Mathieu JL (2019) Ambiguous risk constraints with moment and unimodality information. Math. Programming 173(1–2):151–192.Crossref, Google Scholar
• Lubin M, Bienstock D, Vielma JP (2015) Two-sided linear chance constraints and extensions. Preprint, submitted July 8, https://arxiv.org/abs/1507.01995.Google Scholar
• Luedtke J (2014) A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Programming 146(1–2):219–244.Crossref, Google Scholar
• Luedtke J, Ahmed S (2008) A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2):674–699.Crossref, Google Scholar
• Luedtke J, Ahmed S, Nemhauser GL (2008) An integer programming approach for linear programs with probabilistic constraints. Math. Programming 122(2):247–272.Crossref, Google Scholar
• Luo ZQ, Tseng P (1993) Error bounds and convergence analysis of feasible descent methods: A general approach. Ann. Oper. Res. 46(1):157–178.Crossref, Google Scholar
• Miller BL, Wagner HM (1965) Chance constrained programming with joint constraints. Oper. Res. 13(6):930–945.Link, Google Scholar
• Miranda PA, Garrido RA (2006) A simultaneous inventory control and facility location model with stochastic capacity constraints. Networks Spatial Econom. 6(1):39–53.Crossref, 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.Crossref, Google Scholar
• Norkin VI (1993) The analysis and optimization of probability functions. Monograph (IIASA Working Paper), International Institute for Applied Systems Analysis (IIASA), Laxenburg, Austria.Google Scholar
• Prékopa A (1970) On probabilistic constrained programming. Proc. Princeton Sympos. Math. Programming, vol. 113 (Princeton University Press, Princeton, NJ), 138.Google Scholar
• Prékopa A (1990) Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. Zeitschrift Oper. Res. Methods Models Oper. Res. 34(6):441–461.Crossref, Google Scholar
• Prékopa A (2013) Stochastic Programming, vol. 324 (Springer Science & Business Media, New York).Google Scholar
• Rockafellar RT, Uryasev S (1999) Optimization of conditional value-at-risk. J. Risk 2(1):21–42.Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Crossref, Google Scholar
• Singh D, Zhang S (2021) Distributionally robust profit opportunities. Oper. Res. Lett. 49(1):121–128.Crossref, Google Scholar
• Stewart WR, Jr, Golden BL (1983) Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 14(4):371–385.Crossref, Google Scholar
• van de Panne C, Popp W (1963) Minimum-cost cattle feed under probabilistic protein constraints. Management Sci. 9(3):405–430.Link, Google Scholar
• Wang Q, Guan Y, Wang J (2011) A chance-constrained two-stage stochastic program for unit commitment with uncertain wind power output. IEEE Trans. Power Systems 27(1):206–215.Crossref, Google Scholar
• Xie W (2021) On distributionally robust chance constrained programs with Wasserstein distance. Math. Programming 186(1):115–155.Crossref, Google Scholar
• Xie W, Ahmed S (2018) 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 (2017) 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 (2020) Bicriteria approximation of chance-constrained covering problems. Oper. Res. 68(2):516–533.Link, Google Scholar
• Zymler S, Kuhn D, Rustem B (2011) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.Crossref, Google Scholar