Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes

Convex underestimators of nonconvex functions, frequently used in deterministic global optimization algorithms, strongly influence their rate of convergence and computational efficiency. A good convex underestimator is as tight as possible and introduces a minimal number of new variables and constra...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 29; no. 2; pp. 125 - 155
Main Authors Meyer, Clifford A, Floudas, Christodoulos A
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Nature B.V 01.06.2004
Subjects
Chemical engineering
Linear equations
Optimization algorithms
Signs
Studies
Variables
Online AccessGet full text

Cover

More Information
Summary:Convex underestimators of nonconvex functions, frequently used in deterministic global optimization algorithms, strongly influence their rate of convergence and computational efficiency. A good convex underestimator is as tight as possible and introduces a minimal number of new variables and constraints. Multilinear monomials over a coordinate aligned hyper-rectangular domain are known to have polyhedral convex envelopes which may be represented by a finite number of facet inducing inequalities. This paper describes explicit expressions defining the facets of the convex and concave envelopes of trilinear monomials over a box domain with bounds of opposite signs for at least one variable. It is shown that the previously used approximations based on the recursive use of the bilinear construction rarely yield the convex envelope itself.
ISSN:0925-5001
1573-2916
DOI:10.1023/B:JOGO.0000042112.72379.e6