Redefined “Maclaurin Symmetric Mean Aggregation Operators Based on Cubic Pythagorean Linguistic Fuzzy Numbers”

Abstract

In this study, we highlight the errors in Sections 2.3, 2.4, 3, and 4 in the article by Fahmi et al. (J Ambient Intell Human Comput (2020). https://doi.org/10.1007/s12652-020-02272-9) by counter definitions and theorems. We find that the definition of cubic Pythagorean fuzzy set (CPFS) (Definition 2.3.1) and operational laws (Definition 2.3.2) violates the rules to consider the membership and nonmembership functions, and then, we redefined the corrected definition and their operations for CPFS. Furthermore, we redefine the concept of cubic Pythagorean linguistic fuzzy set (CPLFS) and their basic operational laws. In addition, we find that Sections 3 and 4 (consist of a list of Maclaurin symmetric mean (MSM) and dual MSM aggregation operators) are invalid, and then, we redefined the list of updated MSM and dual MSM aggregation operators in correct way. Finally, we established the numerical application of the proposed improved algorithm using cubic Pythagorean linguistic fuzzy information to show the applicability and effectiveness of the proposed technique.

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

1. Introduction

Due to the increasing complexity of the system, it is difficult for the decision maker to select the best alternative/object from a set of attractive options in the real world. However, it is hard to summarize, but it is not incredible to achieve the best single objective. A large number of multicriteria decision-making problems exist in decision-making, where the criteria are found to be uncertain, ambiguous, imprecise, and vague. As a result, the crisp set appears to be ineffective in dealing with this uncertainty and imprecision in the data and can be easily dealt with by using fuzzy information. To deal with such uncertainty and ambiguity, Zadeh [1] presented the mathematical notion of fuzzy set (FS) which has been defined by using the membership function of the element. Various researchers have discovered the utility of the fuzzy set in a variety of fields, including decision-making, medical diagnosis, engineering, socioeconomic, and finance problems.

With the continuous process of human practice, decision-making problems have become more and more complicated, and many extended forms of fuzzy sets [1] have been proposed, such as the bipolar soft sets [2], the intuitionistic fuzzy (IF) sets [3], the interval-valued intuitionistic fuzzy sets [4], Pythagorean fuzzy (PyF) sets [5], picture fuzzy (PF) sets [6, 7], and spherical fuzzy (SF) sets [8–10]. Many decision-making techniques under Pythagorean fuzzy information are established, for example, Wang et al. [11, 12] presented the novel decision-making techniques under Pythagorean fuzzy interactive Hamacher power and interaction power Bonferroni mean aggregation operators are proposed and discussed their applications in multiple attribute decision-making problems. Khan et al. [13] presented the decision-making method based on probabilistic hesitant fuzzy rough information. In [14], Ashraf et al. worked on sine trigonometric aggregation operator for Pythagorean fuzzy numbers; in [15], Batool et al. developed new models for decision making under Pythagorean hesitant fuzzy numbers. Khan et al. used the Dombi t-norms and t-conorms to Pythagorean fuzzy numbers and defined Pythagorean fuzzy Dombi aggregation operators [16].

The cubic Pythagorean fuzzy set (CPFS) is a well reputed structure of fuzzy sets, proposed by Abbas et al. [17] in 2019 to tackle the uncertainty in decision-making problems. Talukdar and Dutta [18] presented the distance measures under CPFS information. Fahmi et al. [19] proposed the decision-making technique using cubic Pythagorean linguistic fuzzy sets. The main objective of this note is to highlight the error in Sections 2.3, 2.4, 3, and 4 in the study by Fahmi et al. [19] by counterdefinitions and countertheorems.

2. Preliminaries

We initiate with rudimentary concept of fuzzy set, cubic set, intuitionistic fuzzy set, Pythagorean fuzzy set, and cubic Pythagorean fuzzy set that are required for the rest of this paper.

Definition 1.

(see [1]). A fuzzy set (FS) $\mathrm{ℱ}$ in arbitrary set $U\ne \varphi$ has the form$$\begin{array}{}\text{(1)}& \mathrm{ℱ}=\upsilon ,\mu \upsilon |\upsilon \in U,\end{array}$$where $\mu \upsilon \in \mathrm{0,1}$ is represented by the positive membership grade.

Definition 2.

(see [20]). An interval-valued fuzzy set (IVFS) $\mathrm{ℱ}$ in a universe set $U$ is an object having the form$$\begin{array}{}\text{(2)}& \mathrm{ℱ}=\upsilon ,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon |\upsilon \in U,\end{array}$$where $\mu \upsilon \in \mathrm{0,1}$ is represented by the positive membership grade.

Definition 3.

(see [21]). A cubic set $\mathrm{ℱ}$ in a universe set $U$ is an object having the form$$\begin{array}{}\text{(3)}& \mathrm{ℱ}=\upsilon ,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,\mu \upsilon |\upsilon \in U,\end{array}$$where ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon \subseteq \mathrm{0,1}\in \text{IVFS}$ and $\mu \upsilon \in \mathrm{0,1}\in \text{FS}$.

Definition 4.

(see [3]). An intuitionistic FS ${\mathrm{ℱ}}_s$ in a universe set $U$ is an object having the form$$\begin{array}{}\text{(4)}& {\mathrm{ℱ}}_s=\upsilon ,\mu \upsilon ,\partial \upsilon |\upsilon \in U,\end{array}$$where $\mu \upsilon \in \mathrm{0,1}$ are positive and $\partial \upsilon \in \mathrm{0,1}$ are negative membership grades, respectively. In addition, $0\le \mu \upsilon +\partial \upsilon \le 1$, $\forall \upsilon \in U$.

Definition 5.

(see [5]). A Pythagorean FS ${\mathrm{ℱ}}_s$ in a universe set $U$ is an object having the form$$\begin{array}{}\text{(5)}& {\mathrm{ℱ}}_s=\upsilon ,\mu \upsilon ,\partial \upsilon |\upsilon \in U,\end{array}$$where $\mu \upsilon \in \mathrm{0,1}$ are positive and $\partial \upsilon \in \mathrm{0,1}$ are negative membership grades, respectively. In addition, $0\le {\mu }^2\upsilon +{\partial }^2\upsilon \le 1$, $\forall \upsilon \in U$.

Definition 6.

(see [22]). An interval-valued Pythagorean FS (IVPFS) ${\mathrm{ℱ}}_s$ in a universe set $U$ is an object having the form$$\begin{array}{}\text{(6)}& {\mathrm{ℱ}}_s=\upsilon ,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\partial }^{-}\upsilon ,{\partial }^{+}\upsilon |\upsilon \in U,\end{array}$$where ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon \subseteq \mathrm{0,1}$ are positive and ${\partial }^{-}\upsilon ,{\partial }^{+}\upsilon \subseteq \mathrm{0,1}$ are negative membership grades, respectively. In addition, $0\le {{\mu }^{+}\upsilon }^2+{{\partial }^{+}\upsilon }^2\le 1,\forall \upsilon \in U$.

Definition 7.

(see [17]). A cubic Pythagorean fuzzy set ${\mathrm{ℱ}}_s$ in a universe set $U$ is an object having the form$$\begin{array}{}\text{(7)}& \mathrm{ℱ}=\upsilon ,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\partial }^{-}\upsilon ,{\partial }^{+}\upsilon ,\mu \upsilon ,\partial \upsilon |\upsilon \in U,\end{array}$$where ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\partial }^{-}\upsilon ,{\partial }^{+}\upsilon \subseteq \mathrm{0,1}\in \text{IVPFS}$ and $\mu \upsilon ,\partial \upsilon \in \mathrm{0,1}\in \text{PFS}$.

Maclaurin symmetric mean (MSM) is established by Maclaurin [23] and defined as follows.

Definition 8.

(see [23]). Take any collection of nonnegative elements $h_{j}j\in \mathbb{N}$ and $k=\mathrm{1,2},\dots ,n$. If$$\begin{array}{}\text{(8)}& {\text{MSM}}^k{h}_1,h_2,\dots ,h_n={\frac{{\displaystyle \sum _{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{h}_{i_j}}}}{{ℂ}_n^k}}^{1/k},\end{array}$$then ${\text{MSM}}^k$ is said to be MSM operator, where ${ℂ}_n^k$ is the binomial coefficient and $i_1,i_2,\dots ,i_k$ traversal all the k-tuple combination of $\mathrm{1,2},\dots ,n$.

Dual Maclaurin symmetric mean (DMSM) is established by Wei et al. [24] and defined as follows.

Definition 9.

(see [24]). Take any collection of nonnegative elements $h_{j}j\in \mathbb{N}$ and $k=\mathrm{1,2},\dots ,n$. If$$\begin{array}{}\text{(9)}& {\text{DMSM}}^k{h}_1,h_2,\dots ,h_n=\frac{1}{k}{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \sum _{j=1}^k{h}_{i_j}}}^{1/{ℂ}_n^k}},\end{array}$$then ${\text{MDSM}}^k$ is said to be DMSM operator, where ${ℂ}_n^k$ is the binomial coefficient and $i_1,i_2,\dots ,i_k$ traversal of all the k-tuple combination of $\mathrm{1,2},\dots ,n$.

3. Counter Section 2.3 of [19]

This section recalls the discussion of cubic Pythagorean fuzzy numbers (CPFN) and their basic operations proposed by Fahmi et al. [19].

Definition 2.3.1 in [19] proposed the definition of CPFS which is described as follows.

Definition 10.

(see [19]). A CPFS $\mathrm{ℱ}$ in arbitrary set $U\ne \varphi$ has the form$$\begin{array}{}\text{(10)}& \mathrm{ℱ}=\upsilon ,{\mu }^{-}4\upsilon ,{\mu }^{+}\upsilon ,\mu \upsilon |\upsilon \in U,\end{array}$$where ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon \subseteq \mathrm{0,1}$ and $\mu \upsilon \in \mathrm{0,1}$ represent the positive and negative grades of memberships.

