An exact method for multiple objective mixed-integer linear programming problem

Abstract : In this article, we present an exact method to find all efficient solutions of the multi-objective mixed-integer linear programming problem (MOMILP). Based on the branching process and by using an efficient cut to find at each iteration a new efficient solution (if it exists), the proposed algorithm is able to identify all the efficient solutions of the MOMILP problem in a finite number of iterations.
Type de document :
Communication dans un congrès
ISOR, International Symposium on Operations Research, May 2011, Alger, Algeria. 2011
Liste complète des métadonnées

https://hal-imt.archives-ouvertes.fr/hal-01558055
Contributeur : Madani Bezoui <>
Soumis le : vendredi 7 juillet 2017 - 03:30:30
Dernière modification le : samedi 8 juillet 2017 - 01:03:31

Identifiants

  • HAL Id : hal-01558055, version 1

Collections

Citation

Salima Amrouche, Bezoui Madani, Moulaï Mustapha. An exact method for multiple objective mixed-integer linear programming problem. ISOR, International Symposium on Operations Research, May 2011, Alger, Algeria. 2011. 〈hal-01558055〉

Partager

Métriques

Consultations de la notice

36