Some Single-Valued Neutrosophic Uncertain Linguistic Maclaurin Symmetric Mean Operators and Their Application to Multiple-Attribute Decision Making

Abstract

The Maclaurin symmetric mean (MSM) operator has a good aggregation effect. It can capture the relationships between multiple input parameters, and the neutrosophic uncertain linguistic numbers can well represent some indeterminate and incomplete information. In this paper, we combine the MSM operator with the singled-valued neutrosophic uncertain linguistic set and propose some MSM operators based on single-valued neutrosophic uncertain linguistic environment, such as single-valued neutrosophic uncertain linguistic Maclaurin symmetric mean(SVNULMSM) operator and single-valued neutrosophic uncertain linguistic generalized Maclaurin symmetric mean(SVNULGMSM) operator. First of all, according to the neutrosophic set and uncertain linguistic numbers, we propose the single-valued neutrosophic uncertain linguistic numbers and give some operating rules. Furthermore, considering the influence of attribute weight on the results, we introduce the weighted SVNULMSM operator and weighted SVNULGMSM operator. Then, we propose a method to deal with MSDM problems and give the specific steps to solve the problem. Finally, an investment example is used to verify the effectiveness of our method, and the superiority of the method is proved by comparing with other methods.

1. Introduction

Multi-attribute decision making problems are very common in many research fields. In real life, many uncertain and inconsistent pieces of information cannot be described by specific values. In order to solve this problem, Zadeh [1] firstly proposed the concept of fuzzy set theory. However, a fuzzy set cannot express the non-membership degree. Then, Atanassov [2] presented the concept of intuitionistic fuzzy sets (IFSs), which involve degrees of membership and degrees of non-membership. The IFS includes the membership $T(x)$ and non-membership $F(x)$, and $T(x),F(x)\in [0,1]$, $0\le T(x)+F(x)\le 1$. Zwick et al. [3] proposed triangular IFS. Zeng and Li [4] defined trapezoidal IFS. Yager [5] discuss the need for obtaining aggregation operations on ordinal-based intuitionistic fuzzy subsets (OBIFS) and applied fuzzy multi-criteria technology to mobile "apps." Verma [6] defined some new operational-laws for LIFNs based on the linguistic scale function (LSF) and proposed a generalized linguistic intuitionistic fuzzy weighted average (GLIFWA) operator for aggregating LIFNs. However, IFSs cannot process indeterminate information and inconsistent information. Therefore, Smarandache [7] introduced the neutrosophic set (NS), which is composed of truth membership $T(x)$, falsity membership $F(x)$, and indeterminacy membership $I(x)$, and they are independent of each other. NS is an extension of IFS. Wang [8] presented interval NS(INS), which can represent the function of truth membership, falsity membership, and indeterminacy membership by the interval value. Wang et al. [9] extended some new sets of NSs and proposed a single-valued neutrosophic set (SVNS). Fan [10] defined a new form of SVNULS and expressed the weight of each expert in the uncertain linguistic part. Ji [11] established an MABAC–ELECTRE method under SVNUL environments and used it to solve the problem of outsourcing provider selection. Kamac [12] proposed a Hamming distance-based formula to measure the distance between two SVNULNs and presented a game theory model based on the framework of LSVNS technique.

In daily life, in addition to multi-attribute decision making problems that can be processed by qualitative information, some uncertain information is difficult to be described by precise numbers. At this time, decision makers usually use some language terms (LTs), such as “good”, “very good”, “bad”, and “very bad”. Therefore, Herrera and Herrera-Viedma [13] proposed the LTs to deal with this kind of non-qualitative information. However, linguistic variables can only express membership, and cannot express non-membership. On this basis, Wang [14] presented the concept of the intuitionistic linguistic set, which combines the concepts of linguistic variables and intuitionistic fuzzy sets. After that, Ye [15] proposed the SVNLNs and used LTs to describe the truth membership, indeterminacy membership, and falsity membership.

As an effective tool, aggregation operators are widely used in MADM problems [16]. Yager [17] proposed the ordered weighted average (OWA) operator [18] for multi-attribute decision making. Bonferroni presented the Bonferroni mean (BM) [19,20,21,22] operator, which can capture the interrelationships among multiple input arguments. Furthermore, Beliakov [23] proposed the Heronian mean (HM) [24,25,26] operators. Like the BM operator, it can also capture the interrelationships among multiple input arguments. However, since they can only reflect the interrelationships between two arguments, they cannot effectively deal with multi-attribute value decision making problems. Therefore, in order to solve this problem, Maclaurin introduced the MSM operator, which can capture the interrelationships between multiple input arguments [27]. Qin and Liu [28] extended the intuitionistic fuzzy numbers to MSM operator. Ju et al. [29] introduced some novel weighted intuitionistic linguistic MSM operators. Liu and Qin [30] combined the MSM operator with linguistic intuitionistic fuzzy numbers to deal with the MADM problem. Zhong Y [31] proposed hesitant fuzzy power Maclaurin symmetric mean operators. Furthermore, Qin [32] proposed a new method with which to solve the MADM problem by combining MSM operators with uncertain linguistic variables. In addition, it is also an effective method for applying an MSM operator to hesitant fuzzy sets [33,34].

As we know, an MSM operator can capture the interrelationships between multiple input arguments, and language terms can describe non-qualitative information well. Meanwhile, a neutrosophic set has advantages in expressing incomplete, indeterminate, and inconsistent information. Therefore, the purpose of this paper is to apply the MSM operator to the neutrosophic uncertain linguictic numbers environment, and propose some Maclaurin symmetric mean operators based on single-valued neutrosophic uncertain linguistic numbers, including the weighted SVNULMSM operator and the weighted SVNULGMSM operator. Then, we give some definitions and properties and prove them. Finally, an investment case is used to verify the effectiveness of the proposed method, and compared it with other methods to prove its advantages.

The complete structure of the paper is as follows: In Section 2, we give the definitions and properties of uncertain linguistic numbers, the single-valued neutrosophic set, the Maclaurin symmetric mean (MSM) operator, and the generalized Maclaurin symmetric mean (GMSM) operator. In Section 3, we introduce the single-valued neutrosophic uncertain linguistic set composed of the uncertain linguistic numbers and the single-valued neutrosophic set, and give some operational rules. In Section 4, we extend MSM operators to single-valued neutrosophic uncertain linguistic numbers, and propose the SVNULMSM operator, SVNULGMSM operator, WSVNULMSM operator, and WSVNULGMSM operator. In Section 5, we introduce the decision making methods based on the WSVNULMSM and WSVNULGMSM operators and give the specific operation steps. In Section 6, we demonstrate the effectiveness of the method with an investment example. In Section 7, we give the conclusions.

2. Preliminaries

2.1. The Uncertain Linguistic Numbers

Let $S=\{s_0,s_1,\dots ,s_{l-1}\}$ be a linguistic set, and $s_i\left(i=1,2,\dots ,l-1\right)$ is a linguistic number; l is an odd value. For example, when $l=7$, $S=\left(s_0,s_1,s_2,s_3,s_4,s_5,s_6\right)=$ (extremely poor, very poor, poor, medium, good, very good, extremely good).

Let $s_i$ and $s_j$ be any two linguistic numbers, and the characteristics are as follows: [35,36]

• If $i>j$, then $s_i>s_j$.
• There exists a negative operator: neg($s_i$) = $s_j$, where $j=l-1-i$.
• If $s_i>=s_j$, $max(s_i,s_j)=s_i$.
• If $s_i<=s_j$, $min(s_i,s_j)=s_i$.

Let $\overline{S}=\left\{s_{\alpha }\right|\alpha \in R^{+}\}$ be a continuous linguistic set, and $\overline{S}$ meets the strictly monotonically increasing condition. Some operational rules are defined as follows [37]:

$$\beta s_i=s_{\beta \times i}$$

(1)

$$s_i+s_j=s_{i+j}$$

(2)

$$s_i\times s_j=s_{i\times j}$$

(3)

$${s_i}^n=s_{i^n}$$

(4)

Definition 1

([8]). Let $\tilde{s}=[s_a,s_b]$,$s_a,s_b\in \overline{S}$, $a\le b$ be an uncertain linguistic variable, where $s_a$ is the lower limit of $\tilde{s}$ and $s_b$ is the upper limit of $\tilde{s}$. $\tilde{s}$

Suppose $\widetilde{s_1}=[s_{a1},s_{b1}]$ and $\widetilde{s_2}=[s_{a2},s_{b2}]$ are two uncertain linguistic variables. The operation laws are defined as follows [35,36,38]:

$$\widetilde{s_1}+\widetilde{s_2}=[s_{a1},s_{b1}]+[s_{a2},s_{b2}]=[s_{a1+a2-\frac{a1\times b1}{l}},s_{b1+b2-\frac{b1\times b2}{l}}]$$

(5)

$$\widetilde{s_1}\times \widetilde{s_2}=[s_{a1},s_{b1}]\times [s_{a2},s_{b2}]=[s_{\frac{a1\times a2}{l}},s_{\frac{b1\times b2}{l}}]$$

(6)

$$\lambda \widetilde{s_1}=\lambda [s_{a1},s_{b1}]=[s_{l-l{(1-\frac{a1}{l})}^{\lambda }},s_{l-l{(1-\frac{b1}{l})}^{\lambda }}],\lambda \ge 0$$

(7)

$${\widetilde{s_1}}^{\lambda }={[s_{a1},s_{b1}]}^{\lambda }=[s_{l{(\frac{a1}{l})}^{\lambda }},s_{l{(\frac{b1}{l})}^{\lambda }}],\lambda \ge 0$$

(8)

2.2. The Single-Valued Neutrosophic Set (SVNS)

Definition 2

([7]). Let X be a universe of discourse, with a generic element in X denoted by x. A SVNS A in X is

$$A=\{x,⟨T_A(x),I_A(x),F_A(x)⟩\mid x\in X\}$$

(9)

where $T_A(x)$, $I_A(x)$, and $F_A(x)$ are the truth membership, indeterminacy membership, and falsity membership functions. For each points x in X, $T_A(x),I_A(x),F_A(x)\in [0,1]$, and $0\le T_A(x)$+$I_A(x)$+$F_A(x)\le 1$.

