Next Article in Journal
Multi-Granulation Graded Rough Intuitionistic Fuzzy Sets Models Based on Dominance Relation
Next Article in Special Issue
Some Interval Neutrosophic Dombi Power Bonferroni Mean Operators and Their Application in Multi–Attribute Decision–Making
Previous Article in Journal
Lorentzian Lattices and E-Polytopes
Previous Article in Special Issue
Generalized Neutrosophic Soft Expert Set for Multiple-Criteria Decision-Making
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Neutrosophic Cubic Power Muirhead Mean Operators with Uncertain Data for Multi-Attribute Decision-Making

1
Department of Mathematics and Statistics, International Islamic University Islamabad Pakistan, Islamabad 44000, Pakistan
2
School of Mathematical Sciences, Faculty of Science and Technology, Universiti Kebangsaan Malaysia, UKM Bangi, Selongar DE 43600, Malaysia
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(10), 444; https://doi.org/10.3390/sym10100444
Submission received: 31 August 2018 / Revised: 21 September 2018 / Accepted: 25 September 2018 / Published: 28 September 2018

Abstract

:
The neutrosophic cubic set (NCS) is a hybrid structure, which consists of interval neutrosophic sets (INS) (associated with the undetermined part of information associated with entropy) and single-valued neutrosophic set (SVNS) (associated with the determined part of information). NCS is a better tool to handle complex decision-making (DM) problems with INS and SVNS. The main purpose of this article is to develop some new aggregation operators for cubic neutrosophic numbers (NCNs), which is a basic member of NCS. Taking the advantages of Muirhead mean (MM) operator and power average (PA) operator, the power Muirhead mean (PMM) operator is developed and is scrutinized under NC information. To manage the problems upstretched, some new NC aggregation operators, such as the NC power Muirhead mean (NCPMM) operator, weighted NC power Muirhead mean (WNCPMM) operator, NC power dual Muirhead mean (NCPMM) operator and weighted NC power dual Muirhead mean (WNCPDMM) operator are proposed and related properties of these proposed aggregation operators are conferred. The important advantage of the developed aggregation operator is that it can remove the effect of awkward data and it considers the interrelationship among aggregated values at the same time. Furthermore, a novel multi-attribute decision-making (MADM) method is established over the proposed new aggregation operators to confer the usefulness of these operators. Finally, a numerical example is given to show the effectiveness of the developed approach.

1. Introduction

