To the best of our knowledge, a robust optimization framework for cilps is currently missing. Robust optimization princeton series in applied mathematics series by aharon ben tal. Robust optimization is a common framework in optimization under uncertainty when the problem parameters are not known, but it is rather known that the parameters belong to some given uncertainty set. Robust optimization is designed to meet some major challenges associated with uncertaintyaffected optimization problems.
Contrast with classical robust optimization ro uncertainties in ro characterized by uncertainty set support ben tal and nemirovski 1998, bertsimas and sim 2004 j. Robust optimization is a field of optimization theory that deals with optimization problems in which a certain measure of robustness is sought against uncertainty that can be represented as deterministic variability in the value of the parameters of the problem itself andor its solution. Surprisingly, for the netlibproblems these robust solutions nearly lose nothing in optimality. The essence of the problem is to make ordering, stocking, and. A soft robust model for optimization under ambiguity. The reader is referred to ben tal and nemirovski 2008 and bertsimas et al. We then apply the robust optimization methodology bental and nemirovski. Optimal solutions of linear programming problems may become severely infeasible if the nominal data is slightly perturbed.
Excellent surveys of the literature on robust optimization are available in beyer and sendho 12. In particular, robust optimization ro, arguably one of the fastest growing areas in optimization in the last decade, provides, in our opinion, a natural modeling framework for stochastic systems. We demonstrate this phenomenon by studying 90 lps from the wellknown netlib collection. Robust optimization by aharon bental overdrive rakuten.
The book is published by princeton university press. This paper addresses the uncertainty problem in process scheduling using robust optimization. Fabio dandreagiovannimultiband robust optimization data uncertainty is modeled as hard constraints that restrict the feasible set ben tal, nemirovski 98, elghaoui et. Distributionally robust optimization and its tractable. Aharon ben tal is professor of operations research at the. Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Aharon ben tal arkadi nemirovski robust optimization methodology and applications received. Robust optimization, robustness, adaptable optimization, applications of robust op. Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering. It has been suggested that polyhedral sets are a crude model of uncertainty and the resulting robust counterpart is too simplistic ben tal. Robust solutions of optimization problems affected by. Recent works using this general approach include ben tal and nemirovski1998,1999,2000,bertsimasandsim2004. Ben tal and nemirovski approach to robust optimization consider the linear program min ct x p8 subject to ax. Robust optimization download ebook pdf, epub, tuebl, mobi.
Pdf theory and applications of robust optimization researchgate. We then apply the robust optimization methodology ben tal and nemirovski. In the robust optimization framework the problem solved is a minmax problem where a solution is judged according to its performance on the worst possible realization of the parameters. Robust optimization in countably in nite linear programs. Robust optimization for process scheduling under uncertainty. We would like to express our gratitude for our partnership in developing the robust optimization addon in aimms. Extending the scope of robust quadratic optimization. Robust optimization made easy with rome 974 operations research 594, pp. Robust counterpart formulations for linear optimization. Robust optimization 327 acknowledgements the robust optimization addon in aimms has been developed in close cooperation with professor aharon ben tal and boris bachelis of the technion, israel institute of technology. Robust optimization ro isa modeling methodology, combined with computational tools, to pro. Compared to the traditionalscenariobased stochastic programming method, robust counterpart optimization method has a unique advantage, in that the scale of the corresponding optimization problem does not increase exponentially with the number of the uncertain parameters.
Robust convex optimization mathematics of operations. Theory and applications of robust optimization citeseerx. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the. Robust optimization ro is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known to belong to some uncertainty set. An essential book for anyone working on optimization and decision making under uncertainty, robust optimization also makes an ideal graduate textbook on the subject. Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems. Download limit exceeded you have exceeded your daily download allowance.
Pdf robust optimizationmethodology and applications. Notice that, different than the presented results, the original uncertain optimization problem can be nonlinear in the optimization variables andor the uncertain parameters. Robust optimization is proving to be a fruitful tool in the study of problems with uncertain data. Since the seminal paper by bental and nemirowski 1, several. September 12, 2001 published online february 14, 2002 springerverlag 2002 abstract. Nemirovski princeton university press written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and uptodate account of this relatively new approach to optimization. Theory and applications of robust optimization dimitris bertsimas. In the main part of the paper we show that if u is an ellipsoidal uncertainty set, then for some of. For these cases, computationally tractable robust counterparts of. We derive computationally tractable formulations of the robust counterparts of convex quadratic and conic quadratic constraints that are concave in matrixvalued uncertain.
We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set u, yet the constraints must hold for all possible values of the data from u. In this paper we lay the foundation of robust convex optimization. We revisit this example in more detail in section 4. In contrast to ro, stochastic optimization starts by assuming the uncertainty has a probabilistic. Robust optimization methodology and applications georgia tech. Robust solutions of linear programming problems contaminated. Optimal solutions of linear programming problems may become severely.
Robust optimization methodology and applications springerlink. The ensuing optimization problem is called robust optimization. The paper surveys the main results of ro as applied to uncertain linear, conic quadratic and semidefinite programming. In this paper, we propose a framework for robust optimization that relaxes the standard notion of robustness by allowing the decision maker to vary the protection level in a smooth way across the u. The uncertainty is specified in terms of an uncertainty set in which any point is a possible realization of the uncertainty. The goal of this paper therefore is to develop such a. This approach dates back to soyster 1973, who considered a deterministic linear optimization model that is feasible for all data lying in a convex set. One major motivation for studying robust optimization is that in many applications the data set is an appropriate notion of parameter uncertainty, e. A practical guide to robust optimization sciencedirect.
The objective function used in this model is total profit instead of minus total profit as used in the book. Robust convexoptimization ben tal andnemirovski 1997, elghaoui et. Robust optimization is a young and active research. Robust optimization and applications stanford university.
With respect to portfolio selection, the major contributions. Uncertain linear optimization problems and their robust counterparts 3. Robust optimization an overview sciencedirect topics. Sim nusdistributionally robust optimization26 aug 2009 4 47. Aharon ben tal is professor of operations research at the technion, israel institute for technology. This robust technique has obtained prodigious success since the late 1990s, especially in the.
1673 1132 1664 286 1660 1607 959 1454 2 675 1472 66 1509 85 721 124 214 373 73 1140 80 151 146 52 1555 582 370 867 757 636 554 247 1363 698 372 1274 548 429 1391