From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization

Published Online:https://doi.org/10.1287/opre.1090.0712

References

  • Alizadeh F., Goldfarb D. Second-order cone programming. Math. Programming (2003) 95:3–51CrossrefGoogle Scholar
  • Ben-Tal A., Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23:769–805LinkGoogle Scholar
  • Ben-Tal A., Nemirovski A. Robust solutions to uncertain programs. Oper. Res. Lett. (1999) 25:1–13CrossrefGoogle Scholar
  • Ben-Tal A., Nemirovski A. Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming (2000) 88:411–424CrossrefGoogle Scholar
  • Ben-Tal A., Nemirovski A. Lectures on modern convex optimization: Analysis, algorithms, and engineering applications. MPR-SIAM Series on Optimization (2001) (SIAM, Philadelphia) CrossrefGoogle Scholar
  • Ben-Tal A., Teboulle M. Expected utility, penalty functions and duality in stochastic nonlinear programming. Management Sci. (1986) 32:1445–1466LinkGoogle Scholar
  • Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A. Adjusting robust solutions of uncertain linear programs. Math. Programming (2004) 99(2):351–376CrossrefGoogle Scholar
  • Bertsimas D., Brown D. B. Constructing uncertainty sets for robust linear optimization. Oper. Res. (2009) . ePub ahead of print April 24, http://or.journal.informs.org/cgi/content/abstract/opre.1080.0646v1LinkGoogle Scholar
  • Bertsimas D., Sim M. Price of robustness. Oper. Res. (2004) 52(1):35–53LinkGoogle Scholar
  • Bertsimas D., Pachamanova D., Sim M. Robust linear optimization under general norms. Oper. Res. Lett. (2004) 32:510–516CrossrefGoogle Scholar
  • Calafiore G., Campi M. C. Uncertain convex programs: Randomized solutions and confidence levels. Math. Programming, Ser. A (2005) 102(1):25–46CrossrefGoogle Scholar
  • Calafiore G., Campi M. C. The scenario approach to robust control design. IEEE Trans. Automatic Control (2006) 51(5):742–753CrossrefGoogle Scholar
  • Calafiore G., El Ghaoui L. Distributionally robust chance-constrained linear programs with applications. J. Optim. Theory Appl. (2006) 130(1):1–22CrossrefGoogle Scholar
  • Charnes A., Cooper W. W., Symonds G. H. Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil. Management Sci. (1958) 4:235–263LinkGoogle Scholar
  • Chen W., Sim M. Goal-driven optimization. Oper. Res. (2009) 57(2):342–357LinkGoogle Scholar
  • Chen X., Sim M., Sun P. A robust optimization perspective on stochastic programming. Oper. Res. (2007) 55(6):1058–1107LinkGoogle 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–556LinkGoogle Scholar
  • El Ghaoui L., Oustry L. F., Lebret H. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. (1998) 9:33–52CrossrefGoogle Scholar
  • Ergodan G., Iyengar G. Ambiguous chance constrained problems and robust optimization. Math. Programming, Ser. B (2006) 107:37–61CrossrefGoogle Scholar
  • Föllmer H., Schied A.Stochastic Finance: An Introduction in Discrete Time (2004) (Walter de Gruyter, Berlin) CrossrefGoogle Scholar
  • Lagoa C. M. On the convexity of probabilistically constrained linear programs. Proc. 38th Conf. Decision and Control (1999) 1(Phoenix, AZ)516–521CrossrefGoogle Scholar
  • Luedtke J., Ahmed S. A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. (2008) 19(2):674–699CrossrefGoogle Scholar
  • Meilijson I., Nadas A. Convex majorization with an application to the length of critical path. J. Appl. Probab. (1979) 16:671–677CrossrefGoogle Scholar
  • Natarajan K., Pachmanova D., Sim M. Constructing risk measures from uncertainty sets. Oper. Res. (2009) 57(5LinkGoogle Scholar
  • Nemirovski A., Shapiro A. Convex approximation of chance constrained programs. SIAM J. Optim. (2006) 17(4):969–996CrossrefGoogle Scholar
  • Pintér J. Deterministic approximations of probability inequalities. ZOR—Methods Models Oper. Res. (1989) 33:219–239CrossrefGoogle Scholar
  • Prékopa A.Stochastic Programming (1995) (Kluwer, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Rockafellar R. T., Uryasev S. Optimization of conditional value-at-risk. J. Risk (2000) 2:21–41CrossrefGoogle Scholar
  • Ruszczynski A. Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Programming (2002) 93(2):195–215CrossrefGoogle Scholar
  • Shapiro A., Nemirovski A., Jeyakumar V., Rubinov A. M. On complexity of stochastic programming problems. Continuous Optimization: Current Trends and Applications (2005) (Springer)111–144CrossrefGoogle Scholar
  • Soyster A. L. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. (1973) 21:1154–1157LinkGoogle 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.