One of the drawbacks of real MADM problems is expressing attribute values in fuzzy and indeterminate DM environments. Fuzzy sets (FSs) developed by Zadeh [1] emerged as a tool for describing and communicating uncertainties and vagueness. Since its beginning, FS has gained a significant focus from researchers all over the world who studied its practical and theoretical aspects. Several extensions of FSs have been developed, such as interval-valued FS (IVFS) [2], which explained the truth membership degree (TMD) on a closed interval value in the interval [0, 1], and intuitionistic FS (IFS) [3], which explained the TMD and falsity-membership degree (FMD). Therefore, IFS defines fuzziness and uncertainty more comprehensively than FS. However, neither FS nor IFS are capable to handle indeterminate and inconsistent information. For example, when we take a student opinion about the teaching skills of a professor with about 0.6 being the possibility that the teaching skills of the professor are good, 0.5 being the possibility that the teaching skills of the professor are bad and 0.3 is the possibility that he/she may not be sure about the teaching skills of the professor whether bad or good. To handle such type of information, Smarandache [4] added a new component “indeterminacy membership degree” (IMD) to the TMD and FMD, all being independent elements lying in ] 0 , 1 + [ . The resulting set is now familiarly known as neutrosophic set (NS). To use NS in practical and engineering problems, some scholars developed simplified forms of NS, such as SVNS [5], INS [6,7], simplified neutrosophic sets [8,9], multi-valued NS [10], Q-neutrosophic soft set [11], complex neutrosophic soft expert set [12] and others.
In the real world, sometimes it is difficult to express the TMD in some fuzzy problems completely by an exact value or interval value. Therefore, Jun et al. [13] developed the concept of cubic set (CS) by combining FS and IVFS. CS defined uncertainty and vagueness by an interval value and a fuzzy value concurrently. In recent years, some researchers established some extended forms of CS. Garg et al. [14,15] combined IFS and interval-valued intuitionistic FS (IVIFS) to form cubic IFS (CIFS), while Ali et al. [16] and Jun et al. [17] combined INS and SVNS to develop the cubic NS (CNS), consisting of internal and external NCSs. Jun et al. [18] further investigated P-union and P-intersection of NCS and discussed their related properties. Since then, various studies to solve MADM problems based on NCSs are developed. Zhang et al. [19] and Ye [20] developed some aggregation operators such as weighted averaging operators and weighted geometric operators on NCSs and applied these to MADM. Shi et al. [21], developed some aggregation operator for NCNs based on Dombi T-norm and T-conorm and applied these to MADM. To solve MADM problems under NC information, various similarity measures are developed for NCSs [22,23]. Pramanik et al. [24] introduced the NC-TODIM method to solve multiple-attribute group decision-making (MAGDM) problem.
Aggregation operator (AO) plays a dominant role in DM. Consequently, many scholars proposed different aggregation operators and their generalizations, such as Bonferroni mean (BM) operator [25,26], Heronian mean (HM) operator [27], Muirhead mean (MM) operator [28], Maclaurin symmetric mean (MSM) operator [29,30] and others. Certainly, different AOs have different functions. Some can remove the effect of awkward data given by prejudiced DMs, such as power average (PA) operator [31,32] developed by Yager [31] which can aggregate the input information by giving the weighted vector based on support degree among the input arguments. Some aggregation operators are capable to consider the interrelationship among two or more input arguments such as BM operator, HM operators, MSM operator and MM operator.
Due to the enhanced complexity in real decision-making problems, it is necessary to look over the following questions when selecting the best alternative. Firstly, the values of the attributes provided by the decision makers may be too low or too high, thus giving a negative impact on the final ranking results. The PA operator, however, permits the evaluated values to be mutually supported and enhanced. Therefore, we may use the PA operator to diminish such awful impact by designating distinct weights produced by the support measure. Secondly, the values of attributes are required to be dependent. Hence, the interrelationship among the values of the attributes should be examined. Some advantages of MM operator over BM and HM are discussed by Liu et al. [33,34]. Some existing aggregation operator such as the BM and MSM operators are special cases of the MM operator. The MM operator consists of the parameter vector, which enlarges the flexibility in the aggregation process. Recently, Li et al. [35] developed the concept of power Muirhead mean operator under Pythagorean fuzzy environment. From the existing literature, the PA operator and MM operator have not been yet combined to deal with NC information. To handle the issues raised, a few new aggregation operators will be proposed by incorporating both the PA and MM operators. These new aggregation operators are NC power MM operator (NCPMM), weighted NC power MM operator, NC power dual MM operator (NCPDMM) and weighted NC power dual MM (WNCPDMM) operator. Discussions on some basic properties and related cases with respect to the parameter vector will be dealt at length. The advantages of these proposed aggregation operators are to capture the interrelationship among input arguments by the MM operator, and simultaneously eliminate the effect of awkward data. Finally, a novel approach to solve MADM problems based on these proposed aggregation operators will be developed.
The rest of the article is organized as follows. In Section 2, some basic definitions and properties of NCSs, MM and PA operators are recalled. In Section 3, the PA and MM operators in the construction of new operators, namely NCPMM, WNCPMM, NCPDMM and WNCPDMM operators are incorporated followed by discussions on their related properties. In Section 4, a novel method to MADM is established based on the developed aggregation operators. In Section 5, a numerical example is illustrated to show the effectiveness of the proposed method to solve a MADM problem. In Section 6, a comparison with the existing methods is given followed by the conclusion.

2. Preliminaries

In this part, some basic concepts about SVNSs, INSs, NCSs, PA and MM operators are briefly overviewed.

2.1. The NCSs and Their Operations

Definition 1
([4]). Let Γ be a space of points (objects), with a generic element in Γ denoted by n. A neutrosophic set N in Γ is defined as N = { n ; T N ( n ) , I N ( n ) , F N ( n ) n Γ } where T N ( n ) , I N ( n ) and F N ( n ) are the truth membership function, the indeterminacy membership function and the falsity-membership function respectively, such that T ; F ; I : Γ ] 0 , 1 + [ and 0 T N ( n ) + I N ( n ) + F N ( n ) 3 + .
Smarandache [4] developed the concept of NS as a generalization of FS, IFS and IVIFS. To apply NS to real and engineering problems easily, its parameters should be specified. Hence, Wang et al. [5] provided the following definition.
Definition 2
([5]). Let Γ be a space of points (objects), with a generic element in Γ denoted by n . A single-valued neutrosophic set S in Γ is defined as:
S = Γ T S ( n ) , I S ( n ) , F S ( n ) | n , n Γ
when Γ is continuous, and
S = i = 1 m T S ( n i ) , I S ( n i ) , F S ( n i ) | n i , n i Γ
when Γ is discrete, where T S ( n ) , I S ( n ) and F S ( n ) are the truth membership function, the indeterminacy membership function and the falsity-membership function respectively, such that T ; F ; I : Γ [ 0 , 1 ] and 0 T S ( n ) + I S ( n ) + F S ( n ) 3 .
Definition 3
([6]). Let Γ be a space of points (objects), with a generic element in Γ denoted by n. An interval neutrosophic set A in Γ is defined as:
A = Γ T A ( n ) , I A ( n ) , F A ( n ) | n , n Γ
when Γ is continuous, and
A = i = 1 m T A ( n i ) , I A ( n i ) , F A ( n i ) | n i , n i Γ
when Γ is discrete, where T A ( n ) , I A ( n ) and F A ( n ) are the truth membership function, the indeterminacy membership function and the falsity-membership function respectively. For each element n in Γ , we have
T A ( n ) = [ T A L ( n ) , T A U ( n ) ] [ 0 , 1 ] , I A ( n ) = [ I A L ( n ) , I A U ( n ) ] [ 0 , 1 ] ,   and   F A ( n ) = [ F A L ( n ) , F A U ( n ) ] [ 0 , 1 ]   such   that
0 sup T A U ( n ) + sup I A U ( n ) + sup F A U ( n ) 3 .
Definition 4
([16,17]). Let Γ be a non-empty set. A neutrosophic cubic set (NCS) in Γ is a pair Z = A , λ , where A = { n , T A ( n ) , I A ( n ) , F A ( n ) | n Γ } is an interval neutrosophic set in Γ and λ = { n , λ T ( n ) , λ I ( n ) , λ F ( n ) | n Γ } is a neutrosophic set in Γ .
For simplicity, a basic element { n , T ( n ) , I ( n ) , F ( n ) , λ T ( n ) , λ I ( n ) , λ F ( n ) } in a NCS can be expressed by z = ( T , I , F , λ T , λ I , λ F ) , which is called neutrosophic cubic number (NCN), where T , I , F [ 0 , 1 ] and λ T , λ I , λ F [ 0 , 1 ] , satisfying 0 T U + I U + F U 3 and 0 λ T + λ I + λ F 3 .
Definition 5
([20]). Let z 1 = ( [ T 1 L , T 1 U ] , [ I 1 L , I 1 U ] , [ F 1 L , F 1 U ] , λ T 1 , λ I 1 , λ F 1 ) and z 2 = ( [ T 2 L , T 2 U ] , [ I 2 L , I 2 U ] , [ F 2 L , F 2 U ] , λ T 2 , λ I 2 , λ F 2 ) be any two NCNs and ξ > 0 . Then the operational laws for NCNs defined by Ye [20] are as follows:
( 1 )   z 1 z 2 = ( [ T 1 L + T 2 L T 1 L T 2 L , T 1 U + T 2 U T 1 U T 2 U ] , [ I 1 L I 2 L , I 1 U I 2 U ] , [ F 1 L F 2 L , F 1 U F 2 U ] , λ T 1 + λ T 2 λ T 1 λ T 2 , λ I 1 λ I 2 , λ F 2 λ F 2 ) ;
( 2 )   z 1 z 2 = ( [ T 1 L T 2 L , T 1 U T 2 U ] , [ I 1 L + I 2 L I 1 L I 2 L , I 1 U + I 2 U I 1 U I 2 U ] , [ F 1 L + F 2 L F 1 L F 2 L , F 1 U + F 2 U F 1 U F 2 U ] , λ T 1 λ T 2 , λ I 1 + λ I 2 λ I 1 λ I 2 , λ F 2 + λ F 2 λ F 2 λ F 2 ) ;
( 3 )   ξ z 1 = ( [ 1 ( 1 ( T 1 L ) ) ξ , 1 ( 1 ( T 1 U ) ) ξ ] , [ ( I 1 L ) ξ , ( I 1 U ) ξ ] , [ ( F 1 L ) ξ , ( F 1 U ) ξ ] , 1 ( 1 λ T 1 ) ξ , ( λ I 1 ) ξ , ( λ F 1 ) ξ ) ;
( 4 )   z 1 ξ = [ ( T 1 L ) ξ , 1 ( T 1 U ) ξ ] , [ 1 ( 1 I 1 L ) ξ , 1 ( 1 I 1 U ) ξ ] , [ 1 ( 1 F 1 L ) ξ , 1 ( 1 F 1 U ) ξ ] , ( λ T 1 ) ξ , 1 ( 1 λ I 1 ) ξ , 1 ( 1 λ F 1 ) ξ .
Definition 6
([21]). Let z 1 = ( [ T 1 L , T 1 U ] , [ I 1 L , I 1 U ] , [ F 1 L , F 1 U ] , λ T 1 , λ I 1 , λ F 1 ) be an NCN. Then, the score, accuracy, and certainty functions of NCN are defined as follows:
S ^ ( z 1 ) = 4 + T 1 L I 1 L F 1 L + T 1 U I 1 U F 1 U + λ T 1 + 2 λ I 1 λ F 1 9 ;
A ^ ( z 1 ) = T 1 L I 1 L + T 1 U I 1 U + λ T 1 λ F 1 3   and   C ^ ( z 1 ) = T 1 L + T 1 U + λ T 1 3 .
Theorem 1
([21]). Let z 1 = ( [ T 1 L , T 1 U ] , [ I 1 L , I 1 U ] , [ F 1 L , F 1 U ] , λ T 1 , λ I 1 , λ F 1 ) and z 2 = ( [ T 2 L , T 2 U ] , [ I 2 L , I 2 U ] , [ F 2 L , F 2 U ] , λ T 2 , λ I 2 , λ F 2 ) . Then the comparison rules for NCNs can be defined as follows:
(i) 
If S ^ ( z 1 ) > S ^ ( z 2 ) , then z 1 is greater than z 2 , and is denoted by z 1 > z 2 ;
(ii) 
If S ^ ( z 1 ) = S ^ ( z 2 ) , and A ^ ( z 1 ) > A ^ ( z 2 ) , then z 1 is greater than z 2 , and is denoted by z 1 > z 2 ;
(iii) 
If S ^ ( z 1 ) = S ^ ( z 2 ) , A ^ ( z 1 ) = A ^ ( z 2 ) , and C ^ ( z 1 ) > C ^ ( z 2 ) , then z 1 is greater than z 2 , and is denoted by z 1 > z 2 ;
(iv) 
If S ^ ( z 1 ) = S ^ ( z 2 ) , A ^ ( z 1 ) = A ^ ( z 2 ) , and C ^ ( z 1 ) = C ^ ( z 2 ) , then z 1 is equal to z 2 , and is denoted by z 1 = z 2 .

2.2. Power Average (PA) Operator

The PA operator was first introduced by Yager [31] for classical number. The dominant edge of PA operator is its capacity to diminish the inadequate effect of unreasonably too high and too low arguments on the inconclusive results.
Definition 7
([31]). Let g ( g = 1 , 2 , , a ) be a group of classical numbers. The PA operator is then represented as follows:
P A ( 1 , 2 , , a ) = g = 1 a ( ( 1 + T ( g ) ) x = 1 a ( 1 + T ( x ) ) g )
where, T ( z ) = x = 1 g x a S u p p ( g , x ) and S u p p ( z , x ) is the support degree for g and x . The support degree must satisfy the following axioms:
(1) 
S u p p ( g , x ) [ 0 , 1 ] ;
(2) 
S u p p ( g , x ) = S u p p ( x , g ) ;
(3) 
If D ¯ ¯ ( g , x ) < D ¯ ¯ ( l , m ) , then S u p p ( g , x ) > S u p p ( l , m ) , where D ¯ ¯ ( g , x ) is the distance measure among g and x .

2.3. Muirhead Mean (MM) Operator

The MM operator was first introduced by Muirhead [28] for classical numbers. MM operator has the advantage of considering the interrelationship among all aggregated arguments.
Definition 8
([28]). Let g ( g = 1 , 2 , , a ) be a group of classical numbers and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the MM operator is described as:
M M Q ( 1 , 2 , , a ) = ( 1 a ! θ S a g = 1 a θ ( g ) q g ) 1 g = 1 a q g
where, S a is the group of permutation of ( 1 , 2 , , a ) and θ ( g ) is any permutation of ( 1 , 2 , , a ) .
Now we can give some special cases with respect to the parameter vector Q of the MM operator, which are shown as follows:
(1)
If Q = ( 1 , 0 , 0 , , 0 ) , then the MM operator degenerates to the following form:
M M ( 1 , 0 , , 0 ) ( 1 , 2 , , a ) = 1 a g = 1 a g .
That is, the MM operator degenerates into arithmetic averaging operator.
(2)
If Q = ( 1 a , 1 a , , 1 a ) , then the MM operator degenerates to the following form:
M M ( 1 a , 1 a , , 1 a ) ( 1 , 2 , , a ) = g = 1 a g 1 a .
That is, the MM operator degenerates into geometric averaging operator.
(3)
If Q = ( 1 , 1 , 0 , , 0 ) , then the MM operator degenerates to the following form:
M M ( 1 , 1 , 0 , , 0 ) ( 1 , 2 , , a ) = ( 1 a ( a + 1 ) g , x = 1 g x a g x ) 1 2 .
That is, the MM operator degenerates into BM operator.
(4)
If Q = ( 1 , 1 , , 1 c , 0 , , 0 a c ) , then the MM operator degenerates to the following form:
M M ( 1 , 1 , , 1 d , 0 , , 0 a d ) ( 1 , 2 , , a ) = ( 1 x 1 < x 2 < < x d a y = 1 d g y C a d ) 1 d .
That is, the MM operator degenerates into MSM operator.

3. Some Power Muirhead Mean Operator for NCNs

In this part, we first give the definitions of PMM operator and propose the concept of power dual Muirhead mean (PDMM) operator. Then, we extended both the aggregation operator to NCN environment.
Definition 9
([35]). Let g ( g = 1 , 2 , , a ) be a group of classical numbers and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the PMM operator is explained as,
P M M Q ( 1 , 2 , , a ) = ( 1 a ! θ S a g = 1 a ( a ( 1 + T ( θ ( g ) ) ) x = 1 a ( 1 + T ( x ) ) θ ( g ) ) q g ) 1 g = 1 a q g
where, T ( g ) = x = 1 , x g a S u p p ( g , x ) and S u p p ( g , x ) is the support degree for g and x , satisfying the above conditions.
Definition 10.
Let g ( g = 1 , 2 , , a ) be a group of classical numbers and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the PDMM operator is described as,
P D M M Q ( 1 , 2 , , a ) = 1 g = 1 a q g ( θ S a g = 1 a q g θ ( g ) a ( 1 + T ( θ ( g ) ) ) x = 1 a ( 1 + T ( x ) ) ) 1 a !
where, T ( g ) = x = 1 x 1 a S u p p ( g , x ) and S u p p ( g , x ) is the support degree for g and x , satisfying the above conditions.

3.1. The Neutrosophic Cubic Power Muirhead Mean (NCPMM) Operator

In this subsection, we extend the PMM operator to neutrosophic cubic environment and discuss some basic properties, and special cases of these developed aggregation operators with respect to the parameter Q .
Definition 11.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. If,
N C P M M Q ( z 1 , z 2 , . , z a ) = ( 1 a ! θ S a g = 1 a ( a ( 1 + T ( z θ ( g ) ) ) x = 1 a ( 1 + T ( z x ) ) z θ ( g ) ) q g ) 1 g = 1 a q g
then, we call N C P M M Q the neutrosophic cubic power Muirhead mean operator, where S a is the group of all permutation, θ ( g ) is any permutation of ( 1 , 2 , , a ) and T ( z x ) = x = 1 , x g a S u p p ( z g , z x ) , S u p p ( z g , z x ) is the support degree for z g and z x , satisfying the following axioms:
(1) 
S u p p ( z g , z x ) [ 0 , 1 ] ;
(2) 
S u p p ( z g , z x ) = S u p p ( z x , z z ) ;
(3) 
If D ¯ ¯ ( z g , z x ) < D ¯ ¯ ( z u , z v ) , then S u p p ( z g , z x ) > S u p p ( z u , z v ) , where D ¯ ¯ ( z g , z x ) is the distance among z g and z x .
To write Equation (20) in a simple form, we can specify it as:
Θ g = ( 1 + T ( z g ) ) x = 1 a ( 1 + T ( z x ) ) .
For suitability, we can call ( Θ 1 , Θ 2 , , Θ a ) T the power weight vector (PMV), such that Θ g [ 0 , 1 ] and g = 1 a Θ g = 1 . From the use of Equation (20), Equation (19) can be expressed as:
N C P M M Q ( z 1 , z 2 , . , z a ) = ( 1 a ! θ S a g = 1 a ( a Θ g z θ ( g ) ) q g ) 1 g = 1 a q g .
Based on the operational rules given in Definition 3 for NCNs, and Definition 11, we can have the following Theorem 2.
Theorem 2.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the aggregated value obtained by using Equation (21) is still an NCN and,
N C P M M Q ( z 1 , z 2 , , z a ) = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) .
Proof. 
According to the operational laws for NCNs, we have
a Θ g z θ ( g ) = ( [ 1 ( 1 ( T L ) θ ( g ) ) a Θ g , 1 ( 1 ( T U ) θ ( g ) ) a Θ g ] , [ ( I L ) θ ( g ) a Θ g , ( I U ) θ ( g ) a Θ g ] , [ ( F L ) θ ( g ) a Θ g , ( F U ) θ ( g ) a Θ g ] , 1 ( 1 ( λ T ) θ ( g ) ) a Θ g , ( λ I ) θ ( g ) a Θ g , ( λ F ) θ ( g ) a Θ g ) .
Therefore,
( a Θ g z θ ( g ) ) q g = ( [ ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g , ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ] , [ , 1 ( 1 ( I L ) θ ( g ) a Θ g ) q g 1 ( 1 ( I ) θ ( g ) a Θ g ) q g ] , [ 1 ( 1 ( F L ) θ ( g ) a Θ g ) q g , 1 ( 1 ( F U ) θ ( g ) a Θ g ) q g ] , ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g , 1 ( 1 ( λ I ) θ ( g ) a Θ g ) q g , 1 ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) .
Therefore,
g = 1 a ( a Θ g z θ ( g ) ) q g = ( [ g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g , g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ] , [ 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ] , [ 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ] , g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g , 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) ,
and
θ S a g = 1 a ( a Θ g z θ ( g ) ) q g = [ 1 θ S a ( g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) , 1 θ S a ( g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ] , [ θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) ] ) , [ θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) ] , 1 θ S a ( g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( λ f ) θ ( g ) a Θ g ) q g ) ) .
Furthermore,
1 a ! θ S a g = 1 a ( a Θ g z θ ( g ) ) q g = ( [ 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! , 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ] , [ ( θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) ) 1 a ! ] , [ ( θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) ) 1 a ! ] , 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) ) 1 a ! ) .
Hence,
( 1 a ! θ S a g = 1 a ( a Θ g Γ θ ( g ) ) q g ) 1 g = 1 a q g = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) , N C P M M Q ( z 1 , z 2 , , z a ) = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) .
This is the required proof of Theorem 2. ☐
In the above equations, we calculate the PWV Θ , after calculating the support degree S u p p ( z g , z x ) . First, we determined the S u p p ( z g , z x ) using
S u p p ( z g , z x ) = 1 D ¯ ¯ ( z g , z x ) ,
where,
D ¯ ¯ ( z g , z x ) = 1 9 ( ( T g L T x L ) 2 + ( T g U T x U ) 2 + ( I g L I x L ) 2 + ( I g U I x U ) 2 + ( F g L F x L ) 2 + ( F g U F x U ) 2 ( λ T g λ T x ) 2 + ( λ I g λ I x ) 2 + ( λ F g λ F x ) 2 ) .
Therefore, we use the equation
T ( z g ) = g = 1 , g x a S u p p ( z g , z x )
to obtain the values of T ( z g ) ( g = 1 , 2 , , a ) . Then using Equation (20) we can get the PWV.
Theorem 3.
(Idempotency) Let z g ( g = 1 , 2 , , a ) be a group of NCNs, and z g = z , for all g = 1 , 2 , , a . Then,
N C P M M Q ( z 1 , z 2 , , z a ) = C N .
Proof. 
As z g = z for all g = 1 , 2 , , a , we have S u p p ( z g , z x ) = 1 for all g , x = 1 , 2 , , a . Therefore, we can get Θ g = 1 a for all g . Moreover,
C N P M M Q ( z 1 , z 2 , , z a ) = C N P M M Q ( z , z , , z ) = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 T L ) a 1 a ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 T L ) a 1 a ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 I L a 1 a ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 I U a 1 a ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 F L a 1 a ) q g ) 1 a ! ) 1 z = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 F U a 1 a ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 λ T ) a 1 a ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 λ I a 1 a ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 λ F a 1 a ) q g ) 1 a ! ) 1 g = 1 a q g ) , = ( [ ( 1 ( ( 1 ( 1 ( 1 T L ) ) g = 1 a q g ) a ! ) 1 a ! ) 1 g = 1 a q g , ( 1 ( ( 1 ( 1 ( 1 T U ) ) g = 1 a q g ) a ! ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 ( 1 ( 1 I L ) g = 1 a q g ) a ! 1 a ! ) 1 g = 1 a q g , 1 ( 1 ( 1 ( 1 I U ) g = 1 a q g ) a ! 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 ( 1 ( 1 F L ) g = 1 a q g ) a ! 1 a ! ) 1 g = 1 a q g , 1 ( 1 ( 1 ( 1 F U ) g = 1 a q g ) a ! 1 a ! ) 1 g = 1 a q g ] , ( 1 ( ( 1 ( 1 ( 1 λ T ) ) g = 1 a q g ) a ! ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 ( 1 ( 1 λ I ) g = 1 a q g ) a ! 1 a ! ) 1 g = 1 a q g , 1 ( 1 ( 1 ( 1 λ F ) g = 1 a q g ) a ! 1 a ! ) 1 g = 1 a q g ) , = ( [ T L , T U ] , [ I L , I U ] , [ F L , F U ] , λ T , λ I , λ F ) = z .
This is the required proof of Theorem 3. ☐
Theorem 4.
(Boundedness) Let z g ( g = 1 , 2 , , a ) be a group of NCNs. Where
z = min ( z 1 , z 2 , , z a ) = ( [ T L , T U ] , [ I + L , I + U ] , [ F + L , F + U ] , λ T , λ I + , λ F + ) ,   and     z + = max ( z 1 , z 2 , , z a ) = ( [ T + L , T + U ] , [ I L , I U ] , [ F L , F U ] , λ T + , λ I , λ F ) .
Then,
m N C P M M Q ( z 1 , z 2 , , z a ) n
where,
m = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 T θ ( g ) L ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 T θ ( g ) U ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 I + θ ( g ) L a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 I + U θ ( g ) a Θ z ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 F + θ ( g ) L a Θ z ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 F + θ ( g ) U a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 z = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I + ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F + ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) .
and
n = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 T + θ ( g ) L ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 T + θ ( g ) U ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 I θ ( g ) L a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 I U θ ( g ) a Θ z ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 F θ ( g ) L a Θ z ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 F θ ( g ) U a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T + ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 z = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) .
Proof. 
a Θ g z θ ( g ) = ( [ 1 ( 1 ( T L ) θ ( g ) ) a Θ g , 1 ( 1 ( T U ) θ ( g ) ) a Θ g ] , [ ( I L ) θ ( g ) a Θ g , ( I U ) θ ( g ) a Θ g ] , [ ( F L ) θ ( g ) a Θ g , ( F U ) θ ( g ) a Θ g ] , 1 ( 1 ( λ T ) θ ( g ) ) a Θ g , ( λ I ) θ ( g ) a Θ g , ( λ F ) θ ( g ) a Θ g ) ( [ 1 ( 1 ( T L ) θ ( g ) ) a Θ g , 1 ( 1 ( T U ) θ ( g ) ) a Θ g ] , [ ( I + L ) θ ( g ) a Θ g , ( I + U ) θ ( g ) a Θ g ] , [ ( F + L ) θ ( g ) a Θ g , ( F + U ) θ ( g ) a Θ g ] , 1 ( 1 ( λ T ) θ ( g ) ) a Θ g , ( λ I + ) θ ( g ) a Θ g , ( λ F + ) θ ( g ) a Θ g ) .
and
( a Θ g z θ ( g ) ) q g = ( [ ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g , ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ] , [ , 1 ( 1 ( I L ) θ ( g ) a Θ g ) q g 1 ( 1 ( I U ) θ ( g ) a Θ g ) q g ] ,      [ 1 ( 1 ( F L ) θ ( g ) a Θ g ) q g 1 ( 1 ( F U ) θ ( g ) a Θ g ) q g ] , ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g , 1 ( 1 ( λ I ) θ ( g ) a Θ g ) q g , 1 ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) ( [ ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g , ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ] , [ , 1 ( 1 ( I + L ) θ ( g ) a Θ g ) q g 1 ( 1 ( I + U ) θ ( g ) a Θ g ) q g ] , [ 1 ( 1 ( F + L ) θ ( g ) a Θ g ) q g 1 ( 1 ( F + U ) θ ( g ) a Θ g ) q g ] , ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g , 1 ( 1 ( λ I + ) θ ( g ) a Θ g ) q g , 1 ( 1 ( λ F + ) θ ( g ) a Θ g ) q g ) .
Thus,
g = 1 a ( a Θ g z θ ( g ) ) q g = ( [ g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g , g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ] , [ 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ] , [ 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ] , g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g , 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) ( [ g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g , g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ] , [ 1 g = 1 a ( 1 ( I + L ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( I + U ) θ ( g ) a Θ g ) q g ] , [ 1 g = 1 a ( 1 ( F + L ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( F + U ) θ ( g ) a Θ g ) q g ] , g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g , 1 g = 1 a ( 1 ( λ I + ) θ ( g ) a Θ g ) q g , 1 g = 1 a ( 1 ( λ F + ) θ ( g ) a Θ g ) q g ) .
and
θ S a z = 1 a ( a Θ g z θ ( g ) ) q g = ( [ 1 θ S a ( g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) , 1 θ S a ( g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ] , [ θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) ] , [ θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) ] , 1 θ S a ( g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) ) ( [ 1 θ S a ( g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) , 1 θ S a ( g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ] , [ θ S a ( 1 g = 1 a ( 1 ( I + L ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( I + U ) θ ( g ) a Θ g ) q g ) ] , [ θ S a ( 1 g = 1 a ( 1 ( F + L ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( F + U ) θ ( g ) a Θ g ) q g ) ] , 1 θ S a ( g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( λ I + ) θ ( g ) a Θ g ) q g ) , θ S a ( 1 g = 1 a ( 1 ( λ F + ) θ ( g ) a Θ g ) q g ) ) .
Furthermore,
1 a ! θ S a g = 1 a ( a Θ g z θ ( g ) ) q g = ( [ 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! , 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ] , [ ( θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) ) 1 a ! ] , [ ( θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) ) 1 a ! ] , 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 z = 1 a ( 1 ( λ F ) θ ( z ) a Θ z ) q z ) ) 1 a ! ) ( [ 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! , 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ] , [ ( θ S a ( 1 g = 1 a ( 1 ( I + L ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( I + U ) θ ( g ) a Θ g ) q g ) ) 1 a ! ] , [ ( θ S a ( 1 g = 1 a ( 1 ( F + L ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( F + U ) θ ( g ) a Θ g ) q g ) ) 1 a ! ] , 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 g = 1 a ( 1 ( λ I + ) θ ( g ) a Θ g ) q g ) ) 1 a ! , ( θ S a ( 1 z = 1 a ( 1 ( λ F + ) θ ( z ) a Θ z ) q z ) ) 1 a ! ) .
Hence,
( 1 a ! θ S a z = 1 a ( a Θ z Γ θ ( z ) ) q z ) 1 z = 1 a q z = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I + L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I + U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F + L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F + U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I + ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F + ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ) .
This implies that m N C P M M Q ( z 1 , z 2 , , z a ) .
In a similar way we can show that N C P M M Q ( z 1 , z 2 , , z a ) n . Hence, m N C P M M Q ( z 1 , z 2 , , z a ) n .
The NCPMM operator does not have the property of monotonicity.
One of the leading advantages of NCPMM is its capacity to represent the interrelationship among NCNs. Furthermore, the NCPMM operator is more flexible in aggregation process due to parameter vector. Now, we discuss some special cases of NCPMM operators by assigning different values to the parameter vector.
Case 1.
If Q = ( 1 , 0 , , 0 ) , then the NCPMM operator degenerates into the following form:
N C P M M ( 1 , 0 , , 0 ) ( z 1 , z 2 , . , z a ) = ( g = 1 a ( 1 + T ( z g ) ) x = 1 a ( 1 + T ( z x ) ) z g ) .
This is the NC power averaging operator.
Case 2.
If Q = ( 1 a , 1 a , . , 1 a ) , then the NCPMM operator degenerates into the following form:
N C P M M ( 1 a , 1 a , , 1 a ) ( z 1 , z 2 , . , z a ) = g = 1 a z g ( 1 + T ( z θ ( g ) ) ) x = 1 a ( 1 + T ( z x ) ) .
This is the NC power geometric operator.
Case 3.
If Q = ( 1 , 1 , , 0 ) , then the NCPMM operator degenerates into the following form:
N C P M M ( 1 , 1 , 0 , , 0 ) = ( z 1 , z 2 , , z a ) = ( [ ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 T g L ) Θ g ) ( 1 ( 1 T x L ) Θ x ) ) ) 1 a 2 a ) 1 2 , ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 T g U ) Θ g ) ( 1 ( 1 T x U ) Θ x ) ) ) 1 a 2 a ) 1 2 ] , [ 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 I g L Θ g ) ( 1 I x L Θ x ) ) ) 1 a 2 a ) 1 2 , 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 I g U Θ g ) ( 1 I x U Θ x ) ) ) 1 a 2 a ) 1 2 ] , [ 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 F g L Θ g ) ( 1 F x L Θ x ) ) ) 1 a 2 a ) 1 2 , 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 F g U Θ g ) ( 1 F x U Θ x ) ) ) 1 a 2 a ) 1 2 ] , ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( λ T ) g ) Θ z ) ( 1 ( 1 T x ) Θ x ) ) ) 1 a 2 a ) 1 2 , 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 ( λ I ) g Θ g ) ( 1 ( λ T ) x Θ x ) ) ) 1 a 2 a ) 1 2 , 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 ( λ F ) z Θ z ) ( 1 ( λ F ) x Θ x ) ) ) 1 a 2 a ) 1 2 ) .
This is the NC power Bonferroni mean operator ( p = q = 1 ) .
Case 4.
If Q = ( 1 , 1 , , 1 i , 0 , 0 , , 0 z i ) , then the NCPMM operator degenerates into the following form:
N C P M M ( 1 , 1 , , . , 1 i , 0 , 0 , , 0 z i ) = ( z 1 , z 2 , , z a ) = [ ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 T g x L ) Θ g x ) ) 1 C a i ) 1 k , ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 T g x U ) Θ g x ) ) 1 C a i ) 1 k ] , [ , 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 I g x L Θ g x ) ) 1 C a i ) 1 k , 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 I g x U Θ g x ) ) 1 C a i ) 1 k ] , [ 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 F g x L Θ g x ) ) 1 C a i ) 1 k , 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 F g x U Θ g x ) ) 1 C a i ) 1 k ] , ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( λ T ) g x ) Θ g x ) ) 1 C a i ) 1 k , 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( λ I ) g x Θ g x ) ) 1 C a i ) 1 k , 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( λ F ) g x Θ g x ) ) 1 C a i ) 1 k .
This is the NC power Maclaurin symmetric mean operator.

