Skip to Main content Skip to Navigation
Conference papers

Reduced RLT constraints for polynomial programming

Sonia Cafieri 1 Pierre Hansen 2 Lucas Létocart 3 Leo Liberti 4 Frédéric Messine 5
1 ENAC - Ecole Nationale de l'Aviation Civile
2 HEC Montréal - HEC Montréal
3 LIPN - Laboratoire d'Informatique de Paris-Nord
4 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
5 ENSEEIHT - Ecole Nationale Supérieure d'Electrotechnique, d'Electronique, d'Informatique, d'Hydraulique et de Télécommunications
Abstract : An extension of the reduced Reformulation-Linearization Technique constraints from quadratic to general polynomial programming problems with linear equality constraints is presented and a strategy to improve the associated convex relaxation is proposed.
Keywords : polynomial MINLP sBB convex relaxation RLT
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
https://hal-enac.archives-ouvertes.fr/hal-00938438
Contributor : Laurence Porte <>
Submitted on : Tuesday, April 15, 2014 - 2:05:41 PM
Last modification on : Thursday, August 26, 2021 - 2:36:02 PM
Long-term archiving on: : Tuesday, July 15, 2014 - 10:37:49 AM

File

Vignette du document
170.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00938438, version 1

Collections

MAIAA-OPTIM | INSMI | ENAC | UNIV-PARIS13 | CNRS | LIX | X-LIX | X | LIPN | TDS-MACS | USPC | X-DEP-INFO | GALILE | SORBONNE-PARIS-NORD

Citation

Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine. Reduced RLT constraints for polynomial programming. EWMINLP10, European Workshop on Mixed Integer Nonlinear Programming, Apr 2010, Marseille, France. pp 205-207. ⟨hal-00938438⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

565

Files downloads

211