article

Relaxations and discretizations for the pooling problem

Authors:

Santanu S. Dey,

Myun Seok CheonAuthors Info & Claims

Journal of Global Optimization, Volume 67, Issue 3

Pages 631 - 669

https://doi.org/10.1007/s10898-016-0434-4

Published: 01 March 2017 Publication History

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.

References

[1]

Adhya, N., Tawarmalani, M., Sahinidis, N.: A Lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38(5), 1956---1972 (1999)

[2]

Al-Khayyal, F., Falk, J.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273---286 (1983)

[3]

Alfaki, M., Haugland, D.: A cost minimization heuristic for the pooling problem. Ann. Oper. Res. 222(1), 73---87 (2013a)

[4]

Alfaki, M., Haugland, D.: A multi-commodity flow formulation for the generalized pooling problem. J. Glob. Optim. 56(3), 917---937 (2013b)

[5]

Alfaki, M., Haugland, D.: Strong formulations for the pooling problem. J. Glob. Optim. 56(3), 897---916 (2013c)

[6]

Almutairi, H., Elhedhli, S.: A new Lagrangean approach to the pooling problem. J. Glob. Optim. 45(2), 237---257 (2009)

Digital Library

[7]

Audet, C., Brimberg, J., Hansen, P., Le Digabel, S., Mladenović, N.: Pooling problem: alternate formulations and solution methods. Manag. Sci. 50(6), 761---776 (2004)

Digital Library

[8]

Audet, C., Hansen, P., Jaumard, B., Savard, G.: A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3), 573---592 (1999)

[9]

Baker, T., Lasdon, L.: Successive linear programming at Exxon. Manag. Sci. 31(3), 264---274 (1985)

[10]

Bao, X., Sahinidis, N., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4---5), 485---504 (2009)

Digital Library

[11]

Bao, X., Sahinidis, N., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129(1), 129---157 (2011)

Digital Library

[12]

Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1---131 (2013)

[13]

Ben-Tal, A., Eiger, G., Gershovitz, V.: Global minimization by reducing the duality gap. Math. Program. 63(1), 193---212 (1994)

Digital Library

[14]

Biegler, L., Grossmann, I., Westerberg, A.: Systematic methods for chemical process design. In: International Series in the Physical and Chemical Engineering Sciences. Prentice Hall (1997)

[15]

Bley, A., Boland, N., Froyland, G., Zuckerberg, M.: Solving mixed integer nonlinear programming problems for mine production planning with stockpiling (2012). http://www.optimization-online.org/DB_HTML/2012/11/3674.html

[16]

Bodington, C., Baker, T.: A history of mathematical programming in the petroleum industry. Interfaces 20(4), 117---127 (1990)

Digital Library

[17]

Boland, N., Kalinowski, T., Rigterink, F.: New multi-commodity flow formulations for the pooling problem. J. Glob. Optim (2015).

Digital Library

[18]

Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97---106 (2012)

[19]

Burer, S., Saxena, A.: The MILP road to MIQCP. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and its Applications, vol. 154, pp. 373---405. Springer, Berlin (2012)

[20]

Crama, Y.: Concave extensions for nonlinear 0---1 maximization problems. Math. Program. 61(1---3), 53---60 (1993)

Digital Library

[21]

D'Ambrosio, C., Linderoth, J., Luedtke, J.: Valid inequalities for the pooling problem with binary variables. In: Günlük, O., Woeginger, G. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 6655, pp. 117---129. Springer (2011)

Digital Library

[22]

Dey, S., Gupte, A.: Analysis of MILP techniques for the pooling problem. Oper. Res. 63(2), 412---427 (2015)

Digital Library

[23]

Floudas, C., Aggarwal, A.: A decomposition strategy for global optimum search in the pooling problem. ORSA J. Comput. 2(3), 225---235 (1990)

[24]

Foulds, L., Haugland, D., Jörnsten, K.: A bilinear approach to the pooling problem. Optimization 24(1), 165---180 (1992)

[25]

Frimannslund, L., El Ghami, M., Alfaki, M., Haugland, D.: Solving the pooling problem with LMI relaxations. In: TOGO10--global optimization workshop, pp. 51---54 (2010)

[26]

Frimannslund, L., Gundersen, G., Haugland, D.: Sensitivity analysis applied to the pooling problem. Tech. Rep. 380, University of Bergen (2008)

[27]

Furman, K., Androulakis, I.: A novel MINLP-based representation of the original complex model for predicting gasoline emissions. Comp. Chem. Eng. 32(12), 2857---2876 (2008)

[28]

Gounaris, C., Misener, R., Floudas, C.: Computational comparison of piecewise-linear relaxations for pooling problems. Ind. Eng. Chem. Res. 48(12), 5742---5766 (2009)

[29]

Greenberg, H.: Analyzing the pooling problem. ORSA J. Comput. 7(2), 205---217 (1995)

[30]

Günlük, O., Lee, J., Leung, J.: A polytope for a product of real linear functions in 0/1 variables. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and its Applications, vol. 154, pp. 513---529. Springer, Berlin (2012)

