.png){kind=icon}
返回
Robust Optimization for the Pooling Problem
.png){kind=icon}
OA
AI
DOI：10.1021/acs.iecr.9b01772.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The pooling problem has applications, for example, 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 nonlinear, nonconvex pooling problem. Most applications of robust optimization have been either convex or mixed-integer linear problems. We explore the suitability of robust optimization in the context of global optimization problems which are concave in the uncertain parameters by considering the pooling problem with uncertain inlet concentrations. We compare the computational efficiency of reformulation and cutting plane approaches for three commonly used uncertainty set geometries on 14 pooling problem instances and demonstrate how accounting for uncertainty changes the optimal solution.
Keyword:
GLOBAL OPTIMIZATION
GENERALIZED SEMIINFINITE
APPROXIMATION
FORMULATIONS
CONSTRAINTS
ALGORITHM
PROGRAMS
DUALITY
SAFETY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
引用论文
Prevalence of polyps in an autopsy series from areas with varying incidence of large‐bowel cancer
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容