Definition 3

([7]). Suppose $A=\{x,⟨T_A(x),I_A(x),F_A(x)⟩\mid x\in X\}$, $B=\{x,⟨T_B(x),I_B(x),F_B(x)⟩\mid x\in X\}$ be two SVNSs, and if $T_A(x)\le T_B(x)$, $I_A(x)\ge I_B(x)$, $F_A(x)\ge F_B(x)$ for all x in X, then $A\le B$.

2.3. Maclaurin Symmetric Mean Operator

Definition 4

([27,28,29,30]). Let $x_i(i=1,2,\dots ,n)$ be a collection of non-negative real numbers. A MSM operator of dimensions n is a mapping $MS{M}^{(m)}:{(R^{+})}^n\to R^{+}$, and it can be defined as follows:

$$MS{M}^{(m)}(x_1,x_2,\dots ,x_n)={(\frac{{\sum }_{1\le i_1<i_2\dots <i_m\le n}{\prod }_{j=1}^m{x}_{i_j}}{C_n^m})}^{\frac{1}{m}}$$

(10)

where $(i_1,\dots ,i_m)$ traverses all the m-tuple combinations of $(1,\dots ,n)$, and $C_n^m=\frac{n!}{m!(n-m)!}$ is the binomial coefficient. Furthermore, the $x_{i_j}$ mean refers to the $i_j$th element in a particular arrangement.

Property 1.

The $MS{M}^{(m)}$ operator has the following properties:

1. 

Idempotency. If $x_i=x$ for each i, and then $MS{M}^{(m)}(x,,\dots ,x)=x$.

2. 

Monotonicity. If $x_i\le y_i$ for all i, $MS{M}^{(m)}(x_1,,\dots ,x_n)\le MS{M}^{(m)}(y_1,,\dots ,y_n)$.

3. 

Boundedness. $min\{x_1,\dots ,x_n\}\le MS{M}^{(m)}(x_1,\dots ,x_n)\le max\{x_1,\dots ,x_n\}$.

Furthermore, when m takes different values, the $MS{M}^{(m)}$ operator can be converted to some special forms, as follows:

1. 

When m = 1, the $MS{M}^{(m)}$ operator reduces to the average operator.

$$MS{M}^{(1)}(x_1,\dots ,x_n)=(\frac{{\sum }_{1\le i_1\le n}{x}_{i_1}}{C_n^1})=\frac{{\sum }_{i=1}^n{x}_i}{n}$$

(11)

2. 

When m = 2, the $MS{M}^{(m)}$ operator reduces to the Bonferroni mean(BM) operator (p = q = 1).

$$\begin{array}{cc}\hfill MS{M}^{(2)}(x_1,\dots ,x_n)& ={(\frac{{\sum }_{1\le i_1<i_2\le n}{\prod }_{j=1}^2{x}_{i_j}}{C_n^2})}^{\frac{1}{2}}\hfill \\ \hfill & ={(\frac{2{\sum }_{1\le i_1<i_2\le n}{x}_{i_1}{x}_{i_2}}{n(n-1)})}^{\frac{1}{2}}\hfill \\ \hfill & ={(\frac{{\sum }_{i,j=1,i\ne j}^n{x}_i{x}_j}{n(n-1)})}^{\frac{1}{2}}\hfill \\ \hfill & =B{M}^{1,1}(x_1,\dots ,x_n)\hfill \end{array}$$

(12)

3. 

When m = 3, the $MS{M}^{(m)}$ operator reduces to the generalized Bonferroni mean (GBM) operator (p = q = r = 1).

$$\begin{array}{cc}\hfill MS{M}^{(3)}(x_1,\dots ,x_n)& ={(\frac{{\sum }_{1\le i_1<i_2<i_3\le n}{\prod }_{j=1}^3{x}_{i_j}}{C_n^3})}^{\frac{1}{3}}\hfill \\ \hfill & ={(\frac{6{\sum }_{1\le i_1<i_2<i_3\le n}{x}_{i_1}{x}_{i_2}{x}_{i_3}}{n(n-1)(n-2)})}^{\frac{1}{3}}\hfill \\ \hfill & ={(\frac{{\sum }_{i,j,k=1,i\ne j\ne k}^n{x}_i^1{x}_j^1{x}_k^1}{n(n-1)(n-2)})}^{\frac{1}{3}}\hfill \\ \hfill & =GB{M}^{1,1,1}(x_1,\dots ,x_n)\hfill \end{array}$$

(13)

4. 

When m = n, the $MS{M}^{(m)}$ operator reduces to the geometric mean operator.

$$MS{M}^{(n)}(x_1,\dots ,x_n)={(\frac{{\sum }_{1\le i_1<\dots <i_n\le n}{\prod }_{j=1}^n{x}_{i_j}}{C_n^n})}^{\frac{1}{n}}={({\displaystyle \prod _{j=1}^n}{x}_j)}^{\frac{1}{n}}$$

(14)

Definition 5

([27,28,29,30,31]). Let $x_i$ be the set of non-negative real numbers and $p_1,\dots ,p_m\ge 0$. A generalized MSM operator of dimension n is a mapping $GMS{M}^{(m,p_1,\dots ,p_m)}:{(R^{+})}^n\to R^{+}$, and it is defined below:

$$GMS{M}^{(m,p_1,\dots ,p_m)}(x_1,\dots ,x_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m{x}_{i_j}^{p_j}}{C_n^m})}^{\frac{1}{p_1+p_2+\dots +p_m}}$$

(15)

where $(i_1,i_2,\dots ,i_m)$ traverses all the m-tuple combination of $(1,2,\dots ,n)$, and $C_n^m=\frac{n!}{m!(n-m)!}$ is the binomial coefficient.

Property 2.

The $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator has the following properties:

1. 

Idempotency. If $x_i=x$ for each i, and then $GMS{M}^{(m,p_1,\dots ,p_m)}(x,\dots ,x)=x$

2. 

Monotonicity. if $x_i\le y_i$ for each i, and then $GMS{M}^{(m,p_1,\dots ,p_m)}(x_1,x_2,\dots ,x_n)\le GMS{M}^{(m,p_1,\dots ,p_m)}(y_1,y_2,\dots ,y_n)$

3. 

Boundedness. $min\{x_1,\dots ,x_n\}\le GMS{M}^{(m,p_1,\dots ,p_m)}(x_1,x_2,\dots ,x_n)\le max\{x_1,\dots ,x_n\}$

Furthermore, when m takes different values, the $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator can be converted to some special forms, as follows:

1. 

When m = 1, the $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator is as follows:

$$GMS{M}^{(1,p_1)}(x_1,x_2,\dots ,x_n)={(\frac{{\sum }_{1\le i_1\le n}{x}_{i_1}^{p_1}}{C_n^1})}^{\frac{1}{p_1}}={(\frac{{\sum }_{i=1}^n{x}_i^{p_1}}{n})}^{p_1}$$

(16)

2. 

When m = 2, the $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator is as follows:

$$\begin{array}{cc}\hfill GMS{M}^{(2,p_1,p_2)}(x_1,x_2,\dots ,x_n)& ={(\frac{{\sum }_{1\le i_1<i_2\le n}{x}_{i_1}^{p_1}{x}_{i_2}^{p_2}}{C_n^2})}^{\frac{1}{p_1+p_2}}\hfill \\ \hfill & ={(\frac{2{\sum }_{1\le i<j\le n}{x}_i^{p_1}{x}_j^{p_2}}{n(n-1)})}^{\frac{1}{p_1+p_2}}\hfill \\ \hfill & ={(\frac{{\sum }_{i,j=1,i\ne j}^n{x}_i^{p_1}{x}_j^{p_2}}{n(n-1)})}^{\frac{1}{p_1+p_2}}\hfill \\ \hfill & =B{M}^{p_1,p_2}\hfill \end{array}$$

(17)

3. 

When m = 3, the $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator is as follows:

$$\begin{array}{cc}\hfill GMS{M}^{(2,p_1,p_2,p_3)}(x_1,x_2,\dots ,x_n)& ={(\frac{{\sum }_{1\le i_1<i_2<i_3\le n}{x}_{i_1}^{p_1}{x}_{i_2}^{p_2}{x}_{i_3}^{p_3}}{C_n^3})}^{\frac{1}{p_1+p_2+p_3}}\hfill \\ \hfill & ={(\frac{6{\sum }_{1\le i<j<k\le n}{x}_i^{p_1}{x}_j^{p_2}{x}_k^{p_3}}{n(n-1)(n-2)})}^{\frac{1}{p_1+p_2+p_3}}\hfill \\ \hfill & ={(\frac{{\sum }_{i,j,k=1,i\ne j\ne k}^n{x}_i^{p_1}{x}_j^{p_2}{x}_k^{p_3}}{n(n-1)(n-2)})}^{\frac{1}{p_1+p_2+p_3}}\hfill \\ \hfill & =GB{M}^{p_1,p_2,p_3}\hfill \end{array}$$

(18)

4. 

When m = n, the $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator is as follows:

$$\begin{array}{cc}\hfill GMS{M}^{(n,p_1,\dots ,p_n)}(x_1,\dots ,x_n)& ={(\frac{{\sum }_{1\le i_1<\dots <i_n\le n}{\prod }_{j=1}^n{x}_{i_j}^{p_j}}{C_n^n})}^{\frac{1}{p_1+p_2+\dots +p_n}}\hfill \\ \hfill & ={({\displaystyle \prod _{j=1}^n}{x}_j^{p_j})}^{\frac{1}{p_1+p_2+\dots +p_n}}\hfill \end{array}$$

(19)

5. 

When $p_1=p_2=\dots =p_m=1$, the $GMS{M}^{(m,p_1,\dots ,p_m)}$ operator is as follows:

$$\begin{array}{cc}\hfill GMS{M}^{(m,1,\dots ,1)}(x_1,\dots ,x_n)& ={(\frac{{\sum }_{1\le i_1<\dots <i_n\le n}{\prod }_{j=1}^m{x}_{i_j}^1}{C_n^m})}^{\frac{1}{m}}\hfill \\ \hfill & ={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m}{C_n^m})}^{\frac{1}{m}}\hfill \\ \hfill & =MS{M}^{(m)}(x_1,\dots ,x_n)\hfill \end{array}$$

