Multi-choice goal programming with utility functions
Multi-choice goal programming with utility functions
复制标题
DOI:
10.1016/j.ejor.2011.06.041
复制
发表时间:
2011-12-01
影响因子:
6.4
通讯作者:
Chang, Ching-Ter
中科院分区:
文献类型:
--
作者:
Chang, Ching-Ter
Goal programming (GP) has been, and still is, the most widely used technique for solving multiple-criteria decision problems and multiple-objective decision problems by finding a set of satisfying solutions. However, the major limitation of goal programming is that can only use aspiration levels with scalar value for solving multiple objective problems. In order to solve this problem multi-choice goal programming (MCGP) was proposed by Chang (2007a). Following the idea of MCGP this study proposes a new concept of level achieving in the utility functions to replace the aspiration level with scalar value in classical GP and MCGP for multiple objective problems. According to this idea, it is possible to use the skill of MCGP with utility functions to solve multi-objective problems. The major contribution of using the utility functions of MCGP is that they can be used as measuring instruments to help decision makers make the best/appropriate policy corresponding to their goals with the highest level of utility achieved. In addition, the above properties can improve the practical utility of MCGP in solving more real-world decision/management problems. (C) 2011 Elsevier B.V. All rights reserved.