Next Article in Journal
Pedestrian Detection under Parallel Feature Fusion Based on Choquet Integral
Previous Article in Journal
Initial Value Acceleration-Based Alternating Minimization Algorithm for Dynamic Sub-Connected Hybrid Precoding in Millimeter Wave MIMO Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Complex q-Rung Orthopair Uncertain Linguistic Partitioned Bonferroni Mean Operators with Application in Antivirus Mask Selection

1
Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li, Taoyuan 32023, Taiwan
2
Department of Mathematics and Statistics, International Islamic University Islamabad, Islamabad 44000, Pakistan
*
Author to whom correspondence should be addressed.
Submission received: 19 January 2021 / Revised: 29 January 2021 / Accepted: 30 January 2021 / Published: 2 February 2021

Abstract

:
In this paper, complex q-rung orthopair uncertain linguistic sets (CQROULSs) for handling multi-attribute decision making (MADM) issues are proposed so that the assessed estimation of each trait can be presented by CQROULS. Another aggregation operator, called the partitioned Bonferroni mean (PBM) operator, is then considered to manage the circumstances under fuzziness. At that point, the PBM operator is stretched out to CQROULSs in which a complex q-rung orthopair uncertain linguistic partitioned Bonferroni mean (CQROULPBM) operator is then proposed. To wipe out the negative impact of preposterous assessment estimations of characteristics on total outcomes, complex q-rung orthopair uncertain linguistic weighted partitioned Bonferroni mean (CQROULWPBM) operator is further considered. These properties, idempotency, boundedness, and commutativity of the CQROULWPBM operator are obtained. The proposed CQROULSs with the CQROULWPBM operator is novel and important for MADM issues. Finally, an MADM based on CQROULSs is constructed with a numerical case given to delineate the proposed approach and then applied for selecting an antivirus mask for the COVID-19 pandemic. The advantages and comparative analysis with graphical interpretation of the explored operators are also presented to demonstrate the effectiveness and usefulness of the proposed method.

1. Introduction

Multi-attribute decision making (MADM) issues are inescapable in the field of board science. In numerous functional applications, MADM techniques have a significant effect on the procedure used to take care of such issues. Most existing strategies say that a better way to pick better and appropriate electives depends on decision-makers’ (DMs) assessment data. Notwithstanding, due to the intricate outer decision-making condition and the abstract vulnerability of DMs, it is difficult for DMs to clarify their genuine inclination data plainly. In this sense, Zadeh [1] first coined fuzzy sets (FSs) to clarify imprecision and dubiousness during assessment procedures. Until now, FSs have been examined and applied to different fields by an enormous number of scientists. Numerous speculations of FSs had then proposed for different application conditions, for example, intuitionistic FSs (IFSs) [2] with applications [3,4,5] and Pythagorean FSs [6] with applications [7,8]. As of late, in light of the possibility of the q-rung refutation and the IFS, Yager [9] explored another broad type of orthopair FSs (OFSs), called q-rung orthopair FSs (QROFSs). Like different OFSs, the QROFSs are additionally described by sets of esteems in the unit stretch α   and   β , where α     0 ,   1 and β     0 ,   1 , separately, indicate the supporting degree and the supporting against degree. However, they require the limitation that the aggregate of the qth intensity of them is not exactly or equivalent to one. Clearly, the requirements of the QROFSs are incredibly discharged. It tends to be effectively seen that as q expands, the scope of conceivable enrollment reviews too increases. Along these lines, the QROFSs are a general and incredible displaying apparatus that can portray DMs’ actual feelings in bigger practicable enrollment reviews, and manage the cost of more prominent adaptability for DMs in communicating judgment deftly under complex choice circumstances. In the last few year, many scholars have utilized it in the environment of different fields [10,11,12].
From the above far-reaching studies and decision-making processes, it is concluded that their entrance is constrained to deal with just vulnerability in the information, yet at the same time neglects management of its changes at a given period of time. To broaden the scope of supporting grade reaching out from a genuine subset to the unit plate of the mind boggling plane, complex FS (CFS) was proposed by Ramot et al. [13]. Additionally, the theory of complex IFS (CIFS) was presented by Alkouri and Salleh [14] to provide a wide range to a decision-maker to make a decision. CIFS composes the grade of supporting and the grade of supporting against in the form of a complex number belonging to a unit disc in a complex plane. The limitations of CIFS is that the sum of the real part (also for the imaginary part) of the both grades cannot exceed from a unit interval. However, there a still a problem, if a decision-maker gives such kinds of values to both grades, whose sum is exceeded from a unit interval. To cope with such kind of issues, the theory of complex PFS (CPFS) was explored by Ullah et al. [15], with a condition that the sum of the squares of the real part (also for imaginary part) of the both grades cannot be exceeded from a unit interval. The theories of CIFS and CPFS again fail, when a decision-maker provides such kind of values, whose sum of the squares of the real part (also for the imaginary part) of the both grades exceeds the unit interval. To cope with such kind of issues, the theory of complex QROFS (CQROFS) was proposed by scholars, such as Liu et al. [16,17] and Garg et al. [18]. The CQROFS is extensive, proficient, and more reliable than existing notions like CIFS and CPFS to cope with uncertain and unpredictable information in realistic decision issues.
In numerous genuine issues, it is difficult for DMs to give their evaluations in quantitative articulations. For instance, when a specialist assesses an up-and-comer’s degree of proficient capability, they may feel increasingly helpful or progressively acquainted with utilizing semantic terms, for example, “excellent”, “great”, or “medium”, to communicate their judgment. The theory of linguistic variables were presented by Zadeh [19]; Xu [20] discovered uncertain linguistic sets. Liu and Jin [21] explored some aggregation operators based on intuitionistic fuzzy uncertain linguistic sets, and Lu and Wei [22] considered Pythagorean uncertain linguistic aggregation operators. Liu et al. [23] presented the q-rung orthopair uncertain linguistic aggregation operators and their application in MADM problem. To broad the scope of the supporting grade reaching out from the unit plate in the form of complex number belonging to unit disc in a complex plane, we propose complex q-rung orthopair uncertain linguistic sets (CQROULSs) in this paper. We use CQROULSs for handling MADM issues as the assessed estimation of each trait and then propose the complex q-rung orthopair uncertain linguistic partitioned Bonferroni mean (CQROULPBM) operator. The contributions of the paper are summarized as follows:
  • To propose CQROULSs that can present the assessed estimation of each trait in MADM issues.
  • To give the CQROULPBM and CQROULWPBM operators with properties of idempotency, boundedness, and commutativity.
  • To construct a novel MADM method based on CQROULSs and the CQROULWPBM operator.
  • To apply the created MADM method in antivirus mask selection.
Furthermore, we may use the fuzzy symmetry concept [24,25] for the proposed CQROULSs and operators so that we can have more uncertain linguistic applications in symmetry.
The rest of this article is organized as follows. In Section 2, we review some basic notions, such as linguistic term set (LTS), uncertain linguistic variable (ULV), complex q-rung orthopair fuzzy sets (CQROFSs), and their operational laws. In Section 3, the notion of complex q-rung orthopair uncertain linguistic sets (CQROULSs) and their fundamental laws are considered. In Section 4, the partitioned Bonferroni mean (PBM) operators based on CQROULSs, called complex q-rung orthopair uncertain linguistic partitioned Bonferroni mean (CQROULPBM) operators, are proposed. We also investigate their special cases of CQROULPBM operators. Based on weighting, we further propose complex q-rung orthopair uncertain linguistic weighted partitioned Bonferroni mean (CQROULWPBM) operator. These properties of idempotency, boundedness, and commutativity for the CQROULWPBM operator are also demonstrated. In Section 5, we construct an MADM based on CQROULSs and then apply it to antivirus mask selection. The advantages, comparative analysis, and graphical interpretation of the explored operator are also presented. We finally make our conclusions in Section 6.