(20)

3. The Single-Valued Neutrosophic Uncertain Linguistic Set

Definition 6

([10]). Let X be a universe of discourse, with a generic element in X denoted by x, and $[S_{\mu (x)},S_{\nu (x)}]\in \tilde{S}$, then

$$A=\left\{⟨x,[S_{\mu (x)},S_{\nu (x)}],(T(x),I(x),F(x))⟩\right|x\in X\}$$

(21)

where $S_{\mu (x)},S_{\nu (x)}\in \overline{S}$, and $T(x)$, $I(x)$, $F(x)\in [0,1]$.

Definition 7

([24]). Let $A=\left\{⟨x,[S_{\mu },S_{\nu }],(T,I,F)⟩\right|x\in X\}$ be an SVNULS, and $a=\left\{⟨[S_{\mu },S_{\nu }],(T,I,F)⟩\right\}$ is called an SVNULN.

Suppose $a_1=⟨[S_{{\mu }_1},S_{{\nu }_1}],(T_1,I_1,F_1)⟩$ and $a_2=⟨[S_{{\mu }_2},S_{{\nu }_2}],(T_2,I_2,F_2)⟩$ are any two SVNULNs, and the operational laws are defined as follows:

$$a_1+a_2=⟨[S_{{\mu }_1+{\mu }_2-\frac{{\mu }_1{\mu }_2}{l}},S_{{\nu }_1+{\nu }_2-\frac{{\nu }_1{\nu }_2}{l}}],(T_1+T_2-T_1{T}_2,I_1{I}_2,F_1{F}_2)⟩$$

(22)

$$a_1\times a_2=⟨[S_{\frac{{\mu }_1{\mu }_2}{l}},S_{\frac{{\nu }_1{\nu }_2}{l}}],(T_1{T}_2,I_1+I_2-I_1{I}_2,F_1+F_2-F_1{F}_2)⟩$$

(23)

$$\lambda a_1=⟨[S_{l-l{(1-\frac{{\mu }_1}{l})}^{\lambda }},S_{l-l{(1-\frac{{\nu }_1}{l})}^{\lambda }}],(1-{(1-T_1)}^{\lambda },I_1^{\lambda },F_1^{\lambda })⟩$$

(24)

$$a_1^{\lambda }=⟨[S_{l{(\frac{{\mu }_1}{l})}^{\lambda }},S_{l{(\frac{{\nu }_1}{l})}^{\lambda }}],T_1^{\lambda },1-{(1-I_1)}^{\lambda },1-{(1-F_1)}^{\lambda })⟩$$

(25)

These operational results are still SVNULNs.

Definition 8

([24]). Suppose $a_1=⟨[S_{{\mu }_1},S_{{\nu }_1}],(T_1,I_1,F_1)⟩$ is an SVNULN, and the expectation value $E(a_1)$ of $a_1$ can be defined as follows:

$$E(a_1)=\frac{1}{3}(2+T_1-I_1-F_1)\times S_{\frac{{\mu }_1+{\nu }_1}{2}}=S_{l-l{(1-\frac{{\mu }_1+{\nu }_1}{2l})}^{\frac{1}{3}(2+T_1-I_1-F_1)}}$$

(26)

Definition 9

([24]). Suppose $a_1=⟨[S_{{\mu }_1},S_{{\nu }_1}],(T_1,I_1,F_1)⟩$ is an SVNULN, and the accuracy function $H(a_1)$ of $a_1$ can be defined as follows:

$$H(a_1)=(T_1+I_1+F_1)\times S_{\frac{{\mu }_1+{\nu }_1}{2}}=S_{l-l{(1-\frac{{\mu }_1+{\nu }_1}{2l})}^{T_1+I_1+F_1}}$$

(27)

Definition 10

([24]). Let $a_1=⟨[S_{{\mu }_1},S_{{\nu }_1}],(T_1,I_1,F_1)⟩$ and $a_2=⟨[S_{{\mu }_2},S_{{\nu }_2}],(T_2,I_2,F_2)⟩$ be any two SVNULNs; then

1. 

If $E(a_1)>E(a_2)$, then $a_1>a_2$

2. 

If $E(a_1)=E(a_2)$, then

If $H(a_1)>H(a_2)$, then $a_1>a_2$

If $H(a_1)=H(a_2)$, then $a_1=a_2$

4. Some Single-Valued Neutrosophic Uncertain Linguistic Maclaurin Symmetric Mean Operators

In this section, we propose SVNULMSM operators, SVNULGMSM operators, WSVNULMSM operators, and WSVNULGMSM operators.

4.1. The SVNULMSM Operator

Definition 11.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs. The SVNULMSM operator ${\Omega }^n\to \Omega$ is

$$SVNULMS{M}^{(m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m{a}_{i_j}}{C_n^m})}^{\frac{1}{m}}$$

(28)

Ω is a set of SVNULNs and $m=1,\dots ,n$.

Theorem 1.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$. Then,

$$\begin{array}{c}\hfill SVNULMS{M}^{(m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m{a}_{i_j}}{C_n^m})}^{\frac{1}{m}}=\\ \hfill ⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\mu }_{i_j}(k)}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}},S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\nu }_{i_j}(k)}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}}],\\ \hfill ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{T}_{i_j(k)})}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-I_{i_j(k)}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},\\ \hfill 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-F_{i_j(k)}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}})⟩\end{array}$$

(29)

where $k=1,2,\dots ,C_n^m$, $a_{i_j(k)}$ represents the $i_j$th element in the kth permutation.

Proof. 

$$\begin{array}{c}{a}_{i_j(k)}=⟨[S_{{\mu }_{i_j(k)}},S_{{\nu }_{i_j(k)}}],(T_{i_j(k)},I_{i_j(k)},F_{i_j(k)})⟩(j=1,\dots ,m)\\ \Rightarrow {\displaystyle \prod _{j=1}^m}{a}_{i_j(k)}=⟨[S_{l{\prod }_{j=1}^m(\frac{{\mu }_{i_j(k)}}{l})},S_{l{\prod }_{j=1}^m(\frac{{\nu }_{i_j(k)}}{l})}]\\ ,({\displaystyle \prod _{j=1}^m}{T}_{i_j(k)},1-{\displaystyle \prod _{j=1}^m}(1-I_{i_j(k)}),1-{\displaystyle \prod _{j=1}^m}(1-F_{i_j(k)}))⟩\\ \Rightarrow {\displaystyle \sum _{1\le i_1<\dots <i_m\le n}}{\displaystyle \prod _{j=1}^m}{a}_{i_j(k)}=⟨[S_{l-l{\prod }_{k=1}^{C_n^m}(1-{\prod }_{j=1}^m(\frac{{\mu }_{i_j(k)}}{l}))},S_{l-l{\prod }_{k=1}^{C_n^m}(1-{\prod }_{j=1}^m(\frac{{\nu }_{i_j(k)}}{l}))}]\\ ,(1-{\displaystyle \prod _{k=1}^{C_n^m}}(1-{\displaystyle \prod _{j=1}^m}(T_{i_j(k)})),{\displaystyle \prod _{k=1}^{C_n^m}}(1-{\displaystyle \prod _{j=1}^m}(1-I_{i_j(k)})),{\displaystyle \prod _{k=1}^{C_n^m}}(1-{\displaystyle \prod _{j=1}^m}(1-F_{i_j(k)})))⟩\\ \Rightarrow {(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m{a}_{i_j}}{C_n^m})}^{\frac{1}{m}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\mu }_{i_j}(k)}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}},S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\nu }_{i_j}(k)}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{T}_{i_j(k)})}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-I_{i_j(k)}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-F_{i_j(k)}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}})⟩\end{array}$$

□

Property 3.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,2,\dots ,n$. There are some properties of $SVNULMS{M}^{(m)}$ operator shown below.

1. 

Idempotency. If the SVNULN $a_i=a=⟨[S_{{\mu }_a},S_{{\nu }_a}],(T_a,I_a,F_a)⟩$ for each $i(i=1,2,\dots ,n)$,then $SVNULMS{M}^{(m)}(a,\dots ,a)=a=⟨[S_{{\mu }_a},S_{{\nu }_a},(T_a,I_a,F_a)]⟩$.

2. 

Commutativity. If $(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$ is a permutation of $(a_1,\dots ,a_n)$. Then

$SVNULMS{M}^{(m)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})=SVNULMS{M}^{(m)}(a_1,\dots ,a_n)$.

3. 

Monotonicity. Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩$ and $a_i^{{}^{\prime }}=⟨[S_{{\mu }_i^{{}^{\prime }}},S_{{\nu }_i^{{}^{\prime }}}],(T_i^{{}^{\prime }},I_i^{{}^{\prime }},F_i^{{}^{\prime }})⟩(i=1,2,\dots ,n)$ be two collections of neutrosophic uncertain linguistic numbers, and if $a_i\le a_i^{{}^{\prime }}$—i.e., $S_{{\mu }_i}\le S_{{\mu }_i^{{}^{\prime }}}$, $S_{{\nu }_i}\le S_{{\nu }_i^{{}^{\prime }}}$, $T_i\le T_i^{{}^{\prime }}$,$I_i\ge I_i^{{}^{\prime }}$, and $F_i\ge F_i^{{}^{\prime }}$, for all i—then, $SVNULMS{M}^{(m)}(a_1,\dots ,a_n)\le SVNULMS{M}^{(m)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$.

4. 

Boundedness. $min\{a_1,\dots ,a_n\}\le SVNULMS{M}^{(m)}(a_1,\dots ,a_n)\le max\{a_1,\dots ,a_n\}$.

Proof. 

• If each $a_i=a$, then we get the equation below:
  $$\begin{array}{c}SVNULMS{M}^{(m)}(a,\dots ,a)\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\mu }_a}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}},S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\nu }_a}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}}],\\ ({(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{T}_a)}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},1-{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-I_a))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-F_a))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}})⟩=⟨[S_{{\mu }_a},S_{{\nu }_a}],(T_a,I_a,F_a)\end{array}$$