For whole study, the list of cubic Pythagorean fuzzy sets are represented by $\text{CPFS}U$. For simplicity, we write ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,\mu \upsilon$ for any cubic Pythagorean fuzzy number.

Definition 2.3.2 in [19] proposed the basic operational laws for CPFNs which are described as follows.

Definition 11.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_1}={\mu }_1^{-}\upsilon ,{\mu }_1^{+}\upsilon ,{\mu }_1\upsilon$ and ${\mathrm{ℱ}}_{{\text{cp}}_2}={\mu }_2^{-}\upsilon ,{\mu }_2^{+}\upsilon ,{\mu }_2\upsilon \in \text{CPFS}U$ with $\varpi >0$. Then, the operational rules are described as

(1) ${\mathrm{ℱ}}_{{\text{cp}}_1}\oplus {\mathrm{ℱ}}_{{\text{cp}}_2}=\sqrt{{{\mu }_1^{-}}^2+{{\mu }_2^{-}}^2-{{\mu }_1^{-}}^2\cdot {{\mu }_2^{-}}^2},\sqrt{{{\mu }_1^{+}}^2+{{\mu }_2^{+}}^2-{{\mu }_1^{+}}^2\cdot {{\mu }_2^{+}}^2},{\mu }_1\cdot {\mu }_2$

(2) ${\mathrm{ℱ}}_{{\text{cp}}_1}\otimes {\mathrm{ℱ}}_{{\text{cp}}_2}={\mu }_1^{-}\cdot {\mu }_2^{-},{\mu }_1^{+}\cdot {\mu }_2^{+},\sqrt{{{\mu }_1}^2+{{\mu }_2}^2-{{\mu }_1}^2\cdot {{\mu }_2}^2}$

(3) ${{\mathrm{ℱ}}_{{\text{cp}}_1}}^{\varpi }={{\mu }_1^{-}}^{\varpi },{{\mu }_1^{+}}^{\varpi },\sqrt{1-{1-{\mu }_1^2}^{\varpi }}$

(4) $\varpi \cdot {\mathrm{ℱ}}_{{\text{cp}}_1}=\sqrt{1-{1-{{\mu }_1^{-}}^2}^{\varpi }},\sqrt{1-{1-{{\mu }_1^{+}}^2}^{\varpi }},{{\mu }_1}^{\varpi }$

Fahmi et al. [19] defined Definition 2.3.1 for CPFS and Definition 3 for cubic set which are the same. So, Fahmi et al. [19] presented the invalid definition of cubic Pythagorean fuzzy sets and also presented invalid operational laws for CPFSs.

Now, we presented the valid definition and operational laws for CPFNs are as follows.

Definition 12.

(see [17]). A CPFS ${\mathrm{ℱ}}_{\text{cp}}$ in arbitrary set $U\ne \varphi$ has the form$$\begin{array}{}\text{(11)}& \mathrm{ℱ}=\upsilon ,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\upsilon }^{-}\upsilon ,{\upsilon }^{+}\upsilon ,\mu \upsilon ,\upsilon \upsilon |\upsilon \in U,\end{array}$$where ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\upsilon }^{-}\upsilon ,{\upsilon }^{+}\upsilon \subseteq \mathrm{0,1}$ and $\mu \upsilon ,\upsilon \upsilon \in \mathrm{0,1}$ represent the positive membership grade in the form of interval valued Pythagorean fuzzy set and negative membership grade in the form of Pythagorean fuzzy set.

The operational laws for CPFNs are defined as follows.

Definition 13.

Let ${\mathrm{ℱ}}_{{\text{cp}}_1}={\mu }_1^{-}\upsilon ,{\mu }_1^{+}\upsilon ,{\upsilon }_1^{-}\upsilon ,{\upsilon }_1^{+}\upsilon ,{\mu }_1\upsilon ,{\upsilon }_1\upsilon$ and ${\mathrm{ℱ}}_{{\text{cp}}_2}={\mu }_2^{-}\upsilon ,{\mu }_2^{+}\upsilon ,{\upsilon }_2^{-}\upsilon ,{\upsilon }_2^{+}\upsilon ,{\mu }_2\upsilon ,{\upsilon }_2\upsilon \in \text{CPFS}U$ with $\varpi >0$. Then, the operational rules are described as

(1) ${\mathrm{ℱ}}_{{\text{cp}}_1}\oplus {\mathrm{ℱ}}_{{\text{cp}}_2}=\sqrt{{{\mu }_1^{-}}^2+{{\mu }_2^{-}}^2-{{\mu }_1^{-}}^2\cdot {{\mu }_2^{-}}^2},\sqrt{{{\mu }_1^{+}}^2+{{\mu }_2^{+}}^2-{{\mu }_1^{+}}^2\cdot {{\mu }_2^{+}}^2},{\upsilon }_1^{-}\cdot {\upsilon }_2^{-},{\upsilon }_1^{+}\cdot {\upsilon }_2^{+},\sqrt{{{\mu }_1}^2+{{\mu }_2}^2-{{\mu }_1}^2\cdot {{\mu }_2}^2},{\upsilon }_1\upsilon \cdot {\upsilon }_2\upsilon$

(2) ${\mathrm{ℱ}}_{{\text{cp}}_1}\otimes {\mathrm{ℱ}}_{{\text{cp}}_2}={\mu }_1^{-}\cdot {\mu }_2^{-},{\mu }_1^{+}\cdot {\mu }_2^{+},\sqrt{{{\upsilon }_1^{-}}^2+{{\upsilon }_2^{-}}^2-{{\upsilon }_1^{-}}^2\cdot {{\upsilon }_2^{-}}^2},\sqrt{{{\upsilon }_1^{+}}^2+{{\upsilon }_2^{+}}^2-{{\upsilon }_1^{+}}^2\cdot {{\upsilon }_2^{+}}^2},{\mu }_1\upsilon \cdot {\mu }_2\upsilon ,\sqrt{{{\upsilon }_1}^2+{{\upsilon }_2}^2-{{\upsilon }_1}^2\cdot {{\upsilon }_2}^2}$

(3) ${{\mathrm{ℱ}}_{{\text{cp}}_1}}^{\varpi }={{\mu }_1^{-}}^{\varpi },{{\mu }_1^{+}}^{\varpi },\sqrt{1-{1-{{\upsilon }_1^{-}}^2}^{\varpi }},\sqrt{1-{1-{{\upsilon }_1^{+}}^2}^{\varpi }},{{\mu }_1}^{\varpi },\sqrt{1-{1-{{\upsilon }_1}^2}^{\varpi }}$

(4) $\varpi \cdot {\mathrm{ℱ}}_{{\text{cp}}_1}=\sqrt{1-{1-{{\mu }_1^{-}}^2}^{\varpi },}\sqrt{1-{1-{{\mu }_1^{+}}^2}^{\varpi }},{{\upsilon }_1^{-}}^{\varpi },{{\upsilon }_1^{+}}^{\varpi },\sqrt{1-{1-{{\mu }_1}^2}^{\varpi }},{{\upsilon }_1}^{\varpi }$

4. Counter Section 2.4 of [19]

This section recalls the discussion of cubic Pythagorean linguistic fuzzy numbers (CPLFN) and their basic operations proposed by Fahmi et al. [19].

Definition 2.4.1 in [19] proposed the concept of CPLFS which is described as follows.

Definition 14.

(see [19]). A CPLFS $\mathrm{ℱ}$ in arbitrary set $U\ne \varphi$, with $\Re ={\ell }_{v_0},{\ell }_{v_1},{\ell }_{v_2},\dots ,{\ell }_{v_{t-1}}$, is the linguistic term set, where $t>0$ is the odd cardinality, having the form$$\begin{array}{}\text{(12)}& \mathrm{ℱ}={\ell }_v,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,\mu \upsilon |\upsilon \in U,\end{array}$$where ${\ell }_v\in \Re$ and ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon \subseteq \mathrm{0,1}$ and $\mu \upsilon \in \mathrm{0,1}$ represent the positive and negative grades of memberships.

For the whole study, the list of cubic Pythagorean linguistic fuzzy sets are represented by $\text{CPLFS}U$. For simplicity, we write ${\ell }_v,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,\mu \upsilon$ for any cubic Pythagorean linguistic fuzzy number.

Definition 2.4.2 in [19] proposed the basic operational laws for CPLFNs described as follows.

Definition 15.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_1}={\ell }_{v_1},{\mu }_1^{-}\upsilon ,{\mu }_1^{+}\upsilon ,{\mu }_1\upsilon$ and ${\mathrm{ℱ}}_{{\text{cp}}_2}={\ell }_{v_2},{\mu }_2^{-}\upsilon ,{\mu }_2^{+}\upsilon ,{\mu }_2\upsilon \in \text{CPLFS}U$ with $\varpi >0$. Then, the operational rules are described as

(1) ${\mathrm{ℱ}}_{{\text{cp}}_1}\oplus {\mathrm{ℱ}}_{{\text{cp}}_2}={\ell }_{v_1+v2},\sqrt{{{\mu }_1^{-}}^2+{{\mu }_2^{-}}^2-{{\mu }_1^{-}}^2\cdot {{\mu }_2^{-}}^2},\sqrt{{{\mu }_1^{+}}^2+{{\mu }_2^{+}}^2-{{\mu }_1^{+}}^2\cdot {{\mu }_2^{+}}^2},{\mu }_1\cdot {\mu }_2$

(2) ${\mathrm{ℱ}}_{{\text{cp}}_1}\otimes {\mathrm{ℱ}}_{{\text{cp}}_2}={\ell }_{v_1\times v2},{\mu }_1^{-}\cdot {\mu }_2^{-},{\mu }_1^{+}\cdot {\mu }_2^{+},\sqrt{{{\mu }_1}^2+{{\mu }_2}^2-{{\mu }_1}^2\cdot {{\mu }_2}^2}$

