Consistency-based algorithms to estimate missing elements for uncertain 2-tuple linguistic preference relations

DOI

10.1080/18756891.2013.856254How to use a DOI?

Keywords

uncertain linguistic preference relation, 2-tuple linguistic, incomplete preference relation, additive consistency, goal programming

Abstract

For actual decision making problems, decision makers sometimes may have difficulty to provide all the preference information over alternatives through pairwise comparisons. In this paper, we focus on estimating missing elements for an incomplete uncertain 2-tuple linguistic preference relation. First, the additive consistency of an uncertain 2-tuple linguistic preference relation is defined. Based on the defined additive consistency, we define acceptable incomplete uncertain 2-tuple linguistic preference relation and propose two new algorithms, including an iterative algorithm and an optimization-based algorithm to estimate the missing elements for an uncertain 2-tuple linguistic preference relation. Finally, some numerical examples are presented to illustrate the applicability of the two algorithms.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Zhen Zhang
AU  - Chonghui Guo
PY  - 2014
DA  - 2014/10/01
TI  - Consistency-based algorithms to estimate missing elements for uncertain 2-tuple linguistic preference relations
JO  - International Journal of Computational Intelligence Systems
SP  - 924
EP  - 936
VL  - 7
IS  - 5
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.856254
DO  - 10.1080/18756891.2013.856254
ID  - Zhang2014
ER  -