2. Preliminaries

In this section, we review some definitions, such as linguistic term set (LTS), complex q-rung orthopair fuzzy sets (CQROFSs), and their operational laws. Throughout this manuscript, the universal set is expressed by X U N I .
Definition 1.
[19] An LTS is initiated by:
L = L 0 , L 1 , L 2 , , L k 1
where k should be odd and hold the following conditions:
  • If k > k , then L k > L k ;
  • The negative operator n e g L k = L k with a condition k + k = k + 1 ;
  • If k k , max L k , L k = L k , and if k k , max L k , L k = L k .
Additionally, L ^ = L i : i R expresses the LTSs.
Definition 2.
[20] Let the set L = L i , L j , L i , L j L ^ i j , where L i , L j are the upper and lower limits of L , be a uncertain linguistic variable (ULV). For any two ULVs L 1 = L i 1 , L j 1 and L 2 = L i 2 , L j 2 , we have
  • L 1 L 2 = L i 1 , L j 1 L i 2 , L j 2 = L i 1 + i 2 i 1 i 2 k , L j 1 + j 2 j 1 j 2 k ;
  • L 1 L 2 = L i 1 , L j 1 L i 2 , L j 2 = L i 1 i 2 k , L j 1 j 2 k ;
  • δ S C L 1 = δ S C L i 1 , L j 1 = L k k 1 i 1 k δ S C , L k k 1 j 1 k δ S C ;
  • L 1 δ S C = L k i 1 k δ S C , L k j 1 k δ S C .
Definition 3.
[16] A CQROFS is initiated by:
C Q = x , M C Q , N C Q : x X U N I
where M C Q = M R P e i 2 π M I P and N C Q = N R P e i 2 π N I P expresses the grade of complex supporting and complex supporting against with a conditions: 0 M R P q S C + N R P q S C 1 and 0 M I P q S C + N I P q S C 1 . Additionally, the grade of refusal is stated by C Q = R P e i 2 π I P = 1 M R P q S C + N R P q S C 1 q S C e i 2 π 1 M I P q S C + N I P q S C 1 q S C . The complex q-rung orthopair fuzzy number (CQROFN) is expressed by C Q = M R P e i 2 π M I P , N R P e i 2 π N I P .
Definition 4.
[17] For any two CQROFSs C Q 1 = M R P 1 e i 2 π M I P 1 , N R P 1 e i 2 π N I P 1 and C Q 2 = M R P 2 e i 2 π M I P 2 , N R P 2 e i 2 π N I P 2 , we have
  • C Q 1 C Q C Q 2 = M R P 1 q S C + M R P 2 q S C M R P 1 q S C M R P 2 q S C 1 q S C e i 2 π M I P 1 q S C + M I P 2 q S C M I P 1 q S C M I P 2 q S C 1 q S C , N R P 1 N R P 2 e i 2 π N I P 1 N I P 2
  • C Q 1 C Q C Q 2 = M R P 1 M R P 2 e i 2 π M I P 1 M I P 2 , N R P 1 q S C + N R P 2 q S C N R P 1 q S C N R P 2 q S C 1 q S C e i 2 π N I P 1 q S C + N I P 2 q S C N I P 1 q S C N I P 2 q S C 1 q S C
  • δ S C C Q 1 = 1 1 M R P 1 q S C δ S C 1 q S C e i 2 π 1 1 M I P 1 q S C δ S C 1 q S C , N R P 1 δ S C e i 2 π N I P 1 δ S C , δ S C > 0
  • C Q 1 δ S C = M R P 1 δ S C e i 2 π M I P 1 δ S C , 1 1 N R P 1 q S C δ S C 1 q S C e i 2 π 1 1 N I P 1 q S C δ S C 1 q S C , δ S C > 0
Definition 5.
[18] For any two CQROFSs C Q 1 = M R P 1 e i 2 π M I P 1 , N R P 1 e i 2 π N I P 1 and C Q 2 = M R P 2 e i 2 π M I P 2 , N R P 2 e i 2 π N I P 2 , the score and accuracy function are initiated by
S S F C Q 1 = 1 2 M R P 1 q S C + M I P 1 q S C N R P 1 q S C N I P 1 q S C
A F C Q 1 = 1 2 M R P 1 q S C + M I P 1 q S C + N R P 1 q S C + N I P 1 q S C
To examine the interrelationship between any two CQROFSs, the following rules are used:
  • If S S F C Q 1 > S S F C Q 2 , then C Q 1 > C Q 2 ;
  • If S S F C Q 1 = S S F C Q 2 , then
    (1)
    If A F C Q 1 > A F C Q 2 , then C Q 1 > C Q 2 ;
    (2)
    If A F C Q 1 = A F C Q 2 , then C Q 1 = C Q 2 .

3. Proposed Complex q-Rung Orthopair Uncertain Linguistic Sets

The purpose of this section is to present the novel approach of complex q-rung orthopair uncertain linguistic sets (CQROULSs) and their fundamental laws. The notion of CQROULS composes two kind of information, uncertain linguistic variable (ULV) and CQROFS, with a condition that the sum of q-power of the real parts (also for imaginary parts) of the supporting and supporting against grades cannot be exceeded from a unit interval.
Definition 6.
A CQROULS is initiated by
C Q U L = x , L θ , L φ , M C Q U L , N C Q U L : x X U N I
where M C Q = M R P e i 2 π M I P and N C Q = N R P e i 2 π N I P expresses the grade of complex supporting and complex supporting against with conditions: 0 M R P q S C + N R P q S C 1 and 0 M I P q S C + N I P q S C 1 for ULVs L θ , L φ . Additionally, the grade of refusal is stated by C Q = R P e i 2 π I P = 1 M R P q S C + N R P q S C 1 q S C e i 2 π 1 M I P q S C + N I P q S C 1 q S C . The complex q-rung orthopair uncertain fuzzy number (CQROUFN) is expressed by C Q U L = L θ , L φ , M R P e i 2 π M I P , N R P e i 2 π N I P .
Definition 7.
For any two CQROULSs C Q U L 1 = L θ 1 , L φ 1 , M R P 1 e i 2 π M I P 1 , N R P 1 e i 2 π N I P 1 and C Q U L 2 = L θ 2 , L φ 2 , M R P 2 e i 2 π M I P 2 , N R P 2 e i 2 π N I P 2 , we have
  • C Q U L 1 C Q U L C Q U L 2 = L θ 1 + θ 2 θ 1 θ 2 k , L φ 1 + φ 2 φ 1 φ 2 k , M R P 1 q S C + M R P 2 q S C M R P 1 q S C M R P 2 q S C 1 q S C e i 2 π M I P 1 q S C + M I P 2 q S C M I P 1 q S C M I P 2 q S C 1 q S C , N R P 1 N R P 2 e i 2 π N I P 1 N I P 2 ;
  • C Q U L 1 C Q U L C Q U L 2 = L θ 1 θ 2 k , L φ 1 φ 2 k M R P 1 M R P 2 e i 2 π M I P 1 M I P 2 , N R P 1 q S C + N R P 2 q S C N R P 1 q S C N R P 2 q S C 1 q S C e i 2 π N I P 1 q S C + N I P 2 q S C N I P 1 q S C N I P 2 q S C 1 q S C ;
  • δ S C C Q U L 1 = L k k 1 θ 1 k δ S C , L k k 1 φ 1 k δ S C , 1 1 M R P 1 q S C δ S C 1 q S C e i 2 π 1 1 M I P 1 q S C δ S C 1 q S C , N R P 1 δ S C e i 2 π N I P 1 δ S C , δ S C > 0 ;
  • C Q U L 1 δ S C = L k θ 1 k δ S C , L k φ 1 k δ S C , M R P 1 δ S C e i 2 π M I P 1 δ S C , 1 1 N R P 1 q S C δ S C 1 q S C e i 2 π 1 1 N I P 1 q S C δ S C 1 q S C , δ S C > 0 .