3.2. Weighted Neutrosophic Cubic Power Muirhead Mean (WNCPMM) Operator

The NCPMM operator does not consider the weight of the aggregated NCNs. In this subsection, we develop the WNCPMM operator, which has the capacity of taking the weights of NCNs.
Definition 12.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. If,
W N C P M M Q ( z 1 , z 2 , . , z a ) = ( 1 a ! θ S a g = 1 a ( a Ξ ϑ ( g ) Θ θ ( g ) x = 1 a Ξ x Θ x z θ ( g ) ) q g ) 1 g = 1 a q g
then, we W N C P M M Q the weighted neutrosophic cubic power Muirhead mean operator, where Ξ = ( Ξ 1 , Ξ 2 , , Ξ a ) T is the weight vector of z g ( g = 1 , 2 , , a ) such that Ξ z [ 0 , 1 ] , z = 1 a Ξ z = 1 , S a is the group of all permutation, θ ( z ) is any permutation of ( 1 , 2 , , a ) and Θ g is power weight vector (PWV) satisfying Θ g = ( 1 + T ( z g ) ) g = 1 a ( 1 + T ( z g ) ) , g = 1 a Θ g = 1 , T ( z x ) = x = 1 , x g a S u p p ( z g , z x ) , S u p p ( z g , z x ) is the support degree for z g and z x , satisfying the following axioms:
(1) 
S u p p ( z g , z x ) [ 0 , 1 ] ;
(2) 
S u p p ( z g , z x ) = S u p p ( z x , z g ) ;
(3) 
If D ¯ ¯ ( z g , z x ) < D ¯ ¯ ( z u , z v ) , then S u p p ( z g , z x ) > S u p p ( z u , z v ) , where D ¯ ¯ ( z g , z x ) is distance among z g and z x .
From Definition 12, we have the following Theorem 5.
Theorem 5.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the aggregated value obtained by using Equation (32) is still an NCN and
W N C P M M Q ( z 1 , z 2 , , z a ) = ( [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T L ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( T U ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I L ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( I U ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F L ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( F U ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g ] , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ T ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ I ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ F ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g ) .
Proof. 
Proof of Theorem 5 is same as Theorem 2. ☐

3.3. The Neutrosophic Cubic Power Dual Muirhead Mean (NCPDMM) Operator

In this subsection, we develop the NCPDMM operator and discuss some related properties.
Definition 13.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. If,
N C P D M M Q ( z 1 , z 2 , . , z a ) = 1 g = 1 a q g ( θ S a g = 1 a ( q g z θ ( g ) a ( 1 + T ( z θ ( g ) ) ) x = 1 a ( 1 + T ( z x ) ) ) ) 1 a !
then, we call N C P D M M Q the neutrosophic cubic power dual Muirhead mean operator, where S a is the group of all permutation, θ ( g ) is any permutation of ( 1 , 2 , , a ) and T ( z x ) = x = 1 , x g a S u p p ( z g , z x ) , S u p p ( z g , z x ) is the support degree for z g and z x , satisfying the following axioms:
(1) 
S u p p ( z g , z x ) [ 0 , 1 ] ;
(2) 
S u p p ( z g , z x ) = S u p p ( z x , z g ) ;
(3) 
If D ¯ ¯ ( z g , z x ) < D ¯ ¯ ( z u , z v ) , then S u p p ( z g , z x ) > S u p p ( z u , z v ) , where D ¯ ¯ ( z g , z x ) is distance among z g and z x .
To write Equation (34) in a simple form, we can specify it as:
Θ g = ( 1 + T ( z g ) ) x = 1 a ( 1 + T ( z x ) ) .
For suitability, we can call ( Θ 1 , Θ 2 , , Θ a ) T the power weight vector (PMV), such that Θ g [ 0 , 1 ] and g = 1 a Θ g = 1 . From, the use of Equation (35), Equation (34) can be expressed as,
N C P D M M Q ( z 1 , z 2 , . , z a ) = 1 g = 1 a q g ( θ S a g = 1 a ( q g z θ ( g ) a Θ θ ( g ) ) ) 1 a ! .
Theorem 6.
Let z g ( g = 1 , 2 , , a ) be a group of SVNNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the aggregated value obtained by using Equation (36) is still an NCN and,
N C P D M M Q ( z 1 , z 2 , , z a ) = ( [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ T ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 z = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ I ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ F ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ) .
Proof. 
Proof of Theorem 6 is similar to that of Theorem 2. ☐
Theorem 7
(Idempotency). Let z g ( g = 1 , 2 , , a ) be a group of NCNs, and z g = z , for all g = 1 , 2 , , a . Then,
N C P D M M Q ( z 1 , z 2 , , z a ) = z .
Theorem 8
(Boundedness). Let z g ( g = 1 , 2 , , a ) be a group of NCNs, z = min ( z 1 , z 2 , , z a ) = ( [ T L , T U ] , [ I + L , I + U ] , [ F + L , F + U ] , λ T , λ I + , λ F + ) , and z + = max ( z 1 , z 2 , , z a ) = ( [ T + L , T + U ] , [ I L , I U ] , [ F L , F U ] , λ T + , λ I , λ F ) .
Then,
m N C P D M M Q ( z 1 , z 2 , , z a ) n .
where,
m = ( [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I + L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I + U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F + L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F + U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , 1 ( 1 θ S a ( 1 z = 1 a ( 1 ( λ T ) θ ( z ) a Θ z ) q z ) 1 a ! ) 1 z = 1 a q z , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ I + ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ F + ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ) ,
and
n = ( [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T + L ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T + U ) θ ( g ) a Θ g ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F L ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F U ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ] , 1 ( 1 θ S a ( 1 z = 1 a ( 1 ( λ T + ) θ ( z ) a Θ z ) q z ) 1 a ! ) 1 z = 1 a q z , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ I ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ F ) θ ( g ) ) a Θ g ) q g ) ) 1 a ! ) 1 g = 1 a q g ) .
Now we will discuss some special cases of NCPDMM operator with respect to the parameter vector Q .
Case 1.
If Q = ( 1 , 0 , , 0 ) , then NCPDMM operators degenerate into the following form:
N C P D M M ( 1 , 0 , , 0 ) ( z 1 , z 2 , . , z a ) = ( g = 1 a z g ( 1 + T ( z g ) ) x = 1 a ( 1 + T ( z x ) ) )
This is the NC power geometric averaging operator.
Case 2.
If Q = ( 1 a , 1 a , . , 1 a ) , then NCPMM operators degenerate into the following form:
N C P D M M ( 1 a , 1 a , , 1 a ) ( z 1 , z 2 , . , z a ) = g = 1 a ( 1 + T ( z g ) ) x = 1 a ( 1 + T ( z x ) ) z g
This is NC power arithmetic averaging operator.
Case 3.
If Q = ( 1 , 1 , 0 , , 0 ) , then NCPDMM operators degenerate into the following form:
N C P D M M ( 1 , 1 , 0 , , 0 ) ( z 1 , z 2 , , z a ) = ( [ 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 ( T L ) g Θ g ) ( 1 ( T L ) x Θ x ) ) ) 1 a 2 a ) 1 2 , 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 ( T U ) g Θ g ) ( 1 ( T U ) x Θ x ) ) ) 1 a 2 a ) 1 2 ] , [ ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( I L ) g ) Θ g ) ( 1 ( 1 ( I L ) x ) Θ x ) ) ) 1 a 2 a ) 1 2 , ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( I U ) g ) Θ g ) ( 1 ( 1 ( I U ) x ) Θ x ) ) ) 1 a 2 a ) 1 2 ] , [ ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( F L ) g ) Θ g ) ( 1 ( 1 ( F L ) x ) Θ x ) ) ) 1 a 2 a ) 1 2 , ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( F U ) g ) Θ g ) ( 1 ( 1 ( F U ) x ) Θ x ) ) ) 1 a 2 a ) 1 2 ] , 1 ( 1 ( g , x = 1 g x a ( 1 ( 1 ( λ T ) g Θ g ) ( 1 ( λ T ) x Θ x ) ) ) 1 a 2 a ) 1 2 , ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( λ I ) g ) Θ g ) ( 1 ( 1 ( λ I ) x ) Θ x ) ) ) 1 a 2 a ) 1 2 , ( 1 ( g , x = 1 g x a ( 1 ( 1 ( 1 ( λ F ) g ) Θ g ) ( 1 ( 1 ( λ F ) x ) Θ x ) ) ) 1 a 2 a ) 1 2 ) .
This is the NC power geometric Bonferroni mean operator ( p = q = 1 ) .
Case 4.
If Q = ( 1 , 1 , , 1 i , 0 , 0 , , 0 z i ) , then the NCPDMM operator degenerates into the following form:
N C P D M M ( 1 , 1 , , . , 1 i , 0 , 0 , , 0 z i ) ( z 1 , z 2 , , z a ) = ( [ 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( T L ) g x Θ z g ) ) 1 C a i ) 1 k , 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( T U ) g x Θ z g ) ) 1 C a i ) 1 k ] , [ ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( I L ) g x ) Θ g x ) ) 1 C a i ) 1 k , ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( I U ) g x ) Θ g x ) ) 1 C a i ) 1 k ] , [ ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( F L ) g x ) Θ g x ) ) 1 C a i ) 1 k , ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( F U ) g x ) Θ g x ) ) 1 C a i ) 1 k ] 1 ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( λ T ) g x Θ g x ) ) 1 C a i ) 1 k , ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( λ I ) g x ) Θ g x ) ) 1 C a i ) 1 k , ( 1 1 y 1 < y 2 < . < y i a ( 1 x = 1 i ( 1 ( 1 ( λ F ) g x ) Θ g x ) ) 1 C a i ) 1 k ) .
This is the NC power dual Maclaurin symmetric mean operator.