(3) ${{\mathrm{ℱ}}_{{\text{cp}}_1}}^{\varpi }={\ell }_{v_1^{\varpi }},{{\mu }_1^{-}}^{\varpi },{{\mu }_1^{+}}^{\varpi },\sqrt{1-{1-{\mu }_1^2}^{\varpi }}$

(4) $\varpi \cdot {\mathrm{ℱ}}_{{\text{cp}}_1}={\ell }_{v_{1\times \varpi }},\sqrt{1-{1-{{\mu }_1^{-}}^2}^{\varpi }},\sqrt{1-{1-{{\mu }_1^{+}}^2}^{\varpi }},{{\mu }_1}^{\varpi }$

Fahmi et al. [19] presented Definition 2.4.1 for CPLFS and Definition 3 for cubic set which are the same. So, Fahmi et al. [19] presented the invalid definition of cubic Pythagorean linguistic fuzzy sets and also presented invalid operational laws for CPLFSs.

Now, we presented the valid definition and operational laws for CPLFNs as follows.

Definition 16.

A CLPFS ${\mathrm{ℱ}}_{\text{cp}}$ in arbitrary set $U\ne \varphi$, with $\Re ={\ell }_{v_0},{\ell }_{v_1},{\ell }_{v_2},\dots ,{\ell }_{v_{t-1}}$, is the linguistic term set, where $t>0$ is the odd cardinality, having the form$$\begin{array}{}\text{(13)}& \mathrm{ℱ}={\ell }_v,{\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\upsilon }^{-}\upsilon ,{\upsilon }^{+}\upsilon ,\mu \upsilon ,\upsilon \upsilon |\upsilon \in U,\end{array}$$where ${\ell }_v\in \Re$ and ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\upsilon }^{-}\upsilon ,{\upsilon }^{+}\upsilon \subseteq \mathrm{0,1}$ and $\mu \upsilon ,\upsilon \upsilon \in \mathrm{0,1}$ represent the positive membership grade in the form of interval-valued Pythagorean fuzzy set and negative membership grade in the form of Pythagorean fuzzy set.

The operational laws for CPLFNs are defined as follows.

Definition 17.

Let ${\mathrm{ℱ}}_{{\text{cp}}_1}={\ell }_{v_1},{\mu }_1^{-}\upsilon ,{\mu }_1^{+}\upsilon ,{\upsilon }_1^{-}\upsilon ,{\upsilon }_1^{+}\upsilon ,{\mu }_1\upsilon ,{\upsilon }_1\upsilon$ and ${\mathrm{ℱ}}_{{\text{cp}}_2}={\ell }_{v_2},{\mu }_2^{-}\upsilon ,{\mu }_2^{+}\upsilon ,{\upsilon }_2^{-}\upsilon ,{\upsilon }_2^{+}\upsilon ,{\mu }_2\upsilon ,{\upsilon }_2\upsilon \in \text{CPLFS}U$ with $\varpi >0$. Then, the operational rules are described as

(1) ${\mathrm{ℱ}}_{{\text{cp}}_1}\oplus {\mathrm{ℱ}}_{{\text{cp}}_2}={\ell }_{v_1+v_2},\sqrt{{{\mu }_1^{-}}^2+{{\mu }_2^{-}}^2-{{\mu }_1^{-}}^2\cdot {{\mu }_2^{-}}^2},\sqrt{{{\mu }_1^{+}}^2+{{\mu }_2^{+}}^2-{{\mu }_1^{+}}^2\cdot {{\mu }_2^{+}}^2},{\upsilon }_1^{-}\cdot {\upsilon }_2^{-},{\upsilon }_1^{+}\cdot {\upsilon }_2^{+},\sqrt{{{\mu }_1}^2+{{\mu }_2}^2-{{\mu }_1}^2\cdot {{\mu }_2}^2},{\upsilon }_1\upsilon \cdot {\upsilon }_2\upsilon$

(2) ${\mathrm{ℱ}}_{{\text{cp}}_1}\otimes {\mathrm{ℱ}}_{{\text{cp}}_2}={\ell }_{v_1\times v_2},{\mu }_1^{-}\cdot {\mu }_2^{-},{\mu }_1^{+}\cdot {\mu }_2^{+},\sqrt{{{\upsilon }_1^{-}}^2+{{\upsilon }_2^{-}}^2-{{\upsilon }_1^{-}}^2\cdot {{\upsilon }_2^{-}}^2},\sqrt{{{\upsilon }_1^{+}}^2+{{\upsilon }_2^{+}}^2-{{\upsilon }_1^{+}}^2\cdot {{\upsilon }_2^{+}}^2},{\mu }_1\upsilon \cdot {\mu }_2\upsilon ,\sqrt{{{\upsilon }_1}^2+{{\upsilon }_2}^2-{{\upsilon }_1}^2\cdot {{\upsilon }_2}^2}$

(3) ${{\mathrm{ℱ}}_{{\text{cp}}_1}}^{\varpi }={\ell }_{v_1^{\varpi }},{{\mu }_1^{-}}^{\varpi },{{\mu }_1^{+}}^{\varpi },\sqrt{1-{1-{{\upsilon }_1^{-}}^2}^{\varpi }},\sqrt{1-{1-{{\upsilon }_1^{+}}^2}^{\varpi }},{{\mu }_1}^{\varpi },\sqrt{1-{1-{{\upsilon }_1}^2}^{\varpi }}$

(4) $\varpi \cdot {\mathrm{ℱ}}_{{\text{cp}}_1}={\ell }_{v_1\times \varpi },\sqrt{1-{1-{{\mu }_1^{-}}^2}^{\varpi }},\sqrt{1-{1-{{\mu }_1^{+}}^2}^{\varpi }},{{\upsilon }_1^{-}}^{\varpi },{{\upsilon }_1^{+}}^{\varpi },\sqrt{1-{1-{{\mu }_1}^2}^{\varpi }},{{\upsilon }_1}^{\varpi }$

Definition 18.

Let$$\begin{array}{c}\text{(14)}& {\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-},{\mu }_i^{+},{\upsilon }_i^{-},{\upsilon }_i^{+},{\mu }_i,{\upsilon }_{i}i\in \mathbb{N}\in \text{CPLFS}U\cdot {\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_1}=\frac{{{\mu }_1^{+}}^2-{{\upsilon }_1^{+}}^2+{{\mu }_1}^2-{{\upsilon }_1}^2\times v_1}{4},\\ {\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_2}=\frac{{{\mu }_2^{+}}^2-{{\upsilon }_2^{+}}^2+{{\mu }_2}^2-{{\upsilon }_2}^2\times v_2}{4},\end{array}$$be the score values of $\text{CPLFNs}$. Also,$$\begin{array}{c}\text{(15)}& {\mathcal{A}}_y{\mathrm{ℱ}}_{{\text{cp}}_1}=\frac{{{\mu }_1^{+}}^2+{{\upsilon }_1^{+}}^2+{{\mu }_1}^2+{{\upsilon }_1}^2\times v_1}{4},{\mathcal{A}}_y{\mathrm{ℱ}}_{{\text{cp}}_2}=\frac{{{\mu }_2^{+}}^2+{{\upsilon }_2^{+}}^2+{{\mu }_2}^2+{{\upsilon }_2}^2\times v_2}{4},\end{array}$$are the accuracy values of $\text{CPLFNs}$. If

(a) ${\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_1}<{\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_2}\Rightarrow {\mathrm{ℱ}}_{{\text{cp}}_1}<{\mathrm{ℱ}}_{{\text{cp}}_2}$

(b) ${\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_1}={\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_2},{\mathcal{A}}_y{\mathrm{ℱ}}_{{\text{cp}}_1}<{\mathcal{A}}_y{\mathrm{ℱ}}_{{\text{cp}}_2}\Rightarrow {\mathrm{ℱ}}_{{\text{cp}}_1}<{\mathrm{ℱ}}_{{\text{cp}}_2}$

(c) ${\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_1}={\mathcal{S}}_{\gamma }{\mathrm{ℱ}}_{{\text{cp}}_2},{\mathcal{A}}_y{\mathrm{ℱ}}_{{\text{cp}}_1}={\mathcal{A}}_y{\mathrm{ℱ}}_{{\text{cp}}_2}\Rightarrow {\mathrm{ℱ}}_{{\text{cp}}_1}={\mathrm{ℱ}}_{{\text{cp}}_2}$

5. Counter Section 3 of [19]

This section recalls the discussion of linguistic aggregation operators (AO) for CPLFN and their basic properties proposed by Fahmi et al. [19].

5.1. Weighted Averaging

Definition 3.1.1 and Theorem 3.1.2 in [19] proposed the weighted averaging operator using defined operational rules described as follows.

Definition 19.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, the CPLFWA operator is described as follows:$$\begin{array}{}\text{(16)}& \text{CPLFWA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{n!}{\displaystyle \sum _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{c{p}_{\theta i}}}},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 1 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, $\text{CPLFWA}$ operator is obtained as$$\begin{array}{c}\text{(17)}& \text{CPLFWA}{\mathrm{ℱ}}_{c{p}_1},{\mathrm{ℱ}}_{c{p}_2},\dots ,{\mathrm{ℱ}}_{c{p}_n}={\ell }_{{\displaystyle {\sum }_{i=1}^n{v}_i}/n},\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{-}}^2}}^{1/n!}},\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{+}}^2}}^{1/n!}},{{\displaystyle \prod _{i=1}^n{\mu }_i^2}}^{1/n!}.\end{array}$$

Definition 3.2.1 and Theorem 3.2.2 in [19] proposed the generalized weighted averaging operator using defined operational rules described as follows.

