Convexity of hesitant fuzzy sets based on aggregation functions
Computer Science and Information Systems, Tome 18 (2021) no. 1
Cet article a éte moissonné depuis la source Computer Science and Information Systems website
Convexity is one of the most important geometric properties of sets and a useful concept in many fields of mathematics, like optimization. As there are also important applications making use of fuzzy optimization, it is obvious that the studies of convexity are also frequent. In this paper we have extended the notion of convexity for hesitant fuzzy sets in order to fulfill some necessary properties. Namely, we have found an appropriate definition of convexity for hesitant fuzzy sets on any ordered universe based on aggregation functions such that it is compatible with the intersection, that is, the intersection of two convex hesitant fuzzy sets is a convex hesitant fuzzy set and it fulfills the cutworthy property.
Keywords:
hesitant fuzzy set, alpha-cut, aggregation function, convexity
@article{CSIS_2021_18_1_a11,
author = {Pedro Huidobro and Pedro Alonso and Vladim{\'\i}r Jani\v{s} and Susana Montes},
title = {Convexity of hesitant fuzzy sets based on aggregation functions},
journal = {Computer Science and Information Systems},
year = {2021},
volume = {18},
number = {1},
url = {http://geodesic.mathdoc.fr/item/CSIS_2021_18_1_a11/}
}
TY - JOUR AU - Pedro Huidobro AU - Pedro Alonso AU - Vladimír Janiš AU - Susana Montes TI - Convexity of hesitant fuzzy sets based on aggregation functions JO - Computer Science and Information Systems PY - 2021 VL - 18 IS - 1 UR - http://geodesic.mathdoc.fr/item/CSIS_2021_18_1_a11/ ID - CSIS_2021_18_1_a11 ER -
Pedro Huidobro; Pedro Alonso; Vladimír Janiš; Susana Montes. Convexity of hesitant fuzzy sets based on aggregation functions. Computer Science and Information Systems, Tome 18 (2021) no. 1. http://geodesic.mathdoc.fr/item/CSIS_2021_18_1_a11/