Robust Satisficing

References

• Artzner P, Delbaen F, Eber JM, Heath D (1999) Coherent measures of risk. Math. Finance 9(3):203–228.Crossref, Google Scholar
• Aumann RJ, Serrano R (2008) An economic index of riskiness. J. Political Econom. 116(5):810–836.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.Link, Google Scholar
• Ben-Tal A, Teboulle M (2007) An old-new concept of convex risk measures: The optimized certainty equivalent. Math. Finance 17(3):449–476.Crossref, Google Scholar
• Ben-Tal A, Boyd S, Nemirovski A (2006) Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems. Math. Programming 107(1):63–89.Crossref, Google Scholar
• Ben-Tal A, den Hertog D, Vial JP (2015) Deriving robust counterparts of nonlinear uncertain inequalities. Math. Programming 149(1–2):265–299.Crossref, Google Scholar
• Ben-Tal A, Brekelmans R, den Hertog D, Vial JP (2017) Globalized robust optimization for nonlinear uncertain inequalities. INFORMS J. Comput. 29(2):350–366.Link, 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
• 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.Link, 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, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1):49–71.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018a) Data-driven robust optimization. Math. Programming 167(2):235–292.Crossref, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018b) Robust sample average approximation. Math. Programming 171(1):217–282.Crossref, Google Scholar
• Bertsimas D, Shtern S, Sturt B 2021. Two-stage sample robust optimization. Oper. Res., ePub ahead of print, April 22, https://doi.org/10.1287/opre.2020.2096.Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Box GEP (1976) Science and statistics. J. Amer. Statist. Assoc. 71(356):791–799.Crossref, Google Scholar
• Brown DB, Sim M (2009) Satisficing measures for analysis of risky positions. Management Sci. 55(1):71–84.Link, Google Scholar
• Brown DB, Giorgi ED, Sim M (2012) Aspirational preferences and their representation by risk measures. Management Sci. 58(11):2095–2113.Link, Google Scholar
• Charnes A, Cooper WW (1959) Chance-constrained programming. Management Sci. 6(1):73–79.Link, Google Scholar
• Chen LG, Tang Q (2021) Supply chain performance with target-oriented firms. Manufacturing Service Oper. Management. 24(3):1714–1732Google Scholar
• Chen Z, Kuhn D, Wiesemann W (2018) Data-driven chance constrained programs over Wasserstein balls. Preprint, submitted September 1, https://arxiv.org/abs/1809.00210.Google Scholar
• Chen LG, Long DZ, Sim M (2015) On dynamic decision making to meet consumption targets. Oper. Res. 63(5):1117–1130.Link, Google Scholar
• Chen Z, Sim M, Xiong P (2020) Robust stochastic optimization made easy with RSOME. Management Sci. 66(8):3329–3339.Link, Google 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.Link, Google Scholar
• Dantzig GB (1955) Linear programming under uncertainty. Management Sci. 1(3–4):197–206.Link, Google Scholar
• DeMiguel V, Garlappi L, Uppal R (2009) Optimal vs. naive diversification: How inefficient is the 1/N portfolio strategy? Rev. Financial Stud. 22(5):1915–1953.Crossref, Google Scholar
• Follmer H, Schied A (2002) Convex measures of risk and trading constraints. Finance Stochastics 6(4):429–447.Crossref, Google Scholar
• Follmer H, Schied A (2004) Stochastic Finance: An Introduction in Discrete Time (Walter de Gruyter, Berlin).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
• 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) Wasserstein distributional robustness and variation regularization. Preprint, submitted December 17, https://arxiv.org/abs/1712.06050.Google Scholar
• Garstka SJ, Wets RJB (1974) On decision rules in stochastic programming. Math. Programming 7(1):117–143.Crossref, Google Scholar
• Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4):902–917.Link, Google Scholar
• Gotoh JY, Kim MJ, Lim AEB (2018) Robust empirical optimization is almost the same as mean–variance optimization. Oper. Res. Lett. 46(4):448–452.Crossref, Google Scholar
• Gotoh JY, Kim MJ, Lim AEB (2020) Calibration of distributionally robust empirical optimization models. Preprint, submitted November 17, https://arxiv.org/abs/1711.06565.Google Scholar
• Hall NG, Long DZ, Qi J, Sim M (2015) Managing underperformance risk in project portfolio selection. Oper. Res. 63(3):660–675.Link, Google Scholar
• Hanasusanto GA, Kuhn D, Wiesemann W (2016) A comment on “Computational complexity of stochastic programming problems.” Math. Programming 159(1):557–569.Crossref, Google Scholar
• Iancu DA, Trichakis N (2014) Pareto efficiency in robust optimization. Management Sci. 60(1):131–147.Google Scholar
• Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper. Res. 64(1):186–200.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kuhn D, Wiesemann W, Georghiou A (2011) Primal and dual linear decision rules in stochastic and robust optimization. Math. Programming 130(1):177–209.Crossref, 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.Crossref, Google Scholar
• Mao JCT (1970) Survey of capital budgeting: Theory and practice. J. Finance 25(2):349–360.Crossref, Google Scholar
• Markowitz HM (1952) Portfolio selection. J. Finance 7(1):77–91.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-2):1–52.Crossref, Google Scholar
• Nemirovski A, Shapiro A (2007) Convex approximations of chance constrained programs. SIAM J. Optim. 17(4):969–996.Crossref, Google Scholar
• Pardo L (2006) Statistical Inference Based on Divergence Measures (Chapman and Hall/CRC, Boca Raton, FL).Google Scholar
• Pflug GC, Pichler A, Wozabal D (2012) The 1/N investment strategy is optimal under high model ambiguity. J. Banking Finance 36(2):410–417.Crossref, Google Scholar
• Rockafellar RT, Uryasev S (2002) Conditional value-at-risk for general loss distributions. J. Banking Finance 26(7):1443–1471.Crossref, Google Scholar
• Schwartz B, Ben-Haim Y, Dacso C (2011) What makes a good decision? Robust satisficing as a normative standard of rational decision making. J. Theory Soc. Behav. 41(2):209–227.Crossref, Google Scholar
• Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. Jeyakumar V, Rubinov A, eds. Continuous Optimization (Springer, Boston), 111–146.Crossref, Google Scholar
• Simon HA (1959) Theories of decision-making in economics and behavioral science. Amer. Econom. Rev. 49(3):253–283.Google Scholar
• Sion M (1958) On general minimax theorems. Pacific J. Math. 8(1):171–176.Crossref, 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
• Sturt B (2021) A nonparametric algorithm for optimal stopping based on robust optimization. Preprint, submitted March 4, https://arxiv.org/abs/2103.03300.Google Scholar
• Xie W (2019) On distributionally robust chance constrained programs with Wasserstein distance. Math. Programming 186:115–155.Crossref, Google Scholar
• Zhang Y, Baldacci R, Sim M, Tang J (2019) Routing optimization with time windows under uncertainty. Math. Programming 175(1):263–305.Crossref, Google Scholar
• Zhen J, den Hertog D, Sim M (2018) Adjustable robust optimization via Fourier–Motzkin elimination. Oper. Res. 66(4):1086–1100.Link, Google Scholar