Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets

Published Online:https://doi.org/10.1287/ijoc.2021.0181

References

  • Anderson B, Moore J (2007) Optimal Control: Linear Quadratic Methods (Courier Corporation, Chelmsford, MA).Google Scholar
  • Atamtürk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4):662–673.LinkGoogle Scholar
  • Bandi C, Han E, Nohadani O (2019) Sustainable inventory with robust periodic-affine policies and application to medical supply chains. Management Sci. 65(10):4636–4655.LinkGoogle Scholar
  • Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.LinkGoogle Scholar
  • Ben-Tal A, Golany B, Nemirovski A, Vial JP (2005) Supplier-retailer flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3):589–605.LinkGoogle Scholar
  • Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2):351–376.CrossrefGoogle Scholar
  • Ben-Tal A, den Hertog D, De Waegenaere A, Melenberg B, Rennen G (2013) Robust solutions of optimization problems affected by uncertain probabilities. Management Sci. 59(2):341–357.LinkGoogle Scholar
  • Bertsimas D, Goyal V (2012) On the power and limitations of affine policies in two-stage adaptive optimization. Math. Program. 134(2):491–531.CrossrefGoogle Scholar
  • Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.LinkGoogle Scholar
  • Bertsimas D, Gupta V, Kallus N (2018a) Data-driven robust optimization. Math. Program. 167(2):235–292.CrossrefGoogle Scholar
  • Bertsimas D, Gupta V, Kallus N (2018b) Robust sample average approximation. Math. Program. 171(1):217–282.CrossrefGoogle Scholar
  • Bertsimas D, Iancu D, Parrilo P (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363–394.LinkGoogle Scholar
  • Bertsimas D, Shtern S, Sturt B (2022) Two-stage sample robust optimization. Oper. Res. 70(1):624–640.LinkGoogle Scholar
  • Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.LinkGoogle Scholar
  • Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2):565–600.LinkGoogle Scholar
  • Chen X, Zhang Y (2009) Uncertain linear programs: Extended affinely adjustable robust counterparts. Oper. Res. 57(6):1469–1482.LinkGoogle Scholar
  • Chen L, He L, Zhou YH (2020a) An exponential cone programming approach for managing electric vehicle charging. Preprint, submitted March 27, https://dx.doi.org/10.2139/ssrn.3548028.Google Scholar
  • Chen Z, Sim M, Xiong P (2020b) Robust stochastic optimization made easy with RSOME. Management Sci. 66(8):3329–3339.LinkGoogle Scholar
  • Chen Z, Sim M, Xu H (2019) Distributionally robust optimization with infinitely constrained ambiguity sets. Oper. Res. 67(5):1328–1344.LinkGoogle Scholar
  • Chen X, Sim M, Sun P, Zhang J (2008) A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2):344–357.LinkGoogle Scholar
  • Chen X, He S, Jiang B, Ryan C, Zhang T (2021) The discrete moment problem with nonconvex shape constraints. Oper. Res. 69(1):279–296.LinkGoogle Scholar
  • Choi MD, Lam TY, Reznick B (1995) Sums of squares of real polynomials. Proc. Sympos. Pure Math. 58:103–126.Google Scholar
  • Conn A, Gould N, Toint P (2000) Trust Region Methods (Society for Industrial and Applied Mathematics, Philadelphia).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
  • Duchi JC, Glynn PW, Namkoong H (2021) Statistics of robust optimization: A generalized empirical likelihood approach. Math. Oper. Res. 46(3):946–969.LinkGoogle Scholar
  • Gao R, Kleywegt A (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint, submitted April 8, https://arxiv.org/abs/1604.02199.Google Scholar
  • Garstka S, Wets R (1974) On decision rules in stochastic programming. Math. Program. 7(1):117–143.CrossrefGoogle Scholar
  • Georghiou A, Tsoukalas A, Wiesemann W (2021) On the optimality of affine decision rules in robust and distributionally robust optimization. Preprint, submitted May 20, https://optimization-online.org/2021/05/8407/.Google Scholar
  • Georghiou A, Wiesemann W, Kuhn D (2015) Generalized decision rule approximations for stochastic programming via liftings. Math. Program. 152(1–2):301–338.CrossrefGoogle Scholar
  • Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4-part-1):902–917.LinkGoogle Scholar
  • Gounaris C, Wiesemann W, Floudas C (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3):677–693.LinkGoogle Scholar
  • Graves S (1999) A single-item inventory model for a nonstationary demand process. Manufacturing Service Oper. Management 1(1):50–61.LinkGoogle Scholar
  • Gupta V (2019) Near-optimal Bayesian ambiguity sets for distributionally robust optimization. Management Sci. 65(9):4242–4260.LinkGoogle Scholar
  • Hadley G, Whitin T (1963) Analysis of Inventory Systems (Prentice Hall, Hoboken, NJ).Google Scholar
  • Hanasusanto G, Kuhn D, Wallace S, Zymler S (2015) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Program. 152(1–2):1–32.CrossrefGoogle Scholar
  • He L, Hu Z, Zhang M (2020) Robust repositioning for vehicle sharing. Manufacturing Service Oper. Management 22(2):241–256.LinkGoogle Scholar
  • Iancu D, Sharma M, Sviridenko M (2013) Supermodularity and affine policies in dynamic robust optimization. Oper. Res. 61(4):941–956.LinkGoogle Scholar
  • Li B, Jiang R, Mathieu J (2019) Ambiguous risk constraints with moment and unimodality information. Math. Program. 173(1):151–192.CrossrefGoogle Scholar
  • Lorca Á, Sun A, Litvinov E, Zheng T (2016) Multistage adaptive robust optimization for the unit commitment problem. Oper. Res. 64(1):32–51.LinkGoogle Scholar
  • Lu M, Shen ZJM (2021) A review of robust operations management under model uncertainty. Production Oper. Management 30(6):1927–1943.CrossrefGoogle Scholar
  • Mak HY, Rong Y, Zhang J (2014) Appointment scheduling with limited distributional information. Management Sci. 61(2):316–334.LinkGoogle Scholar
  • Meng F, Qi J, Zhang M, Ang J, Chu S, Sim M (2015) A robust optimization model for managing elective admission in a public hospital. Oper. Res. 63(6):1452–1467.LinkGoogle Scholar
  • Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Program. 171(1):115–166.CrossrefGoogle Scholar
  • Natarajan K, Teo CP (2017) On reduced semidefinite programs for second order moment bounds with applications. Math. Program. 161(1–2):487–518.CrossrefGoogle Scholar
  • Parrilo P (2003) Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2):293–320.CrossrefGoogle Scholar
  • Ruan H, Chen Z, Ho CP (2023) Adjustable distributionally robust optimization with infinitely constrained ambiguity sets Version v2021.0181. http://dx.doi.org/10.5281/zenodo.7626696, https://github.com/INFORMSJoC/2021.0181.Google Scholar
  • See CT, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.LinkGoogle Scholar
  • Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. Jeyakumar V, Rubinov A, eds. Continuous Optimization, Applied Optimization, vol. 99 (Springer, Boston), 111–146.CrossrefGoogle Scholar
  • Wang Z, Glynn P, Ye Y (2016) Likelihood robust optimization for data-driven problems. Comput. Management Sci. 13(2):241–261.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.LinkGoogle Scholar
  • Zhen J, den Hertog D, Sim M (2018) Adjustable robust optimization via Fourier–Motzkin elimination. Oper. Res. 66(4):1086–1100.LinkGoogle 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.