[31]

Gupte, A.: Mixed integer bilinear programming with applications to the pooling problem. Ph.D. thesis, Georgia Institute of Technology, Atlanta, GA (2012). https://smartech.gatech.edu/handle/1853/45761

[32]

Gupte, A.: Bilinear programming with simplicial constraints (2016a). Working paper. http://people.clemson.edu/~agupte/BilinSimpl.pdf

[33]

Gupte, A.: Convex hulls of superincreasing knapsacks and lexicographic orderings. Discrete Appl. Math. 201, 150---163 (2016b)

Digital Library

[34]

Gupte, A., Ahmed, S., Cheon, M., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721---744 (2013)

[35]

Hasan, M., Karimi, I.: Piecewise linear relaxation of bilinear programs using bivariate partitioning. AIChE J. 56(7), 1880---1893 (2010)

[36]

Haugland, D.: The computational complexity of the pooling problem. J. Glob. Optim. 1---17 (2015).

Digital Library

[37]

Haverly, C.: Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bull. 25, 19---28 (1978)

Digital Library

[38]

Kallrath, J.: Solving planning and design problems in the process industry using mixed integer and global optimization. Ann. Oper. Res. 140(1), 339---373 (2005)

[39]

Karuppiah, R., Furman, K., Grossmann, I.: Global optimization for scheduling refinery crude oil operations. Comput. Chem. Eng. 32(11), 2745---2766 (2008)

[40]

Karuppiah, R., Grossmann, I.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30(4), 650---673 (2006)

[41]

Kim, S., Kojima, M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw. 15(3---4), 201---224 (2001)

[42]

Kolodziej, S.P., Grossmann, I.E., Furman, K.C., Sawaya, N.W.: A discretization-based approach for the optimization of the multiperiod blend scheduling problem. Comput. Chem. Eng. 53, 122---142 (2013)

[43]

Lee, S., Grossmann, I.: Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks. Comput. Chem. Eng. 27(11), 1557---1575 (2003)

[44]

Li, X., Armagan, E., Tomasgard, A., Barton, P.I.: Stochastic pooling problem for natural gas production network design and operation under uncertainty. AIChE J. 57(8), 2120---2135 (2011)

[45]

Li, X., Tomasgard, A., Barton, P.I.: Decomposition strategy for the stochastic pooling problem. J. Glob. Optim. 54(4), 765---790 (2012)

[46]

Liberti, L., Pantelides, C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Glob. Optim. 36(2), 161---189 (2006)

Digital Library

[47]

Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2), 325---351 (2012)

Digital Library

[48]

Marcotte, O.: The cutting stock problem and integer rounding. Math. Program. 33(1), 82---92 (1985)

Digital Library

[49]

McCormick, G.: Computability of global solutions to factorable nonconvex programs: part I. convex underestimating problems. Math. Program. 10(1), 147---175 (1976)

Digital Library

[50]

Meyer, C., Floudas, C.: Global optimization of a combinatorially complex generalized pooling problem. AIChE J. 52(3), 1027---1037 (2006)

[51]

Misener, R., Floudas, C.: Advances for the pooling problem: modeling, global optimization, and computational studies. Appl. Comput. Math. 8(1), 3---22 (2009)

[52]

Misener, R., Floudas, C.: Global optimization of large-scale generalized pooling problems: quadratically constrained MINLP models. Ind. Eng. Chem. Res. 49(11), 5424---5438 (2010)

[53]

Misener, R., Gounaris, C., Floudas, C.: Mathematical modeling and global optimization of large-scale extended pooling problems with the (EPA) complex emissions constraints. Comput. Chem. Eng. 34(9), 1432---1456 (2010)

[54]

Misener, R., Smadbeck, J.B., Floudas, C.A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optim. Methods Softw. 30(1), 215---249 (2015)

Digital Library

[55]

Misener, R., Thompson, J., Floudas, C.: APOGEE: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Comput. Chem. Eng. 35, 876---892 (2011)

[56]

Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization, Discrete Mathematics and Optimization, vol. 18. Wiley-Interscience, London (1988)

Digital Library

[57]

Nishi, T.: A semidefinite programming relaxation approach for the pooling problem. Master's thesis, Department of Applied Mathematics and Physics, Kyoto University (2010). http://www-optima.amp.i.kyoto-u.ac.jp/result/masterdoc/21nishi.pdf

[58]

Pham, V., Laird, C., El-Halwagi, M.: Convex hull discretization approach to the global optimization of pooling problems. Ind. Eng. Chem. Res. 48(4), 1973---1979 (2009)

[59]

Quesada, I., Grossmann, I.: Global optimization of bilinear process networks with multicomponent flows. Comput. Chem. Eng. 19(12), 1219---1242 (1995)

[60]

Realff, M., Ahmed, S., Inacio, H., Norwood, K.: Heuristics and upper bounds for a pooling problem with cubic constraints. In: Foundations of Computer-Aided Process Operations. Savannah, GA (2012). http://focapo.cheme.cmu.edu/2012/proceedings/data/papers/056.pdf