• This property is clear and the proof is omitted.
• if $S_{{\mu }_i}\le S_{{\mu }_i^{{}^{\prime }}}$, $S_{{\nu }_i}\le S_{{\nu }_i^{{}^{\prime }}}$,$T_i\le T_i^{{}^{\prime }}$, $I_i\ge I_i^{{}^{\prime }}$, and $F_i\ge F_i^{{}^{\prime }}$ for all i, we can know ${\prod }_{j=1}^m{\mu }_i\le {\prod }_{j=1}^m{\mu }_i^{{}^{\prime }}$, ${\prod }_{j=1}^m{\nu }_i\le {\prod }_{j=1}^m{\nu }_i^{{}^{\prime }}$, ${\prod }_{j=1}^m{T}_i\le {\prod }_{j=1}^m{T}_i^{{}^{\prime }}$, ${\prod }_{j=1}^m{I}_i\le {\prod }_{j=1}^m{I}_i^{{}^{\prime }}$, ${\prod }_{j=1}^m{F}_i\le {\prod }_{j=1}^m{F}_i^{{}^{\prime }}$, then $l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\mu }_i}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}\le l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\mu }_i^{{}^{\prime }}}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}$, $l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\nu }_i}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}\le l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\nu }_i^{{}^{\prime }}}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}$, ${(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{T}_i)}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}\le {(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{T}_i^{{}^{\prime }})}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}$, $1-{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-I_i))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}\ge 1-{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-I_i^{{}^{\prime }}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}$,
  $1-{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-F_i))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}\ge 1-{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-F_i^{{}^{\prime }}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}$. Thus, we can get
  $SVNULMS{M}^{(m)}(a_1,\dots ,a_n)\le SVNULMS{M}^{(m)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$
• Let $min(a_1,\dots ,a_n)=a_l=SVNULMS{M}^{(m)}(a_l,\dots ,a_l)$, $max(a_1,\dots ,a_n)=a_h=SVNULMS{M}^{(m)}(a_h,\dots ,a_h)$. According to the monotonicity, if $a_l\le a_i$ and $a_i\le a_h$ for all i, we have $a_l=SVNULMS{M}^{(m)}(a_l,\dots ,a_l)\le SVNULMS{M}^{(m)}(a_1,\dots ,a_n)$ and $SVNULMS{M}^{(m)}(a_1,\dots ,a_n)\le a_h=SVNULMS{M}^{(m)}(a_h,\dots ,a_h)$.

□

Furthermore, when m takes different values, the $SVNULMS{M}^{(m)}$ operator can be converted to some special forms, which are as follows:

1. 

When m = 1, we have the formula below.

$$\begin{array}{c}\hfill SVNULMS{M}^{(1)}(a_1,\dots ,a_n)=\frac{{\sum }_{1\le i_1\le n}{a}_{i_1}}{C_n^1}=\frac{{\sum }_{i=1}^n{a}_i}{C_n^1}\\ \hfill =⟨[S_{l(1-{\prod }_{k=1}^n{(1-\frac{{\mu }_k}{l})}^{\frac{1}{n}})},S_{l(1-{\prod }_{k=1}^n{(1-\frac{{\nu }_k}{l})}^{\frac{1}{n}})}],\\ \hfill {(1-{\displaystyle \prod _{k=1}^n}{(1-T_k)}^{\frac{1}{n}},{\displaystyle \prod _{k=1}^n}{I}_k)}^{\frac{1}{n}},{\displaystyle \prod _{k=1}^n}{F}_k{)}^{\frac{1}{n}}\end{array}$$

(30)

2. 

When m = 2, we have the formula below.

$$\begin{array}{c}SVNULMS{M}^{(2)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<i_2\le n}{a}_{i_1}{a}_{i_2}}{C_n^2})}^{\frac{1}{2}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-\frac{{\mu }_{i_1(k)}}{l}\frac{{\mu }_{i_2(k)}}{l})}^{\frac{1}{C_n^2}})}^{\frac{1}{2}}},S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-\frac{{\nu }_{i_1(k)}}{l}\frac{{\nu }_{i_2(k)}}{l})}^{\frac{1}{C_n^2}})}^{\frac{1}{2}}}],\\ (1-{({\displaystyle \prod _{k=1}^{C_n^2}}{(1-T_{i_1(k)}{T}_{i_2(k)})}^{\frac{1}{C_n^2}})}^{\frac{1}{2}},\\ 1-(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-I_{i_1(k)}(1-I_{i_2(k)}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}}),\\ 1-(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-I_{i_1(k)}(1-I_{i_2(k)}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}}))⟩\end{array}$$

(31)

3. 

When m = n, we have the formula below.

$$\begin{array}{c}SVNULMS{M}^{(n)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_n\le n}{\prod }_{j=1}^n{a}_{i_j}}{C_n^n})}^{\frac{1}{n}}\\ =⟨[S_{l{({\prod }_{j=1}^n(\frac{{\mu }_j}{l}))}^{\frac{1}{n}}},S_{l{({\prod }_{j=1}^n(\frac{{\nu }_j}{l}))}^{\frac{1}{n}}}],\\ ({({\displaystyle \prod _{j=1}^n}{T}_j)}^{\frac{1}{n}},1-{({\displaystyle \prod _{j=1}^n}(1-I_j))}^{\frac{1}{n}},1-{({\displaystyle \prod _{j=1}^n}(1-F_j))}^{\frac{1}{n}})⟩\end{array}$$

(32)

4.2. The SVNULGMSM Operator

Definition 12.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs. The SVNULGMSM operator ${\Omega }^n\to \Omega$ is

$$SVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m{a}_{i_j}^{p_j}}{C_n^m})}^{\frac{1}{p_1+\dots +p_m}}$$

(33)

where Ω a set of SVNULNs and $m=1,\dots ,n$.

Theorem 2.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$. Then,

$$\begin{array}{c}SVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m{a}_{i_j}^{p_j}}{C_n^m})}^{\frac{1}{p_1+\dots +p_m}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{(\frac{{\mu }_{i_j(k)}}{l})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{(\frac{{\nu }_{i_j(k)}}{l})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(T_{i_j(k)})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(1-I_{i_j(k)})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(1-F_{i_j(k)})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}})⟩\end{array}$$

(34)

where $k=1,\dots ,C_n^m$, $a_{i_j(k)}$ represents the $i_j$th element in the kth permutation. The proof of Theorem 2 is similar to that of Theorem 1, so it is omitted here.

Property 4.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$. There are some properties of $SVNULGMS{M}^{(m)}$ operator shown below.

1. 

Idempotency. If the SVNULNs $a_i=a=⟨[S_{{\mu }_a},S_{{\nu }_a}],(T_a,I_a,F_a)⟩$ for each $i(i=1,2,\dots ,n)$, then $SVNULGMS{M}^{(m,p_1,\dots ,p_n)}(a,\dots ,a)=⟨[S_{{\mu }_a},S_{{\nu }_a}],(T_a,I_a,F_a)⟩$.

2. 

Commutativity. Let $(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$ be a permutation of $(a_1,\dots ,a_n)$. Then

$SVNULGMS{M}^{(m,p_1,\dots ,p_n)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})=SVNULGMS{M}^{(m,p_1,\dots ,p_n)}(a_1,\dots ,a_n)$.

3. 

Monotonicity. Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩$ and $a_i^{{}^{\prime }}=⟨[S_{{\mu }_i^{{}^{\prime }}},S_{{\nu }_i^{{}^{\prime }}}],(T_i^{{}^{\prime }},I_i^{{}^{\prime }},F_i^{{}^{\prime }})⟩(i=1,2,\dots ,n)$ be two collections of neutrosophic uncertain linguistic numbers, and if $a_i\le a_i^{{}^{\prime }}$—i.e., $S_{{\mu }_i}\le S_{{\mu }_i^{{}^{\prime }}}$,$S_{{\nu }_i}\le S_{{\nu }_i^{{}^{\prime }}}$, $T_i\le T_i^{{}^{\prime }}$, $I_i\ge I_i^{{}^{\prime }}$, and $F_i\ge F_i^{{}^{\prime }}$, for all i—then

