Skip to Main content Skip to Navigation
Conference papers

Compact relaxations for polynomial programming problems

Abstract : Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer) quadratic programming problems subject to systems of linear equality constraints. We present an extension to the general case of polynomial programming problems and discuss the derived convex relaxation. We then show how to perform rRLT constraint generation so as to reduce the number of inequality constraints in the relaxation, thereby making it more compact and faster to solve. We present some computational results validating our approach.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 5:09:13 PM
Last modification on : Tuesday, October 19, 2021 - 2:24:12 PM
Long-term archiving on: : Thursday, July 3, 2014 - 10:42:22 AM


Files produced by the author(s)



Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine. Compact relaxations for polynomial programming problems. SEA 2012, 11th International Symposium on Experimental Algorithms, Jun 2012, Bordeaux, France. pp 75-86, ⟨10.1007/978-3-642-30850-5_8⟩. ⟨hal-00938524⟩



Record views


Files downloads