Definition 8.
For any two CQROULSs C Q U L 1 = L θ 1 , L φ 1 , M R P 1 e i 2 π M I P 1 , N R P 1 e i 2 π N I P 1 and C Q U L 2 = L θ 2 , L φ 2 , M R P 2 e i 2 π M I P 2 , N R P 2 e i 2 π N I P 2 , the score and accuracy function are initiated by
S S F C Q U L 1 = L θ 1 + φ 1 1 + M R P 1 q S C + M I P 1 q S C N R P 1 q S C N I P 1 q S C 4
A F C Q U L 1 = L θ 1 + φ 1 1 + M R P 1 q S C + M I P 1 q S C + N R P 1 q S C + N I P 1 q S C 4
To examine the interrelationship between any two CQROULSs, we use the following rules:
  • If S S F C Q U L 1 > S S F C Q U L 2 , then C Q U L 1 > C Q U L 2 ;
  • If S S F C Q U L 1 = S S F C Q U L 2 , then
    (1)
    If A F C Q U L 1 > A F C Q U L 2 , then C Q U L 1 > C Q U L 2 ;
    (2)
    If A F C Q U L 1 = A F C Q U L 2 , then C Q U L 1 = C Q U L 2 .

4. Partitioned Bonferroni Mean Operators Based on CQROULSs

In this section, we propose partitioned Bonferroni mean (PBM) operators based on CQROULSs, called complex q-rung orthopair uncertain linguistic partitioned Bonferroni mean (CQROULPBM) operators. We also investigate their special cases of CQROULPBM operators. Furthermore, we choose the weight vectors whose representation is of the form ω W = ω W 1 , ω W 2 , . , ω W n T with the condition i = 1 n ω W i = 1 , ω W i 0 , 1 , and then present the complex q-rung orthopair uncertain linguistic weighted partitioned Bonferroni mean (CQROULWPBM) operator.
Definition 9.
For a family of CQROULSs C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i , i = 1 , 2 , , n , the CQROULPBM operator is initiated by
C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = 1 m H = 1 m 1 P H i P H C Q U L i S S C 1 P H 1 j P H i j C Q U L j T S C 1 S S C + T S C = 1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C
where P H expresses the order of P H , and { P 1 , P 2 , , P m } is a partition set with m different categories. The symbols S S C , T S C 0 , with a condition of S S C + T S C > 0 .
Theorem 1.
For a family of CQROULSs C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i , i = 1 , 2 , , n , by using the Equation (8) we get
C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = L k k H = 1 m 1 1 i , j P H i j 1 θ i k S S C θ j k T S C δ S C 1 S S C + T S C   1 m , L k k H = 1 m 1 1 i , j P H i j 1 φ i k S S C φ j k T S C δ S C 1 S S C + T S C   1 m , 1 1 H = 1 m 1 i , j P H i j 1 M R P i S S C M R P j T S C q S C δ S C 1 S S C + T S C   1 m 1 q S C × e i 2 π 1 1 H = 1 m 1 i , j P H i j 1 M I P i S S C M I P j T S C q S C δ S C 1 S S C + T S C   1 m 1 q S C , H = 1 m 1 i , j P H i j 1 1 N R P i q S C S S C 1 N R P j q S C T S C δ S C 1 S S C + T S C   1 q S C 1 m × e i 2 π H = 1 m 1 i , j P H i j 1 1 N I P i q S C S S C 1 N I P j q S C T S C δ S C 1 S S C + T S C   1 q S C 1 m
where δ S C = 1 P H P H 1 .
Proof. 
By using the Def. (7), we get
C Q U L i δ S C = L k θ i k S S C , L k φ i k S S C , M R P i S S C e i 2 π M I P i S S C , 1 1 N R P i q S C S S C 1 q S C e i 2 π 1 1 N I P i q S C S S C 1 q S C
C Q U L j T S C = L k θ j k T S C , L k φ j k T S C , M R P j T S C e i 2 π M I P j T S C , 1 1 N R P j q S C T S C 1 q S C e i 2 π 1 1 N I P j q S C T S C 1 q S C
C Q U L i δ S C C Q U L C Q U L j T S C = L k θ i k S S C θ j k T S C , L k φ i k S S C φ j k T S C M R P i δ S C M R P j T S C e i 2 π M I P i δ S C M I P j T S C , 1 1 N R P i q S C δ S C 1 N R P j q S C T S C 1 q S C e i 2 π 1 1 N I P i q S C δ S C 1 N I P j q S C T S C 1 q S C
δ S C i , j P H i j C Q U L i S S C C Q U L j T S C = L k k i , j P H i j 1 θ i k S S C θ j k T S C δ S C , L k k i , j P H i j 1 φ i k S S C φ j k T S C δ S C , 1 i , j P H i j 1 M R P i S S C M R P j T S C q S C δ S C 1 q S C × e i 2 π 1 i , j P H i j 1 M I P i S S C M I P j T S C q S C δ S C 1 q S C , i , j P H i j 1 1 N R P i q S C S S C 1 N R P j q S C T S C δ S C 1 q S C × e i 2 π i , j P H i j 1 1 N I P i q S C S S C 1 N I P j q S C T S C δ S C 1 q S C
1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = L k k H = 1 m 1 1 i , j P H i j 1 θ i k S S C θ j k T S C δ S C 1 S S C + T S C   1 m , L k k H = 1 m 1 1 i , j P H i j 1 φ i k S S C φ j k T S C δ S C 1 S S C + T S C   1 m , 1 1 H = 1 m 1 i , j P H i j 1 M R P i S S C M R P j T S C q S C δ S C 1 S S C + T S C   1 m 1 q S C × e i 2 π 1 1 H = 1 m 1 i , j P H i j 1 M I P i S S C M I P j T S C q S C δ S C 1 S S C + T S C   1 m 1 q S C , H = 1 m 1 i , j P H i j 1 1 N R P i q S C S S C 1 N R P j q S C T S C δ S C 1 S S C + T S C   1 q S C 1 m × e i 2 π H = 1 m 1 i , j P H i j 1 1 N I P i q S C S S C 1 N I P j q S C T S C δ S C 1 S S C + T S C   1 q S C 1 m
The proof is completed. □
Theorem 2.
For a family of CQROULSs C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i , i = 1 , 2 , , n , the following properties of Idempotency, Boundedness and Commutativity are hold.
  • Idempotency: If C Q U L i = C Q U L , then
    C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = C Q R O U L P B M S S C , T S C C Q U L , C Q U L , C Q U L , , C Q U L = 1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = 1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L S S C C Q U L T S C 1 S S C + T S C = 1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L S S C + T S C 1 S S C + T S C = 1 m H = 1 m C Q U L S S C + T S C 1 S S C + T S C = C Q U L
  • Boundedness: If C Q U L = L m i n θ i , L m i n φ i , m i n M R P i e i 2 π m i n M I P i , m a x N R P i e i 2 π m a x N I P i and C Q U L + = L m a x θ i , L m a x φ i , m a x M R P i e i 2 π m a x M I P i , m i n N R P i e i 2 π m i n N I P i , then
    C Q U L C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n C Q U L +
  • Commutativity: If C Q U L i is a permutation of the C Q U L i , then
    C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n
    If C Q U L i is a permutation of the C Q U L i , then
    C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = 1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = 1 m H = 1 m 1 P H P H 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n
