Article ID: | iaor20141774 |
Volume: | 49 |
Issue: | 2 |
Start Page Number: | 97 |
End Page Number: | 106 |
Publication Date: | Sep 2014 |
Journal: | Computers and Operations Research |
Authors: | Vanderpooten Daniel, Galand Lucie, Belhoul Lyes |
Keywords: | programming: multiple criteria, optimization |
In this paper, we consider the problem of determining a best compromise solution for the multi‐objective assignment problem. Such a solution minimizes a scalarizing function, such as the weighted Tchebychev norm or reference point achievement functions. To solve this problem, we resort to a ranking (or