摘要

Multiple attribute group decision-making (MAGDM) problems with incomplete preference information are important research topics in decision analysis. This paper proposes a new approach to solve the problem, in which the preference information on attribute values of alternatives and attribute weights provided by decision makers (DMs) is incomplete. The incomplete information constructs a region of linear constraints. In the approach, firstly, several linear programming models are constructed to transform the MAGDM problem with incomplete information into the MAGDM problem with interval numbers. Then, a goal programming model is used to assess the maximum possible interval of group overall values of alternatives. Based on the definition of possible degree of one interval number is greater than. the other one, ranking of the alternatives or selection of the most desirable alternative(s) is (are) obtained. Finally, a numerical example is given to illustrate the approach proposed in this paper.