Proof. 
The proof of this part is straightforward. □
Additionally, we discuss the special cases of the CQROULPBM operator. The special cases are discussed below.
Case 1. 
By using the values of parameter T S C = 1 and P 1 = n , the explored CQROULPBM operator is reduced into a complex q-rung orthopair uncertain linguistic Bonferroni mean operator, such that:
C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = 1 m H = 1 m 1 P 1 P 1 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = i , j = 1 n C Q U L i S S C C Q U L j T S C n n 1 1 S S C + T S C = C Q R O U L B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n
Case 2. 
By using the values of parameter S S C = 1 and T S C = 0 , the explored CQROULPBM operator is reduced into a complex q-rung orthopair uncertain linguistic mean operator, such that:
C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = 1 m H = 1 m 1 P 1 P 1 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = 1 n i = 1 n C Q U L i
Case 3. 
By using the values of parameter S S C = 2 and T S C = 0 , the explored CQROULPBM operator is reduced into a complex q-rung orthopair uncertain linguistic geometric mean operator, such that:
C Q R O U L P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = 1 m H = 1 m 1 P 1 P 1 1 i , j P H i j C Q U L i S S C C Q U L j T S C 1 S S C + T S C = 1 n i = 1 n C Q U L i 2 1 2
Definition 10.
For a family of CQROULSs C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i , i = 1 , 2 , , n , the CQROULWPBM operator is initiated by:
C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = 1 m H = 1 m 1 P H i P H ω W i S S C C Q U L i S S C 1 P H 1 j P H i j ω W j T S C C Q U L j T S C 1 S S C + T S C = 1 m H = 1 m 1 P H P H 1 i , j P H i j ω W i S S C C Q U L i S S C ω W j T S C C Q U L j T S C 1 S S C + T S C
where P H expresses the order of P H , and { P 1 , P 2 , , P m } is a partition set with m different categories. The symbols S S C , T S C 0 are with a condition that is S S C + T S C > 0 . Additionally, the term ω W = ω W 1 , ω W 2 , , ω W n T , ω W i 0 , 1 with a condition that is i = 1 n ω W i = 1 .
Theorem 3.
For a family of CQROULSs C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i , i = 1 , 2 , , n , by using Equation (10), we get:
C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = L k k H = 1 m 1 1 i , j P H i j 1 1 1 θ i k ω W i S S C 1 1 θ j k ω W j T S C δ S C 1 S S C + T S C   1 m , L k k H = 1 m 1 1 i , j P H i j 1 1 1 φ i k ω W i S S C 1 1 φ j k ω W i T S C δ S C 1 S S C + T S C   1 m , 1 1 1 H = 1 m 1 1 i , j P H i j 1 1 M R P i S S C 1 M R P j T S C q S C δ S C 1 S S C + T S C   1 m 1 q S C × e i 2 π 1 1 1 H = 1 m 1 1 i , j P H i j 1 1 M I P i S S C 1 M I P j T S C q S C δ S C 1 S S C + T S C   1 m 1 q S C , H = 1 m 1 1 i , j P H i j 1 1 N R P i q S C S S C 1 N R P j q S C T S C δ S C 1 S S C + T S C   1 q S C 1 m × e i 2 π H = 1 m 1 1 i , j P H i j 1 1 N I P i q S C S S C 1 N I P j q S C T S C δ S C 1 S S C + T S C   1 q S C 1 m
where δ S C = 1 P H P H 1 .
Proof. 
Straightforward. □
Theorem 4.
For a family of CQROULSs C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i , i = 1 , 2 , , n , the following properties hold:
  • Idempotency: If C Q U L i = C Q U L , then
    C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = C Q R O U L W P B M S S C , T S C C Q U L , C Q U L , C Q U L , , C Q U L = C Q U L
  • Boundedness: If C Q U L = L m i n θ i , L m i n φ i , m i n M R P i e i 2 π m i n M I P i , m a x N R P i e i 2 π m a x N I P i and C Q U L + = L m a x θ i , L m a x φ i , m a x M R P i e i 2 π m a x M I P i , m i n N R P i e i 2 π m i n N I P i , then
    C Q U L C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n C Q U L +
  • Commutativity: If C Q U L i is a permutation of the C Q U L i , then
    C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n
    If C Q U L i is a permutation of the C Q U L i , then
    C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , , C Q U L n

5. MADM Method Based on CQROULSs with Application in Antivirus Mask Selection

The purpose of this section is to explore the MADM issue based on CQROULSs with its CQROULWPBM operator to examine the proficiency and reliability of the presented approach. To proficiently examine the approaches, we choose the family of alternatives and their attributes based on weight vectors, whose expressions are summarized as follows: A A L = A A L 1 , A A L 2 , , A A L n and C A T = C A T 1 , C A T 2 , , C A T m by using the weight vectors ω W = ω W 1 , ω W 2 , , ω W n T with a condition that is i = 1 n ω W i = 1 , ω W i 0 , 1 . To evaluate the above information, we construct the decision matrix whose information in the form of CQROULNs with C Q U L i = L θ i , L φ i , M R P i e i 2 π M I P i , N R P i e i 2 π N I P i . To resolve the above issue, the steps of the algorithm is summarized as follows:
  • Step 1: Construct the decision matrix, whose entries are in the form of CQROULNs.
  • Step 2: By using Equation (11), we aggregate the information which is given in step 1.
  • Step 3: By using Equation (6), we examine the score values of the aggregated values of step 2.
  • Step 4: Rank to all alternatives, and examine the best one.
  • Step 5: The end.

5.1. On Antivirus Mask Selection for the COVID-19 Pandemic