$SVNULGMS{M}^{(m,p_1,\dots ,p_n)}(a_1,\dots ,a_n)\le SVNULGMS{M}^{(m,p_1,\dots ,p_n)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$.

4. 

Boundedness. $min\{a_1,\dots ,a_n\}\le SVNULGMS{M}^{(m,p_1,\dots ,p_n)}(a_1,\dots ,a_n)\le max\{a_1,\dots ,a_n\}$.

The proof of Property 4 is similar to that of Property 3; it is omitted here.

When m takes different values, the $SVNULGMS{M}^{(m,p_1,\dots ,p_n)}$ operator can be converted to some special forms, which are as follows:

1. 

When m = 1, we have the formula below.

$$\begin{array}{c}SVNULGMS{M}^{(m,p_1)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1\le n}{a}_{i_1}^{p_1}}{C_n^1})}^{\frac{1}{p_1}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^n{(1-{(\frac{{\mu }_k}{l})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}}},S_{l{(1-{\prod }_{k=1}^n{(1-{(\frac{{\nu }_k}{l})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}}}],\\ ({(1-{\displaystyle \prod _{k=1}^n}{(1-{(T_k)}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}},\\ 1-{(1-{\displaystyle \prod _{k=1}^n}{(1-{(1-I_k)}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}},\\ 1-{(1-{\displaystyle \prod _{k=1}^n}{(1-{(1-F_k)}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}})⟩\end{array}$$

(35)

2. 

When m = 2, we have the formula below.

$$\begin{array}{c}SVNULGMS{M}^{(m,p_1,p_2)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<i_2\le n}{a}_{i_1}^{p_1}{a}_{i_2}^{p_2}}{C_n^2})}^{\frac{1}{p_1+p_2}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-{(\frac{{\mu }_{i_1(k)}}{l})}^{p_1}{(\frac{{\mu }_{i_2(k)}}{l})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-{(\frac{{\nu }_{i_1(k)}}{l})}^{p_1}{(\frac{{\nu }_{i_2(k)}}{l})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(T_{i_1(k)})}^{p_1}{(T_{i_2(k)})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-I_{i_1(k)})}^{p_1}{(1-I_{i_2(k)})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-F_{i_1(k)})}^{p_1}{(1-F_{i_2(k)})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}})⟩\end{array}$$

(36)

3. 

When m = n, we have the formula below.

$$\begin{array}{c}SVNULGMS{M}^{(n,p_1\dots ,p_n)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_n\le n}{\prod }_{j=1}^n{a}_{i_j}^{p_j}}{C_n^n})}^{\frac{1}{p_1+\dots +p_n}}\\ =⟨[S_{l{({\prod }_{j=1}^n{(\frac{{\mu }_j}{l})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}}},S_{l{({\prod }_{j=1}^n{(\frac{{\nu }_j}{l})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}}}],\\ ({({\displaystyle \prod _{j=1}^n}{(T_j)}^{p_j})}^{\frac{1}{p_1+\dots +p_n}},1-{({\displaystyle \prod _{j=1}^n}{(1-I_j)}^{p_j})}^{\frac{1}{p_1+\dots +p_n}},\\ 1-{({\displaystyle \prod _{j=1}^n}{(1-F_j)}^{p_j})}^{\frac{1}{p_1+\dots +p_n}})⟩\end{array}$$

(37)

4.3. The Weighted SVNULMSM Operator and Weighted SVNULGMSM Operator

In this subsection, we will introduce the weighted SVNULMSM operator and weighted SVNULGMSM operator.

Definition 13.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs. Let $\omega ={({\omega }_1,\dots ,{\omega }_2)}^T$ be the weight vector, which satisfies ${\sum }_{i=1}^n{\omega }_i=1$ and ${\omega }_i>0$$(i=1,\dots ,n)$. Each ${\omega }_i$ represents the importance degree of $a_i$. The $WSVNULMSM$ operator ${\Omega }^n\to \Omega$ is

$$WSVNULMS{M}^{(m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m(n{\omega }_{i_j}{a}_{i_j})}{C_n^m})}^{\frac{1}{m}}$$

(38)

where Ω is a set of SVNULNs and $m=1,\dots ,n$.

Based on the calculation laws for SVNULNs described earlier, the $WSVNULMSM$ operator can be expressed as follows:

Theorem 3.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$, then

$$\begin{array}{c}WSVNULMS{M}^{(m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m(n{\omega }_{i_j}{a}_{i_j})}{C_n^m})}^{\frac{1}{m}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-{(1-\frac{{\mu }_{i_j(k)}}{l})}^{n{\omega }_{i_j}}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-{(1-\frac{{\nu }_{i_j(k)}}{l})}^{n{\omega }_{i_j}}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-{(1-T_{i_j(k)})}^{n{\omega }_{i_j}}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-{(I_{i_j(k)})}^{n{\omega }_{i_j}}))}^{\frac{1}{c_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-{(F_{i_j(k)})}^{n{\omega }_{i_j}}))}^{\frac{1}{c_n^m}})}^{\frac{1}{m}})⟩\end{array}$$

(39)

where $k=1,\dots ,C_n^m$,$a_{i_j(k)}$ represents the $i_j$th element in the kth permutation.

The proof of Theorem 3 is similar to that of Theorem 1; it is omitted here.

Property 5.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$. The properties of the $WSVNULMS{M}^{(m)}$ operator are shown below.

1. 

Reducibility. When $\omega ={(\frac{1}{n},\dots ,\frac{1}{n})}^T$. Then $WSVNULMS{M}^{(m)}(a_1,\dots ,a_n)=SVNULMS{M}^{(m)}(a_1,\dots ,a_n)$

2. 

Monotonicity. Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩$ and $a_i^{{}^{\prime }}=⟨[S_{{\mu }_i^{{}^{\prime }}},S_{{\nu }_i^{{}^{\prime }}}],(T_i^{{}^{\prime }},I_i^{{}^{\prime }},F_i^{{}^{\prime }})⟩(i=1,2,\dots ,n)$ be two collections of SVNULNs, and if $a_i\le a_i^{{}^{\prime }}$—i.e., $S_{{\mu }_i}\le S_{{\mu }_i^{{}^{\prime }}}$, $S_{{\nu }_i}\le S_{{\nu }_i^{{}^{\prime }}}$, $T_i\le T_i^{{}^{\prime }}$, $I_i\ge I_i^{{}^{\prime }}$, and $F_i\ge F_i^{{}^{\prime }}$, for all i—then

$WSVNULMS{M}^{(m)}(a_1,\dots ,a_n)\le WSVNULMS{M}^{(m)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$.

3. 

Boundedness. $min\{a_1,\dots ,a_n\}\le WSVNULMS{M}^{(m)}(a_1,\dots ,a_n)\le max\{a_1,\dots ,a_n\}$.

Proof. 

• If $\omega ={(\frac{1}{n},\dots ,\frac{1}{n})}^T$, then

  $$\begin{array}{c}WSVNULMS{M}^{(m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^m(n{\omega }_{i_j}{a}_{i_j})}{C_n^m})}^{\frac{1}{m}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-{(1-\frac{{\mu }_{i_j(k)}}{l})}^{n\frac{1}{n}}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1-{(1-\frac{{\nu }_{i_j(k)}}{l})}^{n\frac{1}{n}}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-{(1-T_{i_j(k)})}^{n\frac{1}{n}}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-{(I_{i_j(k)})}^{n\frac{1}{n}}))}^{\frac{1}{c_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-{(F_{i_j(k)})}^{n\frac{1}{n}}))}^{\frac{1}{c_n^m}})}^{\frac{1}{m}})⟩\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(\frac{{\mu }_{i_j(k)}}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m(1\frac{{\nu }_{i_j(k)}}{l}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(T_{i_j(k)}))}^{\frac{1}{C_n^m}})}^{\frac{1}{m}},\\ 1-(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(1-I_{i_j(k)})}^{\frac{1}{c_n^m}})}^{\frac{1}{m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}(1-F_{i_j(k)}))}^{\frac{1}{c_n^m}})}^{\frac{1}{m}})⟩\\ =SVNULMS{M}^{(m)}(a_1,\dots ,a_n)\end{array}$$
• The proofs of monotonicity and boundedness are similar to those for Property 3, so are omitted here.

□

When m takes different values, the $WSVNULMS{M}^{(m)}$ operator can be converted to some special forms, which are shown in the following:

1. 

When m = 1, we have the formula below.

$$\begin{array}{c}WSVNULMS{M}^{(1)}(a_1,\dots ,a_n)=\frac{{\sum }_{1\le i_1\le n}(n{\omega }_{i_1}{a}_{i_1})}{C_n^1}\\ =⟨[S_{l(1-{\prod }_{k=1}^n{(1-\frac{{\mu }_k}{l})}^{{\omega }_k})},S_{l(1-{\prod }_{k=1}^n{(1-\frac{{\nu }_k}{l})}^{{\omega }_k})}],\\ ((1-{\displaystyle \prod _{k=1}^n}{(1-T_k)}^{{\omega }_k}),{\displaystyle \prod _{k=1}^n}{(I_k)}^{{\omega }_k},{\displaystyle \prod _{k=1}^n}{(F_k)}^{{\omega }_k})⟩\end{array}$$

(40)

2. 

When m = 2, we have the formula below.

$$\begin{array}{c}WSVNULMS{M}^{(2)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<i_2\le n}{\prod }_{j=1}^2(n{\omega }_{i_j}{a}_{i_j})}{C_n^2})}^{\frac{1}{2}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-(1-{(1-\frac{{\mu }_{i_1(k)}}{l})}^{n{\omega }_{i_1}})(1-{(1-\frac{{\mu }_{i_2(k)}}{l})}^{n{\omega }_{i_2}}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-(1-{(1-\frac{{\nu }_{i_1(k)}}{l})}^{n{\omega }_{i_1}})(1-{(1-\frac{{\nu }_{i_2(k)}}{l})}^{n{\omega }_{i_2}}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-(1-{(1-T_{i_1(k)})}^{n{\omega }_{i_1}})(1-{(1-T_{i_2(k)})}^{n{\omega }_{i_2}}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-(1-{(I_{i_1(k)})}^{n{\omega }_{i_1}})(1-{(I_{i_2(k)})}^{n{\omega }_{i_2}}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-(1-{(F_{i_1(k)})}^{n{\omega }_{i_1}})(1-{(F_{i_2(k)})}^{n{\omega }_{i_2}}))}^{\frac{1}{C_n^2}})}^{\frac{1}{2}})⟩\end{array}$$

(41)

3. 

When m = n, we have the formula below.

$$\begin{array}{c}WSVNULMS{M}^{(n)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le n}{\prod }_{j=1}^n(n{\omega }_{i_j}{a}_{i_j})}{C_n^n})}^{\frac{1}{n}}\\ =⟨[S_{l{(1-{\prod }_{j=1}^n(1-{(1-\frac{{\mu }_j}{l})}^{n{\omega }_j}))}^{\frac{1}{n}}},S_{l{(1-{\prod }_{j=1}^n(1-{(1-\frac{{\nu }_j}{l})}^{n{\omega }_j}))}^{\frac{1}{n}}}],\\ ({({\displaystyle \prod _{j=1}^n}(1-{(1-T_j)}^{n{\omega }_j}))}^{\frac{1}{n}},\\ 1-{({\displaystyle \prod _{j=1}^n}(1-{(I_j)}^{n{\omega }_j}))}^{\frac{1}{n}},\\ 1-{({\displaystyle \prod _{j=1}^n}(1-{(F_j)}^{n{\omega }_j}))}^{\frac{1}{n}})⟩\end{array}$$

(42)

Definition 14.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs. Let $\omega ={({\omega }_1,\dots ,{\omega }_2)}^T$ be the weight vector, which satisfies ${\sum }_{i=1}^n{\omega }_i=1$ and ${\omega }_i>0$$(i=1,\dots ,n)$. Each ${\omega }_i$ represents the importance degree of $a_i$. The $WSVNULGMSM$ operator ${\Omega }^n\to \Omega$ is

$$\begin{array}{c}WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<\dots <i_m\le i_n}{\prod }_{j=1}^n{(b{\omega }_{i_j}{a}_{i_j})}^{p_j}}{C_n^m})}^{\frac{1}{p_1+\dots +p_m}}\end{array}$$

(43)

where Ω is a set of SVNULNs and $m=1,\dots ,n$.

Theorem 4.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$, then

