Comprehensive Pareto Efficiency in robust counterpart optimization. (2nd November 2016)

• Record Type: Journal Article
• Authors: Shang, Ke; Feng, Zuren; Ke, Liangjun; Chan, Felix T.S.
• Is Part Of: Computers & chemical engineering. Volume 94(2016)
• Page Start: 75
• Page End: 91
• Publication Date: 2016-11-02
• Subjects: Robust optimization -- Pareto optimality -- Linear programming -- Integer programming; Chemical engineering -- Data processing -- Periodicals; 660.0285
• DOI: 10.1016/j.compchemeng.2016.07.022
• Languages: English
• ISSNs: 0098-1354

Abstract

Abstract: In this paper, an innovative concept named Comprehensive Pareto Efficiency is introduced in the context of robust counterpart optimization, which consists of three sub-concepts: Pareto Robust Optimality (PRO), Global Pareto Robust Optimality (GPRO) and Elite Pareto Robust Optimality (EPRO). Different algorithms are developed for computing robust solutions with respect to these three sub-concepts. As all sub-concepts are based on the Probability of Constraint Violation (PCV), formulations of PCV under different probability distributions are derived and an alternative way to calculate PCV is also presented. Numerical studies are drawn from two applications (production planning problem and orienteering problem), to demonstrate the Comprehensive Pareto Efficiency. The numerical results show that the Comprehensive Pareto Efficiency has important significance for practical applications in terms of the evaluation of the quality of robust solutions and the analysis of the difference between different robust counterparts, which provides a new perspective for robust counterpart optimization.