Relaxations and discretizations for the pooling problem

• DOI: 10.1007/s10898-016-0434-4
• Publication Date: 2016-04-27T10:31:20Z
• Authors: Akshay Gupte; Shabbir Ahmed; Santanu S. Dey; Myun Seok Cheon
• Keywords: Pooling

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.