 |
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
 |
|
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
|
| HAL : hal-00421760, version 1 |
| DOI : 10.1007/978-3-540-68891-4_2 |
| Fiche détaillée |  Récupérer au format |
 |
| 13th International Conference, IPCO 2008, Bertinoro, Italy : France (2008) |
|
|
|
|
| Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs |
|
|
| Anureet Saxena 1Pierre Bonami 2 |
|
|
| (24/05/2008) |
|
|
|
| his paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and non-convex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the lift-and-project methodology. In particular, we propose new methods for generating valid inequalities by using the equation Y = x x T . We use the concave constraint xx^T - Y psd to derive disjunctions of two types. The first ones are directly derived from the eigenvectors of the matrix Y − x x^T with positive eigenvalues, the second type of disjunctions are obtained by combining several eigenvectors in order to minimize the width of the disjunction. We also use the convex SDP constraint Y - xx^T psd to derive convex quadratic cuts and combine both approaches in a cutting plane algorithm. We present preliminary computational results to illustrate our findings. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Tepper School of Business |
|
|
|
Carnegie Mellon University |
|
|
| 2 : | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
| 3 : | IBM Watson Research Center |
|
|
|
IBM |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Recherche opérationnelle Mathématiques/Optimisation et contrôle |
| hal-00421760, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00421760 | |
| oai:hal.archives-ouvertes.fr:hal-00421760 | |
| Contributeur : Pierre Bonami | |
| Soumis le : Samedi 3 Octobre 2009, 13:30:41 | |
| Dernière modification le : Samedi 3 Octobre 2009, 13:40:45 | |