Definition 20 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, the CGPLFWA operator is described as follows:$$\begin{array}{}\text{(18)}& \text{CGPLFWA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{n!}{{\displaystyle \sum _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}}}}^{1/\lambda },\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 2 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CGPLFS}U$. Then, using defined operational laws, the $\text{CGPLFWA}$ operator is obtained as$$\begin{array}{c}\text{(19)}& \text{CGPLFWA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{{{\displaystyle {\sum }_{i=1}^n{v}_i}/n}^{1/\lambda }},{\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{-}}^{2\lambda }}}^{1/n!}}}^{1/\lambda },{\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{+}}^{2\lambda }}}^{1/n!}}}^{1/\lambda },\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{1-{1-{\mu }_i^2}^{\lambda }}^{1/n!}}}^{1/\lambda }}.\end{array}$$

5.2. Weighted Geometric

Definition 3.3.1 and Theorem 3.3.2 in [19] proposed the weighted geometric operator using defined operational rules described as follows.

Definition 21.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, the CPLFWG operator is described as follows:$$\begin{array}{}\text{(20)}& \text{CPLFWG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{n!}{\displaystyle \sum _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}}},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 3 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFWG}$ operator is obtained as$$\begin{array}{}\text{(21)}& \text{CPLFWG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{{\displaystyle {\sum }_{i=1}^n{v}_i^{1/n}}/n},{\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{-}}^{2\lambda }}}^{1/n!}}}^{1/\lambda },{\sqrt{1-{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{+}}^{2\lambda }}}^{1/n!}}}^{1/\lambda }\sqrt{1-{\displaystyle \prod _{i=1}^n{1-{\mu }_i^2}^{1/n!}}}.\end{array}$$

6. Updated Linguistic Cubic Pythagorean Fuzzy AO

In this section, utilizing valid Definition 16 of LCPFS and operational laws (Definition 17), we establish the updated operational laws to aggregate the uncertain data in the form of linguistic cubic Pythagorean fuzzy environment.

6.1. Updated Weighted Averaging AO

Definition 22.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, the CPLFWA operator is described as follows:$$\begin{array}{c}\text{(22)}& \text{CPLFWA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\rho }_1{\mathrm{ℱ}}_{c{p}_1}\oplus {\rho }_2{\mathrm{ℱ}}_{{\text{cp}}_2}\oplus \cdots \oplus {\rho }_n{\mathrm{ℱ}}_{{\text{cp}}_n}={\displaystyle \sum _{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}{\mathrm{ℱ}}_{{\text{cp}}_{\mathrm{♮}}}},\end{array}$$where the weights ${\rho }_1,{\rho }_2,\dots ,{\rho }_{\mathrm{♮}}$ of ${\mathrm{ℱ}}_{\mathrm{♮}}$ have ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$.

Theorem 4.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws 17, $\text{CPLFWA}$ operator is obtained as$$\begin{array}{c}\text{(23)}& \text{CPLFWA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\displaystyle \sum _{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}{\mathrm{ℱ}}_{{\text{cp}}_{\mathrm{♮}}}}\\ ={\ell }_{{\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}\times v_{\mathrm{♮}}}},\sqrt{1-{\displaystyle \prod _{\mathrm{♮}=1}^n{1-{{\mu }_{\mathrm{♮}}^{-}}^2}^{{\rho }_{\mathrm{♮}}}}},\sqrt{1-{\displaystyle \prod _{\mathrm{♮}=1}^n{1-{{\mu }_{\mathrm{♮}}^{+}}^2}^{{\rho }_{\mathrm{♮}}}}},{{\upsilon }_{\mathrm{♮}}^{-}}^{{\rho }_{\mathrm{♮}}},{{\upsilon }_{\mathrm{♮}}^{+}}^{{\rho }_{\mathrm{♮}}},\sqrt{1-{\displaystyle \prod _{\mathrm{♮}=1}^n{1-{{\mu }_{\mathrm{♮}}}^2}^{{\rho }_{\mathrm{♮}}}}},{{\upsilon }_{\mathrm{♮}}}^{{\rho }_{\mathrm{♮}}},\end{array}$$where the weights ${\rho }_1,{\rho }_2,\dots ,{\rho }_{\mathrm{♮}}$ of ${\mathrm{ℱ}}_{\mathrm{♮}}$ have ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$.

6.2. Updated Weighted Geometric AO

Definition 23.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, the CPLFWG operator is described as follows:$$\begin{array}{c}\text{(24)}& \text{CPLFWG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={{\mathrm{ℱ}}_{{\text{cp}}_1}}^{{\rho }_1}\otimes {{\mathrm{ℱ}}_{{\text{cp}}_2}}^{{\rho }_2}\otimes \cdots \otimes {{\mathrm{ℱ}}_{{\text{cp}}_n}}^{{\rho }_n}={\displaystyle \prod _{\mathrm{♮}=1}^n{{\mathrm{ℱ}}_{{\text{cp}}_{\mathrm{♮}}}}^{{\rho }_{\mathrm{♮}}}},\end{array}$$where the weights ${\rho }_1,{\rho }_2,\dots ,{\rho }_{\mathrm{♮}}$ of ${\mathrm{ℱ}}_{\mathrm{♮}}$ have ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$.

Theorem 5.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws 17, the CPLFWG operator is obtained as$$\begin{array}{c}\text{(25)}& \text{CPLFWG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,\mathrm{ℱ}{\%}_{{\text{cp}}_n}={\displaystyle \prod _{\mathrm{♮}=1}^n{{\mathrm{ℱ}}_{c{p}_{\mathrm{♮}}}}^{{\rho }_{\mathrm{♮}}}}\\ ={\ell }_{{\displaystyle {\prod }_{\mathrm{♮}=1}^n{v_{\mathrm{♮}}}^{{\rho }_{\mathrm{♮}}}}},{{\mu }_{\mathrm{♮}}^{-}}^{{\rho }_{\mathrm{♮}}},{{\mu }_{\mathrm{♮}}^{+}}^{{\rho }_{\mathrm{♮}}},\sqrt{1-{\displaystyle \prod _{\mathrm{♮}=1}^n{1-{{\upsilon }_{\mathrm{♮}}^{-}}^2}^{{\rho }_{\mathrm{♮}}}}}\sqrt{1-{\displaystyle \prod _{\mathrm{♮}=1}^n{1-{{\upsilon }_{\mathrm{♮}}^{+}}^2}^{{\rho }_{\mathrm{♮}}}}},{{\mu }_{\mathrm{♮}}}^{{\rho }_{\mathrm{♮}}},\sqrt{1-{\displaystyle \prod _{\mathrm{♮}=1}^n{1-{{\upsilon }_{\mathrm{♮}}}^2}^{{\rho }_{\mathrm{♮}}}}},\end{array}$$where the weights ${\rho }_1,{\rho }_2,\dots ,{\rho }_{\mathrm{♮}}$ of ${\mathrm{ℱ}}_{\mathrm{♮}}$ having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$.

7. Countersections 3.4 and 3.5 of [19]

This section recalls the discussion of linguistic MSM aggregation operators (AO) for CPLFN and their basic properties proposed by Fahmi et al. [19].

Definition 3.4.1 and Theorem 3.4.2 in [19] proposed the MSM operator using defined operational rules (Definition 15) described as follows.

Definition 24.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_{\mathrm{♮}}}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFMSM operator is described as follows:$$\begin{array}{}\text{(26)}& \text{CPLFMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{n!}{{\displaystyle \sum _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{c{p}_{\theta i}}}}}^{1/\lambda },\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 6 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFMSM}$ operator is obtained as$$\begin{array}{c}\text{(27)}& \text{CPLFMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{h}_{i_j}}}}^{1/\lambda }},\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{-}}^2}}^{1/{ℂ}_n^k}}}^{1/k}},\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{{\mu }_i^{+}}^2}}^{1/{ℂ}_n^k}}}^{1/k}},\sqrt{1-1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{\mu }_i^2}^{1/{ℂ}_n^k}}}}^{1/k}}.\end{array}$$

Definition 3.5.1 and Theorem 3.5.2 in [19] proposed the weighted MSM operator using defined operational rules (Definition 15) described as follows.

Definition 25.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFWMSM operator is described as follows:$$\begin{array}{}\text{(28)}& \text{CPLFWMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{n!}{{\displaystyle \sum _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}}}}^{1/\lambda },\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 7 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, $\text{CPLFWMSM}$ operator is obtained as$$\begin{array}{c}\text{(29)}& \text{CPLFWMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{h}_{i_j}}}}^{1/k}},\sqrt{{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{-}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\sqrt{{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{+}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}}\\ \sqrt{1-1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^2}^{{\rho }_i}}^{1/{ℂ}_n^k}}}}^{1/k}}.\end{array}$$

8. Updated Linguistic Cubic Pythagorean Fuzzy MSM AO

In this section, utilizing valid Definition 16 of LCPFS and operational laws (Definition 17), we establish the updated linguistic Maclaurin symmetric mean AO to aggregate the uncertain data in the form of linguistic cubic Pythagorean fuzzy environment.

Definition 26.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, the CPLFMSM operator is described as follows:$$\begin{array}{}\text{(30)}& \text{CPLFMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{\mathrm{ℱ}}_{{\text{cp}}_{ij}}}}}{{ℂ}_n^k}}^{1/k},\end{array}$$where ${ℂ}_n^k$ is the binomial coefficient and $i_1,i_2,\dots ,i_k$ traversal of all the k-tuple combination of $\mathrm{1,2},\dots ,n$.