3.4. Weighted Neutrosophic Cubic Power Dual Muirhead Mean (WNCPDMM) Operator

The NCPDMM operator does not consider the weight of the aggregated NCNs. In this subsection, we develop the WNCPDMM operator, which has the capacity of taking the weights of NCNs.
Definition 14.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. If,
W N C P D M M Q ( z 1 , z 2 , . , z a ) = 1 g = 1 a q g ( θ S a g = 1 a ( q g z θ ( g ) a Ξ ϑ ( g ) Θ θ ( g ) x = 1 a Ξ x Θ x ) ) 1 a !  
then, we call W N C P D M M Q the weighted neutrosophic cubic power dual Muirhead mean operator, where Ξ = ( Ξ 1 , Ξ 2 , , Ξ a ) T is the weight vector of z g ( g = 1 , 2 , , a ) such that Ξ g [ 0 , 1 ] , g = 1 a Ξ g = 1 , S a is the group of all permutation, θ ( g ) is any permutation of ( 1 , 2 , , a ) and Θ g is PVW satisfying Θ g = ( 1 + T ( z g ) ) g = 1 a ( 1 + T ( z g ) ) , g = 1 a Θ g = 1 , T ( z x ) = x = 1 , x g a S u p p ( z g , z x ) , and S u p p ( z g , z x ) is the support degree for z g and z x , satisfying the following axioms:
(1) 
S u p p ( z g , z x ) [ 0 , 1 ] ;
(2) 
S u p p ( z g , z x ) = S u p p ( z x , z g ) ;
(3) 
If D ¯ ¯ ( z g , z x ) < D ¯ ¯ ( z u , z v ) , then S u p p ( z g , z x ) > S u p p ( z u , z v ) , where D ¯ ¯ ( z g , z x ) is distance among z g and z x .
From Definition 14, we have the following Theorem 9.
Theorem 9.
Let z g ( g = 1 , 2 , , a ) be a group of NCNs and Q = ( q 1 , q 2 , , q a ) R a be a vector of parameters. Then, the aggregated value obtained by using Equation (44) is still an NCN and
W N C P D M M Q ( z 1 , z 2 , , z a ) = [ 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T L ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g , 1 ( 1 θ S a ( 1 g = 1 a ( 1 ( T U ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g ] , [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I L ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( I U ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g ] ,    [ ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F L ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( F U ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g ] ,    1 ( 1 θ S a ( 1 g = 1 a ( 1 ( λ T ) θ ( g ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) 1 a ! ) 1 g = 1 a q g , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ I ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g    , ( 1 ( θ S a ( 1 g = 1 a ( 1 ( 1 ( λ F ) θ ( g ) ) a Θ θ ( g ) Ξ ϑ ( g ) x = 1 a Θ x Ξ x ) q g ) ) 1 a ! ) 1 g = 1 a q g ) .
Proof. 
Proof of Theorem 9 is similar to that of Theorem 2. ☐

4. The MADM Approach Based on WNCPMM Operator and WNCPDMM Operator

In this section, we give a novel method to MADM with NCNs, in which the attributes values gain the form of NCNs. For a MADM problem, let the series of alternatives is represented by = { 1 , 2 , , a } , and the series of attributes is represented by ƛ = { ƛ 1 , ƛ 2 , , ƛ b } . The weight vector of the attributes is denoted by ϖ = ( ϖ 1 , ϖ 2 , , ϖ b ) T such that ϖ p [ 0 , 1 ] , p = 1 b ϖ p = 1 . Assume that z g h = ( [ T g h L , T g h U ] , [ I g h L , I g h U ] , [ F g h L , F g h U ] , λ T g h , λ I g h , λ F g h ) is the assessment values of the alternatives g on the attribute ƛ h , which is expressed by the form of NCN. Then, the main aim is to rank the alternatives. The following decision steps are to be followed.
  • Step 1. Standardize the decision matrix. Generally, there are two types of attributes, one is of cost type and the other is of benefit type. We need to convert the cost type of attributes into benefit types of attributes by using the following formula:
    z g h = ( [ T g h L , T g h U ] , [ I g h L , I g h U ] , [ F g h L , F g h U ] , λ T g h , λ I g h , λ F g h ) , = { ( [ T g h L , T g h U ] , [ I g h L , I g h U ] , [ F g h L , F g h U ] , λ T g h , λ I g h , λ F g h ) , for   benefit   attribute   Γ h , ( [ F g h L , F g h U ] , [ 1 I g h U , 1 I g h L ] , [ T g h L , T g h U ] , λ T g h , 1 λ I g h , λ F g h ) , for   cost   attribute   Γ h .
    Hence, the decision matrix M = [ z g h ] a × b can be transformed into normalized decision matrix N = [ δ g h ] a × b .
  • Step 2. Determine the supports S u p p ( δ g h , δ g l ) ( g = 1 , 2 , , a ; h , l = 1 , 2 , , b ) by,
    S u p p ( δ g h , δ g l ) = 1 D ¯ ¯ ( δ g h , δ g h )
    where, D ¯ ¯ ( δ g h , δ g h ) is the distance measure among two NCNs δ g h and δ g l defined in Equation (25).
  • Step 3. Determine T ( δ g h ) by,
    T ( δ g h ) = l = 1 l h b S u p p ( δ g h , δ g l ) ( g = 1 , 2 , , a ; h , l = 1 , 2 , , b )
  • Step 4. Determine the weights related with the NCN δ g h ( g = 1 , 2 , , a ; h = 1 , 2 , , b ) with the formula
    Ψ g h = b ϖ h ( 1 + T ( δ g h ) ) d = 1 b ϖ d ( 1 + T ( δ g h ) ) ( g = 1 , 2 , , a ; h , d = 1 , 2 , , b ) ,
    where, T ( δ g h ) = l = 1 l h b S u p p ( δ g h , δ g l ) ( g = 1 , 2 , , a ; h , l = 1 , 2 , , b ) is weighted support of NCN δ g h by the other NCN δ g l ( g = 1 , 2 , , a ; h , l = 1 , 2 , , b ) .
  • Step 5. Use the WNCPMM or WNCPDMM operators
    δ g = [ T g L , T g U ] , [ I g L , I g U ] , [ F g L , F g U ] , λ T g , λ I g , λ F g = W N C P M M Q ( δ g 1 , δ g 2 , , δ g b )
    or
    δ g = [ T g L , T g U ] , [ I g L , I g U ] , [ F g L , F g U ] , λ T g , λ I g , λ F g = W N C P D M M Q ( δ g 1 , δ g 2 , , δ g b )
    to calculate the overall NCNs, δ g ( g = 1 , 2 , , a ) .
  • Step 6. Determine the score values of the collective NCNs δ g ( g = 1 , 2 , , a ) , using Definition 6.
  • Step 7. Rank all the alternatives according to their score values, and the select the best one using Theorem 1.

5. An Illustrative Example

To show the application of the developed MADM method, an illustrative example is embraced from [19,21] with NC information.
Example 1.
A passenger wants to travel and select the best vans (alternatives) g ( g = 1 , 2 , 3 , 4 ) among the possible four vans. The customer takes the following four attributes into account to evaluate the possible four alternatives: (1) the facility ƛ 1 ; (2) saving rent ƛ 2 ; (3) comfort ƛ 3 ; (4) safety ƛ 4 . The importance degree of the attributes is expressed by ϖ = ( 0.5 , 0.25 , 0.125 , 0.125 ) T . Therefore, the following decision matrix M = [ z g h ] 4 × 4 can be obtained in the form of NCNs shown in Table 1.
Then, we apply the WNCPMM operator or WNCPDMM operator to solve the MADM problem.
Now, we use the WNCPMM operator for this decision-making problem as follows:
  • Step 1. Since all the attributes are the same, hence there is no need for conversion.
  • Step 2. Use Equation (47), to calculate the support degrees S u p p ( z g h , z g l ) ( 1 , 2 , , 4 ; h , l = 1 , 2 , , 4 ) . We denote S u p p ( z g h , z g l ) by S u p p g h , g l .
    S u p p 11 , 12 = S u p p 12 , 11 = 0.79452 , S u p p 11 , 13 = S u p p 13 , 11 = 0.735425 , S u p p 11 , 14 = S u p p 14 , 11 = 0.65359 , S u p p 12 , 13 = S u p p 13 , 12 = 0.771478 , S u p p 12 , 14 = S u p p 14 , 12 = 0.805635 , S u p p 13 , 14 = S u p p 14 , 13 = 0.786563 ; S u p p 21 , 22 = S u p p 22 , 21 = 0.7972 , S u p p 21 , 23 = S u p p 23 , 21 = 0.7667 , S u p p 21 , 24 = S u p p 24 , 21 = 0.727155 , S u p p 22 , 23 = S u p p 23 , 22 = 0.750556 , S u p p 22 , 24 = S u p p 24 , 22 = 0.750556 , S u p p 23 , 24 = S u p p 23 , 24 = 0.76906 , S u p p 31 , 32 = S u p p 32 , 31 = 0.8 , S u p p 31 , 33 = S u p p 33 , 31 = 0.614139 , S u p p 31 , 34 = S u p p 34 , 31 = 0.735425 , S u p p 32 , 33 = S u p p 33 , 32 = 0.690879 , S u p p 32 , 34 = S u p p 34 , 32 = 0.711325 , S u p p 33 , 34 = S u p p 33 , 34 = 0.797241 , S u p p 41 , 42 = S u p p 42 , 41 = 0.7551 , S u p p 41 , 43 = S u p p 43 , 41 = 0.783975 , S u p p 41 , 44 = S u p p 44 , 41 = 0.645662 , S u p p 42 , 43 = S u p p 43 , 42 = 0.783975 , S u p p 42 , 44 = S u p p 44 , 42 = 0.675107 , S u p p 43 , 44 = S u p p 44 , 43 = 0.7152 .
  • Step 3. Use Equation (48), to get T ( δ g h ) ( g , h = 1   t o   4 ) . We denote T ( δ g h ) by T g h .
    T 11 = 2.183534 , T 12 = 2.371633 , T 13 = 2.293466 , T 14 = 2.245787 ; T 21 = 2.291063 , T 22 = 2.298354 , T 23 = 2.286283 , T 24 = 2.246771 T 31 = 2.149564 , T 32 = 2.202204 , T 33 = 2.102259 , T 34 = 2.243991 , T 41 = 2.184688 , T 42 = 2.214133 , T 43 = 2.28315 , T 44 = 2.035969 .
  • Step 4. Use Equation (49), to obtain Ψ g h ( g , h = 1 , 2 , 3 , 4 ) .
    Ψ 11 = 1.957844 , Ψ 12 = 1.036761 , Ψ 13 = 0.506363 , Ψ 14 = 0.499032 , Ψ 21 = 2.002623 , Ψ 22 = 1.00353 , Ψ 23 = 0.499929 , Ψ 24 = 0.493918 , Ψ 31 = 1.987975 , Ψ 32 = 1.010601 , Ψ 33 = 0.489529 , Ψ 34 = 0.511894 ,
  • Step 5. Use the WNCPMM given in Equation (50),
    z g = ( [ T g L , T g U ] , [ I g L , I g U ] , [ F g L , F g U ] , λ T g , λ I g , λ F g ) = W C N P M M Q ( z g 1 , z g 2 , , z g 4 ) ( g = 1 , 2 , , 4 ) .
    To get the overall NCNs z g ( g = 1 , 2 , , 4 ) . Assume that Q = ( 1 , 1 , 1 , 1 ) .
    z 1 = ( [ 0.1399 , 0.4650 ] , [ 0.4421 , 0.7027 ] , [ 0.4691 , 0.6847 ] , 0.5483 , 0.6368 , 0.6029 ) ; z 2 = ( [ 0.2238 , 0.6021 ] , [ 0.5236 , 0.8162 ] , [ 0.5122 , 0.715 ] , 0.5617 , 0.5505 , 0.7294 ) ; z 3 = [ 0.3002 , 0.4736 ] , [ 0.3232 , 0.5782 ] , [ 0.3881 , 0.6445 ] , 0.3255 , 0.4952 , 0.415668 ; z 4 = [ 0.3413 , 0.5540 ] , [ 0.5437 , 0.7485 ] , [ 0.4487 , 0.5965 ] , 0.3762 , 0.4451 , 0.5976 .
  • Step 6. Using Definition 6, we calculate the score values of the collective NCNs z g ( g = 1 , 2 , , a ) .
    S C ˜ ( z 1 ) = 0.4022 , S C ˜ ( z 2 ) = 0.393352 , S C ˜ ( z 3 ) = 0.472717 , S C ˜ ( z 4 ) = 0.4324 .
  • Step 7. According to the score values, ranking order of the alternative is 3 > 4 > 1 > 2 .
Hence using Theorem 1, the best alternative is 3 and the worst is 2 .
Similarly, by using WNCPDMM operator for this decision-making problem, we will have, the Steps 1 to 4 are similar to that of weighted neutrosophic cubic power Muirhead mean operator.
  • Step 5. Use the WNCPDMM given in Equation (51),
    z g = [ T g L , T g U ] , [ I g L , I g U ] , [ F g L , F g U ] , λ T g , λ I g , λ F g = W N C P D M M Q ( z g 1 , z g 2 , , z g 4 ) ( g = 1 , 2 , , 4 ) .
    To get the overall NCNs z g ( g = 1 , 2 , , 4 ) . Assume that, Q = ( 1 , 1 , 1 , 1 ) .
    z 1 = [ 0.2569 , 0.6239 ] , [ 0.2929 , 0.5112 ] , [ 0.2375 , 0.4571 ] , 0.7682 , 0.4666 , 0.3905 ; z 2 = [ 0.3642 , 0.8179 ] , [ 0.3110 , 0.6479 ] , [ 0.3194 , 0.5430 ] , 0.7416 , 0.3336 , 0.5561 ; z 3 = [ 0.4935 , 0.6438 ] , [ 0.1794 , 0.3224 ] , [ 0.2248 , 0.4812 ] , 0.6502 , 0.3206 , 0.2330 ; z 4 = [ 0.4995 , 0.7691 ] , [ 0.2570 , 0.5332 ] , [ 0.2130 , 0.3815 ] , 0.5355 , 0.2744 , 0.3248 .
  • Step 6. Using Definition 6, we calculate the score values of the collective NCNs z g ( g = 1 , 2 , , a ) .
    S C ˜ ( z 1 ) = 0.5881 , S C ˜ ( z 2 ) = 0.5782 , S C ˜ ( z 3 ) = 0.6688 , S C ˜ ( z 4 ) = 0.6467 .
  • Step 7. According to the score values, ranking order of the alternative is 3 > 4 > 1 > 2 .
Hence using Theorem 1, the best alternatives is 3 , while the worst is 2 .
From the above obtained results, we can see that by using WNCPMM operator or WNCPDMM operator, the best alternative obtained is 3 , while the worst is 2 .

Effect of the Parameter Q on the Decision Result

In this subsection, different values to the parameter vector and the results obtained from these values are shown in Table 2 and Table 3. From Table 2 and Table 3, it can be seen that, when the value of the parameter vector Q is ( 1 , 0 , 0 , 0 ) , that is, when the interrelationship among the attributes is not considered, then according to the score values the best alternative is 4 while the worst is 2 . Similarly, when the value of the parameter vector Q is ( 1 , 1 , 0 , 0 ) , that is, when WCNPMM operator and WNCPDMM operator degenerate into neutrosophic cubic power Bonferroni mean operator and neutrosophic cubic power geometric Bonferroni mean operator respectively, the best alternative is 3 and 4 while the worst for both cases is 2 . When the value of the parameter vector Q is ( 1 , 1 , 1 , 0 ) , the best alternative is 3 and the worst is 2 . When the value of the parameter vector Q is ( 1 , 1 , 1 , 1 ) , the best alternative is 3 and the worst is 2 . Similarly, for other values of the parameter vector the score values and ranking order vary. Thus, one can select the value of the parameter vector according to the needs of the situations.

6. Comparison with Existing Methods

To show the efficiency and advantages of the proposed method, we give a comparative analysis. We exploit some existing methods to solve the same example and examine the final results. We compare our method in this paper with the methods developed by Qin et al. [30] based on weighted IFMSM operator, and the one developed by Liu et al. [32]-based generalized INPWA operator. We extend the IFMSM operator method [30] for intuitionistic fuzzy information to neutrosophic cubic Maclaurin symmetric mean operator. We also extend the GINPWA operator [32] for interval neutrosophic information to generalized neutrosophic cubic power average operator.
The method developed by Qin et al. [30], is based on MSM operator, which can consider the interrelationship among the attribute values, but unable to remove the effect of awkward data. The MSM operator is a special case of the proposed aggregation operator. Also, the ranking result obtained using the method of Qin et al. [30], is different from the one obtained using the proposed method.
Similarly, the method developed by Liu et al. [32], is based on power weighted averaging operator, which can remove the effect of awkward data but cannot consider the interrelationship among the attributes values. From Table 4, it can be seen that the ranking result obtained using Liu et al. [32] is the same as the ranking order obtained from the proposed method, when Q ( 1 , 0 , 0 , 0 ) . That is, when the interrelationship between NCNs are not considered. This shows the validity of the proposed approach. The ranking order is different when Q ( 1 , 1 , 1 , 1 ) . That is, when the interrelationship among four attributes are considered, then the ranking order is different. The main reason behind the different ranking results is due to the existing aggregation operators, can only consider a single characteristic at a time while aggregating the NCNs, meaning that they can only either consider interrelationship among attributes or remove the effect of awkward data. Our proposed aggregation operator, however, can consider two characteristics at a time. It can consider the interrelationship among the attributes and remove the effect of awkward data. In fact, these existing aggregation operators can be regarded as special cases to our proposed aggregation operator. Hence, our proposed aggregation operator is more practical and flexible to be used in decision-making problems.

7. Conclusions

In this article, we incorporate both the PA operator and MM operator to form a few new aggregation operators to aggregate CNNs, such as the cubic neutrosophic power Muirhead mean (CNPMM) operator, WCNPMM operator, CNPDMM operator and WCNPDMM operator. We discussed several basic results and properties, along with a few special cases of the proposed aggregation operators. In other words, the developed aggregation operators do not only consider the interrelationship among the NCNs, but also remove the influence of too high or too low arguments in the final results. Based on these aggregation operators, a novel approach to MADM problem is developed. Finally, a numerical example is illustrated to show the effectiveness and practicality of the proposed approach.
Our main contribution is enhancing the neutrosophic cubic aggregation operator and its MADM method under neutrosophic cubic environment. In future, we will incorporate the PA operator with the MM operator under the intuitionistic fuzzy environment [3], interval neutrosophic environment [6] and multi-valued neutrosophic environment [10], to develop new operators such as IFPMM, IFPDMM, INPMM, INPDMM, multi-valued neutrosophic power Muirhead mean (NPMM) and multi-valued neutrosophic power dual Muirhead mean (NPDMM) operators along with their weighted forms. We will apply these to MAGDM, data mining, decision support, recommender system and pattern recognition.

Author Contributions

Q.K. drafted the initial manuscript, T.M. supervised, N.H. corrected the draft and sourced the funding. All authors approved the publication work.

Funding

The APC is funded by Universiti Kebangsaan Malaysia under the grant GUP-2017-105.

Acknowledgments

We, the authors of this project are deeply grateful for the valuable suggestions and comments provided by the respected reviewers to improve the quality and worth of this research. We are also indebted to Universiti Kebangsaan Malaysia for providing financial support and facilities for this research under the grant GUP-2017-105.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

FSFuzzy set
IFSIntuitionistic fuzzy set
INSInterval neutrosophic set
INNInterval neutrosophic number
MADMMultiple-attribute decision-making
MAGDMMultiple-attribute group decision-making
MMMuirhead Mean
NSNeutrosophic set
NCNeutrosophic cubic
NCNNeutrosophic cubic number
NCPMMNeutrosophic cubic power Muirhead mean operator
NCPDMMNeutrosophic cubic power dual Muirhead mean operator
PAPower average operator
PWVPower weight vector
SVNSSingle-valued neutrosophic set
SVNNSingle-valued neutrosophic number
WNCPMMWeighted neutrosophic cubic power Muirhead mean
WNCPDMMWeighted neutrosophic cubic power dual Muirhead mean operator

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [Google Scholar] [CrossRef]
  3. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  4. Smarandache, F. Neutrosophy: Neutrosophic Probability, Set, and Logic; American Research Press: Rehoboth, IL, USA, 1998. [Google Scholar]
  5. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single valued neutrosophic sets. In Proceedings of the 8th Joint Conference on Information Sciences, Salt Lake, UT, USA, 21–26 July 2005; pp. 94–97. [Google Scholar]
  6. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Interval Neutrosophic Sets and Logic: Theory and Applications in Computing; Hexis: Phoenix, AZ, USA, 2005. [Google Scholar]
  7. Zhang, H.Y.; Wang, J.Q.; Chen, X.H. Interval neutrosophic sets and their application in multicriteria decision making problems. Sci. World J. 2014. [Google Scholar] [CrossRef] [PubMed]
  8. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar] [CrossRef]
  9. Peng, J.J.; Wang, J.Q.; Wang, J.; Zhang, H.Y.; Chen, X.H. Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems. Int. J. Syst. Sci. 2016, 47, 2342–2358. [Google Scholar] [CrossRef]
  10. Peng, J.J.; Wang, J.Q.; Wu, X.H.; Wang, J.; Chen, X.H. Multi-valued neutrosophic sets and power aggregation operators with their applications in multi-criteria group decision-making problems. Int. J. Comput. Intell. Syst. 2015, 8, 345–363. [Google Scholar] [CrossRef]
  11. Abu Qamar, M.; Hassan, N. Q-Neutrosophic Soft Relation and Its Application in Decision Making. Entropy 2018, 20, 172. [Google Scholar] [CrossRef]
  12. Al-Quran, A.; Hassan, N. The complex neutrosophic soft expert relation and its multiple attribute decision-making method. Entropy 2018, 20, 101. [Google Scholar] [CrossRef]
  13. Jun, Y.B.; Kim, C.S.; Yang, K.O. Cubic sets. Ann. Fuzzy Math. Inform. 2012, 4, 83–98. [Google Scholar]
  14. Kaur, G.; Garg, H. Multi-attribute decision-making based on Bonferroni mean operators under cubic intuitionistic fuzzy set environment. Entropy 2018, 20, 65. [Google Scholar] [CrossRef]
  15. Kaur, G.; Harish, G. Cubic intuitionistic fuzzy aggregation operators. Int. J. Uncertain. Quantif. 2018, 8, 405–427. [Google Scholar] [CrossRef]
  16. Ali, M.; Deli, I.; Smarandache, F. The theory of neutrosophic cubic sets and their applications in pattern recognition. J. Intell. Fuzzy Syst. 2018, 30, 1957–1963. [Google Scholar] [CrossRef]
  17. Jun, Y.B.; Smarandache, F.; Kim, C.S. Neutrosophic cubic sets. New Math. Nat. Comput. 2017, 13, 41–54. [Google Scholar] [CrossRef]
  18. Jun, Y.B.; Smarandache, F.; Kim, C.S. P-union and P-intersection of neutrosophic cubic sets. Analele Universitatii Ovidius Constanta-Seria Matematica 2017, 25, 99–115. [Google Scholar] [CrossRef] [Green Version]
  19. Zhan, J.; Khan, M.; Gulistan, M.; Ali, A. Applications of neutrosophic cubic sets in multi-criteria decision-making. Int. J. Uncertain. Quantif. 2017, 7, 377–394. [Google Scholar] [CrossRef]
  20. Ye, J. Operations and aggregation method of neutrosophic cubic numbers for multiple attribute decision-making. Soft Comput. 2018, 1–10. [Google Scholar] [CrossRef]
  21. Shi, L.; Ye, J. Dombi aggregation operators of neutrosophic cubic sets for multiple attribute decision-making. Algorithms 2018, 11, 29. [Google Scholar] [CrossRef]
  22. Lu, Z.; Ye, J. Cosine measures of neutrosophic cubic sets for multiple attribute decision-making. Symmetry 2017, 9, 121. [Google Scholar] [CrossRef]
  23. Pramanik, S.; Dalapati, S.; Alam, S.; Roy, T.K.; Smarandache, F. Neutrosophic cubic MCGDM method based on similarity measure. Neutrosophic Sets Syst. 2017, 16, 44–56. [Google Scholar]
  24. Pramanik, S.; Dalapati, S.; Alam, S.; Roy, T.K. NC-TODIM-based MAGDM under a neutrosophic cubic set environment. Information 2017, 8, 149. [Google Scholar] [CrossRef]
  25. Bonferroni, C. Sulle medie multiple di potenze. Bollettino dell’Unione Matematica Italiana 1950, 5, 267–270. [Google Scholar]
  26. Xu, Z.; Yager, R.R. Intuitionistic fuzzy Bonferroni means. IEEE Trans. Syst. Man Cybern. Part B Cybern. 2011, 41, 568–578. [Google Scholar] [CrossRef]
  27. Sykora, S. Mathematical Means and Averages: Generalized Heronian Means. Stan’s Libr. 2009. [Google Scholar] [CrossRef]
  28. Muirhead, R.F. Some methods applicable to identities and inequalities of symmetric algebraic functions of n letters. Proc. Edinb. Math. Soc. 1902, 21, 144–162. [Google Scholar] [CrossRef]
  29. Maclaurin, C. A second letter to Martin Folkes, Esq.; Concerning the roots of equations, with the demonstration of other rules of algebra. Philos. Trans. 1729, 36, 59–96. [Google Scholar]
  30. Qin, J.; Liu, X. An approach to intuitionistic fuzzy multiple attribute decision making based on Maclaurin symmetric mean operators. J. Intell. Fuzzy Syst. 2014, 27, 2177–2190. [Google Scholar] [CrossRef]
  31. Yager, R.R. The power average operator. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 2001, 31, 724–731. [Google Scholar] [CrossRef]
  32. Liu, P.; Tang, G. Some power generalized aggregation operators based on the interval neutrosophic sets and their application to decision making. J. Intell. Fuzzy Syst. 2016, 30, 2517–2528. [Google Scholar] [CrossRef]
  33. Liu, P.; Li, D. Some Muirhead mean operators for intuitionistic fuzzy numbers and their applications to group decision making. PLoS ONE 2017, 12, e0168767. [Google Scholar] [CrossRef] [PubMed]
  34. Liu, P.; You, X. Interval neutrosophic Muirhead mean operators and their application in multiple attribute group decision-making. Int. J. Uncertain. Quantif. 2017, 7, 303–334. [Google Scholar] [CrossRef]
  35. Li, L.; Zhang, R.; Wang, J.; Zhu, X.; Xing, Y. Pythagorean fuzzy power Muirhead mean operators with their application to multi-attribute decision making. J. Intell. Fuzzy Syst. 2018. [Google Scholar] [CrossRef]
Table 1. The decision matrix M = [ C N g h ] 4 × 4 .
Table 1. The decision matrix M = [ C N g h ] 4 × 4 .
ƛ 1 ƛ 2 ƛ 3 ƛ 4
1 ( [ 0.2 , 0.5 ] , [ 0.3 , 0.7 ] , [ 0.1 , 0.2 ] , 0.9 , 0.7 , 0.2 ) ( [ 0.2 , 0.4 ] , [ 0.4 , 0.5 ] , [ 0.2 , 0.5 ] , 0.7 , 0.4 , 0.5 ) ( [ 0.2 , 0.7 ] , [ 0.4 , 0.9 ] , [ 0.5 , 0.7 ] , 0.7 , 0.7 , 0.5 ) ( [ 0.1 , 0.6 ] , [ 0.3 , 0.4 ] , [ 0.5 , 0.8 ] , 0.5 , 0.5 , 0.7 )
2 ( [ 0.3 , 0.9 ] , [ 0.2 , 0.7 ] , [ 0.3 , 0.5 ] , 0.5 , 0.7 , 0.5 ) ( [ 0.3 , 0.7 ] , [ 0.6 , 0.8 ] , [ 0.2 , 0.4 ] , 0.7 , 0.6 , 0.8 ) ( [ 0.3 , 0.9 ] , [ 0.4 , 0.6 ] , [ 0.6 , 0.8 ] , 0.9 , 0.4 , 0.6 ) ( [ 0.2 , 0.5 ] , [ 0.4 , 0.9 ] , [ 0.5 , 0.8 ] , 0.5 , 0.2 , 0.7 )
3 ( [ 0.3 , 0.4 ] , [ 0.4 , 0.8 ] , [ 0.2 , 0.6 ] , 0.1 , 0.4 , 0.2 ) ( [ 0.2 , 0.4 ] , [ 0.2 , 0.3 ] , [ 0.2 , 0.5 ] , 0.2 , 0.2 , 0.2 ) ( [ 0.4 , 0.7 ] , [ 0.1 , 0.2 ] , [ 0.4 , 0.5 ] , 0.9 , 0.5 , 0.5 ) ( [ 0.6 , 0.7 ] , [ 0.3 , 0.6 ] , [ 0.3 , 0.7 ] , 0.7 , 0.5 , 0.3 )
4 ( [ 0.5 , 0.9 ] , [ 0.1 , 0.8 ] , [ 0.2 , 0.6 ] , 0.4 , 0.6 , 0.2 ) ( [ 0.4 , 0.6 ] , [ 0.5 , 0.7 ] , [ 0.1 , 0.2 ] , 0.5 , 0.3 , 0.2 ) ( [ 0.5 , 0.6 ] , [ 0.2 , 0.4 ] , [ 0.3 , 0.5 ] , 0.5 , 0.4 , 0.5 ) ( [ 0.3 , 0.7 ] , [ 0.7 , 0.8 ] , [ 0.6 , 0.7 ] , 0.4 , 0.2 , 0.8 )
Table 2. Score values and ranking orders for different parameter values in WCNPMM operator.
Table 2. Score values and ranking orders for different parameter values in WCNPMM operator.
Parameter Vector QScore ValuesRanking Orders
Q ( 1 , 0 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.5671 , S C ˜ ( C N 2 ) = 0.5230 , S C ˜ ( C N 3 ) = 0.5593 , S C ˜ ( C N 4 ) = 0.6031 . 4 > 1 > 3 > 2 .
Q ( 1 , 1 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.4579 , S C ˜ ( C N 2 ) = 0.4468 , S C ˜ ( C N 3 ) = 0.5092 , S C ˜ ( C N 4 ) = 0.5027 . 3 > 4 > 1 > 2 .
Q ( 1 , 1 , 1 , 0 ) S C ˜ ( C N 1 ) = 0.4227 , S C ˜ ( C N 2 ) = 0.4133 , S C ˜ ( C N 3 ) = 0.4866 , S C ˜ ( C N 4 ) = 0.4607 . 3 > 4 > 1 > 2 .
Q ( 1 , 1 , 1 , 1 ) S C ˜ ( C N 1 ) = 0.5881 , S C ˜ ( C N 2 ) = 0.5782 , S C ˜ ( C N 3 ) = 0.6688 , S C ˜ ( C N 4 ) = 0.6467 . 3 > 4 > 1 > 2 .
Q ( 0.5 , 0.5 , 0.5 , 0.5 ) S C ˜ ( C N 1 ) = 0.3988 , S C ˜ ( C N 2 ) = 0.3910 , S C ˜ ( C N 3 ) = 0.4708 , S C ˜ ( C N 4 ) = 0.4306 . 3 > 4 > 1 > 2 .
Q ( 5 , 0 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.6608 , S C ˜ ( C N 2 ) = 0.6235 , S C ˜ ( C N 3 ) = 0.6313 , S C ˜ ( C N 4 ) = 0.6854 . 4 > 1 > 3 > 2 .
Table 3. Score values and ranking orders for different parameter values in weighted neutrosophic cubic power dual Muirhead mean operator.
Table 3. Score values and ranking orders for different parameter values in weighted neutrosophic cubic power dual Muirhead mean operator.
Parameter Vector QScore ValuesRanking Orders
Q ( 1 , 0 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.5588 , S C ˜ ( C N 2 ) = 0.5346 , S C ˜ ( C N 3 ) = 0.6040 , S C ˜ ( C N 4 ) = 0.6081 . 4 > 1 > 3 > 2 .
Q ( 1 , 1 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.5881 , S C ˜ ( C N 2 ) = 0.5782 , S C ˜ ( C N 3 ) = 0.6688 , S C ˜ ( C N 4 ) = 0.6467 . 4 > 3 > 1 > 2 .
Q ( 1 , 1 , 1 , 0 ) S C ˜ ( C N 1 ) = 0.5760 , S C ˜ ( C N 2 ) = 0.5582 , S C ˜ ( C N 3 ) = 0.6478 , S C ˜ ( C N 4 ) = 0.6276 . 3 > 4 > 1 > 2 .
Q ( 1 , 1 , 1 , 1 ) S C ˜ ( C N 1 ) = 0.5881 , S C ˜ ( C N 2 ) = 0.5782 , S C ˜ ( C N 3 ) = 0.6688 , S C ˜ ( C N 4 ) = 0.6467 . 3 > 4 > 1 > 2 .
Q ( 0.5 , 0.5 , 0.5 , 0.5 ) S C ˜ ( C N 1 ) = 0.5909 , S C ˜ ( C N 2 ) = 0.5817 , S C ˜ ( C N 3 ) = 0.6741 , S C ˜ ( C N 4 ) = 0.6488 . 3 > 4 > 1 > 2 .
Q ( 5 , 0 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.4671 , S C ˜ ( C N 2 ) = 0.4073 , S C ˜ ( C N 3 ) = 0.4022 , S C ˜ ( C N 4 ) = 0.4559 . 1 > 4 > 2 > 3 .
Table 4. Score values and ranking orders for different parameter values in WCNPDMM operator.
Table 4. Score values and ranking orders for different parameter values in WCNPDMM operator.
Aggregation OperatorScore ValuesRanking Orders
NCMSM operator [30] S C ˜ ( C N 1 ) = 0.6263 , S C ˜ ( C N 2 ) = 0.6153 , S C ˜ ( C N 3 ) = 0.6355 , S C ˜ ( C N 4 ) = 0.6373 . 4 > 3 > 1 > 2 .
GNCPWA operator [32] S C ˜ ( C N 1 ) = 0.5694 , S C ˜ ( C N 2 ) = 0.5266 , S C ˜ ( C N 3 ) = 0.5646 , S C ˜ ( C N 4 ) = 0.6054 . 4 > 1 > 3 > 2 .
Proposed   WNCPMM   operator   Q ( 1 , 0 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.5671 , S C ˜ ( C N 2 ) = 0.5230 , S C ˜ ( C N 3 ) = 0.5593 , S C ˜ ( C N 4 ) = 0.6031 . 4 > 1 > 3 > 2 .
Proposed   WNCPDMM   operator   Q ( 1 , 0 , 0 , 0 ) S C ˜ ( C N 1 ) = 0.5588 , S C ˜ ( C N 2 ) = 0.5346 , S C ˜ ( C N 3 ) = 0.6040 , S C ˜ ( C N 4 ) = 0.6081 . 4 > 1 > 3 > 2 .
Proposed   WNCPMM   operator   Q ( 1 , 1 , 1 , 1 ) S C ˜ ( C N 1 ) = 0.5881 , S C ˜ ( C N 2 ) = 0.5782 , S C ˜ ( C N 3 ) = 0.6688 , S C ˜ ( C N 4 ) = 0.6467 . 3 > 4 > 1 > 2 .
Proposed   WNCPDMM   operator   Q ( 1 , 1 , 1 , 1 ) S C ˜ ( C N 1 ) = 0.5881 , S C ˜ ( C N 2 ) = 0.5782 , S C ˜ ( C N 3 ) = 0.6688 , S C ˜ ( C N 4 ) = 0.6467 . 3 > 4 > 1 > 2 .

Share and Cite

MDPI and ACS Style

Khan, Q.; Hassan, N.; Mahmood, T. Neutrosophic Cubic Power Muirhead Mean Operators with Uncertain Data for Multi-Attribute Decision-Making. Symmetry 2018, 10, 444. https://doi.org/10.3390/sym10100444

AMA Style

Khan Q, Hassan N, Mahmood T. Neutrosophic Cubic Power Muirhead Mean Operators with Uncertain Data for Multi-Attribute Decision-Making. Symmetry. 2018; 10(10):444. https://doi.org/10.3390/sym10100444

Chicago/Turabian Style

Khan, Qaisar, Nasruddin Hassan, and Tahir Mahmood. 2018. "Neutrosophic Cubic Power Muirhead Mean Operators with Uncertain Data for Multi-Attribute Decision-Making" Symmetry 10, no. 10: 444. https://doi.org/10.3390/sym10100444

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