In the current extreme instance of COVID-19 transmission, there are six sorts of veils that are generally accessible in the market, including clinical careful covers, particulate respirators (N95/KN95 or more), clinical defensive covers, dispensable clinical covers, conventional non-clinical covers, and gas covers. An individual needs to purchase an antivirus veil from the six up-and-comer antivirus covers. In addition, the individual in question assesses the antivirus veils by thinking about four measures, in particular, spillage rate (C1), that is the adhesiveness of the veil structure configuration to cover the human face; reusability (C2); nature of crude materials (C3); and filtration productivity (C4), which implies that the filtration productivity of non-slick 0.3 µm particles is more noteworthy than 95%, and it should likewise have clinical assurance prerequisites, for example, surface dampness opposition and blood obstruction. The mask and their representations are presented in Figure 1.
The individual gives the assessment estimation of standard C i   i =   1 ,   2 ,   3 ,   4 concerning every A i   i =   1 ,   2 ,   3 ,   4 ,   5 ,   6 in CQROULSs. Since the proposed MADM based on CQROULSs with its CQROULPBM operator has different q values, it generates some usefully special cases. For example, when q = 1, it becomes complex intuitionistic uncertain linguistic numbers (CIULNs), and when q = 2, it becomes complex Pythagorean uncertain linguistic numbers (CPULNs). To examine the usefulness and proficiency of the proposed approach, we next present three cases of q = 1, q = 2, and q = 7.
We first consider the case of q = 1, that is, CIULNs. These decision matrix items in the form of CIULNs are shown in Table 1.
To resolve the above issue, the steps of the algorithm are summarized as follows:
  • Step 1: We construct the decision matrix, whose entries in the form of CQROULNs are discussed in Table 1.
  • Step 2: By using Equation (11), we aggregate the information which is given in Step 1, for S S C = T S C = 1 , q = 1 , as shown in Table 1. We obtain the following:
    A A L 1 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1 , L 3.4354 , 0.32243 e i 2 π 0.42635 , 0.223535 e i 2 π 0.126353
    A A L 2 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1.9846 , L 3.4655 , 0.424645 e i 2 π 0.527327 , 0.3232323 e i 2 π 0.228483
    A A L 3 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 2.345 , L 4.3545 , 0.52723672 e i 2 π 0.627836 , 0.4286428 e i 2 π 0.328682
    A A L 4 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 0 , L 2.134 , 0.12824648 e i 2 π 0.32288 , 0.42383627 e i 2 π 0.227846278
    A A L 5 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1 , L 3.12342 , 0.72726274 e i 2 π 0.52846387 , 0.1238483 e i 2 π 0.228483
    A A L 6 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1.34562 , L 3.3636 , 0.828483 e i 2 π 0.7283286 , 0.123278236 e i 2 π 0.1282382
  • Step 3: By using Equation (6), we examine the score values of the aggregated values of Step 2 with
    S S F A A L 1 = L 1.5512 , S S F A A L 2 = L 0.5453 , S S F A A L 3 = L 0.6663 , S S F A A L 4 = L 0.1070 , S S F A A L 5 = L 0.9312 , S S F A A L 6 = L 1.5366
  • Step 4: We rank all alternatives with A A L 1 A A L 6 A A L 5 A A L 3 A A L 2 A A L 4 . Therefore, the alternative A A L 1 is the best one according to the rank of Step 4.
  • Step 5: The end.
Additionally, we consider the case of q = 2, that is, CPULNs. These decision matrix items in the form of CPULNs are shown in Table 2.
By using Equation (11), we aggregate the information given in step 1, for S S C = T S C = 1 , q = 2 . We obtain the following:
A A L 1 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1 , L 3.4354 , 0.82243 e i 2 π 0.92635 , 0.223535 e i 2 π 0.126353
A A L 2 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1.9846 , L 3.4655 , 0.724645 e i 2 π 0.827327 , 0.3232323 e i 2 π 0.228483
A A L 3 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 2.345 , L 4.3545 , 0.62723672 e i 2 π 0.727836 , 0.4286428 e i 2 π 0.328682
A A L 4 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 0 , L 2.134 , 0.62824648 e i 2 π 0.82288 , 0.42383627 e i 2 π 0.227846278
A A L 5 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1 , L 3.12342 , 0.62726274 e i 2 π 0.72846387 , 0.1238483 e i 2 π 0.228483
A A L 5 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1.34562 , L 3.3636 , 0.928483 e i 2 π 0.8283286 , 0.123278236 e i 2 π 0.1282382
By using Equation (6), we examine the score values of the aggregated values and have:
S S F A A L 1 = L 2.7371 , S S F A A L 2 = L 2.7975 , S S F A A L 3 = L 2.7324 , S S F A A L 4 = L 0.9817 , S S F A A L 5 = L 1.9137 , S S F A A L 6 = L 2.9625
We rank all alternatives with A A L 6 A A L 2 A A L 1 A A L 3 A A L 5 A A L 4 ; the alternative A A L 6 is found to be the best.
Furthermore, we consider a general CQROULN with q = 7; its decision matrix items are shown in Table 3.
By using Equation (11), we aggregate the information given in step 1, for S S C = T S C = 1 , q = 7 with:
A A L 1 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1 , L 3.4354 , 0.82243 e i 2 π 0.92635 , 0.723535 e i 2 π 0.126353
A A L 2 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1.9846 , L 3.4655 , 0.724645 e i 2 π 0.827327 , 0.8232323 e i 2 π 0.928483
A A L 3 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 2.345 , L 4.3545 , 0.62723672 e i 2 π 0.727836 , 0.7286428 e i 2 π 0.628682
A A L 4 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 0 , L 2.134 , 0.62824648 e i 2 π 0.82288 , 0.42383627 e i 2 π 0.227846278
A A L 5 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1 , L 3.12342 , 0.72726274 e i 2 π 0.52846387 , 0.8238483 e i 2 π 0.928483
A A L 5 = C Q R O U L W P B M S S C , T S C C Q U L 1 , C Q U L 2 , C Q U L 3 , C Q U L 4 = L 1.34562 , L 3.3636 , 0.828483 e i 2 π 0.7283286 , 0.123278236 e i 2 π 0.1282382
By using Equation (6), we examine the score values of the aggregated values with
S S F A A L 1 = L 1.9247 , S S F A A L 2 = L 0.7078 , S S F A A L 3 = L 1.6725 , S S F A A L 4 = L 0.6890 , S S F A A L 5 = L 1.4162 , S S F A A L 6 = L 2.1921
We rank all alternatives with A A L 6 A A L 1 A A L 3 A A L 5 A A L 2 A A L 4 ; the alternative A A L 6 is found to be the best one.
From the above analysis (Table 1, Table 2 and Table 3), it is clear that the proposed approach is proficient and applicable, even for the special cases of CIULNs and CPULNs.

5.2. Comparative Analysis and Graphical Interpretations of the Proposed Approach

Additionally, a comparative analysis of the explored operator with some existing operators was done to examine the reliability and effectiveness of the proposed approach. The comparative analysis is based on information in Table 1, Table 2 and Table 3. The existing operators are as follows: Liu and Jin [21] explored the notion of aggregation operator based on intuitionistic uncertain linguistic variables. Lu and Wei [22] presented the theory of Pythagorean uncertain linguistic aggregation operators, and Liu et al. [23] explored the theory of q-rung orthopair uncertain linguistic aggregation operators.
The comparative results of Table 1 are shown in Table 4. From the above analysis, it is clear that the explored operator provides the same ranking result with the best alternative, A A L 1 . However, these existing operators of Liu and Jin [21], Lu and Wei [22], and Liu et al. [23] fail to make a decision.
The comparative results of Table 2 are shown in Table 5. From the analysis, it is clear that the explored operator provides the same ranking result with the best alternative, A A L 6 . However, these existing operators of Liu and Jin [21], Lu and Wei [22], and Liu et al. [23] fail to make a decision.
Furthermore, the comparative results of Table 3 are shown in Table 6. From the analysis, it is clear that the explored operator provides the same ranking result with the best alternative, A A L 6 . However, these existing operators of Liu and Jin [21], Lu and Wei [22], and Liu et al. [23] fail to make a decision.
We then use the graphical representations for Table 4, Table 5 and Table 6. The graphical representations for Table 4, Table 5 and Table 6 are shown in Figure 2, Figure 3 and Figure 4, respectively. From these figures, it is clear that they contains six series, which express the family of alternatives with different colors. The best alternative in Figure 2 is A A L 1 and the best alternative in Figure 3 and Figure 4 is A A L 6 . It is seen that the proposed approach is superior and more effective than these existing methods [21,22,23].

6. Conclusions

