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.
Document type :
Conference papers
Complete list of metadatas

https://hal-imt.archives-ouvertes.fr/hal-01558055
Contributor : Madani Bezoui <>
Submitted on : Friday, July 7, 2017 - 3:30:30 AM
Last modification on : Saturday, July 8, 2017 - 1:03:31 AM

Identifiers

  • 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. ⟨hal-01558055⟩

Share

Metrics

Record views

91