$$\begin{array}{c}WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)\\ ={(\frac{{\sum }_{1\le i_1<\dots <i_m\le i_n}{\prod }_{j=1}^n{(b{\omega }_{i_j}{a}_{i_j})}^{p_j}}{C_n^m})}^{\frac{1}{p_1+\dots +p_m}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{(1-{(1-\frac{{\mu }_{i_j(k)}}{l})}^{n{\omega }_{i_j}})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^m}{(1-{\prod }_{j=1}^m{(1-{(1-\frac{{\nu }_{i_j(k)}}{l})}^{n{\omega }_{i_j}})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(1-{(1-T_{i_j(k)})}^{n{\omega }_{i_j}})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(1-{(I_{i_j(k)})}^{n{\omega }_{i_j}})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^m}}{(1-{\displaystyle \prod _{j=1}^m}{(1-{(I_{i_j(k)})}^{n{\omega }_{i_j}})}^{p_j})}^{\frac{1}{C_n^m}})}^{\frac{1}{p_1+\dots +p_m}})⟩\end{array}$$

(44)

where $k=1,\dots ,C_n^m$,$a_{i_j(k)}$ represents the $i_j$th element in kth permutation.

The proof of Theorem 4 is similar to that of Theorem 1; it is omitted here.

Property 6.

Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩(i=1,\dots ,n)$ be a collection of SVNULNs, and $m=1,\dots ,n$. The properties of the $WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}$ operator are shown below.

1. 

Reducibility. When $\omega ={(\frac{1}{n},\dots ,\frac{1}{n})}^T$, then $WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)=SVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)$

2. 

Monotonicity. Let $a_i=⟨[S_{{\mu }_i},S_{{\nu }_i}],(T_i,I_i,F_i)⟩$ and $a_i^{{}^{\prime }}=⟨[S_{{\mu }_i^{{}^{\prime }}},S_{{\nu }_i^{{}^{\prime }}}],(T_i^{{}^{\prime }},I_i^{{}^{\prime }},F_i^{{}^{\prime }})⟩(i=1,2,\dots ,n)$ be two collections of SVNULNs, and if $a_i\le a_i^{{}^{\prime }}$—i.e., $S_{{\mu }_i}\le S_{{\mu }_i^{{}^{\prime }}}$,$S_{{\nu }_i}\le S_{{\nu }_i^{{}^{\prime }}}$, $T_i\le T_i^{{}^{\prime }}$,$I_i\ge I_i^{{}^{\prime }}$, and $F_i\ge F_i^{{}^{\prime }}$, for all i—then $WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)\le WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1^{{}^{\prime }},\dots ,a_n^{{}^{\prime }})$.

3. 

Boundedness. $min\{a_1,\dots ,a_n\}\le WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}(a_1,\dots ,a_n)\le max\{a_1,\dots ,a_n\}$

The proof is similar to that of Property 3 and is omitted.

When m takes different values, the $WSVNULGMS{M}^{(m,p_1,\dots ,p_m)}$ operator can be converted to some special forms, as follows:

1. 

When m = 1, we have the formula below.

