A Robust Optimization Perspective on Stochastic Programming

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

References

  • Atamtürk A. Strong formulations of robust mixed 0-1 programming. Math. Programming (2006) 108(2):235–250CrossrefGoogle 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., Golany B., Nemirovski A., Vial J. Supplier-retailer flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management (2005) 7(3):248–271LinkGoogle Scholar
  • Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A. Adjusting robust solutions of uncertain linear programs. Math. Programming (2004) 99:351–376CrossrefGoogle Scholar
  • Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Programming (2003) 98:49–71CrossrefGoogle Scholar
  • Bertsimas D., Sim M. Price of robustness. Oper. Res. (2004a) 52(1):35–53LinkGoogle Scholar
  • Bertsimas D., Sim M. Robust discrete optimization and downside risk measures. (2004b) . Working paper, National University of Singapore, SingaporeGoogle Scholar
  • Bertsimas D., Sim M. Tractable approximations to robust conic optimization problems. Math. Programming (2006) 107(1):5–36CrossrefGoogle Scholar
  • Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54(1):150–168LinkGoogle Scholar
  • Bertsimas D., Pachamanova D., Sim M. Robust linear optimization under general norms. Oper. Res. Lett. (2004) 32:510–516CrossrefGoogle Scholar
  • Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
  • Charnes A., Cooper W. W. Uncertain convex programs: Randomize solutions and confidence level. Management Sci. (1959) 6:73–79LinkGoogle Scholar
  • Charnes A., Cooper W. W. Deterministic equivalents for optimizing and satisficing under chance constraints. Oper. Res. (1963) 11:18–39LinkGoogle Scholar
  • Charnes A., Cooper W. W., Symonds G. Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil production. Management Sci. (1958) 4:253–263LinkGoogle Scholar
  • Chen X., Sim M., Sun P., Zhang J. A linear-decision based approximation approach to stochastic programming. Oper. Res. (2006) . ForthcomingGoogle Scholar
  • El-Ghaoui L., Lebret H. Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. (1997) 18:1035–1064CrossrefGoogle Scholar
  • El-Ghaoui L., Oustry F., Lebret H. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. (1998) 9:33–52CrossrefGoogle Scholar
  • Ergodan G., Iyengar G. On two-stage convex constrained problems. (2005) . CORC technical report TR-2005-06, Columbia University, New YorkGoogle Scholar
  • Garstka S. J., Wets R. J.-B. On decision rules in stochastic programming. Math. Programming (1974) 17(1):117–143CrossrefGoogle Scholar
  • Goldfarb D., Iyengar G. Robust convex quadratically constrained programs. Math. Programming Series B (2003) 97(3):495–515CrossrefGoogle Scholar
  • Kibzun A., Kan Y.Stochastic Programming Problems with Probability and Quantile Functions (1996) (Johns Wiley & Sons, New York) Google Scholar
  • Natarajan K., Pachamanova D., Sim M. A tractable parametric approach to value-at-risk optimization. (2006) . Working paper, NUS Business School, SingaporeGoogle Scholar
  • Nemirovski A., Shapiro A., Calafiore G., Dabenne F. Scenario approximations of chance constraints. Probabilistic and Randomized Methods for Design Under Uncertainty (2006) (Springer-Verlag, London, UK) CrossrefGoogle 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 Academic Publishers, Dordrecht, Boston) CrossrefGoogle Scholar
  • Shapiro A., Nemirovski A., Jeyakumar V., Rubinov A. M. On complexity of stochastic programming problems. Continuous Optimization: Current Trends and Modern Applications (2005) (Springer, Heidelberg, Germany) 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.