Relaxations and discretizations for the pooling problem
详细信息 查看全文
- 作者：Akshay Gupte ; Shabbir Ahmed ; Santanu S. Dey…
- 关键词：Pooling problem ; Bilinear program ; Convexification ; Lagrange relaxation ; Discretization
- 刊名：Journal of Global Optimization
- 出版年：2017
- 出版时间：March 2017
- 年：2017
- 卷：67
- 期：3
- 页码：631-669
- 全文大小：
- 刊物类别：Business and Economics
- 刊物主题：Optimization; Operation Research/Decision Theory; Real Functions; Computer Science, general;
- 出版者：Springer US
- ISSN：1573-2916
- 卷排序：67
文摘
The pooling problem is a folklore NP-hard global optimization problem that finds applications in industries such as petrochemical refining, wastewater treatment and mining. This paper assimilates the vast literature on this problem that is dispersed over different areas and gives new insights on prevalent techniques. We also present new ideas for computing dual bounds on the global optimum by solving high-dimensional linear programs. Finally, we propose discretization methods for inner approximating the feasible region and obtaining good primal bounds. Valid inequalities are derived for the discretized models, which are formulated as mixed integer linear programs. The strength of our relaxations and usefulness of our discretizations is empirically validated on random test instances. We report best known primal bounds on some of the large-scale instances.