首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Relaxations and discretizations for the pooling problem
Authors:Akshay Gupte  Shabbir Ahmed  Santanu S Dey  Myun Seok Cheon
Institution:1.Department of Mathematical Sciences,Clemson University,Clemson,USA;2.School of Industrial and Systems Engineering,Georgia Institute of Technology,Atlanta,USA;3.ExxonMobil Research and Engineering Company,Annandale,USA
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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号