Theorem 8.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws 17, the CPLFMSM operator is obtained as$$\begin{array}{c}\text{(31)}& \text{CPLFMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{\mathrm{ℱ}}_{{\text{cp}}_{ij}}}}}{{ℂ}_n^k}}^{1/k}={\ell }_{{{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{\mathrm{ℱ}}_{c{p}_{i_j}}}}/{ℂ}_n^k}^{1/k}},\\ {\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots n\le i_k\le n}1-{{\displaystyle \prod _{j=1}^n{\mu }_{i_j}^{-}}}^2}}^{1/{ℂ}_n^k}}}^{1/k},{\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots n\le i_k\le n}1-{{\displaystyle \prod _{j=1}^n{\mu }_{i_j}^{+}}}^2}}^{1/{ℂ}_n^k}}}^{1/k},\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{j=1}^{n}1-{{\upsilon }_{i_j}^{-}}^2}}}^{1/{ℂ}_n^k}}^{1/k}},\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{j=1}^{n}1-{{\upsilon }_{i_j}^{+}}^2}}}^{1/{ℂ}_n^k}}^{1/k}},\\ {\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots n\le i_k\le n}1-{{\displaystyle \prod _{j=1}^n{\mu }_{i_j}}}^2}}^{1/{ℂ}_n^k}}}^{1/k},\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{j=1}^{n}1-{{\upsilon }_{i_j}}^2}}}^{1/{ℂ}_n^k}}^{1/k}}.\end{array}$$

Updated weighted MSM AO is defined as follows.

Definition 27.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFWMSM operator is described as follows:$$\begin{array}{}\text{(32)}& \text{CPLFWMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{{\mathrm{ℱ}}_{c{p}_{i_j}}}^{{\rho }_{i_j}}}}}{{ℂ}_n^k}}^{1/k},\end{array}$$where ${ℂ}_n^k$ is the binomial coefficient and $i_1,i_2,\dots ,i_k$ traversal of all the k-tuple combination of $\mathrm{1,2},\dots ,n$.

Theorem 9.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws 17, the CPLFWMSM operator is obtained as$$\begin{array}{c}\text{(33)}& \text{CPLFWMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{j=1}^k{{\mathrm{ℱ}}_{{\text{cp}}_{i_j}}}^{{\rho }_{i_j}}}}}{{ℂ}_n^k}}^{1/k}={\ell }_{{{\displaystyle \sum _{1\le i_1\le i_2\le \dots \le i_k\le n}{\displaystyle \prod _{j=1}^k{{\mathrm{ℱ}}_{c{p}_{i_j}}}^{{\rho }_{i_j}}}}/{ℂ}_n^k}^{1/k}},\\ {\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \dots \le i_k\le n}1-}{{\displaystyle \prod _{j=1}^n{{\mu }_{i_j}^{-}}^{{\rho }_{i_j}}}}^2}^{1/{ℂ}_n^k}}}^{1/k},{\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \dots \le i_k\le n}1-{{\displaystyle \prod _{j=1}^n{{\mu }_{i_j}^{+}}^{{\rho }_{i_j}}}}^2}}^{1/{ℂ}_n^k}}}^{1/k},\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \dots \le i_k\le n}1-{\displaystyle \prod _{j=1}^n{1-{{\upsilon }_{i_j}^{-}}^2}^{{\rho }_{i_j}}}}}^{1/{ℂ}_n^k}}^{1/k}},\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \dots \le i_k\le n}1-{\displaystyle \prod _{j=1}^n{1-{{\upsilon }_{i_j}^{+}}^2}^{{\rho }_{i_j}}}}}^{1/{ℂ}_n^k}}^{1/k}},\\ {\sqrt{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \dots \le i_k\le n}1-{{\displaystyle \prod _{j=1}^n{{\mu }_{i_j}}^{{\rho }_{i_j}}}}^2}}^{1/{ℂ}_n^k}}}^{1/k},\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \dots \le i_k\le n}1-{\displaystyle \prod _{j=1}^n{1-{{\upsilon }_{i_j}}^2}^{{\rho }_{i_j}}}}}^{1/{ℂ}_n^k}}^{1/k}}.\end{array}$$

9. Countersection 4 of [19]

This section recalls the discussion of DMSM AO for CPLFN and their basic properties proposed by Fahmi et al. [19].

9.1. Weighted DMSM Averaging

Definition 4.1.1 and Theorem 4.1.2 in [19] proposed the weighted DMSM averaging operator using defined operational rules (Definition 15) described as follows.

Definition 28.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFDWMSMA operator is described as follows:$$\begin{array}{}\text{(34)}& \text{CPLFDWMSMA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{1}{k}{\displaystyle \sum _{\theta \in S_n}{\displaystyle \sum _{i=1}^n{\rho }_j{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}}}}^{1/k},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 10 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFDWMSMA}$ operator is obtained as$$\begin{array}{c}\text{(35)}& \text{CPLFDWMSMA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{1/k{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{i=1}^k{h}_{\theta i}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{-}}^2}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}^{1/k}}\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{+}}^2}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}^{1/k}}\\ \sqrt{{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-1-{\mu }_i^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}}.\end{array}$$

Definition 4.2.1 and Theorem 4.2.2 in [19] proposed the ordered weighted DMSM averaging operator using defined operational rules (Definition 15) described as follows.

Definition 29.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFDOWMSMA operator is described as follows:$$\begin{array}{}\text{(36)}& \text{CPLFDOWMSMA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{1}{k}{\displaystyle \sum _{\theta \in S_n}{\displaystyle \sum _{i=1}^n{\rho }_j{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}}}}^{1/k},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 11 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFDOWMSMA}$ operator is obtained as$$\begin{array}{c}\text{(37)}& \text{CPLFDOWMSMA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{1/k{1/{ℂ}_n^k{\displaystyle \sum _{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle \prod _{i=1}^k{h}_{\theta i}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{-}}^2}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}^{1/k}},\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \mathrm{...}\le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{+}}^2}^{{\rho }_i}}}}^{\frac{1}{{ℂ}_n^k}}}^{1/k}}\\ \sqrt{{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-1-{\mu }_i^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}}.\end{array}$$

Definition 4.3.1 and Theorem 4.3.2 in [19] proposed the hybrid weighted DMSM averaging operator using defined operational rules (Definition 15) described as follows.

Definition 30.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is associated weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFDHWMSMA operator is described as follows:$$\begin{array}{}\text{(38)}& \text{CPLFDHWMSMA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{1}{k}{\displaystyle \sum _{\theta \in S_n}{\displaystyle \sum _{i=1}^n{\rho }_j{\mathrm{ℱ}}_{c{p}_{\theta i}}}}}^{1/k},\end{array}$$where $\theta ii\in \mathbb{N}$ represented the any permutation and $S_n$ represented the total numbers of elements.

Theorem 12 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFDHWMSMA}$ operator is obtained as$$\begin{array}{c}\text{(39)}& \text{CPLFDHWMSMA}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{1/k{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{i=1}^k{h}_{\theta i}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{-}}^2}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}^{1/k}}\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{i=1}^n{1-{{\mu }_i^{+}}^2}^{{\rho }_i}}}}^{1/{ℂ}_n^k}}^{1/k}}\\ \sqrt{{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-1-\text{\$}{\mu }_i^2\text{\$}}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}}.\end{array}$$

9.2. Weighted DMSM Geometric

Definition 4.4.1 and Theorem 4.4.2 in [19] proposed the weighted DMSM geometric operator using defined operational rules (Definition 15) described as follows.

Definition 31.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFDWMSMG operator is described as follows:$$\begin{array}{}\text{(40)}& \text{CPLFDWMSMG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{1}{k}{\displaystyle \prod _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}^{{\rho }_i}}}}^{1/k},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents total numbers of elements.

