Convex hull discretization approach to the global optimization of pooling problems

Industrial and Engineering Chemistry Research

Volumn 48, Issue 4, 2009, Pages 1973-1979

  Pham, Viet ^a   Laird, Carl ^a   El Halwagi, Mahmoud ^a  

^a Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND METHODS; COMPUTATIONALLY EFFICIENT; CONVEX HULLS; DISCRETIZATION; DISCRETIZED PROBLEMS; IMPLICIT ENUMERATIONS; IN PROCESS; MIXED INTEGER LINEAR PROGRAMS; NEW APPROACHES; NON-LINEAR VARIABLES; NONCONVEX; OPTIMIZATION PROBLEMS; OPTIMIZATION TECHNIQUES; POOLING PROBLEMS; SEARCH SPACES;

CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING; WIRELESS LOCAL AREA NETWORKS (WLAN);

BRANCH AND BOUND METHOD;

EID: 61849113250     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie8003573     Document Type: Article

References (26)

1. Haverly, C. A. Studies of the Behaviour of Recursion for the Pooling Problem. ACM SIGMAP Bull. 1978, 25, 29-32.
2. Lasdon, L. S.; Waren, A. D.; Sarkar, S.; Palacios-Gomez, F. Solving the Pooling Problem using Generalized Reduced Gradient and Successive Linear Programming Algorithms. ACM SIGMAP Bull. 1979, 27, 9-15.
3. Griffith, R. E.; Stewart, R. A. A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems. Manage. Sci. 1961, 7, 379-392.
4. Palacios-Gomez, F.; Lasdon, L. S.; Engquist, M. Nonlinear Optimization by Successive Linear Programming. Manage. Sci. 1982, 28, 1106-1120.
5. Baker, T. E.; Lasdon, L. S. Successive Linear Programming at Exxon. Manage. Sci. 1985, 31, 264-274.
6. Floudas, C. A.; Aggarwal, A.; Ciric, A. R. Global Optimum Search for Nonconvex NLP and MINLP Problems. Comput. Chem. Eng. 1989, 13 (10), 1117-1132.
7. Floudas, C. A.; Aggarwal, A. A decomposition strategy for global optimum search in the pooling problem. ORSA J. Comput. 1990, 2 (3), 225-235.
8. Sahinidis, N. V.; Grossmann, I. E. Convergence Properties of Generalized Benders Decomposition. Comput. Chem. Eng. 1991, 15, 481-491.
9. Androulakis, I. P.; Visweswaran, V.; Floudas, C. Distributed decomposition-based approaches in Global Optimization. In State of the art in global optimization: Computational Methods and Applications; Fouldas, C. M.; Parados, P. M., Eds.; Kluwer Academic Publishers: Dordrecht, 1996; pp 285-301.
10. Foulds, L. R.; Haugland, D.; Jornsten, K. A Bilinear Approach to the Pooling Problem. Optimization 1992, 24, 165-180.
11. McCormick, G. P. Computability of global solutions to factorable nonconvex programs, part I: Convex underestimating problems. Math. Prog. 1976, 10, 147-175.
12. Al-Khayyal, F. A.; Falk, J. E. Jointly constrained biconvex programming. Math. Oper. Res. 1983, 8, 273-286.
13. Sherali, H. D.; Alameddine, A. A New Reformulation-Linearization Technique For Bilinear Programming Problems. J. Global Optim. 1992, 2, 379-410.
14. Sherali, H. D. Tight Relaxations for Nonconvex Optimization Problems using the Reformulation-Linearization/Convexification Technique (RLT). In Handbook of Global Optimization, Volume 2: Heuristic Approaches;
15. Pardalos, P. M.; Romeijin, H. E., Eds.; Kluwer Academic Publishers; Dordrecht/London/Boston, 2002; pp 1-63.
16. Quesada, I.; Grossmann, I. E. Global Optimization of Bilinear Process Networks with Multicomponent Streams. Comput. Chem. Eng. 1995, 19, 1219-1242.
17. Ben-Tal, A.; Eiger, G.; Gershovitz, V. Global Minimization by Reducing the Duality Gap. Math. Prog. 1994, 63, 193-212.
18. Meyer, C.; Floudas, C. A. Global Optimization of a Combinatorially Complex Generalized Pooling Problem. AIChE J. 2006, 52, 1027-1037.
19. Bergamini, M. L.; Grossman, I.; Scenna, N.; Aguirre, P. An Improved Piecewise Outer-approximation Algorithm for the Global Optimization of MINLP Models Involving Concave and Bilinear Terms. Comput. Chem. Eng. 2008, 32, 477-493.
20. Wicaksono, D. S.; Karimi, I. A. Piecewise MILP Under- and Overestimators for Global Optimization of Bilinear Programs. AIChE J. 2008, 54 (4), 991-1008.
21. Adhya, N.; Sahinidis, N. V.; Tawarmalani, M. A Lagrangian Approach to the Pooling Problem. Ind. Eng. Chem. Res. 1999, 38, 1956-1972.
22. Audet, C.; Brimberg, J.; Hansen, P.; Le Digabel, S.; Mladenovic, N. Pooling Problem: Alternative Formulations and Solution Methods. Manage. Sci. 2004, 50, 761-776.
23. Audet, C.; Hansen, P.; Jaumard, B.; Savard, G. A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Math. Prog. 2000, 878 (1), 131-152.
24. Sahinidis, N. V. Global Optimization and Constraint Satisfaction: The Branch-and Reduce Approach. In Global Optimization and Constraint Satisfaction; Bliek, C., et al., Eds.; Springer: Berlin, 2003; pp 1-16.
25. Schrage, L. LINGO User's Guide; LINDO Systems Inc.: Chicago, IL, 2006.
26. Greenberg, H. J. Analysing the Pooling Problem. ORSA J. Comput. 1995, 7 (2), 205-217.