Reduced RLT constraints for polynomial programming
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...