It is well known that, under very weak assumptions, multiobjective optimization problems admit (1+ε,⋯,1+ε)-approximation sets (also called ε-Pareto sets ) of polynomial cardinality (in the size of the instance and in 1ε). While an approximation guarantee of 1+εfor any ε0is the best one...

It is well known that, under very weak assumptions, multiobjective optimization problems admit (1+ε,⋯,1+ε)-approximation sets (also called ε-Pareto sets ) of polynomial cardinality (in the size of the instance and in 1ε). While an approximation guarantee of 1+εfor any ε0is the best one...

The goal of this thesis is to propose new general methods to get around the intractability of multi-objective optimization problems.First, we try to give some insight on this intractability by determining an, easily computable, upper bound on the number of nondominated points, knowing the number...