| HAL : hal-00423416, version 2 |
| Fiche détaillée | Récupérer au format |
|
|
| Versions disponibles : | v1 (09-10-2009) | v2 (15-10-2009) |
|
|
|
|
| Algorithms and Software for Convex Mixed Integer Nonlinear Programs |
|
|
| Pierre Bonami 1Mustafa Kilinç 2 |
|
|
| (07/10/2009) |
|
|
| This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have received sustained attention in very years. By exploiting analogies to the case of well-known techniques for solving mixed integer linear programs and incorporating these techniques into the software, significant improvements have been made in our ability to solve the problems. |
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
| CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I | |
| 2 : | Department of Industrial and Systems Engineering [Wisconsin-Madison] (ISyE) |
| University of Wisconsin-Madison | |
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Recherche opérationnelle Mathématiques/Optimisation et contrôle |
|
|
| Mixed Integer Nonlinear Programming – Branch and Bound |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00423416, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00423416 | |
| oai:hal.archives-ouvertes.fr:hal-00423416 | |
| Contributeur : Pierre Bonami | |
| Soumis le : Jeudi 15 Octobre 2009, 13:13:29 | |
| Dernière modification le : Jeudi 15 Octobre 2009, 16:51:57 | |