Piecewise linear relaxation of bilinear programs using bivariate partitioning

AIChE Journal

Volumn 56, Issue 7, 2010, Pages 1880-1893

  Hasan, M M Faruque ^a   Karimi, I A ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bilinear program; Bivariate partitioning; Global optimization; Piecewise under and overestimators; Process network synthesis

Indexed keywords

AB INITIO; BILINEAR PROGRAM; BIVARIATE; CONVEX COMBINATIONS; GLOBAL SOLVERS; GRID POINTS; INCREMENTAL COST; NUMERICAL COMPARISON; PIECE-WISE; PIECEWISE LINEAR; PROCESS NETWORKS; PROCESS SYNTHESIS; RELAXATION MODELS; SEGMENT LENGTHS; SPECIAL ORDERED SETS; SYNTHESIS PROBLEMS; UNIVARIATE;

OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES;

GLOBAL OPTIMIZATION;

EID: 77955798717     PISSN: 00011541     EISSN: 15475905     Source Type: Journal    
DOI: 10.1002/aic.12109     Document Type: Article

References (41)

1. Meyer CA, Floudas CA. Global optimization of a combinatorially complex generalized pooling problem. AIChE J. 2006;52:1027-1037.
2. Karuppiah R, Grossmann IE. Global optimization for the synthesis of integrated water systems in chemical processes. Comput Chem Eng. 2006;30:650-673.
3. Takama N, Kuriyama Y, Shiroko K, Umeda T. Optimal water allocation in a petrochemical refinery. Comput Chem Eng. 1980;4:251-258.
4. Björk KJ, Westerlund T. Global optimization of heat exchanger network synthesis problems with and without the isothermal mixing assumption. Comput Chem Eng. 2002;26:1581-1593.
5. Hasan MMF, Karimi IA, Alfadala HE, Grootjans H. Operational modeling of multi-stream heat exchangers with phase changes. AIChE J. 2009;55:150-171.
6. Haverly CA. Studies of the behaviour of recursion for the pooling problem. ACM SIGMAP Bull. 1978;25:19-28.
7. Pham V, Laird C, El-Halwagi M. Convex hull discretization approach to the global optimization of pooling problems. Ind Eng Chem Res. 2009;48:1973-1979.
8. Reddy PCP, Karimi IA, Srinivasan R. A Novel solution approach for optimizing crude oil operations. AIChE J. 2004;50:1177-1197.
9. Li J, Li W, Karimi IA, Srinivasan R. Improving the robustness and efficiency of crude scheduling algorithms. AIChE J. 2007;53:2659-2680.
10. Li J, Karimi IA, Srinivasan R. Recipe determination and scheduling of gasoline blending and distribution operations. AIChE J. 2009, In Press.
11. Floudas, CA, Pardalos PM, Adjiman CS, Esposito WR, Gumus ZH, Harding ST, Klepeis JL, Meyer CA, Schweiger CA. Handbook of Test Problems in Local and Global Optimization. Dordrecht, The Netherlands: Kluwer Academic, 1999.
12. Hasan MMF, Karimi IA. Optimal synthesis of fuel gas networks. Paper Presented at the INFORMS Annual Meeting, Washington, DC, USA, October 12-15, 2008.
13. Floudas CA. Deterministic Global Optimization: Theory, Methods, and Applications. Dordrecht, The Netherlands: Kluwer Academic, 2000.
14. GrossmannIE, editor. Global Optimization in Engineering Design. Dordrecht, The Netherlands: Kluwer Academic, 1996.
15. Tawarmalani M, Sahinidis NV. Convexification and Global Optimization in Continuous and Mixed-integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Dordrecht, The Netherlands: Kluwer Academic, 2002.
16. FloudasCA, Pardalos PM, editors. Frontiers in Global Optimization. Dordrecht, The Netherlands: Kluwer Academic, 2004.
17. Horst R, Tuy H. Global Optimization: Deterministic Approaches, 2nd ed. Germany: Springer-Verlag, 1993.
18. Tuy H. Convex Analysis and Global Optimization. Dordrecht, The Netherlands: Kluwer Academic, 1998.
19. McCormick GP. Computability of global solutions to factorable nonconvex programs, Part I: Convex underestimating problems. Math Program. 1976;10:146-175.
20. Al-Khayyal FA, Falk JE. Jointly constrained biconvex programming. Math Oper Res. 1983;8:273-286.
21. Foulds LR, Haughland D, Jornsten K. A bilinear approach to the pooling problem. Optimization. 1992;24:165-180.
22. Ben-Tal A, Eiger G, Gershovitz V. Global minimization by reducing duality gap. Math Program. 1994;63:193-212.
23. Adhya N, Tawarmalani M, Sahinidis NV. A Lagrangian approach to the pooling problems. Ind Eng Chem Res. 1999;38:1956-1972.
24. Quesada I,Grossmann IE.Global optimization of bilinear process networks withmulticomponent flows. Comput Chem Eng. 1995;19:1219-1242.
25. Bergamini ML, Aguirre PA, Grossmann IE. Logic-based outer approximation for globally optimal synthesis of process networks. Comput Chem Eng. 2005;29:1914-1933.
26. Wicaksono DS, Karimi IA. PiecewiseMILP under- and overestimators for global optimization of bilinear programs. AIChE J. 2008;54:991-1008.
27. Wicaksono DS, Karimi IA. Modeling piecewise under- and overestimators for bilinear process network synthesis via mixed-integer linear programming. Paper Presented at the 18th European Symposium on Computer-Aided Process Engineering-ESCAPE18, Lyon, France, June 1-4, 2008.
28. Bergamini ML, Scenna NJ, Aguirre PA. Global optimal structures of heat exchanger networks by piecewise relaxation. Ind Eng Chem Res. 2007;46:1752-1763.
29. Misener R, Gounaris CF, Floudas CA. Global optimization of gas lifting operations: a comparative study of piecewise linear formulations. Ind Eng Chem Res. 2009;48:6098-6104.
30. Keha AB, de Farias IR Jr, Nemhauser GL. Models for representing piecewise linear cost functions. Oper Res Lett. 2004;32:44-48.
31. Beale ELM, Tomlin JA. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence J, editor. Proceedings of the Fifth International Conference on Operations Research. London: Tavistock Publications, 1970, pp. 447-454.
32. Gounaris CE, Misener R, Floudas CA. Computational comparison of piecewise-linear relaxations for pooling problems. Ind Eng Chem Res. 2009;48:5742-5766.
33. Androulakis IP, Maranas CD, Floudas CA. αBB: a global optimization method for general constrained nonconvex problems. J Global Optim. 1995;7:337-363.
34. Padberg MW. Approximating separable nonlinear functions via mixed zero-one programs. Oper Res Lett. 2000;27:1-5.
35. Wolsey LA. Mixed integer programming for production planning and scheduling. In Proceedings of Foundations of Computer-Aided Process Operations (FOCAPO2008), Cambridge, Massachusetts, USA, June 29-July 2, 2008.
36. GAMS Development Corporation. CPLEX, GAMS: the Solver Manuals. Available at: http://www.gams.com/dd/docs/solvers/cplex.pdf. Accessed 2005.
37. Balas E. Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl Math. 1998;89:3-44.
38. Yee TF, Grossmann IE, Kravanja Z. Simultaneous optimization models for heat integration-I. Area and energy targeting and modeling of multi-stream exchangers. Comput Chem Eng. 1990;14:1151-1164.
39. Tawarmalani M, Ahmed S, Sahinidis NV. Product disaggregation in global optimization and relaxations of rational programs. J Global Optim. 2002;3:281-303.
40. Liberti L, Pantelides CC. An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J Global Optim. 2006;36: 161-189.
41. Liu Y, Karimi IA. Scheduling multistage, multiproduct batch plants with nonidentical parallel units and unlimited intermediate storage. Chem Eng Sci. 2007;62:1549-1566.