[61]

Rikun, A.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10(4), 425---437 (1997)

Digital Library

[62]

Ruiz, J., Grossmann, I.: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks. Optim. Lett. 5(1), 1---11 (2011)

[63]

Ruiz, M., Briant, O., Clochard, J., Penz, B.: Large-scale standard pooling problems with constrained pools and fixed demands. J. Glob. Optim. 56(3), 939---956 (2013)

[64]

Sherali, H., Adams, W.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Nonconvex Optimization and its Applications, vol. 31. Kluwer Academic Publishers, Dordrecht (1998)

[65]

Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Math. Vietnam. 22(1), 245---270 (1997)

[66]

Smith, E.M., Pantelides, C.C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex minlps. Comput. Chem. Eng. 23(4), 457---478 (1999)

[67]

Tardella, F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Optim. Lett. 2(3), 363---375 (2008)

[68]

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)

Digital Library

[69]

Vielma, J., Nemhauser, G.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128, 49---72 (2011)

Digital Library

[70]

Visweswaran, V.: MINLP: applications in blending and pooling problems. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 2114---2121. Springer, Berlin (2009)

Cited By

El Housni OFoussoul AGoyal V(2024)LP-based approximations for disjoint bilinear and two-stage adjustable robust optimizationMathematical Programming: Series A and B10.1007/s10107-023-02004-9206:1-2(239-281)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10107-023-02004-9
Dumouchelle JPatel RKhalil EBodur MKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Neur2SPProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602012(23992-24005)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602012
Sun RMaillart LValeva SSchaefer AStarks S(2022)Optimal Pooling, Batching, and Pasteurizing of Donor Human MilkService Science10.1287/serv.2021.028514:1(13-34)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1287/serv.2021.0285
Show More Cited By

Index Terms

Relaxations and discretizations for the pooling problem

Index terms have been assigned to the content through auto-classification.

Recommendations

New multi-commodity flow formulations for the pooling problem

The pooling problem is a nonconvex nonlinear programming problem with numerous applications. The nonlinearities of the problem arise from bilinear constraints that capture the blending of raw materials. Bilinear constraints are well-studied and ...
A new Lagrangean approach to the pooling problem

We present a new Lagrangean approach for the pooling problem. The relaxation targets all nonlinear constraints, and results in a Lagrangean subproblem with a nonlinear objective function and linear constraints, that is reformulated as a linear mixed ...
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
Abstract
The pooling problem is an important industrial problem in the class of network flow problems for allocating gas flow in pipeline transportation networks. For the pooling problem with time discretization, we propose second order cone programming (...

Comments

Information & Contributors

Information

Published In

cover image Journal of Global Optimization

Journal of Global Optimization Volume 67, Issue 3

March 2017

230 pages

ISSN:0925-5001

Issue’s Table of Contents

Copyright © Copyright © 2017 Springer Science+Business Media New York.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 March 2017

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

El Housni OFoussoul AGoyal V(2024)LP-based approximations for disjoint bilinear and two-stage adjustable robust optimizationMathematical Programming: Series A and B10.1007/s10107-023-02004-9206:1-2(239-281)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10107-023-02004-9
Dumouchelle JPatel RKhalil EBodur MKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Neur2SPProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602012(23992-24005)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602012
Sun RMaillart LValeva SSchaefer AStarks S(2022)Optimal Pooling, Batching, and Pasteurizing of Donor Human MilkService Science10.1287/serv.2021.028514:1(13-34)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1287/serv.2021.0285
Chen YMaravelias C(2022)Variable Bound Tightening and Valid Constraints for Multiperiod BlendingINFORMS Journal on Computing10.1287/ijoc.2021.114034:4(2073-2090)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1287/ijoc.2021.1140
Cheng XLi X(2022)Discretization and global optimization for mixed integer bilinear programmingJournal of Global Optimization10.1007/s10898-022-01179-384:4(843-867)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s10898-022-01179-3
Dey SLuedtke JSahinidis N(2022)Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization ProblemsMathematical Programming: Series A and B10.1007/s10107-022-01876-7196:1-2(1-8)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s10107-022-01876-7
Housni OFoussoul AGoyal V(2022)LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust OptimizationInteger Programming and Combinatorial Optimization10.1007/978-3-031-06901-7_17(223-236)Online publication date: 27-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-06901-7_17
Chen YMaravelias C(2020)Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimizationJournal of Global Optimization10.1007/s10898-020-00882-377:3(603-625)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.1007/s10898-020-00882-3
Kimizuka MKim SYamashita M(2019)Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methodsJournal of Global Optimization10.1007/s10898-019-00795-w75:3(631-654)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1007/s10898-019-00795-w
Zou JAhmed SSun X(2019)Stochastic dual dynamic integer programmingMathematical Programming: Series A and B10.1007/s10107-018-1249-5175:1-2(461-502)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s10107-018-1249-5
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents