Journal's Facebook pageConvexity of hesitant fuzzy sets based on aggregation functions
- Dept. of Statistics and Operational Research
University of Oviedo, Spain
{huidobropedro,montes}@uniovi.es - Dept. of Mathematics
University of Oviedo, Spain
palonso@uniovi.es - Dept. of Mathematics
Matej Bel University, Slovakia
vladimir.janis@umb.sk
Abstract
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.
Key words
hesitant fuzzy set, alpha-cut, aggregation function, convexity
Digital Object Identifier (DOI)
https://doi.org/10.2298/CSIS200428045H
Publication information
Volume 18, Issue 1 (January 2021)
Year of Publication: 2021
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium
Full text
Available in PDF
Portable Document Format
How to cite
Huidobro, P., Alonso, P., Janiš, V., Montes, S.: Convexity of hesitant fuzzy sets based on aggregation functions. Computer Science and Information Systems, Vol. 18, No. 1, 213–230. (2021), https://doi.org/10.2298/CSIS200428045H
