Optimisation globale de polynômes en variables mixte-entières

Arnaud Lazare 1, 2
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : In this thesis, we are interested in the study of polynomial programs. These problems have many practical applications and are currently actively studied, but they remain very difficult and only small instances are addressed. In most of this manuscript, we study optimization problems with binary variables. We propose several convex reformulations for these problems. We first focus on linearizations by introducing the concept of q−linearization. Then, we apply convex reformulation to the polynomial problem. We then extend quadratic convex reformulation to the polynomial case. We propose several new reformulations that we compare to existing methods on instances of the literature. In particular we present method PQCR for unconstrained binary polynomial problems, which is able to solve several unsolved instances. We also propose a theoretical study to compare the different quadratic reformulations of the literature and then apply a convex reformulation to them. Finally, we consider more general problems and we propose a method to compute convex relaxations for problems with continuous variables.
Document type :
Complete list of metadatas

Cited literature [88 references]  Display  Hide  Download

Contributor : Amélie Lambert <>
Submitted on : Friday, January 31, 2020 - 1:45:36 PM
Last modification on : Wednesday, February 12, 2020 - 2:47:08 PM


Files produced by the author(s)


  • HAL Id : tel-02462537, version 1


Arnaud Lazare. Optimisation globale de polynômes en variables mixte-entières. Recherche opérationnelle [cs.RO]. École doctorale de mathématiques Hadamard (EDMH, ED 574), 2019. Français. ⟨tel-02462537⟩



Record views


Files downloads