Theorem 13 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFDWMSMG}$ operator is obtained as$$\begin{array}{c}\text{(41)}& \text{CPLFDWMSMG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{1/k{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le .\cdots \le i_k\le n}{\displaystyle {\prod }_{i=1}^k{h}_{\theta i}^{{\rho }_i}}}}^{1/{ℂ}_n^k}},\\ \sqrt{{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \prod _{i=1}^n{{{\mu }_i^{-}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\sqrt{{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \prod _{i=1}^n{{{\mu }_i^{+}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\\ {\sqrt{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-{\mu }_i^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}}^{1/k}.\end{array}$$

Definition 4.5.1 and Theorem 4.5.2 in [19] proposed the ordered weighted DMSM geometric operator using defined operational rules (Definition 15) is described as

Definition 32 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFDOWMSMG operator is described as follows:$$\begin{array}{}\text{(42)}& \text{CPLFDOWMSMG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{1}{k}{\displaystyle \prod _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}^{{\rho }_i}}}}^{1/k},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 14 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFDOWMSMG}$ operator is obtained as$$\begin{array}{c}\text{(43)}& \text{CPLFDOWMSMG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{1/k{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{i=1}^k{h}_{\theta i}^{{\rho }_i}}}}^{1/{ℂ}_n^k}},\\ \sqrt{{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \prod _{i=1}^n{{{\mu }_i^{-}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\sqrt{{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \prod _{i=1}^n{{{\mu }_i^{+}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\\ {\sqrt{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-{\mu }_i^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}}^{1/k}.\end{array}$$

Definition 4.6.1 and Theorem 4.6.2 in [19] proposed the hybrid-weighted DMSM geometric operator using defined operational rules (Definition 15) described as follows.

Definition 33.

(see [19]). Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFDHWMSMG operator is described as follows:$$\begin{array}{}\text{(44)}& \text{CPLFDHWMSMG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\frac{1}{k}{\displaystyle \prod _{\theta \in S_n}{\displaystyle \prod _{i=1}^n{\mathrm{ℱ}}_{{\text{cp}}_{\theta i}}^{{\rho }_i}}}}^{1/k},\end{array}$$where $\theta ii\in \mathbb{N}$ represents any permutation and $S_n$ represents the total numbers of elements.

Theorem 15 (see [19]).

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\mu }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws, the $\text{CPLFDHWMSMG}$ operator is obtained as$$\begin{array}{c}\text{(45)}& \text{CPLFDHWMSMG}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}={\ell }_{1/k{1/{ℂ}_n^k{\displaystyle {\sum }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{\displaystyle {\prod }_{i=1}^k{h}_{\theta i}^{{\rho }_i}}}}^{1/{ℂ}_n^k}},\\ \sqrt{{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \prod _{i=1}^n{{{\mu }_i^{-}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\sqrt{{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \prod _{i=1}^n{{{\mu }_i^{+}}^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}^{1/k}},\\ {\sqrt{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{\displaystyle \prod _{i=1}^n{1-{\mu }_i^2}^{{\rho }_i}}}^{1/{ℂ}_n^k}}}}^{1/k}.\end{array}$$

10. Updated Dual MSM Operators

In this section, valid Definition 16 of LCPFS and operational laws (Definition 17) are utilized to establish the updated linguistic dual Maclaurin symmetric mean AO to aggregate the uncertain data in the form of linguistic cubic Pythagorean fuzzy environment.

Definition 34.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$ and ${{\rho }_1,{\rho }_2,\dots ,{\rho }_n}^T$ is weight vector having ${\rho }_{\mathrm{♮}}\ge 0$ and ${\displaystyle {\sum }_{\mathrm{♮}=1}^n{\rho }_{\mathrm{♮}}}=1$. Then, the CPLFWDMSM operator is described as follows:$$\begin{array}{}\text{(46)}& \text{CPLFWDMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{k}{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \sum _{j=1}^k{\rho }_{i_j}\otimes {\mathrm{ℱ}}_{{\text{cp}}_{i_j}}}}^{1/{ℂ}_n^k}},\end{array}$$where ${ℂ}_n^k$ is the binomial coefficient and $i_1,i_2,\dots ,i_k$ traversal of all the k-tuple combination of $\mathrm{1,2},\dots ,n$.

Theorem 16.

Let ${\mathrm{ℱ}}_{{\text{cp}}_i}={\ell }_{v_i},{\mu }_i^{-}\upsilon ,{\mu }_i^{+}\upsilon ,{\upsilon }_i^{-}\upsilon ,{\upsilon }_i^{+}\upsilon ,{\mu }_i\upsilon ,{\upsilon }_i\upsilon ;i\in \mathbb{N}\in \text{CPLFS}U$. Then, using defined operational laws 17, the CPLFWDMSM operator is obtained as$$\begin{array}{c}\text{(47)}& \text{CPLFWDMSM}{\mathrm{ℱ}}_{{\text{cp}}_1},{\mathrm{ℱ}}_{{\text{cp}}_2},\dots ,{\mathrm{ℱ}}_{{\text{cp}}_n}=\frac{1}{k}{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle \sum _{j=1}^k{\rho }_{i_j}\otimes {\mathrm{ℱ}}_{{\text{cp}}_{i_j}}}}^{1/{ℂ}_n^k}}={\ell }_{1/k{\displaystyle {\prod }_{1\le i_1\le i_2\le \cdots \le i_k\le n}{{\displaystyle {\sum }_{j=1}^k{\rho }_{i_j}\otimes {\mathrm{ℱ}}_{c{p}_{i_j}}}}^{1/{ℂ}_n^k}}},\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{j=1}^n{1-{{\mu }_{i_j}^{-}}^2}^{{\rho }_{i_j}}}}}^{1/{ℂ}_n^k}}^{1/k}},\sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{j=1}^n{1-{{\mu }_{i_j}^{+}}^2}^{{\rho }_{i_j}}}}}^{1/{ℂ}_n^k}}^{1/k}},\\ {\sqrt{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{{\displaystyle \prod _{j=1}^n{{\upsilon }_{i_j}^{-}}^{{\rho }_{i_j}}}}^2}^{1/{ℂ}_n^k}}}}^{1/k},{\sqrt{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}{1-{{\displaystyle \prod _{j=1}^n{{\upsilon }_{i_j}^{+}}^{{\rho }_{i_j}}}}^2}^{1/{ℂ}_n^k}}}}^{1/k},\\ \sqrt{1-{1-{{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \le i_k\le n}1-{\displaystyle \prod _{j=1}^n{1-{{\mu }_{i_j}}^2}^{{\rho }_{i_j}}}}}^{1/{ℂ}_n^k}}^{1/k}},{\sqrt{1-{\displaystyle \prod _{1\le i_1\le i_2\le \cdots \%\le i_k\le n}{1-{{\displaystyle \prod _{j=1}^n{{\upsilon }_{i_j}}^{{\rho }_{i_j}}}}^2}^{1/{ℂ}_n^k}}}}^{1/k}.\end{array}$$

11. Decision-Making Model Based on Updated MSM Operators

In this section, we propose a framework for solving multiattribute decision-making problems (DMPs) under cubic Pythagorean linguistic fuzzy (CPLF) information. Consider a MADM with a set of m alternatives ${\mathrm{\gimel }}_1,{\mathrm{\gimel }}_2,\dots ,{\mathrm{\gimel }}_{\mathrm{♮}}$, and let $y_1,y_2,\dots ,y_h$ be a set of attributes with weight vector $p=p_1,p_2,\dots ,p_h$, where $p_t\in \mathrm{0,1}$ and ${\displaystyle {\sum }_{t=1}^h{p}_t}=1$. To assess the performance of kth alternative ${\mathrm{\gimel }}_k$ under the tth attribute $y_t$, let ${\stackrel{\circ }{D}}_1,{\stackrel{\circ }{D}}_2,\dots ,{\stackrel{\circ }{D}}_{\mathcal{J}}$ be a set of decision makers and $\widehat{w}={\widehat{w}}_1,{\widehat{w}}_2,\dots ,{\widehat{w}}_{\mathcal{J}}$ be the weighted vector of decision makers with ${\widehat{w}}_s\in \mathrm{0,1}$ and ${\displaystyle {\sum }_{s=1}^{\mathcal{J}}{\widehat{w}}_s}=1$. The CPLF decision matrix can be written as$$\begin{array}{}\text{(48)}& \begin{array}{ccccc}{\mathrm{♭}}_{11}& {\mathrm{♭}}_{12}& {\mathrm{♭}}_{13}& \cdots & {\mathrm{♭}}_{1h}\\ {\mathrm{♭}}_{21}& {\mathrm{♭}}_{22}& {\mathrm{♭}}_{23}& \cdots & {\mathrm{♭}}_{2h}\\ {\mathrm{♭}}_{31}& {\mathrm{♭}}_{32}& {\mathrm{♭}}_{33}& \cdots & {\mathrm{♭}}_{3h}\\ ⋮& ⋮& ⋮& \ddots & ⋮\\ {\mathrm{♭}}_{\mathrm{♮}1}& {\mathrm{♭}}_{\mathrm{♮}2}& {\mathrm{♭}}_{\mathrm{♮}3}& \cdots & {\mathrm{♭}}_{\mathrm{♮}h}\end{array},\end{array}$$where ${\mathrm{♭}}_{ij}={\ell }_{v_{ij}},{\mu }_{ij}^{-}\upsilon ,{\mu }_{ij}^{+}\upsilon ,{\upsilon }_{ij}^{-}\upsilon ,{\upsilon }_{ij}^{+}\upsilon ,{\mu }_{ij}\upsilon ,{\upsilon }_{ij}\upsilon$ and ${\mu }^{-}\upsilon ,{\mu }^{+}\upsilon ,{\upsilon }^{-}\upsilon ,{\upsilon }^{+}\upsilon \subseteq \mathrm{0,1}$ and $\mu \upsilon ,\upsilon \upsilon \in \mathrm{0,1}$ represented the positive membership grade in the form of interval-valued Pythagorean fuzzy set and negative membership grade in the form of Pythagorean fuzzy set. Key steps of the developed multiattribute decision-making (MADM) problem are described as follows.

  Step 1: construct the CPLF decision matrix based on the experts’ evaluations:$$\begin{array}{}\text{(49)}& D^{\widehat{\mathcal{J}}}=\begin{array}{ccccc}{\mathrm{♭}}_{11}^{\mathcal{J}}& {\mathrm{♭}}_{12}^{\mathcal{J}}& {\mathrm{♭}}_{13}^{\mathcal{J}}& \cdots & {\mathrm{♭}}_{1h}^{\mathcal{J}}\\ {\mathrm{♭}}_{21}^{\mathcal{J}}& {\mathrm{♭}}_{22}^{\mathcal{J}}& {\mathrm{♭}}_{23}^{\mathcal{J}}& \cdots & {\mathrm{♭}}_{2h}^{\mathcal{J}}\\ {\mathrm{♭}}_{31}^{\mathcal{J}}& {\mathrm{♭}}_{32}^{\mathcal{J}}& {\mathrm{♭}}_{33}^{\mathcal{J}}& \cdots & {\mathrm{♭}}_{3h}^{\mathcal{J}}\\ ⋮& ⋮& ⋮& \ddots & ⋮\\ {\mathrm{♭}}_{\mathrm{♮}1}^{\mathcal{J}}& {\mathrm{♭}}_{\mathrm{♮}2}^{\mathcal{J}}& {\mathrm{♭}}_{\mathrm{♮3}}^{\mathcal{J}}& \cdots & {\mathrm{♭}}_{\mathrm{♮}h}^{\mathcal{J}}\end{array},\end{array}$$

  where $\mathcal{J}$ represents the number of expert.

  Step 2: exploit the established aggregation operators to achieve the CPLFNs ${\mathrm{ℱ}}_{t}t=\mathrm{1,2},\dots ,\mathrm{♮}$ for the alternatives ${\mathrm{\gimel }}_k$, that is, the established operators to obtain the collective overall preference values of ${\mathrm{ℱ}}_{t}t=\mathrm{1,2},\dots ,\mathrm{♮}$ for the alternatives ${\mathrm{\gimel }}_k$, where $p=p_1,p_2,\dots ,p_h$ is the weight vector of the attributes.

  Step 3: after that, we compute the scores of all the overall values ${\mathrm{ℱ}}_{t}t=\mathrm{1,2},\dots ,\mathrm{♮}$ for the alternatives ${\mathrm{\gimel }}_k$.

  Step 4: according to Definition 18, rank the alternatives ${\mathrm{\gimel }}_{k}k=\mathrm{1,2},\dots ,\mathrm{♮}$ and select the best one having the greater value.

