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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
DeWitt, C., Lasdon, L., Waren, A., Brenner, D., Melham, S.: OMEGA: An improved gasoline blending system for Texaco. Interfaces 19, 85–101 (1989)
Rigby, B., Lasdon, L., Waren, A.: The evolution of Texaco’s blending systems: From OMEGA to StarBlend. Interfaces 25, 64–83 (1995)
Bagajewicz, M.: A review of recent design procedures for water networks in refineries and process plants. Computers & Chemical Engineering 24, 2093–2113 (2000)
Kallrath, J.: Mixed integer optimization in the chemical process industry: Experience, potential and future perspectives. Chemical Engineering Research and Design 78, 809–822 (2000)
Misener, R., Floudas, C.: Advances for the pooling problem: Modeling, global optimization, & computational studies. Applied and Computational Mathematics 8, 3–22 (2009)
Lee, H., Pinto, J., Grossmann, I., Park, S.: Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Industrial & Engineering Chemistry Research 35, 1630–1641 (1996)
Shah, N.: Mathematical programming techniques for crude oil scheduling. Computers & Chemical Engineering 20, S1227–S1232 (1996)
Padberg, M., Van Roy, T.J., Wolsey, L.: Valid linear inequalities for fixed charge problems. Operations Research 33, 842–861 (1985)
Meyer, C., Floudas, C.: Global optimization of a combinatorially complex generalized pooling problem. AIChE Journal 52, 1027–1037 (2006)
Karuppiah, R., Grossmann, I.: Global optimization for the synthesis of integrated water systems in chemical processes. Computers & Chemical Engineering 30, 650–673 (2006)
Papageorgiou, D.J., Toriello, A., Nemhauser, G.L., Savelsbergh, M.: Fixed-charge transportation with product blending (2010) (unpublished manuscript)
Quesada, I., Grossmann, I.: Global optimization of bilinear process networks with multicomponent flows. Computers and Chemical Engineering 19, 1219–1242 (1995)
Tawarmalani, M., Sahinidis, N.: Convexification and global optimization in continuous and mixed-integer nonlinear programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht (2002)
McCormick, G.: Computability of global solutions to factorable nonconvex programs: Part 1 - convex underestimating problems. Mathematical Programming 10, 147–175 (1976)
Wolsey, L., Nemhauser, G.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Sahinidis, N., Tawarmalani, M.: Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints. Journal of Global Optimization 32, 259–280 (2005)
Dolan, E., Moré, J.: Benchmarking optimization software with performance profiles. Mathematical Programming 91, 201–213 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Ambrosio, C., Linderoth, J., Luedtke, J. (2011). Valid Inequalities for the Pooling Problem with Binary Variables. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)