Test-sets for multi-objective Linear Integer Programming

J. M. Ucha, M. I. Hartillo, H. Jimenez

We propose a new algebraic approach to deal with Multi-objective Integer Linear Programming problems (MILP). We use the epsilon-constraint strategy, and we explain how to use Gröbner bases in order to compute a test-set that is valid to solve the single objective problems that arise with the classical method.

In the bi-objective case, the computation of the complete Pareto optima set can be done essentially in a single process of reduction/division. The computational experiments have been promising.

Keywords: MULTI-OBJECTIVE, INTEGER PROGRAMMING; ALGEBRAIC METHODS

Scheduled

ThA2 Multiobjective optimization
June 2, 2016  9:00 AM
Sala de pinturas

Other papers in the same session

Designing Health care appointment systems using GA and SA

M. Al Refaei, T. Sulaiman, A. Isa Aliyu

A bi-objective mixed integer programming approach for air conflict resolution under uncertainty

J. Omer, T. Lehouillier, M. I. Nasri, F. Soumis, G. Desaulniers

Latest news

  • 1/8/16
    Paper submission is open
  • 1/8/16
    Registration is open

Organizers

Sponsors

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.