12. Numerical Application

The company of intranet is usually attacked by malicious intrusions. To enhance the security of the intranet, the company plans to purchase the firewall production and put it between the intranet and extranet for blocking illegal access. Basically, there are four types of firewall productions given to be considered, whose detailed is as follows: $\mathrm{\complement }={\mathrm{\complement }}_1,{\mathrm{\complement }}_2,{\mathrm{\complement }}_3,{\mathrm{\complement }}_4$. If the firewall production is chosen, the company pays attention to the factors, which are detailed as follows: $G_1⟶$ the promotion, $G_2⟶$ configuration simplicity, $G_3⟶$ security level, and $G_4⟶$ maintenance server level, whose weight vector is ${0.2,0.1,0.3,0.4}^T$. To examine the firewall production with respect to their factor, we consider the cubic Pythagorean linguistic fuzzy matrix, the decision matrix is given in the form of Table 1:

  Step 1: the evaluation result of the expert is listed in Table 1:

  Step 2: based on the proposed MSM operators, the collective CPLF information of each alternative is obtained as follows in Tables 2–4:$$\begin{array}{c}\text{(50)}& {\mathrm{♭}}_{11}\otimes {\mathrm{♭}}_{12}={\ell }_8,0.15,0.48,0.48,0.750.21,0.44,{\mathrm{♭}}_{11}\otimes {\mathrm{♭}}_{13}={\ell }_2,0.10,0.32,0.48,0.680.14,0.22,\\ {\mathrm{♭}}_{11}\otimes {\mathrm{♭}}_{14}={\ell }_{10},0.20,0.40,0.64,0.750.42,0.52,\\ {\mathrm{♭}}_{12}\otimes {\mathrm{♭}}_{13}={\ell }_4,0.06,0.24,0.54,0.820.06,0.41,\\ {\mathrm{♭}}_{12}\otimes {\mathrm{♭}}_{14}={\ell }_{20},0.12,0.30,0.68,0.860.18,0.60,\\ {\mathrm{♭}}_{13}\otimes {\mathrm{♭}}_{14}={\ell }_5,0.08,0.20,0.68,0.820.12,0.50.\end{array}$$

  Case 1: from Table 1, we have ${\mathrm{♭}}_{11}={\ell }_2,0.5,0.8,0.3,0.40.7,0.2$, ${\mathrm{♭}}_{12}={\ell }_4,0.3,0.6,0.4,0.70.3,0.4$, ${\mathrm{♭}}_{13}={\ell }_1,0.2,0.4,0.4,0.60.2,0.1$, and ${\mathrm{♭}}_{14}={\ell }_5,0.4,0.5,0.6,0.70.6,0.5\in \text{CPLFS}U$. Here, we use CPLFMSM operator to aggregate the expert evaluation in the form of CPLFSs. Without loss of generality, we take $k=2$; then,

  Using Theorem 8, we obtain$$\begin{array}{c}\text{(51)}& {\text{CPLFMSM}}^2{\mathrm{♭}}_{11},{\mathrm{♭}}_{12},{\mathrm{♭}}_{13},{\mathrm{♭}}_{14}={\frac{{\displaystyle {\sum }_{1\le i_1\le i_2\le 4}{\mathrm{♭}}_{i_1}\otimes {\mathrm{♭}}_{i_2}}}{{ℂ}_4^2}}^{1/2}={\ell }_{1.52},0.242,0.438,0.352,0.5300.337,0.246.\end{array}$$

  Hence, we obtained similarly.$$\begin{array}{c}\text{(52)}& {{\mathrm{♭}}_{11}}^{0.2}\otimes {{\mathrm{♭}}_{12}}^{0.1}={\ell }_{1.319},0.77,0.90,0.01,0.040.82,0.01,{{\mathrm{♭}}_{11}}^{0.2}\otimes {{\mathrm{♭}}_{13}}^{0.3}={\ell }_{1.148},0.53,0.73,0.03,0.060.57,0.004,\\ {{\mathrm{♭}}_{11}}^{0.2}\otimes {{\mathrm{♭}}_{14}}^{0.4}={\ell }_{2.186},0.60,0.72,0.05,0.080.75,0.02,\\ {{\mathrm{♭}}_{12}}^{0.1}\otimes {{\mathrm{♭}}_{13}}^{0.3}={\ell }_{1.148},0.54,0.72,0.02,0.090.54,0.007,\\ {{\mathrm{♭}}_{12}}^{0.1}\otimes {{\mathrm{♭}}_{14}}^{0.4}={\ell }_{2.186},0.61,0.72,0.05,0.120.72,0.04,\\ {{\mathrm{♭}}_{13}}^{0.3}\otimes {{\mathrm{♭}}_{14}}^{0.4}={\ell }_{1.903},0.42,0.57,0.09,0.170.50,0.01.\\ \text{(53)}& {\text{CPLFWMSM}}^2{\mathrm{♭}}_{11},{\mathrm{♭}}_{12},{\mathrm{♭}}_{13},{\mathrm{♭}}_{14}={\frac{{\displaystyle {\sum }_{1\le i_1\le i_2\le 4}{{\mathrm{♭}}_{i_1}}^{{\rho }_{i_1}}\otimes {{\mathrm{♭}}_{i_2}}^{{\rho }_{i_2}}}}{{ℂ}_4^2}}^{1/2}={\ell }_{1.105},0.658,0.787,0.020,0.0460.725,0.007.\\ \text{(54)}& {\text{CPLFWDMSM}}^2{\mathrm{♭}}_{11},{\mathrm{♭}}_{12},{\mathrm{♭}}_{13},{\mathrm{♭}}_{14}=\frac{1}{2}{\displaystyle \prod _{1\le i_1\le i_2\le 4}{{\rho }_{i_1}\otimes {\mathrm{ℱ}}_{c{p}_{i_1}}\oplus {\rho }_{i_2}\otimes {\mathrm{ℱ}}_{c{p}_{i_2}}}^{1/{ℂ}_4^2}}={\ell }_{0.657},0.179,0.302,0.821,0.8830.254,0.738.\end{array}$$

  Case 2: from Table 1, we have ${\mathrm{♭}}_{11}={\ell }_2,0.5,0.8,0.3,0.40.7,0.2$, ${\mathrm{♭}}_{12}={\ell }_4,0.3,0.6,0.4,0.70.3,0.4$, ${\mathrm{♭}}_{13}={\ell }_1,0.2,0.4,0.4,0.60.2,0.1$, and ${\mathrm{♭}}_{14}={\ell }_5,0.4,0.5,0.6,0.70.6,0.5\in \text{CPLFS}U$, and ${0.2,0.1,0.3,0.4}^T$ is the weight vector. Here, we use CPLFWMSM operator to aggregate the expert evaluation in the form of CPLFSs. Without loss of generality, we take $k=2$; then,

  Using Theorem 9, we obtain

  Hence, we obtained similarly in Table 3 utilizing Theorem 9,

  Case 3: From Table 1, we have ${\mathrm{♭}}_{11}={\ell }_2,0.5,0.8,0.3,0.40.7,0.2$, ${\mathrm{♭}}_{12}={\ell }_4,0.3,0.6,0.4,0.70.3,0.4$, ${\mathrm{♭}}_{13}={\ell }_1,0.2,0.4,0.4,0.60.2,0.1$, and ${\mathrm{♭}}_{14}={\ell }_5,0.4,0.5,0.6,0.70.6,0.5\in \text{CPLFS}U$, and ${0.2,0.1,0.3,0.4}^T$ is the weight vector. Here, we use the CPLFWDMSM operator to aggregate the expert evaluation in the form of CPLFSs. Without loss of generality, we take $k=2$; then, using Theorem 16, we obtain

  Hence, we obtained similarly in Table 4 utilizing Theorem 16,

  Step 3: compute the score value of the each collective CPLF information of each alternative as in Table 5.

  Step 4: select the optimal alternative according the maximum score value as in Table 6:

Table 1

Expert 1 information $D^1$.

	$G_1$	$G_2$	$G_3$	$G_4$
${\mathrm{\complement }}_1$	${\ell }_2,0.5,0.8,0.3,0.40.7,0.2$	${\ell }_4,0.3,0.6,0.4,0.70.3,0.4$	${\ell }_1,0.2,0.4,0.4,0.60.2,0.1$	${\ell }_5,0.4,0.5,0.6,0.70.6,0.5$
${\mathrm{\complement }}_2$	${\ell }_5,0.2,0.4,0.1,0.70.5,0.6$	${\ell }_1,0.4,0.8,0.2,0.50.6,0.2$	${\ell }_5,0.5,0.7,0.3,0.70.5,0.6$	${\ell }_2,0.3,0.6,0.4,0.70.4,0.2$
${\mathrm{\complement }}_3$	${\ell }_1,0.3,0.6,0.5,0.80.6,0.4$	${\ell }_3,0.5,0.6,0.3,0.40.4,0.3$	${\ell }_3,0.4,0.4,0.5,0.60.3,0.8$	${\ell }_4,0.1,0.8,0.3,0.50.7,0.5$
${\mathrm{\complement }}_4$	${\ell }_3,0.4,0.7,0.2,0.60.4,0.7$	${\ell }_5,0.2,0.8,0.3,0.50.7,0.1$	${\ell }_2,0.6,0.8,0.2,0.80.6,0.3$	${\ell }_1,0.2,0.4,0.5,0.60.3,0.8$

Table 2

${\text{CPLFMSM}}^2$ operator.

${\mathrm{\complement }}_1$	${\ell }_{1.520},0.242,0.438,0.352,0.5300.337,0.246$
${\mathrm{\complement }}_2$	${\ell }_{1.568},0.242,0.493,0.200,0.5780.362,0.339$
${\mathrm{\complement }}_3$	${\ell }_{1.482},0.231,0.464,0.329,0.5060.371,0.432$
${\mathrm{\complement }}_4$	${\ell }_{1.468},0.246,0.555,0.239,0.5530.372,0.431$

