A Special Multi-Objective Assignment Problem

Abstract

The following assignment problem is considered. There are n activities to be assigned to n personnel. The cost of assigning activity i to person j is c _ij . It is required to find all the efficient assignments, i.e. those for which there exists no other assignment which has at least as small costs for each person and strictly smaller costs for at least one person. The main results are as follows. In Theorem 1 it is shown that whereas, for many integer problems, the standard scalar weighting factor approach will not produce all the efficient solutions, in this case it will. In Theorem 2 it is shown that when each efficient vector is determined by a single assignment solution, the efficient set is identical to the set of efficient vertices of the convex hull of the assignment solution set.