Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks

Optimization Letters

Volumn 5, Issue 1, 2011, Pages 1-11

  Ruiz, Juan P ^a   Grossmann, Ignacio E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Bilinear programs; Global optimization; Process networks; Tight formulations; Vector spaces

Indexed keywords

BRANCH AND BOUND METHOD; GLOBAL OPTIMIZATION; RELAXATION PROCESSES;

CONVEX ENVELOPE; CONVEX RELAXATION; LINEAR TERMS; PROCESS NETWORKS; QUADRATIC CONSTRAINT; SPATIAL BRANCH AND BOUNDS; TIGHT FORMULATIONS; TRADITIONAL APPROACHES;

VECTOR SPACES;

EID: 85027935450     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0228-4     Document Type: Article

References (14)

1. Quesada I., Grossmann I. E.: Global optimization of bilinear process networks with multicomponent flows. Comput. Chem. Eng. 19(12), 1219-1242 (1995).
2. Horst R., Tuy H.: Global Optimization Deterministic Approaches, 3rd edn. Springer-Verlag, Berlin (1996).
3. McCormick G. P.: Computability of global solutions to factorable nonconvex programs. Part I: convex underestimating problems. Math. Program. 10, 146-175 (1976).
4. Tawarmalani M., Sahinidis N.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Kluwer Academic Publishers, Dordrecht (2002).
5. Anstreicher K. M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2-3), 471-484 (2009).
6. Narasimhan S.: Data Reconciliation & Gross Error Detection: An Intelligent Use of Process Data. Gulf Professional Publishing, Houston (2001).
7. Zamora J. M., Grossmann I. E.: A branch and bound algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Glob. Optim. 14(3), 217-249 (1999).
8. Drud S. A.: CONOPT-a large-scale GRG code. ORSA J. Comput. 6, 207-216 (1992).
9. Sherali H. D., Alameddine A.: A new reformulation linearization technique for bilinear programming problems. J. Glob. Optim. 2, 379-410 (1992).
10. Kreiszig E.: Advanced Engineering Mathematics. Wiley, New York (2001).
11. Al-Khayyal F. A., Falk J. E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273-286 (1983).
12. Liberti L., Pantelides C. C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Glob. Optim. 36(2), 161-189 (2006).
13. Gounaris C. E., Misener R., Floudas C. A.: Computational comparison of piecewise-linear relaxations for pooling problems. Ind. Eng. Chem. Res. 48(12), 5742-5766 (2009).
14. Wicaksono D. S., Karimi I. A.: Piecewise MILP under- and overestimators for global optimization of bilinear programs. AICHE J. 54, 991-1008 (2008).