Strategic robust supply chain design based on the pareto. Toward a comprehensive and efficient robust optimization. Any configuration has a risk versus reward curve between maximum reward and minimum risk performance. Comprehensive pareto efficiency in robust counterpart. Although robust optimization has been dealt in detail in singleobjective optimization studies, in this paper, we present two different robust multiobjective optimization procedures, where the emphasis is to find the robust optimal frontier, instead of the global paretooptimal front. This paper formalizes and adapts the well known concept of pareto efficiency in the context of the popular robust optimization ro methodology. All paretooptimal robust supply chain configurations are found. There are two kinds of raw materials, rawi and rawii, which can be used as sources of the active agent. For more details on pareto efficiency in robust linear optimization we refer to iancu and trichakis. Pareto efficiency or pareto optimality is a situation that cannot be modified so as to make any one individual or preference criterion better off without making at least one individual or preference criterion worse off. In general, the comprehensive pareto efficiency provides a new perspective for robust counterpart optimization and has important significance in practice which can help us to find high quality solutions and make better decisions.
Pareto efficiency in robust optimization request pdf. We argue that the classical ro paradigm need not produce solutions that possess the associated property of pareto optimality, and we illustrate via examples how this. A general robustoptimization formulation for nonlinear programming yin zhang. Convex optimization methods for graphs and statistical. There are few examples to illustrate the techniques of robust optimization, and most of this content discusses.
In the sequel, we show that there are several convenient, efficient, and. The robust optimization method, which focused on treatability of computation in the case of data points disturbing in convex sets, was first proposed by soyster 2 and developed, respectively, by. In dynamic multiobjective optimization problems, the environmental parameters change over time, which makes the true pareto fronts shifted. So far, most works of research on dynamic multiobjective optimization methods have concentrated on detecting the changed environment and triggering the population based optimization methods so as to track the moving pareto fronts over time.
One major motivation for studying robust optimization is that in many applications the data set is an appropriate notion of parameter uncertainty, e. Robust optimization a comprehensive survey request pdf. Unfortunately there is few books that deals with robust optimization. Its main application have focused stochastic linear programming with or without chance constraints as in cala. The evolutionary algorithm to find robust paretooptimal. Then, either the optimal value is zero and x p xpro, or the optimal value is strictly positive and x. Robust optimization ro, on the other hand, does not assume that probability distributions are known, but instead it assumes that the uncertain data resides in a socalled uncertainty set. P ripuq, consider the following linear optimization problem. This paper formalizes and adapts the wellknown concept of pareto efficiency in the context of the popular robust optimization ro methodology for linear optimization problems. In this paper we provide a survey of recent contributions from operations research and. The formulations addressed in these works are mostly based on established frameworks for optimization under uncertainty, such as. Robust optimization and applications stanford university. A practical guide to robust optimization sciencedirect. The book is indeed good in mathematical theory and only for that.
Scenario probability asset 1 return asset 2 return 1 0. I thought that this one would have a more practical view to apply this method. These conditions are analogous to those for robust efficiency, except that they hold with respect to convex scalarizing functions. Theory and applications of robust optimization 467 since there are more constraints to satisfy and the smaller the loss probability p loss. We introduce an unconstrained multicriteria optimization problem and discuss its relation to various wellknown scalar robust optimization problems with a finite uncertainty set. 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. A solution x is called a pareto robustly optimal pro solution for.
We also refer the interested reader to the recent book of bental. Pareto efficiency in robust optimization institute for mathematical. This book is devoted to robust optimization a specific and. Although optimization models of a more general form have already been considered, for. Robust optimization belongs to an important methodology for dealing with optimization problems with data uncertainty. Specifically, we show that a unique solution of a robust optimization problem is pareto optimal for. With robust lp, the feasible set is replaced by the robust feasible set. 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. Pareto efficiency in robust optimization management science. The paper surveys the main results of ro as applied to uncertain linear, conic quadratic and semidefinite programming. Lets begin by taking an allocation bx xbin 1 thats pareto e cient and well show that because bx is a pareto allocation it must be a solution to a speci c constrained maximization problem. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the. Recent advances in robust optimization optimization online. The basic idea of robust optimization is to seek a solution which remains feasible and nearoptimal under the perturbation of parameters in the optimization problem.
An allocation of goods is pareto optimal when there is no possibility of redistribution in a way where at least one individual would be better off while no other individual ends up worse off. Our focus will be on the computational attractiveness of ro approaches, as well. The optimal point and optimal value of the new problem, however, may be quite di. The concept is named after vilfredo pareto 18481923, italian engineer and economist, who used the concept in his studies of economic efficiency and income distribution.
Sim nusdistributionally robust optimization26 aug 2009 1 47. Strategy because robust design optimization simultaneously deals with optimization and robustness analysis, the computational. We address the complexity and practically efficient methods for robust discrete optimization under ellipsoidal uncertainty sets. This paper provides an overview of developments in robust optimization since 2007. Strategic robust supply chain design considering both the efficiency and the risk. We introduce a more restrictive concept of efficiency than robust efficiency, called convex hull robust pareto efficiency or simply convex hull efficiency, and give necessary and sufficient conditions for convex hull efficiency to uncertain multiobjective programs. Uncertainty different scenarios robust optimization done in two ways. A robust optimization perspective to stochastic models. Pareto curves and solutions when there is an obvious solution, pareto curves will find it. July, 2004 revise june 2005 abstract most research in robust optimization has so far been focused on inequalityonly, convex conic programming with simple linear models for uncertain parameters. Robust design optimization and design for six sigma, which is a quality improvement process leading to products conforming to six sigma quality. Many practical optimization problems, however, are nonlinear and. In contrast to existing surveys, our paper focuses on one of the most rapid and important areas, the construction of robust.
We propose a convex optimization method for decomposing the sum of a sparse matrix and a lowrank matrix into the individual components. An efficient algorithm based on the branchandreduce algorithm with specialized. Mittal 2011 investigates efficient algorithms that give optimal or nearoptimal solutions for problems with non. This efficiency criterion was developed by vilfredo pareto in his book manual of political economy, 1906. Over the last ten years, robust optimization has emerged as a framework of tackling optimization problems under data uncertainty e. Carmel, 31905, israel dmitry moor ibm systems and technology group science and technology center, moscow, russia abstract. As a result of its versatility and tractability, recent years have seen. Additionally, basic versions of ro assume hard constraints, i. Central themes in ro include understanding how to structure the uncertainty set r with loss probability p loss. A general robustoptimization formulation for nonlinear. Robust regression and e cient optimization yaoliang yu university of alberta nicta canberra may 16, 20 yl.
Variablesized uncertainty and inverse problems in robust. Necessary and sufficient conditions for pareto efficiency. Necessary and sufficient conditions for pareto efficiency in robust multiobjective optimization article pdf available in european journal of operational research 2622 april 2017 with 177 reads. A company produces two kinds of drugs, drugi and drugii, containing a specific active agent a, which is extracted from raw materials purchased on the market. In this work, we propose a highly efficient framework for solving robust. Distributionally robust optimization and its tractable approximations with rome joel goh melvyn sim department of decision sciences nus business school, singapore 26 aug 2009 20th ismp, chicago j. This is essentially the same model as in ceria and stubbs 3, but serves as a convenient starting point for the model proposed in this paper. Given a robust optimal solution, iancu and trichakis propose optimizing a new problem to find a solution that is pareto efficient.
Theory and applications of robust optimization dimitris bertsimas. Variablesized uncertainty and inverse problems in robust optimization andr e chasseiny1 and marc goerigkz2 1university of kaiserslautern, germany 2lancaster university, united kingdom abstract in robust optimization, the general aim is to nd a solution that performs well over a set of possible parameter outcomes, the socalled uncertainty set. Robust optimization ro is a relatively young methodology, developed mainly in the course of the last 15 years to analyze and optimize the performance of complex systems refer to the survey papers bental and nemirovski 2007, bertsimas et al. Brown y, constantine caramanis z july 6, 2007 abstract in this paper we survey the primary research, both theoretical and applied, in the. Pareto optimization and tradeoff analysis applied to metalearning of multiple simulation criteria ofer m. Searching for robust paretooptimal solutions in multi. Shir, shahar chen, david amid, david boaz and ateret anabytavor ibm research haifa university campus, mt. 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 for intensity modulated radiation. Princeton series in applied mathematics, title robust optimization, year 2009 related entries. In multistage optimization, the first assumption a. Distributionally robust optimization and its tractable. Our course will be focused on the basic theory of robust optimization, specifically, on motivation and detailed presentation of the robust optimization paradigm, including indepth investigation of the outlined notion of the robust counterpart of an uncertain optimization problem and its recent extensions adjustable and globalized robust coun. Outline 1 general overview 2 static problems 3 adjustable ro 4 twostages problems with real recourse 5 multistage problems with real recourse 6 multistage with integer recourse michael poss introduction to robust optimization may 30, 2017 2 53.
1497 1013 1422 184 426 1364 296 83 756 416 1505 1303 443 1468 1336 865 320 27 157 1280 1416 1124 985 1440 369 630 1308 480 1139 640 708 646 1228 914 451 739 768 716 650 1492 897 603 106 1251