$$\begin{array}{c}WSVNULGMS{M}^{(1,p_1)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1\le n}{(n{\omega }_{i_1}{a}_{i_1})}^{p_1}}{C_n^1})}^{\frac{1}{p_1}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^n{(1-{(1-{(1-\frac{{\mu }_{i_1(k)}}{l})}^{n{\omega }_{i_1}})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}}},\\ S_{l{(1-{\prod }_{k=1}^n{(1-{(1-{(1-\frac{{\nu }_{i_1(k)}}{l})}^{n{\omega }_{i_1}})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}}}],\\ ({(1-{\displaystyle \prod _{k=1}^n}{(1-{(1-{(1-T_{i_1(k)})}^{n{\omega }_{i_1}})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}},\\ 1-{(1-{\displaystyle \prod _{k=1}^n}{(1-{(1-{(I_{i_1(k)})}^{n{\omega }_{i_1}})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}},\\ 1-{(1-{\displaystyle \prod _{k=1}^n}{(1-{(1-{(F_{i_1(k)})}^{n{\omega }_{i_1}})}^{p_1})}^{\frac{1}{n}})}^{\frac{1}{p_1}})⟩\end{array}$$

(45)

2. 

When m = 2, we have the formula below.

$$\begin{array}{c}WSVNULGMS{M}^{(2,p_1,p_2)}(a_1,\dots ,a_n)={(\frac{{\sum }_{1\le i_1<i_2\le n}{\prod }_{j=1}^2{(n{\omega }_{i_j}{a}_{i_j})}^{p_j}}{C_n^2})}^{\frac{1}{p_1+p_2}}\\ =⟨[S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-{(1-{(1-\frac{{\mu }_{i_1(k)}}{l})}^{n{\omega }_{i_1}})}^{p_1}{(1-{(1-\frac{{\mu }_{i_2(k)}}{l})}^{n{\omega }_{i_2}})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}}},\\ S_{l{(1-{\prod }_{k=1}^{C_n^2}{(1-{(1-{(1-\frac{{\nu }_{i_1(k)}}{l})}^{n{\omega }_1})}^{p_1}{(1-{(1-\frac{{\nu }_{i_2(k)}}{l})}^{n{\omega }_2})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}}}],\\ ({(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-{(1-T_{i-1(k)})}^{n{\omega }_{i_1}})}^{p_1}{(1-{(1-T_{i_2(k)})}^{n{\omega }_{i_2}})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-{(I_{i_1(k)})}^{n{\omega }_{i-1}})}^{p_1}{(1-{(I_{i_2(k)})}^{n{\omega }_{i_2}})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}},\\ 1-{(1-{\displaystyle \prod _{k=1}^{C_n^2}}{(1-{(1-{(F_{i_1(k)})}^{n{\omega }_{i-1}})}^{p_1}{(1-{(F_{i_2(k)})}^{n{\omega }_{i_2}})}^{p_2})}^{\frac{1}{C_n^2}})}^{\frac{1}{p_1+p_2}})⟩\end{array}$$

(46)

3. 

When m = n, we have the formula below.

$$\begin{array}{c}WSVNULGMS{M}^{(n,p_1,\dots ,p_n)}(a_1,\dots ,a_n)\\ ={(\frac{{\sum }_{1\le i_1<\dots <i_n\le n}{\prod }_{j=1}^n{(n{\omega }_{i_j}{a}_{i_j})}^{p_j}}{C_n^n})}^{\frac{1}{p_1+\dots +p_n}}\\ =⟨[S_{l{({\prod }_{j=1}^n{(1-{(1-\frac{{\mu }_j}{l})}^{n{\omega }_j})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}}},S_{l{({\prod }_{j=1}^n{(1-{(1-\frac{{\nu }_j}{l})}^{n{\omega }_j})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}}}],\\ ({({\displaystyle \prod _{j=1}^n}{(1-{(1-T_j)}^{n{\omega }_j})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}},\\ 1-{({\displaystyle \prod _{j=1}^n}{(1-{(I_j)}^{n{\omega }_j})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}},\\ 1-{({\displaystyle \prod _{j=1}^n}{(1-{(F_j)}^{n{\omega }_j})}^{p_j})}^{\frac{1}{p_1+\dots +p_n}})⟩\end{array}$$

(47)

5. MCDM Approach Based on WSVNULMSM Operator and WSVNULGMSM Operator

In this section, we apply the proposed SVNULMSM operator and SVNULGMSM operator to cope with a MADM issue. Suppose $A=\{A_1,\dots ,A_m\}$ is a set of alternatives, and let $C=\{C_1,\dots ,C_n\}$ be a collection of attributes. The weight vector of the attribute is $\omega ={({\omega }_1,\dots ,{\omega }_n)}^T$ while satisfying ${\sum }_{i=1}^n{\omega }_i=1({\omega }_i\ge 0,i=1,\dots ,n)$, and each ${\omega }_i$ represents the importance of $C_j$. Let $D=\{D_1,\dots ,D_t\}$ be the set of decision makers, and $\lambda ={({\lambda }_1,\dots ,{\lambda }_t)}^T$ be the weight vector of decision makers $D_s(s=1,\dots ,t)$, and ${\sum }_{s=1}^t{\lambda }_s=1({\lambda }_s\ge 0,s=1,\dots ,t)$. $R^{(s)}={[R_{ij}^{(s)}]}_{m\times n}$ is the decision matrix, where $R_{ij}^{(s)}=⟨[S_{{\mu }_{ij}}^{(s)},S_{{\nu }_{ij}}^{(s)}],(T_{ij}^{(s)},I_{ij}^{(s)},F_{ij}^{(s)})⟩$ is attribute value given by the decision maker $D_s$ for alternative $A_i$ with respect to attribute $C_j$. The main steps as follows:

Step 1 Utilize the WSVNULMSM operator:

$$R_i^{(s)}=SVNULMSM(R_{i_1}^{(s)},R_{i_2}^{(s)},\dots ,R_{i_n}^{(s)})$$

(48)

Utilize the WSVNULGMSM operator:

$$R_i^{(s)}=SVNULGMSM(R_{i_1}^{(s)},R_{i_2}^{(s)},\dots ,R_{i_n}^{(s)})$$

(49)

We use Definition 12 and Definition 13 to aggregate the attribute values of each alternative for decision maker $D_s$, and obtain the overall preference value $R_i^{(s)}$ corresponding to alternative $A_i$.

Step 2 Utilize the WSVNULMSM operator:

$$R_i=SVNULMSM(R_i^{(s)},R_i^{(s)},\dots ,R_i^{(s)})$$

(50)

Utilize the WSVNULGMSM operator:

$$R_i=SVNULGMSM(R_i^{(s)},R_i^{(s)},\dots ,R_i^{(s)})$$

(51)

According to the aggregation value $R_i^{(s)}$ from the above, we also use Definition 12 and Definition 13 to aggregate the evaluation values of the decision maker.

Step 3 Calculate the value $E(R_i)$ of $R_i$ according to Definition 7.

Step 4 According to Definition 9, rank the alternatives.

6. Illustrative Example

In this section, we provide an investment example (adapted from [24]) to illustrate the application of WSVNULMSM and WSVNUGMSM operators.

There are four alternatives, including a car company (A1), a food company (A2), a computer company (A3), and an arms company (A4); and these companies evaluated by three decision makers, $D_1$, $D_2$, and $D_3$. The weight vector of the decision makers is $\lambda ={(0.314,0.355,0.331)}^T$. We use the following attributes: C1 (the risk index), C2 (the growth index), and C3 (the social-political impact index). Suppose the attribute weight vector is $\omega ={(0.4,0.2,0.4)}^T$. Decision makers use linguistic term set $S=S_0,S_1,S_2,S_3,S_4,S_5,S_6$ to express their evaluation results. The decision matrices $R^{(s)}={[R_{ij}^{(s)}]}_{4\times 4}(s=1,2,3)$ as listed in Table 1, Table 2 and Table 3.

Table 1. Decision matrix $R^{(1)}$.

	C1	C2	C3
A1	$⟨[s_5,s_5],(0.265,0.350,0.385)⟩$	$⟨[s_2,s_3],(0.330,0.390,0.280)⟩$	$⟨[s_5,s_6],(0.245,0.275,0.480)⟩$
A2	$⟨[s_4,s_5],(0.345,0.245,0.410)⟩$	$⟨[s_5,s_5],(0.430,0.290,0.280)⟩$	$⟨[s_3,s_4],(0.245,0.375,0.380)⟩$
A3	$⟨[s_3,s_4],(0.365,0.300,0.335)⟩$	$⟨[s_4,s_4],(0.480,0.315,0.205)⟩$	$⟨[s_4,s_5],(0.340,0.370,0.290)⟩$
A4	$⟨[s_6,s_6],(0.430,0.300,0.270)⟩$	$⟨[s_2,s_3],(0.460,0.245,0.295)⟩$	$⟨[s_3,s_4],(0.310,0.520,0.170)⟩$

Table 2. Decision matrix $R^{(2)}$.

	C1	C2	C3
A1	$⟨[s_3,s_4],(0.125,0.470,0.405)⟩$	$⟨[s_3,s_4],(0.220,0.420,0.360)⟩$	$⟨[s_3,s_4],(0.345,0.490,0.165)⟩$
A2	$⟨[s_5,s_6],(0.355,0.315,0.330)⟩$	$⟨[s_3,s_4],(0.300,0.370,0.330)⟩$	$⟨[s_4,s_5],(0.205,0.630,0.165)⟩$
A3	$⟨[s_4,s_5],(0.315,0.380,0.305)⟩$	$⟨[s_4,s_4],(0.330,0.565,0.105)⟩$	$⟨[s_2,s_3],(0.280,0.520,0.200)⟩$
A4	$⟨[s_5,s_5],(0.365,0.365,0.270)⟩$	$⟨[s_4,s_5],(0.355,0.320,0.325)⟩$	$⟨[s_2,s_3],(0.425,0.485,0.090)⟩$

Table 3. Decision matrix $R^{(3)}$.

	C1	C2	C3
A1	$⟨[s_5,s_5],(0.260,0.425,0.315)⟩$	$⟨[s_3,s_4],(0.220,0.450,0.330)⟩$	$⟨[s_4,s_5],(0.255,0.500,0.245)⟩$
A2	$⟨[s_4,s_5],(0.270,0.370,0.360)⟩$	$⟨[s_5,s_5],(0.320,0.215,0.465)⟩$	$⟨[s_2,s_3],(0.135,0.575,0.290)⟩$
A3	$⟨[s_4,s_4],(0.245,0.465,0.290)⟩$	$⟨[s_5,s_5],(0.250,0.570,0.180)⟩$	$⟨[s_1,s_3],(0.175,0.660,0.165)⟩$
A4	$⟨[s_3,s_4],(0.390,0.340,0.270)⟩$	$⟨[s_3,s_4],(0.305,0.475,0.220)⟩$	$⟨[s_4,s_5],(0.465,0.485,0.050)⟩$

6.1. The Decision Making Method Based on the WSVNULMSM Operator

We can give $m=\frac{n}{2}$, so m = 1 or m = 2.

(1) When $m=1$, the steps are shown below.

Step 1 Get the aggregate values of each alternative for decision maker $D_s$ with the WSVNULMSM operator.

$$R_1^{(1)}=⟨[s_{4.6805},s_{6.0000}],(0.2707,0.3248,0.3946)⟩$$

$$R_2^{(1)}=⟨[s_{3.9523},s_{4.6805}],(0.3257,0.3004,0.3685)⟩$$

$$R_3^{(1)}=⟨[s_{3.6478},s_{4.4843}],(0.3804,0.3295,0.2866)⟩$$

$$R_4^{(1)}=⟨[s_{6.0000},s_{6.0000}],(0.3913,0.3590,0.2284)⟩$$

$$R_1^{(2)}=⟨[s_{3.0000},s_{4.0000}],(0.2384,0.4673,0.2762)⟩$$

$$R_2^{(2)}=⟨[s_{4.3562},s_{6.0000}],(0.2872,0.4292,0.2501)⟩$$

$$R_3^{(2)}=⟨[s_{3.3610},s_{4.2174}],(0.3043,0.4664,0.2081)⟩$$

$$R_4^{(2)}=⟨[s_{4.0000},s_{4.4482}],(0.3878,0.3983,0.1806)⟩$$

$$R_1^{(3)}=⟨[s_{4.3562},s_{4.8513}],(0.2502,0.4588,0.2875)⟩$$

$$R_2^{(3)}=⟨[s_{3.7026},s_{4.4482}],(0.2297,0.3959,0.3475)⟩$$

$$R_3^{(3)}=⟨[s_{3.4881},s_{3.9523}],(0.2188,0.5572,0.2104)⟩$$

$$R_4^{(3)}=⟨[s_{3.4492},s_{4.4843}],(0.4059,0.4190,0.1320)⟩$$

Step 2 Get the aggregate values for each alternative with the WSVNULMSM operator.

$$\widetilde{R_1}=⟨[s_{4.1005},s_{4.8513}],(0.2526,0.4143,0.3131)⟩$$

$$\widetilde{R_2}=⟨[s_{4.0324},s_{6.0000}],(0.2813,0.3736,0.3150)⟩$$

$$\widetilde{R_3}=⟨[s_{3.4959},s_{4.2264}],(0.3029,0.4436,0.2309)⟩$$

$$\widetilde{R_4}=⟨[s_{6.0000},s_{6.0000}],(0.3949,0.3920,0.1753)⟩$$

Step 3 Calculate the value $E(R_i)$ of $R_i$.

$E(R_1)=s_{3.0106}$, $E(R_2)=s_{3.7024}$, $E(R_3)=s_{2.5724}$, $E(R_4)=s_6$

Step 4 According to Definition 7, rank the alternatives:

$A_4>A_2>A_1>A_3$.

(2) When $m=2$, the steps are shown below.

Step 1 Get the aggregate values of each alternative for decision maker $D_s$ with the WSVNULMSM operator.

$$R_1^{(1)}=⟨[s_{4.1408},s_{4.7344}],(0.2682,0.3547,0.4002)⟩$$

$$R_2^{(1)}=⟨[s_{3.9093},s_{4.5528}],(0.3216,0.3232,0.3745)⟩$$

$$R_3^{(1)}=⟨[s_{3.5452},s_{4.2100}],(0.3782,0.3467,0.2938)⟩$$

$$R_4^{(1)}=⟨[s_{3.4510},s_{4.2006}],(0.3831,0.3760,0.2643)⟩$$

$$R_1^{(2)}=⟨[s_{2.9199},s_{3.8948}],(0.2122,0.4762,0.3334)⟩$$

$$R_2^{(2)}=⟨[s_{3.9340},s_{4.9269}],(0.2735,0.4659,0.2956)⟩$$

$$R_3^{(2)}=⟨[s_{3.1586},s_{3.8256}],(0.2984,0.5004,0.2144)⟩$$

$$R_4^{(2)}=⟨[s_{3.4190},s_{4.2062}],(0.3730,0.4091,0.2487)⟩$$

$$R_1^{(3)}=⟨[s_{3.9340},s_{4.5840}],(0.2410,0.4739,0.3147)⟩$$

$$R_2^{(3)}=⟨[s_{3.5393},s_{4.2062}],(0.2225,0.4065,0.3846)⟩$$

$$R_3^{(3)}=⟨[s_{3.1297},s_{3.9093}],(0.2139,0.5816,0.2312)⟩$$

$$R_4^{(3)}=⟨[s_{3.2394},s_{4.2100}],(0.3810,0.4492,0.2065)⟩$$

Step 2 Get the aggregate values for each alternative with the WSVNULMSM operator.

$$\widetilde{R_1}=⟨[s_{3.6561},s_{4.4072}],(0.2394,0.4361,0.3501)⟩$$

$$\widetilde{R_2}=⟨[s_{3.7901},s_{4.5549}],(0.2708,0.3995,0.3527)⟩$$

$$\widetilde{R_3}=⟨[s_{3.2736},s_{3.9793}],(0.2930,0.4792,0.2473)⟩$$

$$\widetilde{R_4}=⟨[s_{3.3666},s_{4.2022}],(0.3787,0.4120,0.2403)⟩$$

Step 3 Calculate the value $E(R_i)$ of $R_i$.

$E(R_1)=s_{2.5031}$, $E(R_2)=s_{2.7130}$, $E(R_3)=s_{2.3030}$, $E(R_4)=s_{2.6180}$

Step 4 According to Definition 7, rank the alternatives:

$A_2>A_4>A_1>A_3$.

6.2. The Method Based on the WSVNULGMSM Operator

When $m=1$, p = 1, the $WSVNULGMS{M}^{(1)}$ operator is the same as the $WSVNULMS{M}^{(1)}$ operator. The steps are omitted here. When $m=2$, the steps are below.

Step 1 Get the aggregate values of each alternative for decision maker $D_s$ with the WSVNULGMSM operator.

$$R_1^{(1)}=⟨[s_{4.3162},s_{5.0320}],(0.2668,0.3354,0.4112)⟩$$

$$R_2^{(1)}=⟨[s_{3.8062},s_{4.4423}],(0.3093,0.3364,0.3688)⟩$$

$$R_3^{(1)}=⟨[s_{3.7000},s_{4.4027}],(0.3758,0.3518,0.2864)⟩$$

$$R_4^{(1)}=⟨[s_{3.2189},s_{4.0407}],(0.3686,0.4010,0.2427)⟩$$

$$R_1^{(2)}=⟨[s_{2.9535},s_{3.9257}],(0.2527,0.4757,0.2906)⟩$$

$$R_2^{(2)}=⟨[s_{3.8869},s_{4.8509}],(0.2556,0.5022,0.2638)⟩$$

$$R_3^{(2)}=⟨[s_{2.9426},s_{3.5980}],(0.2965,0.5097,0.2108)⟩$$

$$R_4^{(2)}=⟨[s_{3.1004},s_{3.9959}],(0.3896,0.4227,0.2123)⟩$$

$$R_1^{(3)}=⟨[s_{3.8869},s_{4.6467}],(0.2467,0.4795,0.2979)⟩$$

$$R_2^{(3)}=⟨[s_{3.3964},s_{4.9959}],(0.2073,0.4275,0.3625)⟩$$

$$R_3^{(3)}=⟨[s_{3.0819},s_{3.8062}],(0.2057,0.6036,0.2121)⟩$$

$$R_4^{(3)}=⟨[s_{3.4458},s_{4.4027}],(0.4053,0.4617,0.1699)⟩$$

Step 2 Get the aggregate values for each alternative with the WSVNULGMSM operator.

$$\widetilde{R_1}=⟨[s_{3.6816},s_{4.5119}],(0.2543,0.4453,0.3203)⟩$$

$$\widetilde{R_2}=⟨[s_{3.6683},s_{4.4066}],(0.2473,0.4315,0.3293)⟩$$

$$\widetilde{R_3}=⟨[s_{3.1774},s_{3.8778}],(0.2671,0.5144,0.2247)⟩$$

$$\widetilde{R_4}=⟨[s_{3.2901},s_{4.1980}],(0.3932,0.4331,0.1988)⟩$$

Step 3 Calculate the value $E(R_i)$ of $R_i$.

$E(R_1)=s_{2.6061}$, $E(R_2)=s_{2.5512}$, $E(R_3)=s_{2.1903}$, $E(R_4)=s_{2.6214}$

Step 4 According to Definition 7, rank the alternatives:

$A_4>A_1>A_2>A_3$.

6.3. Comparative Analysis and Discussion

Based on the experiment in Section 6.1 and Section 6.2, we acquired the ranking results shown in Table 4. According to Table 4, we can achieve the same ranking results when $m=1$. This is because the relationship between the attributes is not considered. When $m=2$, we can see that the ranking results are slightly different. It can be stated that we should consider the relationship between the attributes.

Table 4. A comparison of different operators.

Operator	m	${\mathit{P}}_1$	${\mathit{P}}_2$	Ranking
$WSVNULMS{M}^{(m)}$	1	-	-	$A_4>A_2>A_1>A_3$
	2	-	-	$A_2>A_4>A_1>A_3$
$WSVNULGMS{M}^{(m)}$	1	1	-	$A_4>A_2>A_1>A_3$
	2	1	2	$A_4>A_1>A_2>A_3$

From Table 5, we see the comparisons for when $p_1$ and $p_2$ have different values. When $p_1=0$, we do not need to consider the relationship between multiple attributes, so the ranking results are the same: $A_4>A_1>A_2>A_3$. When $p_2=0$, the relationship between the attributes also does not need to be considered, and the ranking results are $A_4>A_2>A_1>A_3$. When $p_1$ and $p_2$ are not equal to zero, we should consider the interrelationship between the attributes, and we find the best alternative to be the arms company ($A_4$). According to the sorting results, we can know that the number of parameters has a great influence on the results. Therefore, sometimes the best alternative was the food company ($A_2$). Meanwhile, the worst alternative was the computer company ($A_3$).

Table 5. A comparison of different values of $P_1$ and $p_2$ when $m=2$.

Operator	${\mathit{P}}_1$	${\mathit{P}}_2$	${\mathit{E}}_{{\mathit{r}}_{\mathit{i}}}(\mathit{i}=1,2,3,4)$	Ranking
$WSVNULGMS{M}^{(m)}$	0	1	$E_{r_1}=S_{2.7367}$ $E_{r_2}=S_{2.2580}$ $E_{r_3}=S_{1.7169}$ $E_{r_4}=S_{3.0104}$	$A_4>A_1>A_2>A_3$
	0	2	$E_{r_1}=S_{2.8339}$ $E_{r_2}=S_{2.3480}$ $E_{r_3}=S_{1.8018}$ $E_{r_4}=S_{3.1106}$	$A_4>A_1>A_2>A_3$
	0	3	$E_{r_1}=S_{2.9203}$ $E_{r_2}=S_{2.4411}$ $E_{r_3}=S_{1.8866}$ $E_{r_4}=S_{3.2059}$	$A_4>A_1>A_2>A_3$
	1	0	$E_{r_1}=S_{2.7756}$ $E_{r_2}=S_{4.0998}$ $E_{r_3}=S_{2.7348}$ $E_{r_4}=S_{6.0000}$	$A_4>A_2>A_1>A_3$
	1	1	$E_{r_1}=S_{2.5031}$ $E_{r_2}=S_{2.7130}$ $E_{r_3}=S_{2.3030}$ $E_{r_4}=S_{2.6180}$	$A_2>A_4>A_1>A_3$
	1	2	$E_{r_1}=S_{2.6061}$ $E_{r_2}=S_{2.5512}$ $E_{r_3}=S_{2.1903}$ $E_{r_4}=S_{2.6214}$	$A_4>A_1>A_2>A_3$
	1	3	$E_{r_1}=S_{2.7066}$ $E_{r_2}=S_{2.5273}$ $E_{r_3}=S_{2.1670}$ $E_{r_4}=S_{2.7212}$	$A_4>A_1>A_2>A_3$
	2	0	$E_{r_1}=S_{2.9080}$ $E_{r_2}=S_{4.1561}$ $E_{r_3}=S_{2.7983}$ $E_{r_4}=S_{6.0000}$	$A_4>A_2>A_1>A_3$
	2	1	$E_{r_1}=S_{2.5839}$ $E_{r_2}=S_{3.0059}$ $E_{r_3}=S_{2.4821}$ $E_{r_4}=S_{2.9243}$	$A_2>A_4>A_1>A_3$
	2	2	$E_{r_1}=S_{2.6329}$ $E_{r_2}=S_{2.7833}$ $E_{r_3}=S_{2.3747}$ $E_{r_4}=S_{2.7091}$	$A_2>A_4>A_1>A_3$
	2	3	$E_{r_1}=S_{2.7067}$ $E_{r_2}=S_{2.7001}$ $E_{r_3}=S_{2.3338}$ $E_{r_4}=S_{2.7154}$	$A_4>A_1>A_2>A_3$
	3	0	$E_{r_1}=S_{3.0236}$ $E_{r_2}=S_{4.2111}$ $E_{r_3}=S_{2.8640}$ $E_{r_4}=S_{6.0000}$	$A_4>A_2>A_1>A_3$
	3	1	$E_{r_1}=S_{2.6940}$ $E_{r_2}=S_{3.2013}$ $E_{r_3}=S_{2.5887}$ $E_{r_4}=S_{3.2176}$	$A_4>A_2>A_1>A_3$
	3	2	$E_{r_1}=S_{2.7075}$ $E_{r_2}=S_{2.9661}$ $E_{r_3}=S_{2.4879}$ $E_{r_4}=S_{2.9075}$	$A_2>A_4>A_1>A_3$
	3	3	$E_{r_1}=S_{2.7610}$ $E_{r_2}=S_{2.8566}$ $E_{r_3}=S_{2.4449}$ $E_{r_4}=S_{2.8235}$	$A_2>A_4>A_1>A_3$

In order to prove the effectiveness of the method proposed in this paper, we have performed a comparison with Liu’s [24] method, and the results are shown in Table 6.

Table 6. Comparison of different methods.

Methods	Operator	Ranking
Methods in this paper	$WSVNULMS{M}^{(m)}m=1$	$A_4>A_2>A_1>A_3$
	$WSVNULMS{M}^{(m)}m=2$	$A_2>A_4>A_1>A_3$
	$WSVNULGMS{M}^{(m)}m=1$	$A_4>A_2>A_1>A_3$
	$WSVNULGMS{M}^{(m)}m=2$	$A_4>A_1>A_2>A_3$
other methods	$NULNIGWHM(p=q=1)$	$A_4>A_2>A_3>A_1$
	$NULNIGGWHM(p=q=1)$	$A_4>A_2>A_1>A_3$

As shown in Table 6, the best choice found by the other method was $A_4$, which is the same as in our former results. Obtaining the same ranking results shows that our method is effective and reasonable. When $m=1$, our method had the same values as Liu’s method [24]. This is because neither method considers the relationship between attributes. When $m=2$, the ranking results are different from those of Liu’s method [24]. This is because the method proposed by Liu [24] only considers the relationship between two input parameters, whereas our method takes the relationship between multiple parameters into account, which effectively solves the problem of multiple input parameters. Therefore, our method has a wider range of applications.

7. Conclusions

SVNULNs can well represent incomplete, indeterminate, and inconsistent information. Meanwhile, as an effective aggregation tool, the MSM operator can consider the relationship between multiple input parameters. In this paper, we combined the neutrosophic uncertain linguistic numbers with MSM operators, and proposed some MSM operators based on a neutrosophic uncertain linguistic environment, including the SVNULMSM operator, SVNULGMSM operator, weighted SVNULMSM operator, and weighted SVNULGMSM operator. Then, we proposed a method for solving the MADM problem by using a WSVNULMSM operator and a WSVNULGMSM operator.

Finally, the effectiveness of the proposed method was proved by comparing it with other methods. According to the same ranking results, the rationality of the method was proved. The research on the determination of parameter values is not thorough, so we will further study and explore the area. In the future, we will further extend the aggregation operator and apply it to a wider range of fields, such as fault diagnosis, financial analysis, and algorithm selection. In future research, we will extend the MSM operator to other fuzzy environments, such as an intuitionistic fuzzy set, and further validate the effectiveness of MSM operator.