.png){kind=icon}
.png){kind=icon}
Return
Data-driven distributionally robust chance-constrained optimization with large data set and outliers: Sequential sample removal algorithm for solution improvement
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2023.108407.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data-driven distributionally robust chance-constrained optimization (DRCCP) is a powerful technique to handle optimization problems involving uncertainty in constraint functions. However, the outliers and extreme samples in the data set may deteriorate the decision quality of DRCCP. Although there are numerous outlier detection techniques, they are either unable to pinpoint the samples causing overly conservative solutions, or incompatible with DRCCP models. This work proposes a novel and widely compatible algorithm that generates a representative subset of the original data set and removes samples causing overly conservative solutions for the DRCCP problem. With the proposed approach, the DRCCP solution quality can be enhanced while simultaneously ensuring the solution feasibility. To illustrate its effectiveness, we examine two numerical examples and a nonlinear process optimization problem in our study.
Keywords:
Distributionally robust chance-constrained
optimization
Optimization under uncertainty
Data-driven optimization
Joint chance constraint
Process optimization
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W