Since Yager [9] proposed q-rung orthopair fuzzy sets (QROFSs), QROFSs have been widely studied and applied in various areas, especially in MADM. To broaden the scope of QROFSs from real part in a real plane to real and imaginary parts in a complex plane, complex QROFSs are considered. On the other hand, uncertain linguistic sets are satisfactory in presenting the DMs’ assessment data for handling MADM issues. Thus, complex q-rung orthopair uncertain linguistic sets (CQROULSs) are first proposed in the paper. Regarding MADM issues in which the assessed estimation of each trait is as CQROULS, the method of MADM based on CQROULSs is then created. Based on CQROULSs, another aggregation operator, called the partitioned Bonferroni mean (PBM) operator, is then used to manage the circumstances where the properties are parceled into various parts with interrelationships among different properties in the same part while the qualities in various parts are not related. To wipe out preposterous assessment estimations of characteristics, we stretched out the PBM operator to CQROULSs and then proposed the complex q-rung orthopair uncertain linguistic partitioned Bonferroni mean (CQROULPBM) operator. Furthermore, we propose the complex q-rung orthopair uncertain linguistic weighted partitioned Bonferroni mean (CQROULWPBM) operator based on weighting. The properties of idempotency, boundedness, and commutativity for the CQROULWPBM operator are shown to hold. Finally, we present an MADM method based on CQROULSs with the CQROULWPBM operator and apply it to an antivirus mask selection for the COVID-19 pandemic. We further analyze its advantages, and also make a comparative analysis with graphical interpretation. These comparative analysis and application results demonstrate the good aspects of the proposed CQROULSs and CQROULWPBM operator with effectiveness and usefulness in practice. In our future works, we will extend the proposed method to complex neutrosophic hesitant fuzzy sets [26], T-spherical fuzzy sets [27,28], and plithogenic hypersoft sets [29]. Furthermore, we will use the fuzzy symmetry concept [24,25] to the proposed CQROULSs and CQROULWPBM operator and then give more uncertain linguistic set applications in symmetry.

Author Contributions

Conceptualization, Z.A. and T.M.; methodology, M.-S.Y., Z.A., and T.M.; validation, M.-S.Y., Z.A., and T.M.; formal analysis, Z.A.; investigation, M.-S.Y., Z.A., and T.M.; writing—original draft preparation, Z.A. and T.M.; writing—review and editing, M.-S.Y.; supervision, M.-S.Y. and T.M.; project administration, Z.A.; funding acquisition, M.-S.Y. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded in part by the Ministry of Science and technology (MOST) of Taiwan under Grant MOST-109-2118-M-033-001.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the anonymous referees for their helpful comments in improving the presentation of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Hwang, C.M.; Yang, M.S.; Hung, W.L. New similarity measures of intuitionistic fuzzy sets based on the Jaccard index with its application to clustering. Int. J. Intell. Syst. 2018, 33, 1672–1688. [Google Scholar] [CrossRef]
  4. Krishankumar, R.; Ravichandran, K.S.; Tyagi, S.K. Solving cloud vendor selection problem using intuitionistic fuzzy decision framework. Neural Comput. Appl. 2020, 32, 589–602. [Google Scholar] [CrossRef]
  5. Roy, J.; Das, S.; Kar, S.; Pamucar, D. An extension of the CODAS approach using interval-valued intuitionistic fuzzy set for sustainable material selection in construction projects with incomplete weight information. Symmetry 2019, 11, 393. [Google Scholar] [CrossRef] [Green Version]
  6. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  7. Yang, M.S.; Hussian, Z. Fuzzy entropy for Pythagorean fuzzy sets with application to multicriterion decision making. Complexity 2018, 2018, 2832839. [Google Scholar] [CrossRef]
  8. Zhang, M.; Zheng, T.; Zheng, W.; Zhou, L. Interval-valued Pythagorean hesitant fuzzy set and its application to multiattribute group decision-making. Complexity 2020, 2020, 1724943. [Google Scholar] [CrossRef]
  9. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  10. Liang, D.; Gao, W. Q-rung orthopair fuzzy sets-based decision-theoretic rough sets for three-way decisions under group decision making. Int. J. Intell. Syst. 2019, 34, 3139–3167. [Google Scholar] [CrossRef]
  11. Liu, P.; Wang, Y. Multiple attribute decision making based on q-rung orthopair fuzzy generalized Maclaurin symmetic mean operators. Inf. Sci. 2020, 518, 181–210. [Google Scholar] [CrossRef]
  12. Riaz, M.; Pamucar, D.; Farid, H.M.A.; Hashmi, M.R. Q-rung orthopair fuzzy prioritized aggregation operators and their application towards green supplier chain management. Symmetry 2020, 12, 976. [Google Scholar] [CrossRef]
  13. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. Ieee Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  14. Alkouri, A.M.D.J.S.; Salleh, A.R. Complex intuitionistic fuzzy sets. In AIP Conference Proceedings; American Institute of Physics: College Park, MD, USA, 2012; Volume 1482, pp. 464–470. [Google Scholar]
  15. Ullah, K.; Mahmood, T.; Ali, Z.; Jan, N. On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition. Complex Intell. Syst. 2020, 6, 15–27. [Google Scholar] [CrossRef] [Green Version]
  16. Liu, P.; Ali, Z.; Mahmood, T. A method to multi-attribute group decision-making problem with complex q-rung orthopair linguistic information based on Heronian mean operators. Int. J. Comput. Intell. Syst. 2019, 12, 1465–1496. [Google Scholar] [CrossRef] [Green Version]
  17. Liu, P.; Mahmood, T.; Ali, Z. Complex Q-rung orthopair fuzzy aggregation operators and their applications in multi-attribute group decision making. Information 2020, 11, 5. [Google Scholar] [CrossRef] [Green Version]
  18. Garg, H.; Gwak, J.; Mahmood, T.; Ali, Z. Power aggregation operators and VIKOR methods for complex q-rung orthopair fuzzy sets and their applications. Mathematics 2020, 8, 538. [Google Scholar] [CrossRef] [Green Version]
  19. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning. In Learning Systems and Intelligent Robots; Springer: Boston, MA, USA, 1974; pp. 1–10. [Google Scholar]
  20. Xu, Z. Uncertain linguistic aggregation operators based approach to multiple attribute group decision making under uncertain linguistic environment. Inf. Sci. 2004, 168, 171–184. [Google Scholar] [CrossRef]
  21. Liu, P.; Jin, F. Methods for aggregating intuitionistic uncertain linguistic variables and their application to group decision making. Inf. Sci. 2012, 205, 58–71. [Google Scholar] [CrossRef]
  22. Lu, M.; Wei, G.W. Pythagorean uncertain linguistic aggregation operators for multiple attribute decision making. Int. J. Knowl.-Based Intell. Eng. Syst. 2017, 21, 165–179. [Google Scholar] [CrossRef]
  23. Liu, Z.; Xu, H.; Yu, Y.; Li, J. Some q-rung orthopair uncertain linguistic aggregation operators and their application to multiple attribute group decision making. Int. J. Intell. Syst. 2019, 34, 2521–2555. [Google Scholar] [CrossRef]
  24. Kohler, A.E. A fuzzy symmetry concept for forms with imperfect symmetries. Comput. Math. Appl. 1991, 22, 35–50. [Google Scholar] [CrossRef] [Green Version]
  25. Kohler, A.E. Fuzzy symmetries of point ensembles. Comput. Math. Appl. 1999, 37, 89–113. [Google Scholar] [CrossRef] [Green Version]
  26. Li, D.F.; Mahmood, T.; Ali, Z.; Dong, Y. Decision making based on interval-valued complex single-valued neutrosophic hesitant fuzzy generalized hybrid weighted averaging operators. J. Intell. Fuzzy Syst. 2020, 38, 4359–4401. [Google Scholar] [CrossRef]
  27. Ullah, K.; Garg, H.; Mahmood, T.; Jan, N.; Ali, Z. Correlation coefficients for T-spherical fuzzy sets and their applications in clustering and multi-attribute decision making. Soft Comput. 2020, 24, 1647–1659. [Google Scholar] [CrossRef]
  28. Ali, Z.; Mahmood, T.; Yang, M.S. Complex T-spherical fuzzy aggregation operators with application to multi-attribute decision making. Symmetry 2020, 12, 1311. [Google Scholar] [CrossRef]
  29. Ahmad, M.R.; Saeed, M.; Afzal, U.; Yang, M.S. A novel MCDM method based on plithogenic hypersoft sets under fuzzy neutrosophic environment. Symmetry 2020, 12, 1855. [Google Scholar] [CrossRef]
