Reducing Conservatism in Robust Optimization

References

• Alvarez-Miranda E, Ljubic I, Raghavan S, Toth P (2015) The recoverable robust two-level network design problem. INFORMS J. Comput. 27(1):1–19.Link, Google Scholar
• Anstreicher KM, Burer S (2010) Computable representations for convex hulls of low-dimensional quadratic forms. Math. Programming 124(1–2):33–43.Crossref, Google Scholar
• Ardestani-Jaafari A, Delage E (2016) Robust optimization of sums of piecewise linear functions with application to inventory problems. Oper. Res. 64(2):474–494.Link, Google Scholar
• Baron O, Milner J, Naseraldin H (2011) Facility location: A robust optimization approach. Production Oper. Management 20(5):772–785.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.Link, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming 88(3):411–424.Crossref, Google Scholar
• Ben-Tal A, Bertsimas D, Brown DB (2010) A soft robust model for optimization under ambiguity. Oper. Res. 58(4, part 2):1220–1234.Google Scholar
• Ben-Tal A, Boyd S, Nemirovski A (2006) Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems. Math. Programming 107(1–2):63–89.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Ben-Tal A, Brekelmans R, Den Hertog D, Vial JP (2017) Globalized robust optimization for nonlinear uncertain inequalities. INFORMS J. Comput. 29(2):350–366.Link, Google Scholar
• Bertsimas D, Nohadani O, Teo KM (2010) Nonconvex robust optimization for problems with constraints. INFORMS J. Comput. 22(1):44–58.Link, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Calafiore GC, Ghaoui LE (2006) On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1):1–22.Crossref, Google Scholar
• Chen W, Sim M, Sun J, Teo CP (2010) From CVaR to uncertainty set: Implications in joint chance-constrained optimization. Oper. Res. 58(2):470–485.Link, Google Scholar
• El Ghaoui L, Lebret H (1997) Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18(4):1035–1064.Crossref, Google Scholar
• Fiacco AV, Kyparisis J (1986) Convexity and concavity properties of the optimal value function in parametric nonlinear programming. J. Optim. Theory Appl. 48(1):95–126.Crossref, Google Scholar
• Fischetti M, Monaci M (2009) Light robustness. Ahuja RK, Möhring RH, Zaroliagis CD, eds. Robust and Online Large-Scale Optimization (Springer, Berlin, Heidelberg), 61–84.Crossref, Google Scholar
• Gabrel V, Lacroix M, Murat C, Remli N (2014) Robust location transportation problems under uncertain demands. Discrete Appl. Math. 164(part 1):100–111.Crossref, Google Scholar
• Goerigk M, Schöbel A (2016) Algorithm engineering in robust optimization. Kliemann L, Sanders P, eds. Algorithm Engineering (Springer, Cham, Switzerland), 245–279.Crossref, Google Scholar
• Gorissen BL, den Hertog D (2013) Robust counterparts of inequalities containing sums of maxima of linear functions. Eur. J. Oper. Res. 227(1):30–43.Crossref, Google Scholar
• Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2017) Ambiguous joint chance constraints under mean and dispersion information. Oper. Res. 65(3):751–767.Link, Google Scholar
• Iancu DA, Trichakis N (2014) Pareto efficiency in robust optimization. Management Sci. 60(1):130–147.Link, Google Scholar
• Madansky A (1959) Bounds on the expectation of a convex function of a multivariate random variable. Ann. Math. Statist. 30(3):743–746.Crossref, Google Scholar
• Mudchanatongsuk S, Ordóñez F, Liu J (2008) Robust solutions for network design under transportation cost and demand uncertainty. J. Oper. Res. Soc. 59(5):652–662.Crossref, Google Scholar
• Mutapcic A, Boyd S (2009) Cutting-set methods for robust convex optimization with pessimizing oracles. Optim. Methods Software 24(3):381–406.Crossref, Google Scholar
• Pessoa AA, Poss M (2015) Robust network design with uncertain outsourcing cost. INFORMS J. Comput. 27(3):507–524.Link, Google Scholar
• Postek K, Ben-Tal A, Den Hertog D, Melenberg B (2018) Robust optimization with ambiguous stochastic constraints under mean and dispersion information. Oper. Res. 66(3):814–833.Link, Google Scholar
• Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Roos E, den Hertog D, Ben-Tal A, de Ruiter F, Zhen J (2018) Approximation of hard uncertain convex inequalities. Optimization Online. Accessed December 5, 2018, http://www.optimization-online.org/DB_HTML/2018/06/6679.html.Google Scholar
• Schöbel A (2014) Generalized light robustness and the trade-off between robustness and nominal quality. Math. Methods Oper. Res. 80(2):161–191.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2014) Lectures on Stochastic Programming: Modeling and Theory, vol. 16 (SIAM, Philadelphia).Crossref, Google Scholar
• Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. Continuous Optimization (Springer, Boston), 111–146.Crossref, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.Link, Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Xie W, Ahmed S (2018) On deterministic reformulations of distributionally robust joint chance constrained optimization problems. SIAM J. Optim. 28(2):1151–1182.Crossref, Google Scholar
• Yoshise A, Matsukawa Y (2010) On optimization over the doubly nonnegative cone. 2010 IEEE Internat. Sympos. Computer-Aided Control System Design (CACSD) (IEEE, Piscataway, NJ), 13–18.Google Scholar
• Zymler S, Kuhn D, Rustem B (2013) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.Crossref, Google Scholar