2019
DOI: 10.1021/acs.iecr.9b01772
|View full text |Cite
|
Sign up to set email alerts
|

Robust Optimization for the Pooling Problem

Abstract: The pooling problem has applications, e.g., in petrochemical refining, water networks, and supply chains and is widely studied in global optimization. To date, it has largely been treated deterministically, neglecting the influence of parametric uncertainty. This paper applies two robust optimization approaches, reformulation and cutting planes, to the non-linear, non-convex pooling problem. Most applications of robust optimization have been either convex or mixed-integer linear problems. We explore the suitab… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 72 publications
(167 reference statements)
1
3
0
Order By: Relevance
“…An exception is the the non-linear, nonconvex pooling problem with an ellipsoidal set. For this instance, the cutting plane solver achieves significantly better results, which is in line with previous work on robust pooling problems [27].…”
Section: Resultssupporting
confidence: 89%
“…An exception is the the non-linear, nonconvex pooling problem with an ellipsoidal set. For this instance, the cutting plane solver achieves significantly better results, which is in line with previous work on robust pooling problems [27].…”
Section: Resultssupporting
confidence: 89%
“…To address this, Bertsimas et al 24 proposed a local search algorithm for identifying robust feasible solutions to uncertain optimization problems with non‐convex inequality constraints. Additionally, there have been recent advances in the development of novel methods and applications of RO methods to nonlinear process systems engineering models, including general nonlinear programming robust counterpart formulations, 25 robust counterparts with local linearization of nonlinear uncertain constraints and a novel sampling algorithm, 26 application to the pooling problem utilizing a cutting‐plane solution algorithm, 27 application to water treatment network operation, 28 robust counterpart derivation for the synthesis of fuel refineries under cost uncertainty, 29 and design and operation of process systems with resilience to disruptive events, 30 to name but a few.…”
Section: Introductionmentioning
confidence: 99%
“…In this work, they used nonconvex Benders decomposition to solve the nonconvex MINLP. More recently, Wiebe et al 30 presented a comparison study of reformulation and cutting plane-based robust optimization methods for the pooling problem.…”
Section: Introductionmentioning
confidence: 99%