Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion

References

• Ahmed S. Convexity and decomposition of mean-risk stochastic programs. Math. Programming (2006) 106(3):433–446Crossref, 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
• Breton M., El Hachem S. Algorithms for the solution of stochastic dynamic minimax problems. Comput. Optim. Appl. (1995) 4(4):317–345Crossref, Google Scholar
• Carbone R., Mehrez A. The single facility minimax distance problem under stochastic location demand. Management Sci. (1980) 26(1):113–115Link, 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
• Dokov S. P., Morton D. P. Second-order lower bounds on the expectation of a convex function. Math. Oper. Res. (2005) 30(3):662–677Link, Google Scholar
• Dupačová J. The minimax approach to stochastic programming and an illustrative application. Stochastics (1987) 20(1):73–88Crossref, Google Scholar
• Dupačová J. Stress testing via contamination. Coping with Uncertainty: Modeling and Policy Issues (2006) 58(Springer, Berlin) 29–46Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
• Edmundson H. P. Bounds on the expectation of a convex function of a random variable. Acta Mathematica (1956) 30:175–193Google Scholar
• Eichorn A., Romisch W. Polyhedral risk measures in stochastic programming. SIAM J. Optim. (2005) 16(1):69–95Crossref, Google Scholar
• Floudas C., Visweswaran V. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: I. Theory. Comput. Chemical Engrg. (1990) 14(12):1397–1417Crossref, Google Scholar
• Gorski J., Pfeuffer F., Klamroth K. Biconvex sets and optimization with biconvex functions—A survey and extensions. Math. Methods Oper. Res. (2007) 66(4):373–407Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1988) (Springer, Berlin) Crossref, Google Scholar
• Isii K. On the sharpness of Chebyshev-type inequalities. Ann. Inst. Statist. Math. (1963) 12(1):185–197Crossref, Google Scholar
• Jensen J. L. Sur les fonctions convexes et les inégalités entre les valeurs moyennes. Acta Mathematica (1906) 30(1):175–193Crossref, Google Scholar
• Kall P., Wallace S.Stochastic Programming (1994) (John Wiley & Sons, Chichester, UK) Google Scholar
• Löfberg J. YALMIP: A toolbox for modeling and optimization in MATLAB. Proc. CACSD Conf. (2004) Taipei, TaiwanCrossref, Google Scholar
• Madansky A. Bounds on the expectation of a convex function of a multivariate random variable. Ann. Math. Statist. (1959) 30(3):743–746Crossref, Google Scholar
• Mangasarian O. J., Shiau T. H. A variable-complexity norm maximization problem. SIAM J. Algebraic Discrete Methods (1986) 7(3):455–461Crossref, Google Scholar
• Riis M., Andersen K. A. Applying the minimax criterion in stochastic recourse programs. Eur. J. Oper. Res. (2005) 165(3):569–584Crossref, Google Scholar
• Rutenberg D. Risk aversion in stochastic programming with recourse. Oper. Res. (1973) 21(1):377–380Link, Google Scholar
• Shapiro A., Ahmed S. On a class of minimax stochastic programs. SIAM J. Optim. (2004) 14(4):1237–1249Crossref, Google Scholar
• Shapiro A., Kleywegt A. Minimax analysis of stochastic problems. Optim. Methods Software (2002) 17(3):523–542Crossref, Google Scholar
• Sion M. On general minimax theorems. Pacific J. Math. (1958) 8(1):171–176Crossref, Google Scholar
• Sturm J. F. Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Software (1999) 11(1–4):625–653Crossref, Google Scholar
• Wendell R., Hurter A. Minimization of non-separable objective function subject to disjoint constraints. Oper. Res. (1976) 24(4):643–657Link, Google Scholar
• Žáčková J. On minimax solutions of stochastic linear programming problems. Časopis pro Pěstování Matematiky (1966) 91:423–430Google Scholar