|
Descripción
|
|
|---|---|
| We consider a group decision-making problem where preferences given by the experts are articulated into the form of pairwise comparison matrices. In many cases, experts are not able to efficiently provide their preferences on some aspects of the problem because of a large number of alternatives, limited expertise related to some problem domain, unavailable data, etc., resulting in incomplete pairwise comparison matrices. Our goal is to develop a computational method to retrieve a group priority vector of the considered alternatives dealing with incomplete information. For that purpose, we have established an optimization problem in which a similarity function and a parametric compromise function are defined. Associated to this problem, a logarithmic goal programming formulation is considered to provide an effective procedure to compute the solution. Moreover, the parameters involved in the method have a clear meaning in the context of group problems. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
APPLIED MATHEMATICS AND COMPUTATION |
|
ISSN
|
0096-3003 |
|
Factor de impacto JCR
|
1,124 |
|
Información de impacto
|
|
|
Volumen
|
218 |
|
DOI
|
10.1016/j.amc.2011.05.094 |
|
Número de revista
|
|
|
Desde la página
|
514 |
|
Hasta la página
|
519 |
|
Mes
|
SEPTIEMBRE |
|
Ranking
|
|