 |
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.
Cited literature [27 references]
https://hal-enac.archives-ouvertes.fr/hal-00938524
Contributor : Laurence Porte <>
Submitted on : Thursday, April 3, 2014 - 5:09:13 PM
Last modification on : Thursday, March 18, 2021 - 2:29:23 PM
Long-term archiving on: : Thursday, July 3, 2014 - 10:42:22 AM
Contributor : Laurence Porte <>
Submitted on : Thursday, April 3, 2014 - 5:09:13 PM
Last modification on : Thursday, March 18, 2021 - 2:29:23 PM
Long-term archiving on: : Thursday, July 3, 2014 - 10:42:22 AM
File
585.pdf
Files produced by the author(s)