Figure 1. Representation of mask and their names.
Figure 1. Representation of mask and their names.
Symmetry 13 00249 g001
Figure 2. Graphical representation of the information in Table 4.
Figure 2. Graphical representation of the information in Table 4.
Symmetry 13 00249 g002
Figure 3. Graphical representation of the information in Table 5.
Figure 3. Graphical representation of the information in Table 5.
Symmetry 13 00249 g003
Figure 4. Graphical representation of the information in Table 6.
Figure 4. Graphical representation of the information in Table 6.
Symmetry 13 00249 g004
Table 1. Decision matrix, whose items are in the form of CIULNs.
Table 1. Decision matrix, whose items are in the form of CIULNs.
Data C A T 1 C A T 2 C A T 3 C A T 4
A A L 1 L 1 , L 2 , 0.3 e i 2 π 0.4 , 0.2 e i 2 π 0.1 L 1 , L 3 , 0.31 e i 2 π 0.41 , 0.21 e i 2 π 0.11 L 1 , L 4 , 0.32 e i 2 π 0.42 , 0.22 e i 2 π 0.12 L 1 , L 5 , 0.33 e i 2 π 0.43 , 0.23 e i 2 π 0.13
A A L 2 L 2 , L 3 , 0.4 e i 2 π 0.5 , 0.3 e i 2 π 0.2 L 2 , L 4 , 0.41 e i 2 π 0.51 , 0.31 e i 2 π 0.21 L 2 , L 5 , 0.42 e i 2 π 0.52 , 0.32 e i 2 π 0.22 L 1 , L 3 , 0.43 e i 2 π 0.53 , 0.33 e i 2 π 0.23
A A L 3 L 3 , L 4 , 0.5 e i 2 π 0.6 , 0.4 e i 2 π 0.3 L 3 , L 5 , 0.51 e i 2 π 0.61 , 0.41 e i 2 π 0.31 L 2 , L 4 , 0.52 e i 2 π 0.62 , 0.42 e i 2 π 0.32 L 2 , L 5 , 0.53 e i 2 π 0.63 , 0.43 e i 2 π 0.33
A A L 4 L 0 , L 2 , 0.1 e i 2 π 0.3 , 0.4 e i 2 π 0.2 L 0 , L 1 , 0.11 e i 2 π 0.31 , 0.41 e i 2 π 0.21 L 0 , L 3 , 0.12 e i 2 π 0.32 , 0.42 e i 2 π 0.22 L 0 , L 4 , 0.13 e i 2 π 0.33 , 0.43 e i 2 π 0.23
A A L 5 L 1 , L 4 , 0.7 e i 2 π 0.5 , 0.1 e i 2 π 0.2 L 1 , L 5 , 0.71 e i 2 π 0.51 , 0.11 e i 2 π 0.21 L 1 , L 3 , 0.72 e i 2 π 0.52 , 0.12 e i 2 π 0.22 L 1 , L 2 , 0.73 e i 2 π 0.53 , 0.13 e i 2 π 0.23
A A L 6 L 3 , L 5 , 0.8 e i 2 π 0.7 , 0.1 e i 2 π 0.1 L 3 , L 4 , 0.81 e i 2 π 0.71 , 0.11 e i 2 π 0.11 L 2 , L 3 , 0.82 e i 2 π 0.72 , 0.12 e i 2 π 0.12 L 1 , L 5 , 0.83 e i 2 π 0.73 , 0.13 e i 2 π 0.13
Table 2. Decision matrix whose items are the form of CPULNs.
Table 2. Decision matrix whose items are the form of CPULNs.
Data C A T 1 C A T 2 C A T 3 C A T 4
A A L 1 L 1 , L 2 , 0.8 e i 2 π 0.9 , 0.2 e i 2 π 0.1 L 1 , L 3 , 0.81 e i 2 π 0.91 , 0.21 e i 2 π 0.11 L 1 , L 4 , 0.82 e i 2 π 0.92 , 0.22 e i 2 π 0.12 L 1 , L 5 , 0.83 e i 2 π 0.93 , 0.23 e i 2 π 0.13
A A L 2 L 2 , L 3 , 0.7 e i 2 π 0.8 , 0.3 e i 2 π 0.2 L 2 , L 4 , 0.71 e i 2 π 0.81 , 0.31 e i 2 π 0.21 L 2 , L 5 , 0.72 e i 2 π 0.82 , 0.32 e i 2 π 0.22 L 1 , L 3 , 0.73 e i 2 π 0.83 , 0.33 e i 2 π 0.23
A A L 3 L 3 , L 4 , 0.6 e i 2 π 0.7 , 0.4 e i 2 π 0.3 L 3 , L 5 , 0.61 e i 2 π 0.71 , 0.41 e i 2 π 0.31 L 2 , L 4 , 0.62 e i 2 π 0.72 , 0.42 e i 2 π 0.32 L 2 , L 5 , 0.63 e i 2 π 0.73 , 0.43 e i 2 π 0.33
A A L 4 L 0 , L 2 , 0.6 e i 2 π 0.8 , 0.4 e i 2 π 0.2 L 0 , L 1 , 0.61 e i 2 π 0.81 , 0.41 e i 2 π 0.21 L 0 , L 3 , 0.62 e i 2 π 0.82 , 0.42 e i 2 π 0.22 L 0 , L 4 , 0.63 e i 2 π 0.83 , 0.43 e i 2 π 0.23
A A L 5 L 1 , L 4 , 0.7 e i 2 π 0.5 , 0.1 e i 2 π 0.2 L 1 , L 5 , 0.71 e i 2 π 0.51 , 0.11 e i 2 π 0.21 L 1 , L 3 , 0.72 e i 2 π 0.52 , 0.12 e i 2 π 0.22 L 1 , L 2 , 0.73 e i 2 π 0.53 , 0.13 e i 2 π 0.23
A A L 6 L 3 , L 5 , 0.8 e i 2 π 0.7 , 0.1 e i 2 π 0.1 L 3 , L 4 , 0.81 e i 2 π 0.71 , 0.11 e i 2 π 0.11 L 2 , L 3 , 0.82 e i 2 π 0.72 , 0.12 e i 2 π 0.12 L 1 , L 5 , 0.83 e i 2 π 0.73 , 0.13 e i 2 π 0.13
Table 3. Decision matrix whose items are in the form of CQROULNs.
Table 3. Decision matrix whose items are in the form of CQROULNs.
Data C A T 1 C A T 2 C A T 3 C A T 4
A A L 1 L 1 , L 2 , 0.8 e i 2 π 0.9 , 0.7 e i 2 π 0.8 L 1 , L 3 , 0.81 e i 2 π 0.91 , 0.71 e i 2 π 0.81 L 1 , L 4 , 0.82 e i 2 π 0.92 , 0.72 e i 2 π 0.82 L 1 , L 5 , 0.83 e i 2 π 0.93 , 0.73 e i 2 π 0.83
A A L 2 L 2 , L 3 , 0.7 e i 2 π 0.8 , 0.8 e i 2 π 0.9 L 2 , L 4 , 0.71 e i 2 π 0.81 , 0.81 e i 2 π 0.91 L 2 , L 5 , 0.72 e i 2 π 0.82 , 0.82 e i 2 π 0.92 L 1 , L 3 , 0.73 e i 2 π 0.83 , 0.83 e i 2 π 0.93
A A L 3 L 3 , L 4 , 0.6 e i 2 π 0.7 , 0.7 e i 2 π 0.6 L 3 , L 5 , 0.61 e i 2 π 0.71 , 0.71 e i 2 π 0.61 L 2 , L 4 , 0.62 e i 2 π 0.72 , 0.72 e i 2 π 0.62 L 2 , L 5 , 0.63 e i 2 π 0.73 , 0.73 e i 2 π 0.63
A A L 4 L 0 , L 2 , 0.6 e i 2 π 0.8 , 0.4 e i 2 π 0.2 L 0 , L 1 , 0.61 e i 2 π 0.81 , 0.41 e i 2 π 0.21 L 0 , L 3 , 0.62 e i 2 π 0.82 , 0.42 e i 2 π 0.22 L 0 , L 4 , 0.63 e i 2 π 0.83 , 0.43 e i 2 π 0.23
A A L 5 L 1 , L 4 , 0.7 e i 2 π 0.5 , 0.8 e i 2 π 0.9 L 1 , L 5 , 0.71 e i 2 π 0.51 , 0.81 e i 2 π 0.91 L 1 , L 3 , 0.72 e i 2 π 0.52 , 0.82 e i 2 π 0.92 L 1 , L 2 , 0.73 e i 2 π 0.53 , 0.83 e i 2 π 0.93
A A L 6 L 3 , L 5 , 0.8 e i 2 π 0.7 , 0.1 e i 2 π 0.1 L 3 , L 4 , 0.81 e i 2 π 0.71 , 0.11 e i 2 π 0.11 L 2 , L 3 , 0.82 e i 2 π 0.72 , 0.12 e i 2 π 0.12 L 1 , L 5 , 0.83 e i 2 π 0.73 , 0.13 e i 2 π 0.13
Table 4. Analysis of the explored operator with existing operators in Table 1.
Table 4. Analysis of the explored operator with existing operators in Table 1.
MethodsScore ValuesRanking Results
Liu and Jin [21] C a n n o t   b e   C a l c u l a t e d F a i l e d
Lu and Wei [22] C a n n o t   b e   C a l c u l a t e d F a i l e d
Liu et al. [23] C a n n o t   b e   C a l c u l a t e d F a i l e d
Proposed work for q = 1 S S F A A L 1 = L 1.5512 , S S F A A L 2 = L 0.5453 , S S F A A L 3 = L 0.6663 ,
S S F A A L 4 = L 0.1070 , S S F A A L 5 = L 0.9312 , S S F A A L 6 = L 1.536
A A L 1 A A L 6 A A L 5
A A L 3 A A L 2 A A L 4
Proposed work for q = 2 S S F A A L 1 = L 1.422 , S S F A A L 2 = L 0.378 , S S F A A L 3 = L 0.389 ,
S S F A A L 4 = L 0.246 , S S F A A L 5 = L 0.411 , S S F A A L 6 = L 1.418
A A L 1 A A L 6 A A L 5
A A L 3 A A L 2 A A L 4
Proposed work for q = 3 S S F A A L 1 = L 1.412 , S S F A A L 2 = L 0.349 , S S F A A L 3 = L 0.354 ,
S S F A A L 4 = L 0.456 , S S F A A L 5 = L 0.367 , S S F A A L 6 = L 1.377
A A L 1 A A L 6 A A L 5
A A L 3 A A L 2 A A L 4
Table 5. Comparative analysis of the explored operator with existing operators in Table 2.
Table 5. Comparative analysis of the explored operator with existing operators in Table 2.
MethodsScore ValuesRanking Results
Liu and Jin [21] C a n n o t   b e   C a l c u l a t e d F a i l e d
Lu and Wei [22] C a n n o t   b e   C a l c u l a t e d F a i l e d
Liu et al. [23] C a n n o t   b e   C a l c u l a t e d F a i l e d
Proposed work for q = 1 C a n n o t   b e   C a l c u l a t e d F a i l e d
Proposed work for q = 2 S S F A A L 1 = L 2.7371 , S S F A A L 2 = L 2.7975 , S S F A A L 3 = L 2.7324 ,
S S F A A L 4 = L 0.9817 , S S F A A L 5 = L 1.9137 , S S F A A L 6 = L 2.9625
A A L 6 A A L 2 A A L 1
A A L 3 A A L 5 A A L 4
Proposed work for q = 3 S S F A A L 1 = L 2.867 , S S F A A L 2 = L 2.912 , S S F A A L 3 = L 2.845 ,
S S F A A L 4 = L 0.810 , S S F A A L 5 = L 1.811 , S S F A A L 6 = L 2.978
A A L 6 A A L 2 A A L 1
A A L 3 A A L 5 A A L 4
Table 6. Comparative analysis of the explored operator with existing operators in Table 3.
Table 6. Comparative analysis of the explored operator with existing operators in Table 3.
MethodsScore ValuesRanking Results
Liu and Jin [21] C a n n o t   b e   C a l c u l a t e d F a i l e d
Lu and Wei [22] C a n n o t   b e   C a l c u l a t e d F a i l e d
Liu et al. [23] C a n n o t   b e   C a l c u l a t e d F a i l e d
Proposed work for q = 1 C a n n o t   b e   C a l c u l a t e d F a i l e d
Proposed work for q = 2 C a n n o t   b e   C a l c u l a t e d F a i l e d
Proposed work for q = 7 S S F A A L 1 = L 1.9247 , S S F A A L 2 = L 0.7078 , S S F A A L 3 = L 1.6725 ,
S S F A A L 4 = L 0.6890 , S S F A A L 5 = L 1.4162 , S S F A A L 6 = L 2.1921
A A L 6 A A L 1 A A L 3
A A L 5 A A L 2 A A L 4
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yang, M.-S.; Ali, Z.; Mahmood, T. Complex q-Rung Orthopair Uncertain Linguistic Partitioned Bonferroni Mean Operators with Application in Antivirus Mask Selection. Symmetry 2021, 13, 249. https://doi.org/10.3390/sym13020249

AMA Style

Yang M-S, Ali Z, Mahmood T. Complex q-Rung Orthopair Uncertain Linguistic Partitioned Bonferroni Mean Operators with Application in Antivirus Mask Selection. Symmetry. 2021; 13(2):249. https://doi.org/10.3390/sym13020249

Chicago/Turabian Style

Yang, Miin-Shen, Zeeshan Ali, and Tahir Mahmood. 2021. "Complex q-Rung Orthopair Uncertain Linguistic Partitioned Bonferroni Mean Operators with Application in Antivirus Mask Selection" Symmetry 13, no. 2: 249. https://doi.org/10.3390/sym13020249

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop