Document Type
Article
Publication Date
4-2016
Publication Title
Journal of Global Optimization
Volume
67
Issue
3
Publisher
Springer
Abstract
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.
Recommended Citation
Please use publisher's recommended citation. https://link.springer.com/article/10.1007/s10898-016-0434-4
Comments
This manuscript has been published in the Journal of Global Optimization. Please find the published version here (note that a subscription is necessary to access this version):
https://link.springer.com/article/10.1007/s10898-016-0434-4
Springer holds the copyright in this article.