Research article

Spherical fuzzy rough Hamacher aggregation operators and their application in decision making problem

  • Received: 01 January 2023 Revised: 05 March 2023 Accepted: 04 April 2023 Published: 17 May 2023
  • MSC : 03E72, 47S40

  • Aggregation operators are the most effective mathematical tools for aggregating many variables into a single result. The aggregation operators operate to bring together all of the different assessment values offered in a common manner, and they are highly helpful for assessing the options offered in the decision-making process. The spherical fuzzy sets (SFSs) and rough sets are common mathematical tools that are capable of handling incomplete and ambiguous information. We also establish the concepts of spherical fuzzy rough Hamacher averaging and spherical fuzzy rough Hamacher geometric operators. The key characteristics of the suggested operators are thoroughly described. We create an algorithm for a multi-criteria group decision making (MCGDM) problem to cope with the ambiguity and uncertainty. A numerical example of the developed models is shown in the final section. The results show that the specified models are more efficient and advantageous than the other existing approaches when the offered models are contrasted with specific present methods.

    Citation: Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan, Salman Khan. Spherical fuzzy rough Hamacher aggregation operators and their application in decision making problem[J]. AIMS Mathematics, 2023, 8(7): 17112-17141. doi: 10.3934/math.2023874

    Related Papers:

    [1] Sani Salisu, Vasile Berinde, Songpon Sriwongsa, Poom Kumam . Approximating fixed points of demicontractive mappings in metric spaces by geodesic averaged perturbation techniques. AIMS Mathematics, 2023, 8(12): 28582-28600. doi: 10.3934/math.20231463
    [2] Mohammad Dilshad, Mohammad Akram, Md. Nasiruzzaman, Doaa Filali, Ahmed A. Khidir . Adaptive inertial Yosida approximation iterative algorithms for split variational inclusion and fixed point problems. AIMS Mathematics, 2023, 8(6): 12922-12942. doi: 10.3934/math.2023651
    [3] Yasir Arfat, Muhammad Aqeel Ahmad Khan, Poom Kumam, Wiyada Kumam, Kanokwan Sitthithakerngkiet . Iterative solutions via some variants of extragradient approximants in Hilbert spaces. AIMS Mathematics, 2022, 7(8): 13910-13926. doi: 10.3934/math.2022768
    [4] Yasir Arfat, Poom Kumam, Supak Phiangsungnoen, Muhammad Aqeel Ahmad Khan, Hafiz Fukhar-ud-din . An inertially constructed projection based hybrid algorithm for fixed point and split null point problems. AIMS Mathematics, 2023, 8(3): 6590-6608. doi: 10.3934/math.2023333
    [5] Chibueze C. Okeke, Abubakar Adamu, Ratthaprom Promkam, Pongsakorn Sunthrayuth . Two-step inertial method for solving split common null point problem with multiple output sets in Hilbert spaces. AIMS Mathematics, 2023, 8(9): 20201-20222. doi: 10.3934/math.20231030
    [6] Meiying Wang, Luoyi Shi, Cuijuan Guo . An inertial iterative method for solving split equality problem in Banach spaces. AIMS Mathematics, 2022, 7(10): 17628-17646. doi: 10.3934/math.2022971
    [7] Anjali, Seema Mehra, Renu Chugh, Salma Haque, Nabil Mlaiki . Iterative algorithm for solving monotone inclusion and fixed point problem of a finite family of demimetric mappings. AIMS Mathematics, 2023, 8(8): 19334-19352. doi: 10.3934/math.2023986
    [8] Wenlong Sun, Gang Lu, Yuanfeng Jin, Choonkil Park . Self-adaptive algorithms for the split problem of the quasi-pseudocontractive operators in Hilbert spaces. AIMS Mathematics, 2022, 7(5): 8715-8732. doi: 10.3934/math.2022487
    [9] Bancha Panyanak, Chainarong Khunpanuk, Nattawut Pholasa, Nuttapol Pakkaranang . A novel class of forward-backward explicit iterative algorithms using inertial techniques to solve variational inequality problems with quasi-monotone operators. AIMS Mathematics, 2023, 8(4): 9692-9715. doi: 10.3934/math.2023489
    [10] Fei Ma, Jun Yang, Min Yin . A strong convergence theorem for solving pseudo-monotone variational inequalities and fixed point problems using subgradient extragradient method in Banach spaces. AIMS Mathematics, 2022, 7(4): 5015-5028. doi: 10.3934/math.2022279
  • Aggregation operators are the most effective mathematical tools for aggregating many variables into a single result. The aggregation operators operate to bring together all of the different assessment values offered in a common manner, and they are highly helpful for assessing the options offered in the decision-making process. The spherical fuzzy sets (SFSs) and rough sets are common mathematical tools that are capable of handling incomplete and ambiguous information. We also establish the concepts of spherical fuzzy rough Hamacher averaging and spherical fuzzy rough Hamacher geometric operators. The key characteristics of the suggested operators are thoroughly described. We create an algorithm for a multi-criteria group decision making (MCGDM) problem to cope with the ambiguity and uncertainty. A numerical example of the developed models is shown in the final section. The results show that the specified models are more efficient and advantageous than the other existing approaches when the offered models are contrasted with specific present methods.



    Suppose B is a Banach space and CB. Now we many set an operator T:CC. T is known as contraction if ||TvTv||α||vv||, whenever v,vC and α(0,1). We call T a nonexpansive operator if α=1. When Tv=v for some vC, then this element v is known as a fixed point for T and in this case we denote the set {vC:Tv=v} simply by FT. However, if Gv=0, for an operator G:CC, then it is called a zero of G and in this case we denote the set {vC:Gv=0} by S. The class of nonexpansive operators is widely considered by lot of authors in different frame of works. In particular, Browder [6] and Gohde [10] separately provided the existence of fixed point result for these operators in a uniformly convex Banach space (UCBS) setting. Precisely, they noted that if C is bounded convex and closed in a UCBS, then a nonexpansive operator T:CC essentially admits a fixed point. In 1975, Zhang [24] noticed a new notion of nonlinear operators as follows: an operator T:CC on a subset C is essentially called mean nonexpansive if one can find two nonnegative reals a,b satisfying a+b1 such that

    ||TvTv||a||vv||+b||vTv|| for every choice of v,vC.

    Remark 1.1. The class of mean nonexpansive operators is one of the important class of nonlinear mappings because it includes properly the class of all nonexpansive operators, that is, if T:CC is nonexpansive then T satisfies the requirement of a mean nonexpansive operator with a=1 and b=0. However, the converse is not valid in general as shown by the following example (see also Examples 5.1 and 5.2 in the last section of this paper).

    Example 1.1. If C=[0,4], then we can set an operator T:CC by the following formula

    Tv={1,0v<4,0,v=4.

    Here, T is discontinuous at v=4 and hence not nonexpansive. On the other hand, it is straightforward to show that T is a mean nonexpansive operator.

    The existence of fixed points of mean nonexpansive operators in Banach spaces has been studied by some authors. In particular, Zhang [24] suggested a unique fixed point result for the class of mean nonexpansive operators in a Banach space endowed with a normal structure. Moreover, Wu and Zhang [23] and Zuo [25] provided some related properties and fixed point theorems for these operators in a Banach space. The first purpose of this research is to study the computation of fixed points for these maps under an appropriate algorithm. Secondly, we apply these results to solve some problems under new algorithms.

    After the existence of a fixed point for a given operator, it is very natural to construct an iterative scheme, which approximate the value of this fixed point. We know that in general, that Picard iterates vk+1=Tvk converges for Banach contractions but not for nonexpansive maps. Thus to find the value of the fixed point for nonexpansive and accordingly of generalized nonexpansive maps and also to obtain a relatively better rate of convergence, many schemes are available in the literature given below.

    Mann [14] provided the following algorithm:

    {v1C,vk+1=(1μk)vk+μkTvk,kN, (1.1)

    where μk(0,1).

    Ishikawa [11] constructed a new iterative algorithm as follows:

    {v1C,sk=(1ηk)vk+ηkTvk,vk+1=(1μk)vk+μkTsk,kN, (1.2)

    where μk,ηk(0,1).

    In 2000, Noor [16] first time introduced a three-step iterative algorithm, which is more general than that of Mann and Ishikawa iterative algorithms:

    {v1C,ek=(1θk)vk+θkTvk,sk=(1ηk)vk+ηkTek,vk+1=(1μk)vk+μkTsk,kN, (1.3)

    where μk,ηk,θk(0,1).

    In 2007, Agarwal et al. [4] provided the S iterative algorithm, which is independent of but better than the both the Mann and Ishikawa iterative algorithm for many nonlinear operators:

    {v1C,sk=(1ηk)vk+ηkTek,vk+1=(1μk)Tvk+μkTsk,kN, (1.4)

    where μk,ηk(0,1).

    In 2014, Abbas and Nazir [2] considered another three-step iterative algorithm, which gives better approximation results as compared Mann, Ishikawa, Noor and S iterative algorithm. Their algorithm reads as follows:

    {v1C,ek=(1θk)vk+θkTvk,sk=(1ηk)Tvk+ηkTek,vk+1=(1μk)Tsk+μkTek,kN, (1.5)

    where μk,ηk,θk(0,1).

    In 2016, Thakur et al. [21] (TTP) constructed a novel three-step iterative algorithm as follows:

    {v1C,ek=(1θk)vk+θkTvk,sk=(1ηk)ek+ηkTek,vk+1=(1μk)Tek+μkTsk,kN, (1.6)

    where μk,ηk,θk(0,1).

    By means of the iterative algorithm [21], they approximate fixed points for nonexpansive operators through weak and strong convergence on a Banach space setting. They also compared the high accuracy of this algorithm with the other well-known algorithms in the setting of nonexpansive operators. Maniu [15] proved that this algorithm is stable with respect to weak contractions. Here, we want to show that the main results of [21] can be extended to the setting of mean nonexpansive operators. We also give an example of mean nonexpansive operators which fails to hold the nonexpansiveness condition. We connect the three-step algorithm (1.6) and the other three-step algorithms with this example and show that this algorithm provide a high accuracy as compared the others three-step algorithms in the general setting of mean nonexpansive operators.

    To obtain the required aim, we first provide some elementary facts and results.

    Consider a Banach space B and CB. Select an element q0B and choose a bounded sequence, namely, {vk}B. We may set r(q0,{vk}) as

    r(q0,{vk}):=lim supkq0vk.

    The asymptotic radius of the sequence {vk} connected with the set V will be denoted by r(C,{vk}) and given by

    r(C,{vk}):=inf{r(q0,{vk}):q0C}.

    The asymptotic center of the sequence {vk} connected with the set C will be denoted by A(C,{vk}) and given by

    A(C,{vk}):={q0C:r(q0,{vk})=r(C,{vk})}.

    Remark 2.1. The set A(C,{vk}) some-times does not has any element. But in the setting of UCBS, it is always a singleton set. The convexity of the A(C,{vk}) is also known in the case when C is a weakly compact and convex set, (see, e.g., [3,20] and others).

    If a Banach space B is given. Then it is said to be endowed with the Opial's condition [17] in the case, when each {vk} in B converges in the weak sense to vB enjoys the following strict inequality:

    lim infk||vkv||<lim infk||vku|| for each choice of uB{v}.

    The following result is known from [25].

    Lemma 2.1. Assume that C is a nonempty convex and closed subset of a reflexive Banach space (RBS) B and T:CC a mean nonexpansive operator. If a sequence {vk} converges in the weak sense to v and limk||vkTvk||=0, then vFT provided that B has the Opial's property.

    Now we take an important property of a UCBS from [18].

    Lemma 2.2. If B is a UCBS such that for any two sequences {ek} and {vk} in B with lim supk||ek||z, lim supk||vk||z and limk||μkek+(1μk)vk||=z, for 0<cμkd<1 and some z0. Then limk||ekvk||=0.

    Notice that, throughout the section, B denotes a UCBS. The main outcome of this section is begun with the following key lemma. It should be noted that this lemma extends and improves [21, Lemma 4.1] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

    Lemma 3.1. If C is a nonempty convex and closed subset of B such that T:CC is a mean nonexpansive operator having FT. Then limk||vkv|| exists for every vFT, where {vk} is a sequence generated by (1.6).

    Proof. For, vFT, we have v=Tv. Then using (1.6), we have

    ||ekv||(1θk)||vkv||+θk||TvkTv||(1θk)||vkv||+θk(a||vkv||+b||vkTv||)=(1θk)||vkv||+θk(a||vkv||+b||vkv||)=(1θk)||vkv||+θk((a+b)||vkv||)(1θk)||vkv||+θk((1)||vkv||)=||vkv||,

    and

    ||skv||(1ηk)||ekv||+ηk||TekTv||(1ηk)||ekv||+ηk(a||ekv||+b||ekTv||)=(1ηk)||ekv||+ηk(a||ekv||+b||ekv||)=(1ηk)||ekv||+ηk((a+b)||ekv||)(1ηk)||ekv||+ηk((1)||ekv||)=||ekv||.

    While using the above inequilities, we have

    ||vk+1v||(1μk)||TekTv||+μk||TskTv||(1μk)(a||ekv||+b||ekTv||)+μk(a||skv||+b||skTv||)=(1μk)(a||ekv||+b||ekv||)+μk(a||skv||+b||skv||)=(1μk)((a+b)||ekv||)+μk((a+b)||skv||)(1μk)||ekv||+μk||ekv||=||ekv||||vkv||.

    It has been observed that {||vkv||} is non-increasing and bounded. It follows that limk||vkv|| exists for all fixed point v of T.

    The next theorem will be helpful in proving the main results of the sequel.

    Theorem 3.1. If C is a nonempty convex and closed subset of B such that T:CC is a mean nonexpansive operator having FT and {vk} is a sequence defined in (1.6). Then the sequence {vk} is bounded and limk||vkTvk||=0.

    Proof. If we select any element vFT, then it is clear from the Lemma 3.1, that, {vk} is bounded. We want to show that limk||vkTvk||=0. Now, according to Lemma 3.1, limk||vkv|| exists. We set

    limk||vkv||=z. (3.1)

    Now,

    ||ekr||(1θk)||vkv||+θk||TvkTv||(1θk)||vkv||+θk(a||vkv||+b||vkTv||)=(1θk)||vkv||+θk(a||vkv||+b||vkv||)=(1θk)||vkv||+θk((a+b)||vkv||)(1θk)||vkv||+θk((1)||vkv||)=||vkv|| lim supk||ekv||lim supk||vkv||=z. (3.2)

    Also,

    ||Tvkv||=||TvkTv||a||vkv||+b||vkTv||=a||vkv||+b||vkv||=(a+b)||vkv||||vkv||lim supk||Tvkv||lim supk||vkv||=z. (3.3)

    Similarly,

    ||vk+1v||(1μk)||TekTv||+μk||TskTv||(1μk)(a||ekv||+b||ekTv||)+μk(a||skv||+b||skTv||)=(1μk)(a||ekv||+b||ekv||)+μk(a||skv||+b||skv||)=(1μk)((a+b)||ekv||)+μk((a+b)||skv||)(1μk)||ekv||+μk||ekv||=||ekv|| z=lim infk||vk+1v||lim infk||ekv||. (3.4)

    From (3.2) and (3.4), we get

    z=limk||ekv||. (3.5)

    From (3.5), we have

    z=limk||ekv||=limk||(1θk)(vkv)+θk(Tvkv)||.

    Applying Lemma 2.2, we obtain

    limk||Tvkvk||=0.

    Now we want to establish a strong convergence theorem on a compact domain. This result includes the result if one considers a nonexpansive operator.

    Theorem 3.2. If C is a nonempty convex and closed subset of B such that T:CC is a mean nonexpansive operator having FT. Then {vk} defined in (1.6) converges in the strong sense to a point of FT if C is compact.

    Proof. Thanks to the convexity of C, we can say that {vk}C. Also remembering the compactness of C, one can choose a strongly convergent subsequence {vkm} of {vk} such that vkmv0. Now we show that Tv0=v0. For this

    ||v0Tv0||||v0vkm||+||vkmTvkm||+||TvkmTv0||||v0vkm||+||vkmTvkm||+(a||vkmv0||+b||vkmTv0||)||v0vkm||+||vkmTvkm||+(a||vkmv0||+b||v0vkm||+b||vkmTvkm||)=(a+b+1)||v0vkm||+(b+1)||vkmTvkm||.

    Consequently, we obtain

    ||v0Tv0||(a+b+1)||v0vkm||+(b+1)||vkmTvkm||. (3.6)

    According to Theorem 3.1, we have limk||vkmTvkm||=0, so applying m on (3.6), we obtain Tv0=v0. This shows that v0FT. By Lemma 3.1, limk||vkv0|| exists. Consequently, v0 is the strong limit of {vk} and element of FT.

    If we drop the compactness assumption, we have the following result. It should be noted that this theorem extends and improves [21, Theorem 4.4] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

    Theorem 3.3. If C is a nonempty convex and closed subset of B such that T:CC is a mean nonexpansive operator having FT. Then {vk} defined in (1.6) converges in the strong sense to a point of FT, if and only if lim infkd(vk,FT)=0.

    Proof. The necessity is straight forward.

    Conversely, we may assume that lim infkd(vk,FT)=0 and choose vFT. From the Lemma 3.1, limk||vkv|| exists. By assumption, we conclude that limkd(vk,FT)=0. We want to show that {vk} form a Cauchy sequence in the set C. As we have proved that limkd(vk,FT)=0, so for a given ε>0, one can choose r0N in such a way that for each kr0,

    d(vk,FT)<ε2 inf{||vkv||:vFT}<ε2.

    In particular, inf{||vk0v||:vFT}<ε2. This suggests the existence of vFT such that

    ||vk0v||<ε2.

    Now for r,mk0,

    ||vk+rvk||||vk+rv||+||vkv||||vk0v||+||vk0v||=2||vk0v||<ε.

    Hence, we observe that {vk} form a Cauchy sequence in the closed set V and so one can choose some vC such that limkvk=v. Now limkd(vk,FT)=0 gives that d(v,FT)=0. The closeness of FT follows from the mean nonexpansiveness of T. Hence vFT.

    We want to show a strong convergence theorem under the following condition.

    Definition 3.1. [19] On a nonempty subset C of B, an operator T:CC is said to have a condition (I) in the case, when there is a selfmap R:[0,)[0,) such that R(i)=0, if and only if i=0, R(i)>0 for all real constants i(0,) and ||vTv||R(d(v,FT)) for all vC.

    The following theorem extends and improves [21, Theorem 4.5] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

    Theorem 3.4. If C is a nonempty convex and closed subset of B such that T:CC is a mean nonexpansive operator having FT. Then {vk} defined in (1.6) converges in the strong sense to a point of FT if T has a condition (I).

    Proof. In the view of Theorem 3.1, we conclude the following

    lim infk||vkTvk||=0. (3.7)

    By combining condition (I) with (3.7), we get

    lim infkR(d(vk,FT))=0.

    Since the selfmap R is such that R(0)=0 and R(a)>0 for all i>0. It follows that

    lim infkd(vk,FT)=0.

    It has been observed that all the requirements of Theorem 3.3 are present, one concludes that T converges strongly to a fixed point of T.

    This section we close by providing a weak convergence theorem. It should be noted that this theorem extends and improves [21, Theorem 4.3] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

    Theorem 3.5. If C is a nonempty convex and closed subset of B such that T:CC is a mean nonexpansive operator having FT. Then {vk} defined in (1.6) converges in the weak sense to a point of FT if B has the Opial's property.

    Proof. We can write from Theorem 3.1 that {vk} is bounded and limk||vkTvk||=0. It is known that B is RBS in the case when B is UCBS. Thanks to the reflexiveness of the space, the generated sequence {vk} eventually possess a subsequence which we may denote by {vks} equiped with a weak limit v1C. Now we may apply Lemma 2.1, and obtain v1FT. Next we want to show that the element v1 is also a weak limit of {vk}. If the element v1 is not the weak limit of the sequence {vk}, then we may set another weakly convergent subsequence {vkt} of {vk} equiped with a weak limit v2C in such a way that v2v1. Applying Lemma 2.1, v2FT. Now applying Lemma 3.1 and also the Opial condition, one has

    limk||vkv1||=lims||vksv1||<lims||vksv2||=limk||vkv2||=limt||vktv2||<limt||vktv1||=limk||vkv1||.

    The above observations give a contradiction. Thus, we must accept that the element v1 is the weak limit of {vk}. This finishes the proof.

    If a linear or nonlinear equation has a solution then some-times it is either very hard or impossible to compute the value of such a solution under ordinary analytical approaches [1,12,22]. For instance, see the following equations,

    v2sinv=0 and v3lnvev=0,

    which are not easy to solve by applying available analytical approaches of the literature. In such a case, the approximate value of such a solution is desirable. To find an approximate value of a solution, we must rearrange the given equation in the form of fixed point equation v=Tv. Notice that here the operator T should be set on a certian space B. In this case, fixed point set of T is same as the solution set of the given equation. Fixed point theorems provides the existence and uniqueness of a fixed point for T, while iterative algorithms finds the value of this fixed point by imposing some conditions (on T, the domain of T or any other). Banach Contraction Principle (BCP) [5] offers a unique fixed point for T if T is a contraction and B is a complete metric space and suggest a basic iterative algorithm due to Picard for computing its value. However, for nonexpansive operators, Picard algorithm in general fails to converge. The class of nonexpansive operators includes contractions and has important applications in many areas of applied sciences, that is, in image reconstruction and signal processing problems, the operator T is essentially nonexpansive, when the method of an averaging operators is used, (see e.g., Byrne [7] and others).

    Accordingly, here we propose algorithms that are the modifications of the TTP algorithm (1.6) (which we call here TTP type algorithms) and using our main results, we show that these algorithms eventually solves SFPs and VIPs, respectively.

    If B1 and B2 are two given real Hilbert spaces. Then the concept of a SFP mathematically, a SFP [8] reads as follows:

    Find vC AvQ. (4.1)

    The subset CB1 as well as the subset QB2 are assumed as closed, convex and A:B1B2 is an operator which is assumed at the same time linear and bounded. From [13], we know that, many problems arise in the research of signal processing as well as the design of any provided nonlinear synthetic discriminant filter as concerns optical pattern recognition, can be set in the form of SFPs.

    We may suppose that the SFP (4.1) has a nonempty solution set, and we denote it by S. Now, from [13], we know that, vC solves (4.1) if and only if it solves the below provided fixed point equation:

    v=PC(IidξA(IidPQ)A)v.

    The above used notations PC as well as PQ are used for the nearest point projection (NPP) onto the already choosen sets C and Q, respectively. While ξ>0 and A denotes the adjoint operator of corresponding to the operator A. In [7], Byrne was the first researcher among other things, who noted that if η is a scalar that denotes a spectral radius of AA and suppose 0<ξ<2η, we can say that

    T=PC(IidξA(IPQ)A)

    is essentially nonexpansive and the weak convergence of the below CQ iterative algorithm

    vk+1=PC(IidξA(IidPQ)A)vk,kN,

    is confirm in the set S.

    The improvement and extension the above weak convergence to case of strong convergence gained the attention of many authors. However to do this, one needs some more assumptions, (see e.g., [13] and others) to study a recent survey on the Halpern type algorithms.

    In this research, our approach is to consider mean nonexpansive operators, which are generally not continuous on the domain on which they are defined (as shown by examples in this paper), instead of nonexpansive operators, that are essentially throughout continuous on the domain on which they are defined. In this case, we assume that a SFP has a solution, and prove that the proposed iterative algorithm converges weakly and strongly to its solution.

    Theorem 4.1. Let the SFP (4.1) be consistent, that is, S, 0<ξ<2η and PC(IidξA(IidPQ)A) be a mean nonexpansive operator. Then there exists μk,ηk,θk(0,1) in a way that the suggested iterative algorithm sequence {vk} produced as

    {v1C,ek=(1θk)vk+θkPC(IξA(IidPQ)A)vk,sk=(1ηk)ek+ηkPC(IξA(IidPQ)A)ek,vk+1=(1μk)PC(IidξA(IidPQ)A)ek+μkPC(IidξA(IidPQ)A)sk,kN,

    accordingly weakly convergent to v which is a solution of SFP problem (4.1).

    Proof. Puti T=PC(IidξA(IidPQ)A). Then T is a mean nonexpansive operator. According to Theorem 3.5, {vk} converges weakly to a point of FT. But FT=S, it follows that {vk} converges weakly to a solution v of the SFP problem (4.1).

    The strong convergence is the following.

    Theorem 4.2. Let the SFP (4.1) be consistent, that is, S, 0<ξ<2η and PC(IidξA(IidPQ)A) be a mean nonexpansive operator. Then there exists μk,ηk,θk(0,1) in a way that the suggested iterative algorithm sequence {vk} produced as

    {v1C,ek=(1θk)vk+θkPC(IξA(IidPQ)A)vk,sk=(1ηk)ek+ηkPC(IξA(IidPQ)A)ek,vk+1=(1μk)PC(IidξA(IidPQ)A)ek+μkPC(IidξA(IidPQ)A)sk,kN,

    accordingly strongly convergent to v which is a solution of SFP problem (4.1) provided that lim infkd(vk,S)=0.

    Proof. Puti T=PC(IidξA(IidPQ)A). Then T is mean nonexpansive. According to Theorem 3.3, {vk} converges strongly to a point of FT. But FT=S, it follows that {vk} converges strongly to a solution v of the SFP problem (4.1).

    Suppose a Hilbert space B and CB is closed and convex. The operator M:BB is known as monotone if

    MvMv,vv0,v,vB.

    Now we give the concept of a VIP. Mathematically, a VIP reads as follows:

    Find vC such that Mv,vv0 vB. (4.2)

    In [7], the author noted that if ξ>0, then vC is always a solution for the VIP (4.2) if and only if v is a solution of the below given fixed point equation:

    v=PC(IidξM)v,

    where PC denotes the nearest point projection onto the set C.

    In [7], the author noted that if IidξM and PC(IidξM) are nonexpansive operators, then, the sequence {vk} generated by the following iterative algorithm:

    vk+1=PC(IidξM)vk,kN

    converges weakly to a solution of the VIP (4.2), provided that such solutions essentially exist.

    In this research, our approach is to consider mean nonexpansive operators, which are generally not continuous on the domain on which they are defined (as shown by examples in this paper), instead of nonexpansive operators, that are essentially throughout continuous on the domain on which they are defined. In this case, we assume that a VIP has a solution, and prove that the proposed iterative algorithm converges weakly and strongly to its solution.

    Theorem 4.3. Let the VIP (4.2) be consistent, that is, S, ξ>0. If PC(IidξM) is a mean nonexpansive operator. Then there exists μk,ηk,θk(0,1) in a way that the suggested iterative algorithm sequence {vk} produced as

    {v1C,ek=(1θk)vk+θkPC(IidξM)vk,sk=(1ηk)ek+ηkPC(IidξM)ek,vk+1=(1μk)PC(IidξM)ek+μkPC(IidξM)sk,kN,

    accordingly weakly convergent to v which is a solution of VIP problem (4.2).

    Proof. Puti T=PC(IidξM). Then T is a mean nonexpansive operator. According to Theorem 3.5, {vk} converges weakly to a point of FT. But FT=S, it follows that {vk} converges weakly to a solution v of the VIP problem (4.2).

    Theorem 4.4. Let the VIP (4.2) be consistent, that is, S, ξ>0. If PC(IidξM) is a mean nonexpansive operator. Then there exists μk,ηk,θk(0,1) in a way that the suggested iterative algorithm sequence {vk} produced as

    {v1C,ek=(1θk)vk+θkPC(IidξM)vk,sk=(1ηk)ek+ηkPC(IidξM)ek,vk+1=(1μk)PC(IidξM)ek+μkPC(IidξM)sk,kN,

    accordingly strongly convergent to v which is a solution of VIP problem (4.2) provided that lim infkd(vk,S)=0.

    Proof. Put T=PC(IidξM). Then T is mean nonexpansive. According to Theorem 3.3, {vk} converges weakly to a point of FT. But FT=S, it follows that {vk} converges strongly to a solution v of the VIP problem (4.2).

    We first construct an example of discontinuous mean nonexpansive maps having a unique fixed point. We show that this example does not belong to the class of nonexpansive operators as.

    Example 5.1. If C=[1,5], then C is clearly close and convex. We now set T:CC that is defined as follows:

    Tv={5,1v<2,v+52,2v5.

    We want to show that T is mean nonexpansive on C. We need to find some positive real constants a,b with a+b1, suchjthat ||TvTv||a||vv||+b||vTv||, for every v,vC. Choose a=12=b, then a+b1. We suggest the following cases.

    (i) Suppose that 1v,v<2. Then

    ||TvTv||=0a||vv||+b||vTv||.

    (ii) Suppose that 2v,v<5. Then

    a||vv||+b||vPv||=12||vv||+b||v(v+52)||12||vv||=||TvTv||.

    (iii) Suppose that 1v<2 and 2<v5.

    a||vv||+b||vTv||=a||vv||+12||v5||12||v5||=||v52||=||TvTv||.

    (iv) Suppose that 1v<2 and 2v5.

    a||vv||+b||vTv||=12||vv||+12||v(v+52)||12||(vv)(v(v+52))||=12||2v+v+52||=||v52||=||TvTv||.

    It has been observed that the operator T is mean nonexpansive on the set C. Notice that T is being discontinuous and hence not nonexpansive. Precisely, if v=1.9 and v=2, then ||TvTv||>||vv||. Using this example, we provide some values obtained from different iterative algorithms in the Table 1 and the behaviors of there iterates can be viewed in the Figure 1.

    Table 1.  Iterates of Picard, Mann (1.1), Ishikawa (1.2), Noor (1.3), S (1.4), Abbas (1.5), and TTP (1.6) using the operator T of Example 5.1.
    k Picard Mann Ishikawa Noor S Abbas and Nazir TTP
    1 4.3 4.3 4.3 4.3 4.3 4.3 4.3
    2 4.6500 4.5975 4.6942 4.7159 4.7467 4.7470 4.8037
    3 4.8250 4.7686 4.8664 4.8847 4.9083 4.9086 4.9449
    4 4.9125 4.8669 4.9416 4.9532 4.9668 4.9670 4.9846
    5 4.9563 4.9235 4.9745 4.9810 4.9880 4.9881 4.9957
    6 4.9781 4.9560 4.9889 4.9923 4.9957 4.9957 4.9988
    7 4.9891 4.9747 4.9951 4.9969 4.9984 4.9984 4.9997
    8 4.9945 4.9855 4.9979 4.9987 4.9994 4.9994 5.9999
    9 4.9973 4.9916 4.9991 4.9995 4.9998 4.9998 5.0000
    10 4.9986 4.9952 4.9996 4.9998 4.9999 4.9999 5.0000
    11 4.9993 4.9972 4.9998 4.9999 5.0000 5.0000 5.0000
    12 4.9997 4.9984 4.9999 5.0000 5.0000 5.0000 5.0000
    13 4.9998 4.9991 5.0000 5.0000 5.0000 5.0000 5.0000
    14 4.9999 4.9995 5.0000 5.0000 5.0000 5.0000 5.0000
    15 5.0000 4.9997 5.0000 5.0000 5.0000 5.0000 5.0000
    16 5.0000 4.9998 5.0000 5.0000 5.0000 5.0000 5.0000
    17 5.0000 4.9999 5.0000 5.0000 5.0000 5.0000 5.0000
    18 5.0000 5.0000 5.0000 5.0000 5.0000 5.0000 5.0000

     | Show Table
    DownLoad: CSV
    Figure 1.  Behaviors of iterates of the Table 1.

    Now, we show some furhter high accuracy of the TTP iterative algorithm. We use Example 5.2, and set ||vkv||<1015 our stopping cretrian. Observations are provided in the Tables 24 and Figures 24.

    Table 2.  μk=kk+3, ηk=k(k+7) and θk=2k5k+2.
    Number of iterative steps to reach the fixed point.
    v1 Noor (1.3) Abbas and Nazir (1.5) TTP(1.6)
    0.12 17 13 10
    0.28 17 14 10
    0.50 17 14 11
    0.75 18 14 11
    0.99 18 16 11

     | Show Table
    DownLoad: CSV
    Table 3.  μk=kk+1, ηk=kk+7 and θk=(13k+4).
    Number of iterative steps to reach the fixed point.
    v1 Noor (1.3) Abbas and Nazir (1.5) TTP(1.6)
    0.12 15 16 14
    0.28 16 17 14
    0.50 16 17 15
    0.75 16 17 15
    0.99 16 17 15

     | Show Table
    DownLoad: CSV
    Table 4.  μk=k(7k+25)17, ηk=1(1k+7) and θk=kk+25.
    Number of iterative steps to reach the fixed point.
    v1 Noor (1.3) Abbas and Nazir (1.5) TTP(1.6)
    0.12 26 15 12
    0.28 27 15 13
    0.50 27 16 13
    0.75 27 16 13
    0.99 28 16 13

     | Show Table
    DownLoad: CSV
    Figure 2.  Behaviors comparison of the three-step methods by putting the parameters as in the Table 2 and the starting point v1=0.14.
    Figure 3.  Behaviors comparison of the three-step methods by putting the parameters as in the Table 3 and the starting point v1=0.52.
    Figure 4.  Behaviors comparison of the three-step methods by putting the parameters as in the Table 4 and the starting point v1=0.98.

    We finish our paper with the following example that illustrates our main results.

    Example 5.2. If C=[0,1], then we can set an operator T:CC by the following formula

    Tv={v5,0v<12,v6,12v1.

    Here, T is discontinuous and hence not nonexpansive. On the other hand, T is a mean nonexpansive operator. Moreover, the domain of T is closed convex subset of a UCBS, so the sequence of TTP iteration (1.6) converges to its fixed point.

    The paper provided a three-step iterative approach to compute fixed points of mean nonexpansive maps in a Banach space setting. Weak and strong convergence on compact and noncompact domains are essentially established. We have showed by examples that mean nonexpansive mappings are in general discontinuous and include all nonexpansive mappings. Accordingly, we have improved the main results of Thakur et al. [21] in two ways:

    (i) From nonexpansive operators to the wider setting of mean nonexpansive operators.

    (ii) From continuous operators to the general setting of discontinuous operators.

    As applications of the main outcome, we have suggested two new three-step TTP type projection algorithms to find a solution for SFP and VIP in the context of mean nonexpansive mappings. We have performed some numerical experiments to provide the high accuracy of the studied three-step algorithm corresponding to the other three-step algorithms in context of mean nonexpansive operators.

    We now leave an intersting open problem for the readers as follows.

    Open Problem. Can we extend the results of this paper to the setting of hyperbolic spaces?

    This study is supported via funding from Prince Sattam bin Abdulaziz University project number (PSAU/2023/R/1444).

    The authors declare no conflict of interest.



    [1] K. T. Atanassov, More on intuitionistic fuzzy sets, Fuzzy Set Syst., 33 (1989), 37–45. https://doi.org/10.1016/0165-0114(89)90215-7 doi: 10.1016/0165-0114(89)90215-7
    [2] M. I. Ali, F. Feng, T. Mahmood, I. Mahmood, H. Faizan, A graphical method for ranking Atanassov's intuitionistic fuzzy values using the uncertainty index and entropy, Int. J. Intell. Syst., 34 (2019), 2692–2712. https://doi.org/10.1002/int.22174 doi: 10.1002/int.22174
    [3] S. Ashraf, S. Abdullah, T. Mahmood, F. Ghani, T. Mahmood, Spherical fuzzy sets and their applications in multi-attribute decision making problems, J. Intell. Fuzzy Syst., 36 (2019), 2829–2844. https://doi.org/10.3233/JIFS-172009 doi: 10.3233/JIFS-172009
    [4] S. Ashraf, S. Abdullah, M. Aslam, M. Qiyas, M. A. Kutbi, Spherical fuzzy sets and its representation of spherical fuzzy t-norms and t-conorms, J. Intell. Fuzzy Syst., 36 (2019), 6089–6102. https://doi.org/10.3233/JIFS-181941 doi: 10.3233/JIFS-181941
    [5] S. Ashraf, S. Abdullah, T. Mahmood, Spherical fuzzy Dombi aggregation operators and their application in group decision making problems, J. Ambient Intell. Human. Comput., 11 (2020), 2731–2749. https://doi.org/10.1007/s12652-019-01333-y doi: 10.1007/s12652-019-01333-y
    [6] D. Ahmed, B. X. Dai, Picture fuzzy rough set and rough picture fuzzy set on two different universes and their applications, J. Math., 2020 (2020), 1–17. https://doi.org/10.1155/2020/8823580 doi: 10.1155/2020/8823580
    [7] S. An, Q. H. Hu, C. Z. Wang, Probability granular distance-based fuzzy rough set model, Appl. Soft Comput., 102 (2021), 107064. https://doi.org/10.1016/j.asoc.2020.107064 doi: 10.1016/j.asoc.2020.107064
    [8] M. Brandenburg, K. Govindan, J. Sarkis, S. Seuring, Quantitative models for sustainable supply chain management: developments and directions, Eur. J. Oper. Res., 233 (2014), 299–312. https://doi.org/10.1016/j.ejor.2013.09.032 doi: 10.1016/j.ejor.2013.09.032
    [9] C. Chandra, S. Kumar, An application of a system analysis methodology to manage logistics in a textile supply chain, Supply Chain Manag., 5 (2000), 234–245. https://doi.org/10.1108/13598540010350493 doi: 10.1108/13598540010350493
    [10] D. Dubois, H. Prade, Rough fuzzy sets and fuzzy rough sets, Int. J. Gen. Syst., 17 (1990), 191–209. https://doi.org/10.1080/03081079008935107 doi: 10.1080/03081079008935107
    [11] I. Deli, N. Çagman, Spherical fuzzy numbers and multi-criteria decision-making, In: Decision making with spherical fuzzy sets, Cham: Springer, 2021, 53–84. https://doi.org/10.1007/978-3-030-45461-6_3
    [12] A. P. Darko, D. C. Liang, Some q-rung orthopair fuzzy Hamacher aggregation operators and their application to multiple attribute group decision making with modified EDAS method, Eng. Appl. Artif. Intell., 87 (2020), 103259. https://doi.org/10.1016/j.engappai.2019.103259 doi: 10.1016/j.engappai.2019.103259
    [13] B. Fahimnia, J. Sarkis, H. Davarzani, Green supply chain management: a review and bibliometric analysis, Int. J. Prod. Econ., 162 (2015), 101–114. https://doi.org/10.1016/j.ijpe.2015.01.003 doi: 10.1016/j.ijpe.2015.01.003
    [14] M. K. Ghorabaee, E. K. Zavadskas, M. Amiri, Z. Turskis, Extended EDAS method for fuzzy multi-criteria decision-making: an application to supplier selection, Int. J. Comput. Commun. Control, 11 (2016), 358–371. https://doi.org/10.15837/ijccc.2016.3.2557 doi: 10.15837/ijccc.2016.3.2557
    [15] X. J. Gou, Z. S. Xu, P. J. Ren, The properties of continuous Pythagorean fuzzy information, Int. J. Intell. Syst., 31 (2016), 401–424. https://doi.org/10.1002/int.21788 doi: 10.1002/int.21788
    [16] H. Garg, A new generalized Pythagorean fuzzy information aggregation using Einstein operations and its application to decision making, Int. J. Intell. Syst., 31 (2016), 886–920. https://doi.org/10.1002/int.21809 doi: 10.1002/int.21809
    [17] Y. D. He, H. Y. Chen, L. G. Zhou, J. P. Liu, Z. F. Tao, Intuitionistic fuzzy geometric interaction averaging operators and their application to multi-criteria decision making, Inform. Sci., 259 (2014), 142–159. https://doi.org/10.1016/j.ins.2013.08.018 doi: 10.1016/j.ins.2013.08.018
    [18] J. Y. Huang, Intuitionistic fuzzy Hamacher aggregation operators and their application to multiple attribute decision making, J. Intell. Fuzzy Syst., 27 (2014), 505–513. https://doi.org/10.3233/IFS-131019 doi: 10.3233/IFS-131019
    [19] Y. D. He, H. Y. Chen, Z. He, L. G. Zhou, Multi-attribute decision making based on neutral averaging operators for intuitionistic fuzzy information, Appl. Soft Comput., 27 (2015), 64–76. https://doi.org/10.1016/j.asoc.2014.10.039 doi: 10.1016/j.asoc.2014.10.039
    [20] A. Hadrani, K. Guennoun, R. Saadane, M. Wahbi, Fuzzy rough sets: survey and proposal of an enhanced knowledge representation model based on automatic noisy sample detection, Cogn. Syst. Res., 64 (2020), 37–56. https://doi.org/10.1016/j.cogsys.2020.05.001 doi: 10.1016/j.cogsys.2020.05.001
    [21] M. K. Ghorabaee, E. K. Zavadskas, L. Olfat, Z. Turskis, Multi-criteria inventory classification using a new method of evaluation based on distance from average solution (EDAS), Informatica, 26 (2015), 435–451. https://doi.org/10.15388/Informatica.2015.57 doi: 10.15388/Informatica.2015.57
    [22] F. Kutlu Gündoğdu, C. Kahraman, Spherical fuzzy sets and spherical fuzzy TOPSIS method, J. Intell. Fuzzy Syst., 36 (2019), 337–352. https://doi.org/10.3233/JIFS-181401 doi: 10.3233/JIFS-181401
    [23] Q. Lei, Z. S. Xu, Relationships between two types of intuitionistic fuzzy definite integrals, IEEE Trans. Fuzzy Syst., 24 (2016), 1410–1425. https://doi.org/10.1109/TFUZZ.2016.2516583 doi: 10.1109/TFUZZ.2016.2516583
    [24] P. D. Liu, P. Wang, Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making, Int. J. Intell. Syst., 33 (2018), 259–280. https://doi.org/10.1002/int.21927 doi: 10.1002/int.21927
    [25] P. D. Liu, W. Q. Liu, Multiple-attribute group decision-making based on power Bonferroni operators of linguistic q-rung orthopair fuzzy numbers, Int. J. Intell. Syst., 34 (2019), 652–689. https://doi.org/10.1002/int.22071 doi: 10.1002/int.22071
    [26] P. D. Liu, P. Wang, Multiple-attribute decision-making based on Archimedean Bonferroni operators of q-rung orthopair fuzzy numbers, IEEE Trans. Fuzzy Syst., 27 (2019), 834–848. https://doi.org/10.1109/TFUZZ.2018.2826452 doi: 10.1109/TFUZZ.2018.2826452
    [27] X. D. Peng, Y. Yang, Some results for Pythagorean fuzzy sets, Int. J. Intell. Syst., 30 (2015), 1133–1160. https://doi.org/10.1002/int.21738 doi: 10.1002/int.21738
    [28] M. R. Seikh, U. Mandal, Intuitionistic fuzzy Dombi aggregation operators and their application to multiple attribute decision-making, Granular Comput., 6 (2021), 473–488. https://doi.org/10.1007/s41066-019-00209-y doi: 10.1007/s41066-019-00209-y
    [29] M. Qiyas, S. Abdullah, Sine trigonometric spherical fuzzy aggregation operators and their application in decision support system, TOPSIS, VIKOR, Korean J. Math., 29 (2021), 137–167. https://doi.org/10.11568/kjm.2021.29.1.137 doi: 10.11568/kjm.2021.29.1.137
    [30] M. Qiyas, S. Abdullah, S. Khan, M. Naeem, Multi-attribute group decision making based on sine trigonometric spherical fuzzy aggregation operators, Granular Comput., 7 (2022), 141–162. https://doi.org/10.1007/s41066-021-00256-4 doi: 10.1007/s41066-021-00256-4
    [31] M. Qiyas, S. Abdullah, M. Naeem, Spherical uncertain linguistic Hamacher aggregation operators and their application on achieving consistent opinion fusion in group decision making, Int. J. Intell. Comput. Cybern., 14 (2021), 550–579. https://doi.org/10.1108/IJICC-09-2020-0120 doi: 10.1108/IJICC-09-2020-0120
    [32] M. Qiyas, N. Khan, M. Naeem, S. Abdullah, Intuitionistic fuzzy credibility Dombi aggregation operators and their application of railway train selection in Pakistan, AIMS Math., 8 (2023), 6520–6542. https://doi.org/10.3934/math.2023329 doi: 10.3934/math.2023329
    [33] P. J. Ren, Z. S. Xu, X. J. Gou, Pythagorean fuzzy TODIM approach to multi-criteria decision making, Appl. Soft Comput., 42 (2016), 246–259. https://doi.org/10.1016/j.asoc.2015.12.020 doi: 10.1016/j.asoc.2015.12.020
    [34] M. Rafiq, S. Ashraf, S. Abdullah, T. Mahmood, S. Muhammad, The cosine similarity measures of spherical fuzzy sets and their applications in decision making, J. Intell. Fuzzy Syst., 36 (2019), 6059–6073. https://doi.org/10.3233/JIFS-181922 doi: 10.3233/JIFS-181922
    [35] L. Sun, T. Y. Yin, W. P. Ding, Y. H. Qian, J. C. Xu, Feature selection with missing labels using multilabel fuzzy neighborhood rough sets and maximum relevance minimum redundancy, IEEE Trans. Fuzzy Syst., 30 (2022), 1197–1211. https://doi.org/10.1109/TFUZZ.2021.3053844 doi: 10.1109/TFUZZ.2021.3053844
    [36] G. W. Wei, Gray relational analysis method for intuitionistic fuzzy multiple attribute decision making, Expert Syst. Appl., 38 (2011), 11671–11677. https://doi.org/10.1016/j.eswa.2011.03.048 doi: 10.1016/j.eswa.2011.03.048
    [37] W. Z. Wang, X. W. Liu, Intuitionistic fuzzy geometric aggregation operators based on Einstein operations, Int. J. Intell. Syst., 26 (2011), 1049–1075. https://doi.org/10.1002/int.20498 doi: 10.1002/int.20498
    [38] J. Q. Wang, H. Y. Zhang, Multicriteria decision-making approach based on Atanassov's intuitionistic fuzzy sets with incomplete certain information on weights, IEEE Trans. Fuzzy Syst., 21 (2013), 510–515. https://doi.org/10.1109/TFUZZ.2012.2210427 doi: 10.1109/TFUZZ.2012.2210427
    [39] G. W. Wei, H. Gao, Y. Wei, Some q-rung orthopair fuzzy Heronian mean operators in multiple attribute decision making, Int. J. Intell. Syst., 33 (2018), 1426–1458. https://doi.org/10.1002/int.21985 doi: 10.1002/int.21985
    [40] C. Z. Wang, Y. Huang, M. W. Shao, X. D. Fan, Fuzzy rough set-based attribute reduction using distance measures, Knowl. Based Syst., 164 (2019), 205–212. https://doi.org/10.1016/j.knosys.2018.10.038 doi: 10.1016/j.knosys.2018.10.038
    [41] Z. S. Xu, R. R. Yager, Some geometric aggregation operators based on intuitionistic fuzzy sets, Int. J. Gen. Syst., 35 (2006), 417–433. https://doi.org/10.1080/03081070600574353 doi: 10.1080/03081070600574353
    [42] Z. S. Xu, Intuitionistic fuzzy aggregation operators, IEEE Trans. Fuzzy Syst., 15 (2007), 1179–1187. https://doi.org/10.1109/TFUZZ.2006.890678 doi: 10.1109/TFUZZ.2006.890678
    [43] M. M. Xia, Z. S. Xu, B. Zhu, Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm, Knowl. Based Syst., 31 (2012), 78–88. https://doi.org/10.1016/j.knosys.2012.02.004 doi: 10.1016/j.knosys.2012.02.004
    [44] Y. Xu, X. P. Shang, J. Wang, W. Wu, H. Q. Huang, Some q-rung dual hesitant fuzzy Heronian mean operators with their application to multiple attribute group decision-making, Symmetry, 10 (2018), 1–25. https://doi.org/10.3390/sym10100472 doi: 10.3390/sym10100472
    [45] L. Xu, Y. Liu, H. B. Liu, Some improved q-rung orthopair fuzzy aggregation operators and their applications to multiattribute group decision-making, Math. Probl. Eng., 2019 (2019), 1–18. https://doi.org/10.1155/2019/2036728 doi: 10.1155/2019/2036728
    [46] J. C. Xu, K. L. Shen, L. Sun, Multi-label feature selection based on fuzzy neighborhood rough sets, Complex Intell. Syst., 8 (2022), 2105–2129. https://doi.org/10.1007/s40747-021-00636-y doi: 10.1007/s40747-021-00636-y
    [47] K. P. Yoon, C. L. Hwang, Multiple attribute decision making, Sage Publications, 1995. https://doi.org/10.4135/9781412985161
    [48] R. R. Yager, Generalized orthopair fuzzy sets, IEEE Trans. Fuzzy Syst., 25 (2016), 1222–1230. https://doi.org/10.1109/TFUZZ.2016.2604005 doi: 10.1109/TFUZZ.2016.2604005
    [49] M. Yazdani, S. H. Zolfani, E. K. Zavadskas, New integration of MCDM methods and QFD in the selection of green suppliers, J. Bus. Econ. Manag., 17 (2016), 1097–1113. https://doi.org/10.3846/16111699.2016.1165282 doi: 10.3846/16111699.2016.1165282
    [50] W. Yang, Y. F. Pang, New q-rung orthopair fuzzy partitioned Bonferroni mean operators and their application in multiple attribute decision making, Int. J. Intell. Syst., 34 (2019), 439–476. https://doi.org/10.1002/int.22060 doi: 10.1002/int.22060
    [51] Z. Yuan, H. M. Chen, P. Xie, P. F. Zhang, J. Liu, T. R. Li, Attribute reduction methods in fuzzy rough set theory: an overview, comparative experiments, and new directions, Appl. Soft Comput., 107 (2021), 107353. https://doi.org/10.1016/j.asoc.2021.107353 doi: 10.1016/j.asoc.2021.107353
    [52] L. A. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.2307/2272014 doi: 10.2307/2272014
    [53] L. Zhou, W. Z. Wu, On generalized intuitionistic fuzzy rough approximation operators, Inform. Sci., 178 (2008), 2448–2465. https://doi.org/10.1016/j.ins.2008.01.012 doi: 10.1016/j.ins.2008.01.012
    [54] H. Zhao, Z. S. Xu, M. F. Ni, S. S. Liu, Generalized aggregation operators for intuitionistic fuzzy sets, Int. J. Intell. Syst., 25 (2010), 1–30. https://doi.org/10.1002/int.20386 doi: 10.1002/int.20386
    [55] X. L. Zhang, Z. S. Xu, Extension of TOPSIS to multiple criteria decision making with Pythagorean fuzzy sets, Int. J. Intell. Syst., 29 (2014), 1061–1078. https://doi.org/10.1002/int.21676 doi: 10.1002/int.21676
    [56] S. Z. Zeng, Y. Xiao, TOPSIS method for intuitionistic fuzzy multiple-criteria decision making and its application to investment selection, Kybernetes, 45 (2016), 282–296. https://doi.org/10.1108/K-04-2015-0093 doi: 10.1108/K-04-2015-0093
    [57] S. Z. Zeng, S. M. Chen, L. W. Kuo, Multiattribute decision making based on novel score function of intuitionistic fuzzy values and modified VIKOR method, Inform. Sci., 488 (2019), 76–92. https://doi.org/10.1016/j.ins.2019.03.018 doi: 10.1016/j.ins.2019.03.018
  • This article has been cited by:

    1. Rekha Srivastava, Wakeel Ahmed, Asifa Tassaddiq, Nouf Alotaibi, Efficiency of a New Iterative Algorithm Using Fixed-Point Approach in the Settings of Uniformly Convex Banach Spaces, 2024, 13, 2075-1680, 502, 10.3390/axioms13080502
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1665) PDF downloads(68) Cited by(2)

Figures and Tables

Tables(6)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog