To refer to this page use:
|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.|
|Citation:||Li, Zukui, Ran Ding, and Christodoulos A. Floudas. "A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: I. Robust Linear Optimization and Robust Mixed Integer Linear Optimization." Industrial & Engineering Chemistry Research 50, no. 18 (2011): 10567-10603. doi: 10.1021/ie200150p|
|Pages:||10567 - 10603|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||Industrial & Engineering Chemistry Research|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.