Strong formulations for the pooling problem

Mohammed Alfaki () and Dag Haugland ()

Journal of Global Optimization, 2013, vol. 56, issue 3, 897-916

Abstract: The pooling problem is a well-studied global optimization problem with applications in oil refining and petrochemical industry. Despite the strong NP-hardness of the problem, which is proved formally in this paper, most instances from the literature have recently been solved efficiently by use of strong formulations. The main contribution from this paper is a new formulation that proves to be stronger than other formulations based on proportion variables. Moreover, we propose a promising branching strategy for the new formulation and provide computational experiments confirming the strength of the new formulation and the effectiveness of the branching strategy. Copyright Springer Science+Business Media, LLC. 2013

Keywords: Pooling problem; Bilinear programming; Global optimization; Linear relaxation; Computational complexity (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-9875-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:56:y:2013:i:3:p:897-916

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-9875-6

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().