Interactive Methods in Multiobjective Linear Programming

Abstract

In multiobjective programming problems, the methods dedicated to the generation of the whole set of nondominated solutions are in most cases inadequate from a practical point of view. In general, in real world models, the computational burden required for computing the entire set of nondominated solutions is too high. Moreover, proposing hundreds or thousands of solutions to a decision maker (DM) is not useful for the exploitation of results in practice, even limiting the computation to a subset of the nondominated solutions, for instance vertices of the feasible region in MOLP problems.