In this paper, we propose a new methodology for handling optimization problems with uncertain data. Arkadi nemirovski born march 14, 1947 is a professor in the h. With the usual robust optimization paradigm, one looks for the decisions ensuring a required performance for all realizations of the data from a given bounded uncertainty set, whereas with the proposed approach, we require also. Aharon ben tal is professor of operations research at the technion, israel institute for technology.
Convex approximations of chance constrained programs. Nemirovski, efficient methods in convex programming 2. Pdf robust optimization ro is a modeling methodology, combined with computational tools, to process. Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it. A methodology aimed at dealing with uncertain optimization problems under the above decision environment was recently developed under the name robust optimization ro, see 1, 36, 9, 14 and references therein. Ben tal and nemirovski approach to robust optimization consider the linear program min ct x p8 subject to ax. We study convex optimization problems for which the data is not speci. Robust optimization of system design sciencedirect. Adjustable robust solutions of uncertain linear programs.
Robust optimization is still a relatively new approach to optimization problems affected by uncertainty. Boyd, proximal algorithms, now foundations and trends in optimization, 20. Optimal solutions of linear programming problems may become severely infeasible if the nominal data is slightly perturbed. The book starts with a relatively simple treatment of uncertain linear. Milton stewart school of industrial and systems engineering at georgia institute of technology. Robust optimization princeton series in applied mathematics.
Download it once and read it on your kindle device, pc, phones or tablets. In 6 of these problems violations were over 100%, where 210,000% being the highest i. Pdf on jan 1, 2012, ben tal and others published lectures on modern convex optimization find, read and cite all the research you need on researchgate. The theory presented here is useful for desensitizing solutions to illconditioned problems, or for computing solutions that guarantee a certain performance in the. Robust optimization is designed to meet some major challenges associated with uncertaintyaffected optimization problems. Robust convex optimization mathematics of operations. 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. 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 also makes an ideal graduate textbook on the subject. Faculty of industrial engineering and management, technionisrael institute of technology, technion city, haifa 32000, israel. The rst of these books is a collection and has a bias towards algebraic geometry.
Nemirovski lectures on modern convex optimization, 20 most recent version. Theory and applications of robust optimization citeseerx. Sep 21, 2011 one major motivation for studying robust optimization is that in many applications the data set is an appropriate notion of parameter uncertainty, e. The roots of robust optimization can be found in the eld of ro bust control and in the work of soyster 9 as well as later works by ben tal and nemirovski 1,2 and independently by elghaoui and lebret 6 and elg haoui et al 7. A very recent account on rst order methods in convex optimization is 10.
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. For these cases, computationally tractable robust counterparts of. We then apply the robust optimization methodology ben tal and nemirovski. Robust optimization princeton series in applied mathematics 28 9780691143682 by ben tal, aharon. Written by the principal developers of robust optimization. Robust optimization princeton series in applied mathematics 28 9780691143682. If there was uncertainty in the data of an equality constraint, a good modelbuilder. However, as the resulting robust formulations involve conic quadratic problems, such. Professor ben tal was awarded in 2007 the euro gold medal and was named informs fellow in 2010. Robust solutions to l1, l2, and linfinity uncertain linear. We demonstrate this phenomenon by studying 90 lps from the wellknown netlib collection. The concept of robust optimization has a relationship with chanceconstrained optimization, where in certain cases there is a direct relationship between a robust optimization model and a chanceconstrained optimization.
Robust and stochastic optimization cornell university. The robust counterpart problem to p is given by the following optimization problem. Robust optimization ro isa modeling methodology, combined with computational tools, to pro. Pdf robust optimizationmethodology and applications. Books include those of a theoretical and general nature as well as those. Robust optimization, princeton series in applied mathematics, princeton university press, 2009. Pdf theory and applications of robust optimization researchgate. Nemirovski, arkadi and a great selection of similar new, used and collectible books. Application of robust optimization for a product portfolio. September 12, 2001 published online february 14, 2002 springerverlag 2002 abstract. The ensuing optimization problem is called robust optimization. Nemirovski, lectures on modern convex optimization preface, mpssiam series on optimization, siam, philadelphia, 2001.
This approach is based on the idea to consider an entire set u of possible parameter realizations and to optimize the portfolio under the worstcase parameter. On safe tractable approximations of chance constrained linear matrix inequalities mathematics of operations research 34. In this paper we lay the foundation of robust convex optimization. In realworld applications of linear optimization net lib li brary, one cannot ignore the possibility that a small uncer tainty in the data can make the usual optimal solution com pletely meaningless from a practical viewpoint. It then develops the robust optimization theory for uncertain conic quadratic and. Siam journal on optimization society for industrial and.
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. Comprehensive robust counterparts of uncertain problems a ben tal, s boyd, a nemirovski mathematical programming 107 12, 6389, 2006. Ifip tc7 20th conference on system modeling and optimization july 2327, 2001, trier, germany springer us aharon ben tal, arkadi nemirovski auth. Download for offline reading, highlight, bookmark or take notes while you read robust optimization. Ben tal and nemirovski 1998, 1999, 2000 address robust solutions minmaxmaxmin objective by allowing the uncertainty sets for the data to be ellipsoids, and propose efficient algorithms to solve convex optimization problems under data uncertainty. A case study in ben tal and nemirovski 2000 shows that perturbations as low as 0. Robust optimization is designed to meet some major challenges associated with uncertaintyaffected optimization. The paper surveys the main results of ro as applied to uncertain linear, conic quadratic and semidefinite programming. Robust optimization is still a relatively new approach to optimization. Furthermore, ben tal and nemirovski 8 studied robust optimization applied to conic quadratic and semide.
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. He has been a leader in continuous optimization and is best known for his work on the ellipsoid method, modern interiorpoint methods and robust optimization. Arkadi nemirovski born march 14, 1947 is a professor at the h. Aharon ben tal arkadi nemirovski robust optimization methodology and applications received. An introduction to nonlinear optimization theory download link. Nemirovski, selected topics in robust convex optimization, mathematical programming, 112 2008, 125158.
Robust optimization methodology and applications springerlink. In section 3, we present a methodology integrating many techniques from ben tal et al. Use features like bookmarks, note taking and highlighting while reading robust optimization princeton series in applied mathematics book. An essential book for anyone working on optimization and decision making under uncertainty, robust optimization also.
This book is devoted to robust optimization a specific and. In contrast to ro, stochastic optimization starts by assuming the uncertainty has a probabilistic. Milton stewart school of industrial and systems engineering at the georgia institute of technology. 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. Robust optimization princeton series in applied mathematics series by aharon ben tal. Robust counterpart formulations for linear optimization. Aharon bental is professor of operations research at the technion, israel institute for technology. Our results parallel and extend the work of elghaoui and lebret on robust least squares, and the work of ben tal and nemirovski on robust conic convex optimization problems. For our purposes, a suciently general mathematical setting of an optimization. Journal of the operations research society of china 1. Nemirovski, on approximate robust counterparts of uncertain semidefinite and conic quadratic programs proceedings of 20th ifip tc7 conference on system modelling and optimization, july 2327, 2001, trier, germany 3. We use a reference point method to consider multiple objectives estrella et al.
975 67 604 1302 513 1305 674 1337 296 15 919 562 641 382 799 471 1349 1408 585 1331 297 236 359 131 241 935 1291 1129 893 483 114 141 215 24 1097 243 686 91 866 1423 287 380 447