On the composition of convex envelopes for quadrilinear terms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

On the composition of convex envelopes for quadrilinear terms

(1) , (2) , (3) , (4) , (5)
1
2
3
4
5

Résumé

Within the framework of the spatial Branch-and-Bound algorithm for solving Mixed-Integer Nonlinear Programs, different convex relaxations can be obtained for multilinear terms by applying associativity in different ways. The two groupings ((x1x2)x3)x4 and (x1x2x3)x4 of a quadrilinear term, for example, give rise to two different convex relaxations. In [6] we prove that having fewer groupings of longer terms yields tighter convex relaxations. In this paper we give an alternative proof of the same fact and perform a computational study to assess the impact of the tightened convex relaxation in a spatial Branch-and-Bound setting.
Fichier principal
Vignette du fichier
332.pdf (112.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00941976 , version 1 (04-03-2014)

Identifiants

  • HAL Id : hal-00941976 , version 1

Citer

Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew Miller. On the composition of convex envelopes for quadrilinear terms. COSC 2011, International Conference on Optimization, Simulation and Control, Dec 2011, Berlin, Germany. pp xxxx. ⟨hal-00941976⟩
146 Consultations
174 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More