Pooling problem: Alternate formulations and solution methods

Management Science

Volumn 50, Issue 6, 2004, Pages 761-776

  Audet, Charles ^a   Brimberg, Jack ^b   Hansen, Pierre ^a   Le Digabel, Sébastien ^a   Mladenović, Nenad ^a  

^a GERAD   (Canada)

^b UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

Author keywords

Bilinear programming; Branch and cut; Heuristics; Pooling problem; Variable neighborhood search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

BILINEAR PROGRAMMING; BRANCH-AND-CUT; HEURISTICS; POOLING PROBLEM; VARIABLE NEIGHBORHOOD SEARCH;

MANAGEMENT SCIENCE;

EID: 3142607534     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1030.0207     Document Type: Article

References (35)

1. Adhya, N., N. V. Sahinidis, M. Tawarmalani. 1999. A Lagrangian approach to the pooling problem. Indust. Engrg. Chemistry Res. 38 1956-1972.
2. Al-Khayyal, F. A., J. E. Falk. 1983. Jointly constrained biconvex programming. Math. Oper. Res. 8(2) 273-286.
3. Alameddine, A., H. D. Sherali. 1992. A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2 379-410.
4. Amos, F., M. Rönnqvist, G. Gill. 1997. Modeling the pooling problem at the New Zealand refining company. J. Oper. Res. Soc. 48 767-778.
5. Androulakis, I. P., V. Visweswaran, C. A. Floudas. 1996. Distributed decomposition-based approaches. C. A. Floudas, P. M. Pardalos, eds. State of the Art in Global Optimization: Computational Methods and Applications. Kluwer Academics Publishers, Dordrecht, The Netherlands, 285-301.
6. Audet, C., P. Hansen, B. Jaumard, G. Savard. 1997. Links between the linear bilevel and mixed 0-1 programming problem. J. Optim. Theory Appl. 93(2) 273-300.
7. Audet, C., P. Hansen, B. Jaumard, G. Savard. 2000. A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Programming 87(1) 131-152.
8. Baker, T. E., L. S. Lasdon. 1985. Successive linear programming at Exxon. Management Sci. 31(3) 264-274.
9. Ben-Tal, A., G. Eiger, V. Gershovitz. 1994. Global minimization by reducing the duality gap. Math. Programming 63 193-212.
10. Brimberg, J., G. Oron, A. Mehrez. 1997. An operational model for utilizing water sources of varying qualities in an agricultural enterprise. Geography Res. Forum 17 67-77.
11. Chung, S. J. 1989. NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60(3) 393-399.
12. Dewitt, C. W., L. S. Lasdon, D. A. Brenner, S. A. Melhem. 1989. OMEGA: An improved gasoline blending system for Texaco. Interfaces 19 85-101.
13. Dür, M., R. Horst. 1997. Lagrange duality and partitioning techniques in nonconvex global optimization. J. Optim. Theory Appl. 95(2) 347-369.
14. Floudas, C. A., A. Aggarwal. 1990. A decomposition strategy for global optimum search in the pooling problem. ORSA J. Comput. 2(3) 225-235.
15. Floudas, C. A., V. Visweswaran. 1993a. A primal-relaxed dual global optimization approach. J. Optim. Theory Appl. 78(2) 187-225.
16. Floudas, C. A., V. Visweswaran. 1993b. New properties and computational improvement of the GOP algorithm for problems with quadratic objective function and constraints. J. Global Optim. 3 439-462.
17. Floudas, C. A., V. Visweswaran. 1996. New formulations and branching strategies for the GOP algorithm. I. E. Grossmann, ed. Global Optimization in Engineering Design. Kluwer Academics Publishers, Dordrecht, The Netherlands.
18. Foulds, L. R., D. Haugland, K. Jörnsten. 1992. A bilinear approach to the pooling problem. Optimization 24 165-180.
19. Griffith, R. E., R. A. Stewart. 1961. A nonlinear programming technique for the optimization of continuous processing systems. Management Sci. 7 379-392.
20. Grossmann, I. E., I. Quesada. 1995. Global optimization of bilinear process networks with multicomponents flows. Comput. Chemical Engrg. 19(12) 1219-1242.
21. Hansen, P., B. Jaumard. 1992. Reduction of indefinite quadratic programs to bilinear programs. J. Global Optim. 2 41-60.
22. Hansen, P., N. Mladenović. 1997. Variable neighborhood search. Comput. Oper. Res. 24 1097-1100.
23. Hansen, P., N. Mladenović. 1999. An introduction to variable neighborhood search. S. Voss, S. Martello, I. Osman, R. Roucairol, eds. Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, The Netherlands, 433-458.
24. Hansen, P., B. Jaumard, G. Savard. 1992. New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Statist. Comput. 13 1194-1217.
25. Haverly, C. A. 1978. Studies of the behaviour of recursion for the pooling problem. ACM SIGMAP Bull. 25 19-28.
26. Lasdon, L., B. Joffe. 1990. The relationship between distributive recursion and successive linear programming in refining production planning models. NPRA Comput. Conf. Seattle, WA.
27. Lasdon, L., A. Waren, S. Sarkar, F. Palacios-Gomez. 1979. Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms. ACM SIGMAP Bull. 27 9-25.
28. Lodwick, W. A. 1992. Preprocessing nonlinear functional constraints with applications to the pooling problem. ORSA J. Comput. 4(2) 119-131.
29. Palacios-Gomez, F., L. S. Lasdon, M. Engquist. 1982. Nonlinear optimization by successive linear programming. Management Sci. 28(10) 1106-1120.
30. Rehfeldt, M., R. Tisljar. 1997. Private communication, November 20.
31. Sahinidis, N. V. 1996. BARON: A general purpose global optimization software package. J. Global Optim. 8 201-205.
32. Sherali, H. D., C. H. Tuncbilek. 1992. A global optimization algorithm for polynomial programming using a reformulation-linearization technique. J. Global Optim. 2 101-112.
33. Sherali, H. D., C. H. Tuncbilek. 1997a. Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. J. Global Optim. 10 381-390.
34. Sherali, H. D., C. H. Tuncbilek. 1997b. New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21 1-9.
35. Zhang, J., N. H. Kim, L. S. Lasdon. 1985. An improved successive linear programming algorithm. Management Sci. 31(10) 1312-1331.