Distributionally Robust Optimization and Its Tractable Approximations

References

• Artzner P., Delbaen F., Eber J.-M., Heath D. Coherent measures of risk. Math. Finance (1999) 9(3):203–228Crossref, Google Scholar
• Ben-Tal A., Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23(4):769–805Link, Google Scholar
• Ben-Tal A., Nemirovski A. Robust solutions of uncertain linear programs. Oper. Res. Lett. (1999) 25(1, August):1–13Crossref, Google Scholar
• Ben-Tal A., Nemirovski A. Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming Ser. A (2000) 88(3):411–424Crossref, Google Scholar
• Ben-Tal A., Teboulle M. Expected utility, penalty functions, and duality in stochastic nonlinear programming. Management Sci. (1986) 32(11):1445–1466Link, Google Scholar
• Ben-Tal A., Teboulle M. An old-new concept of convex risk measures: The optimized certainty equivalent. Math. Finance (2007) 17(3):449–476Crossref, Google Scholar
• Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A. Adjustable robust solutions of uncertain linear programs. Math. Programming (2004) 99:351–376Crossref, Google Scholar
• Bertsimas D., Sim M. The price of robustness. Oper. Res. (2004) 52(1):35–53Link, Google Scholar
• Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54(1):150–168Link, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
• Breton M., El Hachem S. Algorithms for the solution of stochastic dynamic minimax problems. Comput. Optim. Appl. (1995) 4:317–345Crossref, Google Scholar
• Chen W., Sim M. Goal-driven optimization. Oper. Res. (2009) 57(2):342–357Link, Google Scholar
• Chen X., Zhang Y. Uncertain linear programs: Extended affinely adjustable robust counterparts. Oper. Res. (2009) 57(6):1469–1482Link, Google Scholar
• Chen X., Sim M., Sun P. A robust optimization perspective on stochastic programming. Oper. Res. (2007) 55(6):1058–1071Link, Google Scholar
• Chen X., Sim M., Sun P., Zhang J. A linear decision-based approximation approach to stochastic programming. Oper. Res. (2008) 56(2):344–357Link, Google Scholar
• Chopra V. K., Ziemba W. T. The effects of errors in means, variances, and covariances on optimal portfolio choice. J. Portfolio Management (1993) 19(2):6–11Crossref, Google Scholar
• Delage E., Ye Y. Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. (2010) . ePub ahead of print January 28, http://or.journal/informs.org/cgi/content/abstract/opre/1090.0741v1Link, Google Scholar
• Dupačová J. The minimax approach to stochastic programming and an illustrative application. Stochastics (1987) 20(1):73–88Crossref, Google Scholar
• Dyer M., Stougie L. Computational complexity of stochastic programming problems. Math. Programming Ser. A (2006) 106:423–432Crossref, Google Scholar
• El Ghaoui L., Lebret H. Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. (1997) 18(4):1035–1064Crossref, Google Scholar
• El Ghaoui L., Oks M., Oustry F. Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. (2003) 51(4):543–556Link, Google Scholar
• El Ghaoui L., Oustry F., Lebret H. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. (1998) 9:33–52Crossref, Google Scholar
• Föllmer H., Schied A. Convex measures of risk and trading constraints. Finance and Stochastics (2002) 6(4):429–447Crossref, Google Scholar
• Gallego G., Moon I. The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. (1993) 44(8):825–834Crossref, Google Scholar
• Goh J., Sim M. Robust optimization made easy with ROME. (2009) . Working paper, National University of SingaporeGoogle Scholar
• Natarajan K., Pachamanova D., Sim M. Incorporating asymmetric distributional information in robust value-at-risk optimization. Management Sci. (2008) 54(3):573–585Link, Google Scholar
• Rockafellar R. T., Uryasev S. Optimization of conditional value-at-risk. J. Risk (2000) 2:493–517Crossref, Google Scholar
• Ruszczynski A., Shapiro A.Stochastic Programming. Handbooks in Operations Research and Management Science (2003) 10(Elsevier Science, Amsterdam) Google Scholar
• Scarf H., Arrow K. A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production (1958) (Stanford University Press, Stanford, CA) 201–209Google Scholar
• See C.-T., Sim M. Robust approximation to multiperiod inventory management. Oper. Res. (2009) . ePub ahead of print December 29, http://or.journal/informs.org/cgi/content/abstract/opre/1090.0746v1Google Scholar
• Shapiro A., Kleywegt A. Minimax analysis of stochastic programs. Optim. Methods and Software (2002) 17(3):523–542Crossref, Google Scholar
• Shapiro A., Nemirovski A., Jeyakumar V., Rubinov A. On complexity of stochastic programming problems. Continuous Optimization (2005) (Springer, New York) 111–146Crossref, Google Scholar
• Soyster A. L. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. (1973) 21(5):1154–1157Link, Google Scholar
• Wang C., Ong C.-J., Sim M. Model predictive control using segregated disturbance feedback. Proc. Amer. Control Conf. (2008) SeattleGoogle Scholar
• Žáčková J. On minimax solution of stochastic linear programming problems. Časopis pro Pěstování Matematiky (1966) 91:423–430Google Scholar