A METHOD FOR OPTIMIZING OVER THE INTEGER EFFICIENT SET

摘要

In this paper, we are interested in optimizing a linear function on the set of efficient solutions of a Multiple Objective Integer Linear Programming problem (MOILP). We propose an exact algorithm for maximizing a linear function denoted ? on the set of efficient solutions of a MOILP problem without having to enumerate explicitly all the elements of this set. Two techniques are used: the first is to reduce progressively the admissible domain by adding more constraints eliminating all the dominated points by the current solution; the second, when the new solution obtained by maximizing the function ?in the reduced area is not efficient, an exploration procedure is applied over the edges incident to this solution in order to find new alternative efficient solutions if they exist. The algorithm produces not only an optimal value of the linear function but also a subset of non-dominated solutions in the direction of ? that can be helpful in the practice.