Skip to Main content Skip to Navigation
Conference papers

Reduced RLT constraints for polynomial programming

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Tuesday, April 15, 2014 - 2:05:41 PM
Last modification on : Wednesday, October 27, 2021 - 3:00:43 PM
Long-term archiving on: : Tuesday, July 15, 2014 - 10:37:49 AM


Files produced by the author(s)


  • HAL Id : hal-00938438, version 1


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⟩



Les métriques sont temporairement indisponibles