On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems

References

• Ben-Tal A., Boyd S., Nemirovski A. Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems. Math. Programming (2006) 107(1):63–89Crossref, Google Scholar
• Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A. Adjustable robust solutions of uncertain linear programs. Math. Programming (2004) 99(2):351–376Crossref, Google Scholar
• Ben-Tal A., Nemirovski A. Robust optimization—Methodology and applications. Math. Programming (2002) 92(3):453–480Crossref, Google Scholar
• Bertsimas D., Goyal V. On the power and limitations of affine policies in two-stage adaptive optimization. Math. Programming (2009) . Submitted for publicationGoogle Scholar
• Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Programming Ser. B (2003) 98(1):49–71Crossref, Google Scholar
• Bertsimas D., Sim M. The price of robustness. Oper. Res. (2004) 52(2):35–53Link, Google Scholar
• Bertsimas D., Brown D. B., Caramanis C. Theory and applications of robust optimization. SIAM Rev. (2010) . Submitted for publicationGoogle Scholar
• Bertsimas D., Iancu D. A., Parrilo P. A. Optimality of affine policies in multistage robust optimization. Math. Oper. Res (2009) . ForthcomingGoogle Scholar
• Birge J., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, Berlin) Google Scholar
• Dantzig G. B. Linear programming under uncertainty. Management Sci. (1955) 1(3):197–206Link, Google Scholar
• Dhamdhere K., Goyal V., Ravi R., Singh M. How to pay, come what may: Approximation algorithms for demand-robust covering problems. Annual Sympos. Foundations Comput. Sci. (2005) 46:367–378Google Scholar
• Feige U., Jain K., Mahdian M., Mirrokni V. Robust combinatorial optimization with exponential scenarios. Proc. 12th Internat. Conf. Integer Programming Combinat. Optim. (IPCO) (2007) 4513(Springer, Berlin) 439–453Lecture Notes in Computer ScienceCrossref, Google Scholar
• Gupta A., Pál M., Ravi R., Sinha A. Boosted sampling: Approximation algorithms for stochastic optimization. Proc. 36th Annual ACM Sympos. Theory Comput., (2004) Chicago, IL:417–426Crossref, Google Scholar
• Immorlica N., Karger D., Minkoff M., Mirrokni V. S. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (2004) New Orleans, LA:691–700Google Scholar
• Infanger G.Planning Under Uncertainty: Solving Large-Scale Stochastic Linear Programs (1994) (Boyd & Fraser, San Francisco) Google Scholar
• Kall P., Wallace S. W.Stochastic Programming (1994) (Wiley, New York) Google Scholar
• Prékopa A.Stochastic Programming (1995) (Springer, Berlin) Crossref, Google Scholar
• Ravi R., Sinha A. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Math. Programming (2006) 108(1):97–114Crossref, Google Scholar
• Rockafellar R. T., Wets R. J. B. The optimal recourse problem in discrete time: L1-multipliers for inequality constraints. SIAM J. Control Optim. (1978) 16(1):16–36Crossref, Google Scholar
• Shapiro A. Stochastic programming approach to optimization under uncertainty. Math. Programming, Ser. B (2008) 112(1):183–220Crossref, Google Scholar
• Shapiro A., Nemirovski A., Jeyakumar V., Rubinov A. M. On complexity of stochastic programming problems. Continuous Optimization: Current Trends and Applications (2005) (Springer, New York) 111–144Crossref, Google Scholar
• Shapiro A., Dentcheva D., Ruszczynski A. Lectures on stochastic programming: Modeling and theory. MPS-SIAM Series on Optimization (2009) 9(Society for Industrial and Applied Mathematics, Philadelphia) Crossref, Google Scholar
• Shmoys D. B., Swamy C. Stochastic optimization is (almost) as easy as deterministic optimization. Annual Sympos. Foundations Comp. Sci. (2004) 45:228–237Crossref, Google Scholar
• Swamy C., Shmoys D. B. Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News (2006) 37(1):33–46Crossref, Google Scholar