A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: I. Robust Linear Optimization and Robust Mixed Integer Linear Optimization

Abstract

Robust counterpart optimization techniques for linear optimization and mixed integer linear optimization problems are studied in this paper. Different uncertainty sets, including those studied in literature (i.e., interval set; combined interval and ellipsoidal set; combined interval and polyhedral set) and new ones (i.e., adjustable box; pure ellipsoidal; pure polyhedral; combined interval, ellipsoidal, and polyhedral set) are studied in this work and their geometric relationship is discussed. For uncertainty in the left hand side, right hand side, and objective function of the optimization problems, robust counterpart optimization formulations induced by those different uncertainty sets are derived. Numerical studies are performed to compare the solutions of the robust counterpart optimization models and applications in refinery production planning and batch process scheduling problem are presented.

Transmission Expansion Planning Using TLBO Algorithm in the Presence of Demand Response Resources

“…In other words, L h ∈[L l , L u ], in which L h is the load value at the hth hour, and L l and L u are the lower and upper bands, respectively. In order to handle uncertainties, we assumed that the worst situation occurs [38], in which the loads are on their upper values.…”

A robust optimization method for energy management of CCHP microgrid

“…The scaled deviation of a ij can be denoted by g ij ¼ ð a ij À a ij Þ= a ij or g ij ¼ ð a ij þâ ij Þ= a ij , which is defined as the relative value of the forecast error and the realization of the uncertainty. In addition, when formulating a robust MILP problem [26], it is necessary to define an integer control parameter denoted by C i with values in the interval [0, |J i |]; this is called the budget of uncertainty. C i = 0 yields the nominal problem and thus does not incorporate uncertainty, whereas C i = |J i | corresponds to interval-based uncertainty sets and leads to the most conservative case.…”

“…Recently, the robust optimization has received significant attention in [25,26] as a modelling framework for optimization under parameter uncertainty. The robust optimization seeks the commitment and dispatch of generation resources for immunizing against all possible uncertain situations.…”

An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem

“…In the context of the CVRP, robust optimization may be particularly well-suited to address larger problem instances where little or no historical information about the uncertain problem parameters is available. For reviews of the robust optimization literature, we refer to Ben-Tal et al (2009), Bertsimas and Thiele (2006), Bertsimas et al (2011), Li et al (2011a) and Li et al (2011b). Unlike deterministic variants of the vehicle routing problem, which have been studied extensively, vehicle routing under uncertainty has received much less attention in the literature.…”