A new Lagrangean approach to the pooling problem

Journal of Global Optimization

Volumn 45, Issue 2, 2009, Pages 237-257

  Almutairi, Hossa ^a   Elhedhli, Samir ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Lagrangean relaxation; Pooling problem

Indexed keywords

FEASIBLE SOLUTION; GLOBAL OPTIMUM; GLOBAL SOLUTIONS; LAGRANGEAN HEURISTICS; LAGRANGEAN RELAXATION; LINEAR CONSTRAINTS; LOWER BOUNDS; MIXED-INTEGER PROGRAMS; NON-LINEAR CONSTRAINTS; NONLINEAR OBJECTIVE FUNCTIONS; POOLING PROBLEM;

CONTROL THEORY; INTEGER PROGRAMMING;

HEURISTIC METHODS;

EID: 69949095157     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-008-9371-1     Document Type: Article

References (23)

1. N. Adhya M. Tawarmalani N. Sahinidis 1999 A Lagrangian approach to the pooling problem Ind. Eng. Chem. Res. 38 1956 1972
2. F.A. Al-Khayyal J.E. Falk 1983 Jointly constrained biconvex programming Math. Oper. Res. 8 2 124 131
3. C. Audet J. Brimberg P. Hansen S. Le Digabel N. Maldenovic 2004 Pooling problem: alternate formulations and solution methods Manage. Sci. 50 6 761 776
4. T.E. Baker L.S. Lasdon 1985 Successive linear programming at Exxon Manage. Sci. 31 264 274
5. A. Ben-Tal G. Eiger V. Greshovitz 1994 Global minimization by reducing the duality gap Math. Program. 63 193 212
6. Bodington C.E., Randall W.C.: Nonlinear Programs for Product Blending. Joint National TIMS/ORSA Meeting, New Orleans (1979)
7. M.L. Fisher 1981 The Lagrangian relaxation method for solving integer programming problems Manage. Sci. 27 1 18
8. C.A. Floudas A. Aggarwal 1990 A Decomposition strategy for the optimum search in the pooling problem ORSA J. Comput. 2 3 225 235
9. L.R. Foulds D. Haugland K. Jonsten 1992 A bilinear approach to the pooling problem Optimization 24 165 180
10. GLPK (GNU Linear Programming Kit). http://www.gnu.org/software/glpk/glpk. htmt
11. R.E. Griffith R.A. Stewart 1961 A nonlinear programming technique for the optimization of continuous processing system Manage. Sci. 7 379 392
12. C.A. Haverly 1978 Studies of the behavior of recursion for the pooling problem ACM SIGMAP Bull. 25 29 32
13. C.A. Haverly 1979 Behavior of recursion model-more studies ACM SIGMAP Bull. 26 22 28
14. L.S. Lasdon A.D. Waren S. Sarkar F. Palacios-Gomez 1979 Solving the pooling problem using generalized reduced gradient and successive linear programming algorithm ACM SIGMAP Bull. 27 9 15
15. L. Liberti C.C. Pantelides 2006 An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms J. Glob. Optim. 36 161 189
16. G.P. McCormick 1976 Computability of global solutions to factorable nonconvex programs. Part I-convex underestimating problems Math. Program. 10 147 175
17. C. Meyer C. Floudas 2006 Global optimization of a combinatorially complex generalized pooling problem AIChE J. 52 3 1027 1037
18. I. Quesada I.E. Grossmann 1995 Global optimization of bilinear process networks and multicomponent flows Comput. Chem. Eng. 19 12 1219 1242
19. H.D. Sherali A. Alameddine 1992 A new reformulation-linearization technique for bilinear programming problems J. Glob. Optim. 2 379 410
20. J.D. Simon H.M. Azma 1983 Exxon experience with large scale linear and nonlinear programming applications Comput. Chem. Eng. 7 5 605 614
21. Tawarmalani, M., Sahinidis, N.: Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications (Kluwer Book Series in Nonconvex Optimization and its Applications, vol. 65). Kluwer Academic, Dordrecht (2002)
22. V. Visweswaran C.A. Floudas 1990 A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: application of theory and test problems Comp. Chem. Eng. 14 1419 1434
23. V. Visweswaran C.A. Floudas 1993 New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints J. Glob. Optim. 3 3 439 462