Aarhus University Seal / Aarhus Universitets segl

An overview of solution methods for multi-objective mixed integer linear programming programs

Research output: Contribution to conferencePaperResearchpeer-review

  • Kim Allan Andersen
  • Thomas Riis Stidsen, Department of Informatics and Mathematical Modeling, Denmark
Multiple objective mixed integer linear programming (MOMIP)
problems are notoriously hard to solve to optimality, i.e.
finding the complete set of non-dominated solutions. We will
give an overview of existing methods. Among those are
interactive methods, the two phases method and enumeration
methods. In particular we will discuss the existing branch and
bound approaches for solving multiple objective integer
programming problems. Despite the fact that branch and bound
methods has been applied successfully to integer programming
problems with one criterion only a few attempts has been made
to solve MOMIP problems.
Original languageEnglish
Publication year2011
Publication statusPublished - 2011
EventThe 21st International Conference on Multiple Criteria Decision Making - Jyväskylä, Finland
Duration: 12 Jun 201117 Jun 2011


ConferenceThe 21st International Conference on Multiple Criteria Decision Making

See relations at Aarhus University Citationformats

ID: 34259466