Article ID: | iaor20073385 |
Country: | South Korea |
Volume: | 32 |
Issue: | 1 |
Start Page Number: | 42 |
End Page Number: | 50 |
Publication Date: | Jan 2006 |
Journal: | Journal of the Korean Institute of Industrial Engineers |
Authors: | Kim Sheung-Kown, Kim Jaehee, Cho Namwoong |
Keywords: | programming: integer |
The multi-criteria group decision making (MCGDM) problem is to determine the best compromise solution in a set of competing alternatives that are evaluated under conflicting criteria by decision makers (DMs). In this paper, we propose a mixed-integer programming (MIP) model to solve MCGDM. The existing method based on minimizing a distance measure such as Median Approach can not guarantee the best compromise solution because the element of median point vector is defined with respect to each criterion separately. However, by considering all criteria simultaneously, we generate median point that is better for locating the best compromise solution. We also utilize the concept of spatial dispersion index (SDI) to produce a threshold value, which is used as a guideline to choose either the Utopian Approach or the Median Approach. And we suggest using CBITP (Convex hull of individual maxima Based Interactive Tchebycheff Procedure) to provide DMs with various Pareto-optimal solutions so that DMs have broad range of selection.