The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems

References

• Agra A, Christiansen M, Hvattum LM, Rodrigues F (2018) Robust optimization for a maritime inventory routing problem. Transportation. Sci. 52(3):509–525.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Inc., Upper Saddle River, NJ).Google Scholar
• Ardestani-Jaafari A, Delage E (2018) The value of flexibility in robust location–transportation problems. Transportation Sci. 52(1):189–209.Link, Google Scholar
• Atamtürk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4):662–673.Link, Google Scholar
• Ben-David S, Borodin A, Karp R, Tardos G, Wigderson A (1994) On the power of randomization in online algorithms. Algorithmica 11:2–14.Crossref, Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, de Ruiter FJ (2016) Duality in two-stage adaptive linear optimization: Faster computation and stronger bounds. INFORMS J. Comput. 28(3):500–511.Link, Google Scholar
• Bertsimas D, Nasrabadi E, Orlin J (2018) Information on the power of nature in robust discrete optimization provided via private communication with the authors, March 9.Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Brown GG, Carlyle WM, Harney RC, Skroch EM, Wood RK (2009) Interdicting a nuclear-weapons project. Oper. Res. 57(4):866–877.Link, Google Scholar
• Buhayenko V, den Hertog D (2017) Adjustable robust optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty. Internat. J. Production Res. 55(22):6801–6823.Crossref, Google Scholar
• Chan TCY, Shen ZM, Siddiq A (2018) Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation. Oper. Res. 66(2):358–379.Link, Google Scholar
• Dehghan S, Amjady N, Conejo AJ (2017) Adaptive robust transmission expansion planning using linear decision rules. IEEE Trans. Power Systems 32(5):4024–4034.Crossref, Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
• Delage E, Kuhn D, Wiesemann W (2019) “Dice”-sion making under uncertainty: When can a random decision reduce risk? Management Sci. 65(7):3282–3301.Link, Google Scholar
• Ellsberg D (1961) Risk, ambiguity, and the savage axioms. Quart. J. Econom. 75(4):643–669.Crossref, Google Scholar
• Epstein LG (1999) A definition of uncertainty aversion. Rev. Econom. Stud. 66(3):579–608.Crossref, Google Scholar
• Fernández E, Landete M (2015) Fixed-charge facility location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer International Publishing, Cham, Switzerland), 47–77.Google Scholar
• Föllmer H, Schied A (2002) Convex measures of risk and trading constraints. Finance Stochastics 6(4):429–447.Crossref, Google Scholar
• Fournier N, Guillin A (2015) On the rate of convergence in Wasserstein distance of the empirical measure. Probab. Theory Related Fields 162(3):707–738.Crossref, Google Scholar
• Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9(6):849–859.Link, Google Scholar
• Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• Jain M, Korzhyk D, Vaněk O, Conitzer V, Pěchouček M, Tambe M (2011) A double oracle algorithm for zero-sum security games on graphs. Tumer K, Yolum P, Sonenberg L, Stone P, eds., 10th Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Taipei, Taiwan), 327–334.Google Scholar
• Kantorovich LV, Rubinshtein GS (1958) On a space of completely additive functions. Vestnik Leningrad. Univ. 13(7):52–59.Google Scholar
• Luo F, Mehrotra S (2019) Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models. Eur. J. Oper. Res. 278(1):20–35.Google Scholar
• Mastin A, Jaillet P, Chin S (2015) Randomized minmax regret for combinatorial optimization under uncertainty. Elbassioni K, Makino K, eds. Algorithms and Computation (Springer, Berlin, Heidelberg), 491–501.Crossref, Google Scholar
• McMahan H, Gordon GJ, Blum A (2003) Planning in the presence of cost functions controlled by an adversary. Fawcett T, Mishra N, eds., Proc. 20th Internat. Conf. Machine Learn. (AAAI Press, Washington, DC), 536–543.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:115–166.Crossref, Google Scholar
• Morris JG (1978) On the extent to which certain fixed-charge depot location problems can be solved by LP. J. Oper. Res. Soc. 29(1):71–76.Crossref, Google Scholar
• Parys BPGV, Esfahani PM, Kuhn D (2020) From data to decisions: Distributionally robust optimization is optimal. Management Sci., ePub ahead of print November 23, https://doi.org/10.1287/mnsc.2020.3678.Google Scholar
• Saif A, Delage E (2021) Data-driven distributionally robust capacitated facility location problem. Eur. J. Oper. Res. 291(3):995–1007.Google Scholar
• Shapiro A (2001) On duality theory of conic linear problems. Goberna MÁ, López MA, eds. Semi-Infinite Programming: Recent Advances (Springer US, Boston), 135–165.Google Scholar
• Smith JE, Winkler RL (2006) The optimizer’s curse: Skepticism and postdecision surprise in decision analysis. Management Sci. 52(3):311–322.Link, Google Scholar
• Thiele A, Terry T, Epelman M (2010) Robust linear optimization with recourse. Working paper, Southern Methodist University, Dallas, TX.Google Scholar
• von Neumann J (1928) Zur theorie der gesellschaftsspiele. Math. Ann. 100(1):295–320.Crossref, Google Scholar
• Wang H, Rezaei A, Ziebart BD (2017) Adversarial structured prediction for multivariate measures. Preprint, submitted December 20, https://arxiv.org/abs/1712.07374.Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Yang Z, Zhu J, Teng L, Xu J, Zhu Z (2018) A double oracle algorithm for allocating resources on nodes in graph-based security games. Multimedia Tools Appl. 77(9):10961–10977.Crossref, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.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