An improved interactive method for the multi-objective linear programming problem based on the maximally changeable dominance cone

This work has improved the method of Kim and Gal's in requiring less response of the DM (decision maker) and ease of reply. The underlying notion is the MCDC (maximally changeable dominance cone) for describing all efficient solutions under the particular preference structure. According to the DM's partial preference expression, enlarging the MCDC is achieved, which results in reducing the solutions needed to take into consideration. The cone generators corresponding to the DM's response are added to the MCDC, which results in the MCDC being enlarged. Adopting the scheme of pairwise comparison as a means of acquiring preference attitude, an improved interactive method is proposed. And also, a scheme of choosing a reference point is suggested to achieve the computational efficiency.