Table 3

${\text{CPLFWMSM}}^2$ operator.

${\mathrm{\complement }}_1$	${\ell }_{1.111},0.621,0.817,0.017,0.0410.762,0.027$
${\mathrm{\complement }}_2$	${\ell }_{1.118},0.655,0.812,0.005,0.0570.744,0.014$
${\mathrm{\complement }}_3$	${\ell }_{1.105},0.658,0.787,0.020,0.0460.725,0.007$
${\mathrm{\complement }}_4$	${\ell }_{1.061},0.665,0.841,0.008,0.0510.735,0.016$

Table 4

${\text{CPLFWDMSM}}^2$ operator.

${\mathrm{\complement }}_1$	${\ell }_{0.657},0.179,0.302,0.821,0.8830.254,0.738$
${\mathrm{\complement }}_2$	${\ell }_{0.796},0.179,0.339,0.721,0.9080.248,0.808$
${\mathrm{\complement }}_3$	${\ell }_{0.667},0.153,0.331,0.807,0.8780.275,0.858$
${\mathrm{\complement }}_4$	${\ell }_{0.522},0.187,0.364,0.752,0.9000.249,0.844$

Table 5

Score value.

	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_1$	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_2$	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_3$	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_4$
${\text{CPLFMSM}}^2$	0.0908732	-0.099975	-0.033468	-0.074122
${\text{CPLFWMSM}}^2$	0.655047	0.637365	0.5915109	0.638794
${\text{CPLFWDMSM}}^2$	-0.501965	-0.590133	-0.550951	-0.508489

Table 6

Ranking results.

	Score ranking	Best alternative
${\text{CPLFMSM}}^2$	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_1>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_3>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_4>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_2$	${\mathrm{\complement }}_1$
${\text{CPLFWMSM}}^2$	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_1>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_4>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_2>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_3$	${\mathrm{\complement }}_1$
${\text{CPLFWDMSM}}^2$	${\mathcal{S}}_{\gamma }{\mathrm{\complement }}_1>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_4>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_3>{\mathcal{S}}_{\gamma }{\mathrm{\complement }}_2$	${\mathrm{\complement }}_1$

From this above computational process, we can conclude that the alternative ${\mathrm{\complement }}_1$ is the best among the others, and hence, it is highly recommendable to select for the required task/plan.

13. Conclusion

In this note, we discussed that Sections 2.3 and 2.4 in [16] incorrectively define the concept of cubic Pythagorean fuzzy set and their basic operational laws by violating to consider membership and nonmembership function, constructing counterdefinition and countertheorem, and then, we proposed the modified versions of operational laws to tackle the uncertain information in the form of CPFS in decision-making problems. Furthermore, we redefine the concept of cubic Pythagorean linguistic fuzzy set (CPLFS) and their basic operational laws and aim to establish the valid aggregation operators under CPLFS information. In addition, we find that Sections 3 and 4 that consist of list of Maclaurin symmetric mean (MSM) and dual MSM aggregation operators are invalid due to incorrect concept of cubic Pythagorean linguistic fuzzy set, and then, we redefined the list of updated MSM and dual MSM aggregation operators in a correct way. Finally, we proposed the improved algorithm-based numerical application to show the effectiveness and applicability of the valid aggregation operators under cubic Pythagorean linguistic fuzzy settings.

Ethical Approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Acknowledgments

The authors would like to thank the Deanship of Scientific Research (DSR) at Umm Al-Qura University for supporting this work by Grant Code: 19-SCI-1-01-0055.

References

[1] L. A. Zadeh, "Fuzzy sets," Information and Control, vol. 8 no. 3, pp. 338-353, DOI: 10.1016/s0019-9958(65)90241-x, 1965.

[2] T. Mahmood, "A novel approach towards bipolar soft sets and their applications," Journal of Mathematics, vol. 2020,DOI: 10.1155/2020/4690808, 2020.

[3] K. Attanassov, "Intuitionistic fuzzy sets," Fuzzy Sets and Systems, vol. 20, pp. 87-96, 1986.

[4] K. T. Atanassov, "Interval valued intuitionistic fuzzy sets,"  Intuitionistic Fuzzy Sets, pp. 139-177, DOI: 10.1007/978-3-7908-1870-3_2, 1999.

[5] R. R. Yager, "Pythagorean membership grades in multicriteria decision making," IEEE Transactions on Fuzzy Systems, vol. 22 no. 4, pp. 958-965, 2013.

[6] B. C. Cuong, V. Kreinovich, "Picture fuzzy sets-a new concept for computational intelligence problems," ,DOI: 10.1109/WICT.2013.7113099, .

[7] S. Ashraf, T. Mahmood, S. Abdullah, Q. Khan, "Different approaches to multi-criteria group decision making problems for picture fuzzy environment," Bulletin of the Brazilian Mathematical Society, New Series, vol. 50 no. 2, pp. 373-397, DOI: 10.1007/s00574-018-0103-y, 2019.

[8] S. Ashraf, S. Abdullah, T. Mahmood, "GRA method based on spherical linguistic fuzzy Choquet integral environment and its application in multi-attribute decision-making problems," Mathematical Sciences, vol. 12 no. 4, pp. 263-275, DOI: 10.1007/s40096-018-0266-0, 2018.

[9] S. Ashraf, S. Abdullah, "Spherical aggregation operators and their application in multiattribute group decision-making," International Journal of Intelligent Systems, vol. 34 no. 3, pp. 493-523, DOI: 10.1002/int.22062, 2019.

[10] S. Ashraf, S. Abdullah, T. Mahmood, F. Ghani, T. Mahmood, "Spherical fuzzy sets and their applications in multi-attribute decision making problems," Journal of Intelligent & Fuzzy Systems, vol. 36 no. 3, pp. 2829-2844, DOI: 10.3233/jifs-172009, 2019.

[11] L. Wang, H. Garg, N. Li, "Pythagorean fuzzy interactive Hamacher power aggregation operators for assessment of express service quality with entropy weight," Soft Computing, vol. 25 no. 2, pp. 973-993, DOI: 10.1007/s00500-020-05193-z, 2021.

[12] L. Wang, N. Li, "Pythagorean fuzzy interaction power Bonferroni mean aggregation operators in multiple attribute decision making," International Journal of Intelligent Systems, vol. 35 no. 1, pp. 150-183, DOI: 10.1002/int.22204, 2020.

[13] M. A. Khan, S. Ashraf, S. Abdullah, F. Ghani, "Applications of probabilistic hesitant fuzzy rough set in decision support system," Soft Computing, vol. 24 no. 22, pp. 16759-16774, DOI: 10.1007/s00500-020-04971-z, 2020.

[14] S. Ashraf, S. Abdullah, S. Khan, "Fuzzy decision support modeling for internet finance soft power evaluation based on sine trigonometric Pythagorean fuzzy information," Journal of Ambient Intelligence and Humanized Computing, vol. 12 no. 2, pp. 3101-3119, DOI: 10.1007/s12652-020-02471-4, 2021.

[15] B. Batool, M. Ahmad, S. Abdullah, S. Ashraf, R. Chinram, "Entropy based Pythagorean probabilistic hesitant fuzzy decision making technique and its application for Fog-Haze factor assessment problem," Entropy, vol. 22 no. 3,DOI: 10.3390/e22030318, 2020.

[16] A. Khan, S. Ashraf, S. Abdullah, M. Qiyas, J. Luo, S. Khan, "Pythagorean fuzzy Dombi aggregation operators and their application in decision support system," Symmetry, vol. 11 no. 3,DOI: 10.3390/sym11030383, 2019.

[17] S. Z. Abbas, M. S. Ali Khan, S. Abdullah, H. Sun, F. Hussain, "Cubic Pythagorean fuzzy sets and their application to multi-attribute decision making with unknown weight information," Journal of Intelligent & Fuzzy Systems, vol. 37 no. 1, pp. 1529-1544, DOI: 10.3233/jifs-18382, 2019.

[18] P. Talukdar, P. Dutta, "Distance measures for cubic Pythagorean fuzzy sets and its applications to multicriteria decision making," Granular Computing, vol. 6 no. 2, pp. 267-284, DOI: 10.1007/s41066-019-00185-3, 2019.

[19] A. Fahmi, N. Yaqoob, W. Chammam, "Maclaurin symmetric mean aggregation operators based on cubic Pythagorean linguistic fuzzy number," Journal of Ambient Intelligence and Humanized Computing, vol. 12 no. 2, pp. 1925-1942, DOI: 10.1007/s12652-020-02272-9, 2020.

[20] M. B. Gorzałczany, "A method of inference in approximate reasoning based on interval-valued fuzzy sets," Fuzzy Sets and Systems, vol. 21 no. 1, 1987.

[21] Y. B. Jun, C. S. Kim, K. O. Yang, "Annals of fuzzy mathematics and informatics," Cubic Sets, vol. 4, pp. 83-98, 2011.

[22] X. Peng, Y. Yang, "Fundamental properties of interval-valued Pythagorean fuzzy aggregation operators," International Journal of Intelligent Systems, vol. 31 no. 5, pp. 444-487, DOI: 10.1002/int.21790, 2016.

[23] C. Maclaurin, "A second letter toMartin Folkes, Esq.; concerning the roots of equations, with demonstration of other rules of algebra," Philosophical Transactions of the Royal Society A, vol. 36, pp. 59-96, 1729.

[24] G. Wei, C. Wei, J. Wang, H. Gao, Y. Wei, "Some q-rung orthopair fuzzy maclaurin symmetric mean operators and their applications to potential evaluation of emerging technology commercialization," International Journal of Intelligent Systems, vol. 34 no. 1, pp. 50-81, DOI: 10.1002/int.22042, 2019.