Title
Valid inequalities for the pooling problem with binary variables
Abstract
The pooling problem consists of finding the optimal quantity of final products to obtain by blending different compositions of raw materials in pools. Bilinear terms are required to model the quality of products in the pools, making the pooling problem a non-convex continuous optimization problem. In this paper we study a generalization of the standard pooling problem where binary variables are used to model fixed costs associated with using a raw material in a pool. We derive four classes of strong valid inequalities for the problem and demonstrate that the inequalities dominate classic flow cover inequalities. The inequalities can be separated in polynomial time. Computational results are reported that demonstrate the utility of the inequalities when used in a global optimization solver.
Year
DOI
Venue
2011
10.1007/978-3-642-20807-2_10
IPCO
Keywords
Field
DocType
computational result,classic flow cover inequality,different composition,optimal quantity,valid inequality,final product,global optimization solver,raw material,binary variable,non-convex continuous optimization problem,bilinear term
Mathematical optimization,Global optimization,Pooling,Fixed cost,Integer programming,Solver,Time complexity,Mathematics,Binary number,Bilinear interpolation
Conference
Volume
ISSN
Citations 
6655
0302-9743
9
PageRank 
References 
Authors
0.51
6
3
Name
Order
Citations
PageRank
Claudia D'Ambrosio115920.07
Jeff Linderoth265450.26
James Luedtke343925.95