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

DOI10.1007/S11590-010-0228-4zbMath1211.90186OpenAlexW2013083658MaRDI QIDQ628648

Ignacio E. Grossmann, Juan P. Ruiz

Publication date: 14 March 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0228-4

zbMATH Keywords

global optimizationvector spacesprocess networksbilinear programstight formulations

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (10)

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques ⋮ Relaxations and discretizations for the pooling problem ⋮ Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems ⋮ QPLIB: a library of quadratic programming instances ⋮ Convexification of bilinear forms through non-symmetric lifting

Uses Software

• CONOPT

Cites Work

• Unnamed Item
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A new reformulation-linearization technique for bilinear programming problems
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• CONOPT—A Large-Scale GRG Code

This page was built for publication: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks