REVIEW OF MODELING PREFERENCES FOR DECISION MODELS

A group decision problem is set in environments where there is a common issue to solve, a set of possible options to choose, and a set of individuals who are experts and express their opinions about the set of possible alternatives with the intention to reach a collective decision as the unique solution of the problem in question. The modeling of the preferences of the decision-maker is an essential stage in the construction of models used in the theory of decision, operations research, economics, etc. On decision problems experts use models of representation of preferences that are close to their disciplines or fields of work. The structures of information most commonly used for the representation of the preferences of experts are vectors of utility, orders of preference and preference relations. In decision problems, the expression of preferences domain is the domain of information used by the experts to express their preferences, the main are numerical, linguistic, and intervalar stressing the multi-granular linguistic. This paper is a review of these concepts. Its purpose is to provide a guide of bibliographic references for these concepts, which are briefly discussed in this document

A multi-step goal programming approach for group decision making with incomplete interval additive reciprocal comparison matrices

This article presents a goal programming framework to solve group decision making problems where decision-makers’ judgments are provided as incomplete interval additive reciprocal comparison matrices (IARCMs). New properties of multiplicative consistent IARCMs are put forward and used to define consistent incomplete IARCMs. A two-step goal programming method is developed to estimate missing values for an incomplete IARCM. The first step minimizes the inconsistency of the completed IARCMs and controls uncertainty ratios of the estimated judgments within an acceptable threshold, and the second step finds the most appropriate estimated missing values among the optimal solutions obtained from the previous step. A weighted geometric mean approach is proposed to aggregate individual IARCMs into a group IARCM by employing the lower bounds of the interval additive reciprocal judgments. A two-step procedure consisting of two goal programming models is established to derive interval weights from the group IARCM. The first model is devised to minimize the absolute difference between the logarithm of the group preference and that of the constructed multiplicative consistent judgment. The second model is developed to generate an interval-valued priority vector by maximizing the uncertainty ratio of the constructed consistent IARCM and incorporating the optimal objective value of the first model as a constraint. Two numerical examples are furnished to demonstrate validity and applicability of the proposed approach