Article Dans Une Revue Mathematical Programming Computation Année : 2012

Extending the QCR method to the case of general mixed integer programs

Résumé

Let (MQP) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP), i.e. we reformulate (MQP) into an equivalent program, with a convex objective function. Such a reformulation can be solved by a standard solver that uses a branch and bound algorithm. We prove that our reformulation is the best one within a convex reformulation scheme, from the continuous relaxation point of view. This reformulation, that we call MIQCR (Mixed Integer Quadratic Convex Reformulation), is based on the solution of an SDP relaxation of (MQP). Computational experiences are carried out with instances of (MQP) including one equality constraint or one inequality constraint. The results show that most of the considered instances with up to 40 variables can be solved in one hour of CPU time by a standard solver.

Fichier principal
Vignette du fichier
Extending_the_QCR_method_to_general_mixed-integer_.pdf (281.31 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-01125718 , version 1 (27-11-2025)

Licence

Identifiants

Citer

Alain Billionnet, Sourour Elloumi, Amélie Lambert. Extending the QCR method to the case of general mixed integer programs. Mathematical Programming Computation, 2012, 131, pp.381-401. ⟨10.1007/s10107-010-0381-7⟩. ⟨hal-01125718⟩
242 Consultations
65 Téléchargements

Altmetric

Partager

  • More