Next Article in Journal
Symmetry Methods and Conservation Laws for the Nonlinear Generalized 2D Equal-Width Partial Differential Equation of Engineering
Previous Article in Journal
Investigations on the Control of COVID-19 and Suggestions for Re-Open Based on Model Study
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Bipolar Complex Fuzzy Hamacher Aggregation Operators and Their Applications in Multi-Attribute Decision Making

1
Department of Mathematics and Statistics, International Islamic University, Islamabad 44000, Pakistan
2
Facultad de Economía y Empresa and Multidisciplinary Institute of Enterprise (IME), University of Salamanca, 37007 Salamanca, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(1), 23; https://doi.org/10.3390/math10010023
Submission received: 4 November 2021 / Revised: 2 December 2021 / Accepted: 17 December 2021 / Published: 21 December 2021
(This article belongs to the Section Fuzzy Sets, Systems and Decision Making)

Abstract

:
On the basis of Hamacher operations, in this manuscript, we interpret bipolar complex fuzzy Hamacher weighted average (BCFHWA) operator, bipolar complex fuzzy Hamacher ordered weighted average (BCFHOWA) operator, bipolar complex fuzzy Hamacher hybrid average (BCFHHA) operator, bipolar complex fuzzy Hamacher weighted geometric (BCFHWG) operator, bipolar complex fuzzy Hamacher ordered weighted geometric (BCFHOWG) operator, and bipolar complex fuzzy Hamacher hybrid geometric (BCFHHG) operator. We present the features and particular cases of the above-mentioned operators. Subsequently, we use these operators for methods that can resolve bipolar complex fuzzy multiple attribute decision making (MADM) issues. We provide a numerical example to authenticate the interpreted methods. In the end, we compare our approach with existing methods in order to show its effectiveness and practicality.

1. Introduction

In classical set theory (CST), we have only two possibilities, yes or no, i.e., an item either belongs to a set or does not. This means that the characteristic function of an item can give values 0 or 1 . The CST fails in many situations such as age, intelligence, and height. To overcome this issue, Zadeh [1] presented the idea of the fuzzy set (FS). In FS theory, the membership degree (MD) belongs to the closed interval [ 0 ,   1 ] instead of { 0 ,   1 } . Mardani et al. [2] presented decision-making (DM) methods based on fuzzy aggregation operators. Merigó and Casanovas [3] described fuzzy generalized hybrid aggregation operators and their application in fuzzy DM. FS theory only considers MD, but in various circumstances, we need a non-membership degree (NMD). To handle such problems, Atanassov [4] provided the notion of intuitionistic FS (IFS) denoted by an MD and NMD with the condition that the sum of MD and NMD belongs to the closed interval [ 0 ,   1 ] . Xu [5] introduced intuitionistic fuzzy (IF) aggregation operators. The generalized IF aggregation operators are based on confidence levels for group DM given by Rahman et al. [6]. Verma and Merigó [7] presented multiple-attribute group DM (MAGDM) based on two-dimensional linguistic IF aggregation operators. Huang [8] defined the IF Hamacher aggregation operators and their application to MADM. Garg [9] presented IF Hamacher aggregation operators’ entropy weight and their applications to multi-criteria DM (MCDM) issues.
Subsequently, the bipolar fuzzy set (BFS) [10,11] has risen as another technique that illustrates vagueness in MADM issues. The BFS is denoted by the pair of positive degree PD, whose range is [ 0 ,   1 ] , and by negative degree (ND), whose range is the [ 1 ,   0 ] . Lee [12] presented a comparison of interval-valued FS, IFSs, and bipolar valued FSs. BFSs have been applied in several research zones such as bipolar logical cognitive and set theory [13,14], graph theory [15,16], quantum computing [17,18], traditional Chinese medicine notions [19,20], physics and philosophy [21], and biosystem regulation [22]. Gul [23] presented the bipolar fuzzy (BF) aggregation operators. Wei et al. [24] presented BF Hamacher aggregation operators in MADM. BF Dombi aggregation operators and their application in MADM are given by Jana et al. [25]. Jana et al. [26] described BF Dombi prioritized aggregation operators in MADM. Riaz and Tehrim [27] presented a robust extension of VIKOR method for BFSs in which they use connection numbers of SPA theory-based metric spaces. Sarwar et al. [28] defined the DM approach on the basis of competition graphs and extended the TOPSIS method under the BF environment. A new notion of the bipolar soft set was presented by Mahmood [29]. Abdullah et al. [30] described the BF soft sets and their applications in DM issues.
Motivated by the extension of a real number to a complex number, Ramot et al. [31] extended the range of FS from the closed interval [ 0 ,   1 ] to the unit disc in a complex plane. They named this extension complex FS (CFS), which can be represented in a polar structure, i.e., J ( τ ) = r J ( τ ) e i   θ J ( τ ) , where r J ( τ ) [ 0 ,   1 ] and 0 θ J ( τ ) 2 π . Complex fuzzy information can be visualized with the assistance of hypergraphs [32]. Later, Tamir et al. [33] described CFS by changing the range from a unit disc (polar structure) to a unit square with a cartesian structure, i.e., J ( τ ) = η J ( τ )   +   i   σ J ( τ ) , where η J ( τ ) ,   σ J ( τ ) [ 0 ,   1 ] . Yazdanbakhsh and Dick [34] described a systematic review of CFSs. Tamir et al. [35] presented CFSs and complex fuzzy (CF) logic as an overview of the theory. Dagher [36] presented a complex fuzzy c-means algorithm. Bi et al. [37] interpreted CF geometric aggregation operators. The CF power aggregation operators were given by Hu et al. [38]. Bi et al. [39] described CF arithmetic aggregation operators. Garg and Rani [40] described innovative aggregation operators and ranking methods for complex IFSs. Mahmood et al. [41] presented the idea of complex hesitant FSs. Behera and Chakraverty [42] produced a novel procedure for solving real and CF systems. The notion of complex dual hesitant FS was presented by Ur Rehman et al. [43]. Ma et al. [44] interpreted CFS with applications in signals.
Mahmood and Ur Rehman [45] presented a bipolar complex fuzzy set (BCFS). The theory of BCFS has a powerful structure in the shape of complex numbers whose real and unreal terms are belonging to unit intervals. The BCFS is used in many real-life situations: for example, consider that a mayor considers whether he should start a new public transport program in a city. For this purpose, he hires an expert who assesses the given possibilities. The expert must have considered four important aspects of this program, that is, the positive aspects or effects (i.e., people’s benefits), the negative aspects or side effects (i.e., the city’s extra economic costs), and society’s positive and negative responses to the project. For example, an expert rates 0.6 points to the positive aspect, 0.4 to the negative aspect, 0.7 to society’s positive response, and 0.5 to society’s negative response. To handle this type of data, the expert must use BCFS, since no other existing structure can manage this kind of information. The principle of FSs, BFSs, and CFSs are the particular cases of the novel BCFS, and many individuals have employed it in the region of different circumstances. However, to date, the theory of BCFS has had no implementation in the region of decision-making, medical diagnosis, pattern recognition, image segmentation, and analysis of carcinoma. Additionally, Hamacher t-norm and t-conorm are the most important techniques to be employed in the region of FS, BFS, and CFS. The particularities of this analysis consist of implementing Hamacher t-norm and t-conorm in the environment of BCFS and discussing their important cases. Hamacher aggregation operator generalizes the ordinary t-norm and t-conorm through the parameter. For example, if we take the parameter equal to 1, then the Hamacher t-norm and t-conorm will be narrowed to the ordinary t-norm and t-conorm, respectively. On the other hand, if we take the parameter equal to 2, the Hamacher t-norm and t-conorm will be narrowed to the Einstein t-norm and t-conorm, respectively.
In this manuscript, we invented BCFHWA, BCFHOWA, BCFHHA BCFHWG, BCFHOWG, and BCFHHG operators and discuss their particular cases. The benefits of implementation of Hamacher aggregation operators in the setting of BCFSs comprise the prevailing theories such as FS, BFS, and CFS. We can obtain particular cases such as bipolar fuzzy averaging and bipolar fuzzy geometric aggregation operator by taking the parameter 1 in the bipolar complex Hamacher aggregation operator. Similarly, we obtain Einstein averaging and Einstein geometric aggregation operators by taking the parameter equal to 2. This shows that the Hamacher t-norm and t-conorm are powerful due to parameters involved in the operation of Hamacher t-norm and t-conorm.
The remaining article is organized in the following way: In Section 2, we review the elementary definitions such as FS, BFS, CFS, and BCFS. In Section 3 of this article, the basic operations, score function, and accuracy function of the BCFS are given. In Section 4, we have three subsections: in the first subsection, we introduce the Hamacher operations of BCFSs; in the second subsection, we present bipolar complex fuzzy Hamacher arithmetic aggregation (BCFHAA) operators; and in the third subsection, we present bipolar complex fuzzy Hamacher geometric aggregation (BCFHGA) operators. In Section 5 of this article, we present the MADM technique based on the interpreted bipolar complex Hamacher aggregation operators in Section 4 under the BCFS setting. In Section 6, we develop a practical MADM case to explain the application of the interpreted operators. In Section 7, we make a comparative study of our method and of the existing methods so as to show the authenticity and superiority of our approach. In Section 8, we draw our final conclusions.

2. Preliminaries

In this section, we shortly analyze several basic results linked to FSs, BFSs, CFSs, and BCFS. Let Τ be universal set throughout in this article.
Definition 1 
([1]). A FS has the structure J = { ( τ ,   η J )   |   τ Τ } on Τ , where η J : Τ [ 0 ,   1 ] implies the membership degree (MD) of every element τ Τ . Let F S be the identification of the set of all fuzzy numbers (FNs), and if J F S , then J = η J .
Definition 2 
([10,11]). A BFS has the structure J = { ( τ ,   η J + ,   η J )   |   τ Τ } on Τ , where η J + : Τ [ 0 ,   1 ] implies the PD, and η J : Τ [ 1 ,   0 ] implies the ND. Let B F S be the identification of the set of all bipolar FNs (BFNs), and if J B F N , then J = ( η J + ,   η J ) .
Definition 3 
([33]). A CFS has the structure J = { ( τ ,   J )   |   τ Τ } = { ( τ , η J   +   i   σ J )   |   τ Τ } on a Τ , where J ( τ ) is a complex MD, which gives the values in a unit square of a complex plane, η J ,   σ J [ 0 ,   1 ] , and i = 1 . Let C F S be the identification of the set of all complex FNs (CFNs), and if J C F N , then J = ( η J + i   σ J ) .
Definition 4 
([45]). A BCFS J is denoted by a positive degree (PD) J + and a negative degree (ND) J , which are assigned to every elemen τ of Τ . The values of J + and J may obtain all values that lie within the unit square in a complex plane and are of the shape J + = η J + + i   σ J + and J = η J + i   σ J , where η J + , σ J + [ 0 ,   1 ] and η J , σ J [ 1 ,   0 ] . A BCFS is of the form
J = { ( τ ,   J + ,   J )   |   τ Τ }  
where J + : Τ { x + i   𝔂   |   x ,   𝔂 [ 0 ,   1 ] } and J : Τ { x + i   𝓎   |   x ,   𝓎 [ 1 ,   0 ] } .
Let B C F S be the identification of the set of all bipolar CFNs (BCFNs), and if J B C F N , then J = ( J + ,   J ) = ( η J + + i   σ J + ,   η J + i   σ J ) .
Definition 5 
([46]). Hamacher product H and Hamacher sum H are t-norm and t-conorm respectively, given as
For any τ 1 ,   τ 2 [ 0 ,   1 ] , α > 0
τ 1 H τ 2 = τ 1 τ 2 α + ( 1 α ) ( τ 1 + τ 2 τ 1 τ 2 )
τ 1 H τ 2 = ( τ 1 + τ 2 τ 1 τ 2 ) ( 1 α ) τ 1 τ 2 1 ( 1 α ) τ 1 τ 2

3. Elementary Operations Based on BCFS

This section introduces the basic operations, the scoring function, and the accuracy function of the BCFS.
Definition 6. 
The score function S B ( J ) : Τ [ 0 ,   1 ] of a BCFN J = ( J + ,   J ) = ( η J + + i   σ J + ,   η J + i σ J ) is defined as
S B ( J ) = 1 4 ( 2 + η J + + σ J + + η J + σ J )
Definition 7. 
The accuracy function B ( J ) : Τ [ 0 ,   1 ] of a BCFN J = ( J + ,   J ) = ( η J + + i   σ J + ,   η J + i σ J ) is defined as
B ( J ) = η J + + σ J + η J σ J 4
      It is obvious that S B ( J ) [ 0 ,   1 ] and B ( J ) [ 0 ,   1 ] . Observe that B ( J ) evaluates the accuracy degree of J . The greatest value of B ( J ) implies the greatest accuracy degree of the BCFN J .
Definition 8. 
For two BCFNs J = ( J + ,   J ) and K = ( ( K + ,   K ) ) , we introduce the order relation as J K if and only if
  • S B ( J ) > S B ( K )
    or
  • S B ( J ) = S B ( K ) and B ( J ) > B ( K )
    or
  • S B ( J ) = S B ( K ) and B ( J ) = B ( K )
Definition 9. 
In BCFN notation, let be any two BCFS J = ( J + ,   J ) = ( η J + + i   σ J + ,   η J + i   σ J ) and K = (   K + ,   K ) = ( η K + + i   σ K + ,   η K + i σ K ) . Then, operations on BCFSs J , K are described as follows:
  • J K = ( ( η J + H η K + ) + i   ( σ J + H   σ K + ) , ( | η J | H | η K | ) i   ( | σ J | H | σ K | ) )
  • J K = ( ( η J + H η K + ) + i   ( σ J + H   σ K + ) , ( | η J | H | η K | ) i   ( | σ J | H | σ K | ) )
  • λ J = ( H λ ( η J + ) + i   H λ ( σ J + ) , H λ ( | η J | ) i   H λ ( | σ J | ) )
  • J λ = ( H λ ( η J + ) + i   H λ ( σ J + ) , H λ ( | η J | ) i H λ ( | σ J | ) )
For α = 1 , Definition 9, after substituting formulas from Definition 5, takes the of the form of the following Definition 10.
Definition 10.For two BCFNs = ( J + ,   J ) = ( η J + + i   σ J + ,   η J + i   σ J )   K = (   K + ,   K ) = ( η K + + i   σ K + ,   η K + i σ K ) , and for any real number λ > 0 , we introduce the following operations:
  • J K = ( η J + + η K + η J + η K + + i (   σ J + + σ K + σ J +   σ K + ) ,   ( η J η K ) + i   ( ( σ J σ K ) ) ) ;
  • J K = ( η J + η K + + i     σ J +   σ K + ,   η J + η K + η J η K + i   ( σ J + σ K + σ J σ K ) ) ;
  • λ J = ( 1 ( 1 η J + ) λ + i   ( 1 ( 1 σ J + ) λ ) , | η J | λ + i   ( | σ J | λ )   ) ;
  • J λ = ( η J + λ + i     σ J + λ , 1 + ( 1 + η J ) λ + i   ( 1 + ( 1 + σ J ) λ ) ) ;
Theorem 1. 
For BCFNs J = ( J + ,   J ) = ( η J + + i   σ J + ,   η J + i   σ J ) , K = (   K + ,   K ) = ( η K + + i   σ K + ,   η K + i σ K ) , and L = (   L + ,   L ) = ( η L + + i   σ L + ,   η L + i σ L ) , and for real numbers λ ,   λ 1 ,   λ 2 > 0 , the following holds:
  • J K = K J
  • J K = K J
  • λ ( J K ) = λ J λ K
  • ( J K ) λ = J λ K λ
  • λ 1 J λ 2 J = ( λ 1 + λ 2 ) J
  • J λ 1 J λ 2 = J λ 1 + λ 2
  • ( J λ 1 ) λ 2 = J λ 1 λ 2 .
  • J ( K L ) = ( J K ) L
  • J ( K L ) = ( J K ) L
  • λ 1 ( λ 2 J ) = ( λ 1 λ 2 ) J
Proof. 
Trivial. □

4. Bipolar Complex Fuzzy Hamacher Aggregation Operators

In this section, we have two subsections. We present BCFHAA operators in the first subsection and BCFHGA operators in the second subsection.

4.1. Bipolar Complex Fuzzy Hamacher Arithmetic Aggregation Operators

In this subsection, we present the bipolar complex fuzzy Hamacher weighted average (BCFHWA) operator and bipolar complex fuzzy Hamacher ordered weighted average (BCFHOWA) operator. Consider Κ to be the collection of all BCFNs in this article.
In Definition 11, we invent the BCFHWA operator.
Definition 11. 
The BCFHWA operator is a function from Κ n to Κ , i.e., B C F H W A : Κ n K presented as
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J p )
where ϖ = ( ϖ 1 ,   ϖ 2 , ϖ 3 , ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) and ϖ p [ 0 ,   1 ] , p = 1 n ϖ p = 1 .
Theorem 2. 
The BCFHWA operator gives a BCFN and
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J p ) = ( ( p = 1 n ( 1 + ( α 1 ) η J p + ) ϖ p p = 1 n ( 1 η J p + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) η J p + ) ϖ p + ( α 1 ) p = 1 n ( 1 η J p + ) ϖ p ) + i ( p = 1 n ( 1 + ( α 1 ) σ J p + ) ϖ p p = 1 n ( 1 σ J p + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) σ J p + ) ϖ p + ( α 1 ) p = 1 n ( 1 σ J p + ) ϖ p ) , α p = 1 n | η J p | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + η J p ) ) ϖ p + ( α 1 ) p = 1 n | η J p | ϖ p ) + i   α p = 1 n | σ J p | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + σ J p ) ) ϖ p + ( α 1 ) p = 1 n | σ J p | ϖ p ) )
The proof of this theorem is presented in Appendix A.
It can be easily demonstrated that the BCFHWA operator satisfies the following three properties.
Idempotency is an extremely helpful property in various circumstances, as it implies that an operation can be rehashed or revised as frequently as vital without initiating accidental impacts. In the following theorem, we invent the idempotency for the BCFHWA operator.
Theorem 3. 
(Idempotency) If all J p ( p = 1 ,   2 ,   3 ,   ,   n ) are identical, that is, J p = J     p , then
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = J
The proof of this theorem is presented in Appendix A.
The invented BCFHWA operator satisfies the boundedness property, which is interpreted as below.
Theorem 4
(Boundedness) Let J = min J p p , J + = max J p p . Then
J B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) J +
Monotonicity is a significant trademark in numerous applications. The term comes from monotonic mathematical operations, also called non-decreasing function. In the following theorem, we invent monotonicity for the BCFHWA operator.
Theorem 5. 
(Monotonicity) Let J p = ( J p + ,   J p ) = ( η J p + + i   σ J p + ( τ ) ,   η J p + i   σ J p ) ( p = 1 ,   2 ,   3 ,   ,   n ) and K p = ( K p + ,   K p ) = ( η K p + + i   σ K p + ( τ ) ,   η K p + i   σ K p ) ( p = 1 ,   2 ,   3 ,   ,   n ) be two collection of BCFNs. If η J p + η K p + ,   σ J p +   σ K p +   η J p η K p and σ J p σ K p for all p . Then
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) B C F H W A ϖ ( K 1 ,   K 2 ,   K 3 ,   ,   K n )
Particular Cases 1. 
We examine two particular cases of the B C F H W A operators as follows:
1.
When we take α = 1 , then the B C F H W A operator transforms into the bipolar complex fuzzy weighted average (BCFWA) operator
B C F W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J p ) = ( 1 p = 1 n ( 1 η J p + ) ϖ p + i   1 p = 1 n ( 1 σ J p + ) ϖ p   , p = 1 n | η J p | ϖ p + i   ( p = 1 n | σ J p | ϖ p ) )
2.
When we take α = 2 , then the BCFHWA operator transforms into the bipolar complex fuzzy Einstein weighted average (BCFEWA) operator
B C F E W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J p ) = ( ( p = 1 n ( 1 + η J p + ) ϖ p p = 1 n ( 1 η J p + ) ϖ p ) ( p = 1 n ( 1 + η J p + ) ϖ p + p = 1 n ( 1 η J p + ) ϖ p ) + i ( p = 1 n ( 1 + σ J p + ) ϖ p p = 1 n ( 1 σ J p + ) ϖ p ) ( p = 1 n ( 1 + σ J p + ) ϖ p + p = 1 n ( 1 σ J p + ) ϖ p ) , 2 p = 1 n | η J p | ϖ p ( p = 1 n ( 2 + η J p ) ϖ p + p = 1 n | η J p | ϖ p ) + i   2 p = 1 n | σ J p | ϖ p ( p = 1 n ( 2 + σ J p ) ϖ p + p = 1 n | σ J p | ϖ p ) )
In the following Definition 12, we invent the BCFHOWA operator.
Definition 12. 
The bipolar complex fuzzy Hamacher ordered weighted average (BCFHOWA) operator is given as
B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J ϕ ( p ) )
where ( ϕ ( 1 ) ,   ϕ ( 2 ) ,   ,   ϕ ( n ) ) is a permutation of ( 1 ,   2 ,   3 ,   ,   n ) , such that J ϕ ( p 1 ) J ϕ ( p )     p = 1 ,   2 ,   3 ,   ,   n , and ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) and ϖ p [ 0 ,   1 ] , p = 1 n ϖ p = 1 .
Theorem 6. 
The BCFHOWA operator gives a BCFN and
B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J ϕ ( p ) ) = ( ( p = 1 n ( 1 + ( α 1 ) η J ϕ ( p ) + ) ϖ p p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) η J ϕ ( p ) + ) ϖ p + ( α 1 ) p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p ) + i ( p = 1 n ( 1 + ( α 1 ) σ J ϕ ( p ) + ) ϖ p p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) σ J ϕ ( p ) + ) ϖ p + ( α 1 ) p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p ) α p = 1 n | η J ϕ ( p ) | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + η J ϕ ( p ) ) ϖ p + ( α 1 ) p = 1 n | η J ϕ ( p ) | ϖ p ) + i   α p = 1 n | σ J ϕ ( p ) | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + σ J ϕ ( p ) ) ϖ p + ( α 1 ) p = 1 n | σ J ϕ ( p ) | ϖ p ) )
Proof. 
The proof is similar to that of Theorem 2. □
One can easily prove that the BCFHOWA operator satisfies the following three properties. Idempotency is an extremely helpful property in various circumstances, since it implies that an operation can be rehashed or revised as frequently as vital without initiating accidental impacts. In the following theorem, we invent the idempotency for the BCFHOWA operator.
Theorem 7. 
(Idempotency) If all J p ( p = 1 ,   2 ,   3 ,   ,   n ) are identical, that is, J p = J     p , then
B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = J
The invented BCFHOWA operator satisfies the boundedness property, which is interpreted as below.
Theorem 8. 
(Boundedness) Let J = min J p p , J + = max J p p . Then
J B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) J +
Monotonicity is a significant trademark in numerous applications. The term comes from monotonic mathematical operations, also called the non-decreasing function. In the following theorem, we invent monotonicity for the BCFHWA operator.
Theorem 9. 
(Monotonicity) Let J p = ( J p + ,   J p ) = ( η J p + + i   σ J p + ( τ ) ,   η J p + i   σ J p ) ( p = 1 ,   2 ,   3 ,   ,   n ) and K p = ( K p + ,   K p ) = ( η K p + + i   σ K p + ( τ ) ,   η K p + i   σ K p ) ( p = 1 ,   2 ,   3 ,   ,   n ) be two collection of BCFNs. If η J p + η K p + ,   σ J p +   σ K p + , η J p η K p , and σ J p σ K p for all p . Then
B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) B C F H O W A ϖ ( K 1 ,   K 2 ,   K 3 ,   ,   K n )
Particular Cases 2. 
We examine two particular cases of the B C F H O W A operator as follows:
1.
When we take α = 1 , then the BCFHOWA operator transforms into the bipolar complex fuzzy ordered weighted average (BCFOWA) operator
B C F W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J ϕ ( p ) ) = ( 1 p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p + i   1 p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p   , p = 1 n | η J ϕ ( p ) | ϖ p + i   ( p = 1 n | σ J ϕ ( p ) | ϖ p ) )
2.
When we take α = 2 , then the BCFHOWA operator transforms into the bipolar complex fuzzy Einstein ordered weighted average (BCFEOWA) operator
B C F E W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J 𝝓 ( p ) ) = ( ( p = 1 n ( 1 + η J 𝝓 ( p ) + ) ϖ p p = 1 n ( 1 η J 𝝓 ( p ) + ) ϖ p ) ( p = 1 n ( 1 + η J 𝝓 ( p ) + ) ϖ p + p = 1 n ( 1 η J 𝝓 ( p ) + ) ϖ p ) + i ( p = 1 n ( 1 + σ J 𝝓 ( p ) + ) ϖ p p = 1 n ( 1 σ J 𝝓 ( p ) + ) ϖ p ) ( p = 1 n ( 1 + σ J 𝝓 ( p ) + ) ϖ p + p = 1 n ( 1 σ J 𝝓 ( p ) + ) ϖ p ) 2 p = 1 n | η J 𝝓 ( p ) | ϖ p ( p = 1 n ( 2 + η J 𝝓 ( p ) ) ϖ p + p = 1 n | η J 𝝓 ( p ) | ϖ p ) + i   2 p = 1 n | σ J 𝝓 ( p ) | ϖ p ( p = 1 n ( 2 + σ J 𝝓 ( p ) ) ϖ p   +   p = 1 n | σ J 𝝓 ( p ) | ϖ p ) )
In the following Definition 13, we invent the BCFHHA operator.
Definition 13. 
The bipolar complex fuzzy Hamacher hybrid average (BCFHHA) operator is given as
B C F H H A 𝔀 ,   ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( 𝔀 p J ϕ ( p ) )
where 𝔀 = ( 𝔀 1 ,   𝔀 2 ,   𝔀 3 ,   ,   𝔀 n ) , such that 𝔀 p [ 0 ,   1 ] ; p = 1 n 𝔀 p = 1 is the linked weighting vector, J ϕ ( p ) is the p t h biggest element of the bipolar complex fuzzy arguments J p ( J p = ( n ϖ ) J p ) , p = ( 1 ,   2 ,   3 ,   ,   n ) ; ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) with ϖ [ 0 ,   1 ] ; p = 1 n ϖ p = 1 and n is the balancing coefficient.
If we take 𝔀 = ( 1 n , 1 n , , 1 n ) , then the BCFHHA operator transforms into the BCFHWA operator, and if we take ϖ = ( 1 n , 1 n , , 1 n ) , then the BCFHHA operator transforms into the BCFHOWA operator.
Theorem 10. 
The BCFHHA operator gives a BCFN and
B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J ϕ ( p ) ) = ( ( p = 1 n ( 1 + ( α 1 ) η J ϕ ( p ) + ) ϖ p p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) η J ϕ ( p ) + ) ϖ p + ( α 1 ) p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p ) + i ( p = 1 n ( 1 + ( α 1 ) σ J ϕ ( p ) + ) ϖ p p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) σ J ϕ ( p ) + ) ϖ p + ( α 1 ) p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p ) , α p = 1 n | η J ϕ ( p ) | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + η J ϕ ( p ) ) ) ϖ p + ( α 1 ) p = 1 n | η J ϕ ( p ) | ϖ p ) + i   α p = 1 n | σ J ϕ ( p ) | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + σ J ϕ ( p ) ) ) ϖ p + ( α 1 ) p = 1 n | σ J ϕ ( p ) | ϖ p ) )
where 𝔀 = ( 𝔀 1 ,   𝔀 2 ,   𝔀 3 ,   ,   𝔀 n ) , such that 𝔀 [ 0 ,   1 ] ; p = 1 n 𝔀 p = 1 is the linked weighting vector; J ϕ ( p ) is the p t h biggest element of the bipolar complex fuzzy arguments J p ( J p = ( n ϖ ) J p ) , p = ( 1 ,   2 ,   3 ,   ,   n ) ; ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) with ϖ p [ 0 ,   1 ] ; p = 1 n ϖ p = 1 ; and n is the balancing coefficient, α > 0 .
Proof. 
It is similar to the proof of Theorem 2. □
Particular Cases 3. 
We examine two particular cases of the B C F H H A operator as follows:
1.
When we take α = 1 , then the BCFHHA operator transforms into the bipolar complex fuzzy hybrid average (BCFHA) operator
B C F H A 𝔀 ,   ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( 𝔀 p J ϕ ( p ) ) = ( 1 p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p + i   1 p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p   , p = 1 n | η J ϕ ( p ) | ϖ p + i   ( p = 1 n | σ J ϕ ( p ) | ϖ p ) )
2.
When we take α = 2 , then the BCFHHA operator transforms into the bipolar complex fuzzy Einstein hybrid average (BCFEHA) operator
B C F H O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( ϖ p J ϕ ( p ) ) = ( ( p = 1 n ( 1 + η J ϕ ( p ) + ) ϖ p p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p ) ( p = 1 n ( 1 + η J ϕ ( p ) + ) ϖ p + p = 1 n ( 1 η J ϕ ( p ) + ) ϖ p ) + i ( p = 1 n ( 1 + σ J ϕ ( p ) + ) ϖ p p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p ) ( p = 1 n ( 1 + σ J ϕ ( p ) + ) ϖ p + p = 1 n ( 1 σ J ϕ ( p ) + ) ϖ p ) , 2 p = 1 n | η J ϕ ( p ) | ϖ p ( p = 1 n ( 2 + η J ϕ ( p ) ) ϖ p + p = 1 n | η J ϕ ( p ) | ϖ p ) + i   2 p = 1 n | σ J ϕ ( p ) | ϖ p ( p = 1 n ( 2 + σ J ϕ ( p ) ) ϖ p + p = 1 n | σ J ϕ ( p ) | ϖ p ) )

4.2. Bipolar Complex Fuzzy Hamacher Geometric Aggregation Operators

In this subsection, we interpret the bipolar complex fuzzy Hamacher weighted geometric (BCFHWG) operator and bipolar complex fuzzy Hamacher ordered weighted geometric (BCFHOWG) operator.
In the following Definition 14, we invent the BCFHWG operator.
Definition 14. 
The BCFHWG operator is a function from Κ n to Κ , i.e., B C F H W G : Κ n K , presented as
B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J p ) ϖ p
where ϖ = ( ϖ 1 ,   ϖ 2 , ϖ 3 , ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) and ϖ p [ 0 ,   1 ] , p = 1 n ϖ p = 1 .
Theorem 11. 
The BCFHWG operator gives a BCFN and
B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J p ) ϖ p = ( α p = 1 n ( η J p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 η J p + ) ) ϖ p + ( α 1 ) p = 1 n ( η J p + ) ϖ p ) +   i   α p = 1 n ( σ J p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 σ J p + ) ) ϖ p + ( α 1 ) p = 1 n ( σ J p + ) ϖ p ) , ( p = 1 n ( 1 + ( α 1 ) | η J p | ) ϖ p p = 1 n ( 1 + η J p ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η J p | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η J p ) ϖ p ) +   i ( ( p = 1 n ( 1 + ( α 1 ) | σ J p | ) ϖ p p = 1 n ( 1 + σ J p ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | σ J p | ) ϖ p + ( α 1 ) p = 1 n ( 1 + σ J p ) ϖ p ) ) )
The proof of this theorem is presented in Appendix A.
One can easily prove that the BCFHWG operator satisfies the following three properties.
Idempotency is an extremely helpful property in various circumstances, as it implies that an operation can be rehashed or revised as frequently as vital without initiating accidental impacts. In the following theorem, we invent the idempotency for the BCFHWA operator.
Theorem 12. 
(Idempotency) If all J p ( p = 1 ,   2 ,   3 ,   ,   n ) are identical, that is, J p = J     p , then
B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = J
The proof is presented inAppendix A.
The invented BCFHWG operator satisfies the boundedness property, which is interpreted as below.
Theorem 13. 
(Boundedness) Let J = min J p p , J + = max J p p . Then
J B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) J +
Monotonicity is a significant trademark in numerous applications. The term comes from monotonic mathematical operations, also called the non-decreasing function. In the following theorem, we invent monotonicity for the BCFHWA operator.
Theorem 14. 
(Monotonicity) Let J p = ( J p + ,   J p ) = ( η J p + + i   σ J p + ( τ ) ,   η J p + i   σ J p ) ( p = 1 ,   2 ,   3 ,   ,   n ) and K p = ( K p + ,   K p ) = ( η K p + + i   σ K p + ( τ ) ,   η K p + i   σ K p ) ( p = 1 ,   2 ,   3 ,   ,   n ) be two collection of BCFNs. If η J p + η K p + ,   σ J p +   σ K p + , η J p η K p , and σ J p σ K p for all p . Then
B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) B C F H W G ϖ ( K 1 ,   K 2 ,   K 3 ,   ,   K n )
Particular Cases 4. 
Now, we interpret two particular cases of the B C F H W G operator as follows:
1.
When we take α = 1 , then the BCFHWG operator transforms into the bipolar complex fuzzy weighted geometric (BCFWG) operator
B C F W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J p ) ϖ p = ( p = 1 n ( η J p + ) ϖ p + i   p = 1 n ( σ J p + ) ϖ p   , 1 + p = 1 n ( 1 + η J p ) ϖ p + i ( 1 + p = 1 n ( 1 + σ J p ) ϖ p ) )
2.
When we take α = 2 , then the BCFHWG operator transforms into the bipolar complex fuzzy Einstein weighted geometric (BCFEWG) operator
B C F E W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J p ) ϖ p = ( 2 p = 1 n ( η J p + ) ϖ p ( p = 1 n ( 2 η J p + ) ϖ p + p = 1 n ( η J p + ) ϖ p ) + i   2 p = 1 n ( σ J p + ) ϖ p ( p = 1 n ( 2 σ J p + ) ϖ p + p = 1 n ( σ J p + ) ϖ p ) , ( p = 1 n ( 1 + | η J p | ) ϖ p p = 1 n ( 1 + η J p ) ϖ p ) ( p = 1 n ( 1 + | η J p | ) ϖ p + p = 1 n ( 1 + η J p ) ϖ p ) + i   ( ( p = 1 n ( 1 + | σ J p | ) ϖ p p = 1 n ( 1 + σ J p ) ϖ p ) ( p = 1 n ( 1 + | σ J p | ) ϖ p + p = 1 n ( 1 + σ J p ) ϖ p ) ) )
In the following Definition 15, we invent the BCFHOWG operator.
Definition 15. 
The bipolar complex fuzzy Hamacher ordered weighted geometric (BCFHOWG) operator is given as
B C F H O W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) ϖ p
where ( ϕ ( 1 ) ,   ϕ ( 2 ) ,   ,   ϕ ( n ) ) is a permutation of ( 1 ,   2 ,   3 ,   ,   n ) , such that J ϕ ( p 1 ) J ϕ ( p )     p = 1 ,   2 ,   3 ,   ,   n , and ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) and ϖ p [ 0 ,   1 ] , p = 1 n ϖ p = 1 .
Theorem 15. 
The BCFHOWG operator gives a BCFN and
B C F H O W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) ϖ p = ( α p = 1 n ( η J ϕ ( p ) + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 η J ϕ ( p ) + ) ) ϖ p + ( α 1 ) p = 1 n ( η J ϕ ( p ) + ) ϖ p ) + i   α p = 1 n ( σ J ϕ ( p ) + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 σ J ϕ ( p ) + ) ) ϖ p + ( α 1 ) p = 1 n ( σ J ϕ ( p ) + ) ϖ p ) , ( p = 1 n ( 1 + ( α 1 ) | η J ϕ ( p ) | ) ϖ p p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η J ϕ ( p ) | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) + i   ( ( p = 1 n ( 1 + ( α 1 ) | σ J ϕ ( p ) | ) ϖ p p = 1 n ( 1 + σ J ϕ ( p ) ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | σ J ϕ ( p ) | ) ϖ p + ( α 1 ) p = 1 n ( 1 + σ J ϕ ( p ) ) ϖ p ) ) )
Proof. 
The proof is similar to that of Theorem 11. □
One can easily prove that the BCFHOWG operator satisfies the following three properties.
Idempotency is an extremely helpful property in various circumstances, as it implies that an operation can be rehashed or revised as often as necessary without initiating accidental impacts. In the following theorem, we invent the idempotency for the BCFHOWG operator.
Theorem 16. 
(Idempotency) If all J p ( p = 1 ,   2 ,   3 ,   ,   n ) are identical, that is, J p = J     p , then
B C F H O W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = J
The invented BCFHOWG operator satisfies the boundedness property, which is interpreted as below.
Theorem 17. 
(Boundedness) Let J = min J p p , J + = max J p p . Then
J B C F H O W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) J +
Monotonicity is a significant trademark in numerous applications. The term comes from monotonic mathematical operations, otherwise called the non-decreasing function. In the following theorem, we invent monotonicity for the BCFHWA operator.
Theorem 18. 
(Monotonicity) Let J p = ( J p + ,   J p ) = ( η J p + + i   σ J p + ( τ ) ,   η J p + i   σ J p ) ( p = 1 ,   2 ,   3 ,   ,   n ) and K p = ( K p + ,   K p ) = ( η K p + + i   σ K p + ( τ ) ,   η K p + i   σ K p ) ( p = 1 ,   2 ,   3 ,   ,   n ) be two collection of BCFNs. If η J p + η K p + ,   σ J p +   σ K p + , η J p η K p , and σ J p σ K p for all p . Then
B C F H O W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) B C F H O W G ϖ ( K 1 ,   K 2 ,   K 3 ,   ,   K n )
Particular Cases 5. 
Now we interpret two particular cases of the BCFHOWG operator as follows:
1.
When we take α = 1 , then the BCFHOWG operator transforms into the bipolar complex fuzzy ordered weighted geometric (BCFOWG) operator
B C F O W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) ϖ p = ( p = 1 n ( η J ϕ ( p ) + ) ϖ p + i   p = 1 n ( σ J ϕ ( p ) + ) ϖ p   , 1 + p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p + i ( 1 + p = 1 n ( 1 + σ J ϕ ( p ) ) ϖ p ) )
2.
fuzzy Einstein ordered weighted geometric (BCFEOWG) operator
B C F E O W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) ϖ p = ( 2 p = 1 n ( η J ϕ ( p ) + ) ϖ p ( p = 1 n ( 2 η J ϕ ( p ) + ) ϖ p + p = 1 n ( η J ϕ ( p ) + ) ϖ p ) + i   2 p = 1 n ( σ J ϕ ( p ) + ) ϖ p ( p = 1 n ( 2 σ J ϕ ( p ) + ) ϖ p + p = 1 n ( σ J ϕ ( p ) + ) ϖ p ) , ( p = 1 n ( 1 + | η J ϕ ( p ) | ) ϖ p p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) ( p = 1 n ( 1 + | η J ϕ ( p ) | ) ϖ p + p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) + i   ( ( p = 1 n ( 1 + | η J ϕ ( p ) | ) ϖ p p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) ( p = 1 n ( 1 + | η J ϕ ( p ) | ) ϖ p + p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) ) )
In the following Definition 16, we invent the BCFHHG operator.
Definition 16. 
The bipolar complex fuzzy Hamacher hybrid geometric (BCFHHG) operator is given as
B C F H H G 𝔀 ,   ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) 𝔀 p
where 𝔀 = ( 𝔀 1 ,   𝔀 2 ,   𝔀 3 , ,   𝔀 n ) , such that 𝔀 p [ 0 ,   1 ] ; p = 1 n 𝔀 p = 1 is the linked weighting vector, J ϕ ( p ) is the p t h biggest element of the bipolar complex fuzzy arguments J p ( J p = ( n ϖ ) J p ) , p = ( 1 ,   2 ,   3 ,   ,   n ) ; ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) with ϖ p [ 0 ,   1 ] ; p = 1 n ϖ p = 1 ; and n is the balancing coefficient.
If we take 𝔀 = ( 1 n , 1 n , , 1 n ) , then the BCFHHG operator transforms into the BCFHWG operator, and if we take ϖ = ( 1 n , 1 n , , 1 n ) , then the BCFHHOG operator transforms into the BCFHOWG operator.
Theorem 19. 
The BCFHHG operator gives a BCFN and
B C F H H G 𝔀 ,   ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) 𝔀 p = ( α p = 1 n ( η J ϕ ( p ) + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 η J ϕ ( p ) + ) ) ϖ p + ( α 1 ) p = 1 n ( η J ϕ ( p ) + ) ϖ p ) + i   α p = 1 n ( σ J ϕ ( p ) + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 σ J ϕ ( p ) + ) ) ϖ p + ( α 1 ) p = 1 n ( σ J ϕ ( p ) + ) ϖ p ) , ( p = 1 n ( 1 + ( α 1 ) | η J ϕ ( p ) | ) ϖ p p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η J ϕ ( p ) | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η J ϕ ( p ) ) ϖ p ) + i ( ( p = 1 n ( 1 + ( α 1 ) | σ J ϕ ( p ) | ) ϖ p p = 1 n ( 1 + σ J ϕ ( p ) ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | σ J ϕ ( p ) | ) ϖ p + ( α 1 ) p = 1 n ( 1 + σ J ϕ ( p ) ) ϖ p ) ) )
where 𝔀 = ( 𝔀 1 ,   𝔀 2 ,   𝔀 3 ,   ,   𝔀 n ) , such that 𝔀 p [ 0 ,   1 ] ; p = 1 n 𝔀 p = 1 is the linked weighting vector; J ϕ ( p ) is the p t h biggest element of the bipolar complex fuzzy arguments J p ( J p = ( n ϖ ) J p ) , p = ( 1 ,   2 ,   3 ,   ,   n ) ; ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) T signifies the weight vector linked with J p ( p = 1 ,   2 ,   ,   n ) with ϖ p [ 0 ,   1 ] ; p = 1 n ϖ p = 1 ; and n is the balancing coefficient, α > 0 .
Proof. 
The proof is similar to the proof of Theorem 11. □
Particular Cases 6. 
Now we interpret two particular cases of the BCFHHG operator as follows:
1.
When we take α = 1 , then the BCFHHG operator transforms into the bipolar complex fuzzy geometric (BCFG) operator
B C F G 𝔀 ,   ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) 𝔀 p = ( p = 1 n ( η J ϕ ( p ) + ) 𝔀 p + i   p = 1 n ( σ J ϕ ( p ) + ) 𝔀 p   , 1 + p = 1 n ( 1 + η J ϕ ( p ) ) 𝔀 p + i ( 1 + p = 1 n ( 1 + σ J ϕ ( p ) ) 𝔀 p ) )
2.
When we take α = 2 , then the BCFHHG operator transforms into the bipolar complex fuzzy Einstein hybrid geometric (BCFEHG) operator
B C F E H G 𝔀 ,   ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = n p = 1 ( J ϕ ( p ) ) 𝔀 p = ( 2 p = 1 n ( η J ϕ ( p ) + ) 𝔀 p ( p = 1 n ( 2 η J ϕ ( p ) + ) 𝔀 p + p = 1 n ( η J ϕ ( p ) + ) 𝔀 p ) + i   2 p = 1 n ( σ J ϕ ( p ) + ) 𝔀 p ( p = 1 n ( 2 σ J ϕ ( p ) + ) 𝔀 p + p = 1 n ( σ J ϕ ( p ) + ) 𝔀 p ) , s ( p = 1 n ( 1 + | η J ϕ ( p ) | ) 𝔀 p p = 1 n ( 1 + η J ϕ ( p ) ) 𝔀 p ) ( p = 1 n ( 1 + | η J ϕ ( p ) | ) 𝔀 p + p = 1 n ( 1 + η J ϕ ( p ) ) 𝔀 p ) + i   ( + i   ( ( p = 1 n ( 1 + | σ J ϕ ( p ) | ) 𝔀 p p = 1 n ( 1 + σ J ϕ ( p ) ) 𝔀 p ) ( p = 1 n ( 1 + | σ J ϕ ( p ) | ) 𝔀 p + p = 1 n ( 1 + σ J ϕ ( p ) ) 𝔀 p ) ) )

5. An Approach to MADM with Bipolar Complex Fuzzy Information

In this part of the article, we show a MADM technique based on the interpreted bipolar complex Hamacher aggregation operators in Section 4 under the BCFS environment.
Suppose that A = { A 1 ,   A 2 ,   A 3 ,   ,   A m } is the set of alternatives, B = { B 1 ,   B 2 ,   B 3 ,   ,   B n } is the set of attributes, and ϖ = ( ϖ 1 ,   ϖ 2 ,   ϖ 3 ,   ,   ϖ n ) is the weight vector of attributes, such that ϖ p [ 0 ,   1 ] , p = ( 1 ,   2 ,   3 ,   ,   n ) , p = 1 n ϖ p = 1 . Suppose X = ( x q p ) m × n = ( q p + ,   q p ) = ( η q p + + i   σ q p + ,   η q p + i   σ q p ) m × n is the bipolar complex fuzzy decision matrix, where q p + denotes the PD for which the alternative A p satisfies attribute B p provided by the decision-maker, and q p denotes the ND for which the alternative A p does not satisfy attribute B p provided by the decision-maker.

Algorithm

We interpret the algorithm to solve MADM issues in the environment of BCFSs by utilizing BCFHWA and BCFHWG operators as follows:
Step I: By employing the BCFHWA operator to the decision information provided in the matrix X , derive all the values x q   ( q = 1 ,   2 ,   3 ,   ,   m ) of the alternative A q .
x q = ( q + ,   q ) = ( η q + + i   σ q + ,   η q + i   σ q ) = B C F H W A ϖ ( x q 1 ,   x q 2 ,   x q 3 ,   ,   x q n ) = n p = 1 ( ϖ p x q p ) = ( ( p = 1 n ( 1 + ( α 1 ) η q p + ) ϖ p p = 1 n ( 1 η q p + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) η q p + ) ϖ p + ( α 1 ) p = 1 n ( 1 η q p + ) ϖ p ) + i ( p = 1 n ( 1 + ( α 1 ) σ q p + ) ϖ p p = 1 n ( 1 σ q p + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) σ q p + ) ϖ p + ( α 1 ) p = 1 n ( 1 σ q p + ) ϖ p ) , α p = 1 n | η q p | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + η q p ) ) ϖ p + ( α 1 ) p = 1 n | η q p | ϖ p ) + i   α p = 1 n | σ q p | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + σ q p ) ) ϖ p + ( α 1 ) p = 1 n | σ q p | ϖ p ) )
If we select the BFCHWG operator, then
x q = ( q + ,   q ) = ( η q + + i   σ q + ,   η q + i   σ q ) = B C F H W G ϖ ( x q 1 ,   x q 2 ,   x q 3 ,   ,   x q n ) = n p = 1 ( x q p ) ϖ p = ( α p = 1 n ( η q p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 η q p + ) ) ϖ p + ( α 1 ) p = 1 n ( η q p + ) ϖ p ) + i   α p = 1 n ( σ q p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 σ q p + ) ) ϖ p + ( α 1 ) p = 1 n ( σ q p + ) ϖ p ) , ( p = 1 n ( 1 + ( α 1 ) | η q p | ) ϖ p p = 1 n ( 1 + η q p ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η q p | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η q p ) ϖ p ) + i   ( ( p = 1 n ( 1 + ( α 1 ) | η q p | ) ϖ p p = 1 n ( 1 + η q p ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η q p | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η q p ) ϖ p ) ) )
Step II. Determine the scores S B ( x q )   ( q = 1 ,   2 ,   3 ,   ,   m ) .
Step III. Rank all the alternatives A q ( q = 1 ,   2 ,   3 ,   ,   m ) in terms of S B ( x q )   ( q = 1 ,   2 ,   3 ,   ,   m ) . If the two scores functions S B ( x q ) and S B ( x p ) have same values, then we use the accuracy function B ( x q ) and B ( x p ) to rank the alternatives A q and A p .
Step IV. Choose the best alternative.
Step V. End.

6. Numerical Example

In this segment, we use a practical MADM example to explain the application of interpreted operators. Consider A to be the universal set in this example and each A p A to be given in the setting of BCFN, i.e., A p = ( p + ,   p ) = ( η p + + i   σ p + ,   η p + i   σ p ) .
Recognizing, assessing, and gauging the applicants against job necessities can be accepted as a capacity of the employees’ selection. Employees’ capabilities such as competence, knowledge, and experience perform an essential part of an organization’s achievement. It is hard to assess the consequences of the incorrect recruiting decisions of an individual. One of the fundamental goals of an enterprise is to find effective methods of evaluating and positioning a number of employees who have been assessed for various capabilities. In the literature, the selection of an appropriate individual from among various applicants is an important aspect. When the policies of employee selection are accepted by the enterprise, they imply an improvement of the enterprise’s performance. Enterprises invest energy in recruiting people. The employers’ costs are increased by an excess of time and costs spent on engaging, training, and firing inefficient and frustrated employees. These costs increase if the employers take a longer time to realize the employee’s deficiencies. Our proposed algorithm in Section 5 is the appropriate method for the selection of employees that covers all the enterprises’ requirements.
Suppose an enterprise is recruiting an employee for the post of an assistant director. Firstly, the enterprise forms a selection board formed by a CEO and three other senior representatives. There are four applicants, A q ( q = 1 , 2 , 3 , 4 ) , who applied for that post. The selection board choose four attributes to assess the applicants i.e., B 1 = qualification, B 2 = experience, B 3 = organizational skills, and B 4 = professionalism. The four applicants A q ( q = 1 , 2 , 3 , 4 ) are assessed by using BCFN by the decision-makers, factoring in the above-mentioned four attributes, whose weighting vector is ϖ = ( 0.2 ,   0.25 ,   0.15 ,   0.4 ) . The decision matrix X = ( x q p ) 4 × 4 is given in Table 1.
For the selection of the employees, we use the BCFHWA (BCFHWG) operator with an MADM approach and bipolar complex fuzzy data, which is given below:
Step I: For α = 3 , employ the BCFHWA operator to determine all preference values x q of the applicants A q ( q = 1 ,   2 ,   3 , 4 ) .
x 1 = ( 0.509 + i   0.314 , 0.237 i   0.708 ) , x 2 = ( 0.189 + i   0.676 , 0.376 i   0.410 ) , x 3 = ( 0.595 + i   0.742 , 0.215 i   0.207 ) , x 4 = ( 0.513 + i   0.365 , 0.214 i   0.149 ) .
Step II: Determine the score values S B ( x q ) ( q = 1 ,   2 , 3 ,   4 ) of the overall BCFNs x q ( q = 1 ,   2 ,   3 ,   4 ) .
S B ( x 1 ) = 0.467 S B ( x 2 ) = 0.52 S B ( x 3 ) = 0.729 S B ( x 4 ) = 0.629
Step III. Rank all the applicants A q ( q = 1 ,   2 ,   3 ,   4 ) following score values S B ( x q ) ( q = 1 ,   2 , 3 ,   4 ) of the overall BCFNs: A 3 A 4 A 2 A 1 .
Step IV. A 3 is selected as the best applicant.
Step V. End.
If we apply the BCFHWG operator instead of BCFHWA, then the above problem will solve similarly:
Step I: For α = 3 , employ the BCFHWG operator to determine all preference values x q of the applicants A q ( q = 1 ,   2 ,   3 ,   4 ) .
x 1 = ( 0.336 + i   0.269 , 0.189 i   0.779 ) , x 2 = ( 0.164 + i   0.525 , 0.397 i   0.506 ) , x 3 = ( 0.469 + i   0.696 , 0.332 i   0.29 ) , x 4 = ( 0.473 + i   0.354 , 0.514 i   0.21 ) .
Step II: Determine the score values S B ( x q ) ( q = 1 ,   2 , 3 ,   4 ) of the overall BCFNs x q ( q = 1 ,   2 ,   3 ,   4 ) .
S B ( x 1 ) = 0.409 S B ( x 2 ) = 0.447 S B ( x 3 ) = 0.643 S B ( x 3 ) = 0.526
Step III. Rank all the applicants A q ( q = 1 ,   2 ,   3 ,   4 ) following score values S B ( x q ) ( q = 1 ,   2 ,   3 ,   4 ) of the overall BCFNs: A 3 A 4 A 2 A 1 .
Step IV. A 3 is selected as the best applicant.
Step V. End.
We observe that all rating values of alternatives are different when we use two different operators, but their ranking order is similar. The best alternative (applicant) is U 3 for both BCFHWA and BCFHWG operators.

7. Comparative Analysis

This section develops a comparative analysis of the aggregation operators so as to demonstrate the authenticity and dominance of our proposed methods and operators.
We completed a comparison between our interpreted methods and the current studies [8,24,25,26]. In Reference [24], Wei et al. defined Hamacher aggregation operators (AOs) based on BFSs. Huang [8] gives Hamacher AOs based on IFSs. Jana et al. [25] defined Dombi AOs based on BFSs. In Reference [26], Jana et al. invented Dombi prioritized AOs.
Consider the data given in Table 1. The data of Table 1 is two-dimensional (i.e., real part and imaginary part) along with PD and ND. We know that the work of Wei et al. [24], Jana et al. [25], and Jana et al. [26] can only operate with one-dimensional information with positive and negative aspects (i.e., positive degree and negative degree), but are incapable of accounting for the second dimension or imaginary part. From the above discussion, it is clear that the work of Wei et al. [24], Jana et al. [25], and Jana et al. [26] are unable to solve the MADM issues related to data in the environment of BCFSs. Moreover, the work of Huang [8] only can cope with one-dimensional information along with membership and non-membership grade where both membership and non-membership grade belongs to the [ 0 ,   1 ] . Huang [8] does not provide us with any information about the negative aspect. From this, we observe that the work of Huang [8] is also unable to solve the MADM aspects involving the data in the environment of BCFSs. Only the interpreted work can solve such type of MADM cases. This shows that our approach is superior to the existing methods. BCFS amplifies the existing methods: when the imaginary part equals zero in both PD and ND, it transforms into BFSs, and if the imaginary part equals zero in PD and the ND part is neglected, its converts into FSs. The score values and ranking results of the interpreted and existing methods are given in Table 2. Figure 1 provides a graphic of the score values of existing and interpreted methods.

8. Conclusions

In this manuscript, we established various operations, the score function, and the accuracy function for BCFS. Furthermore, inspired by Hamacher operations, we interpreted BCFHWA operator, BCFHOWA operator, BCFHHA operator, BCFHWG operator, BCFHOWG operator, and BCFHHG operator. We described the features and the particular cases of the above operators such as BCFWA operator, BCFOWA operator, BCFHA operator, BCFWG operator, BCFOWG operator, and BCFHG operator by taking the parameter equal to 1. By taking the parameter equal to 2, we obtained BCFEWA operator, BCFEOWA operator, BCFEHA operator, BCFEWG operator, BCFEOWG operator, and BCFEHG operator. Subsequently, we used these operators to generate methods to resolve the bipolar complex fuzzy MADM issues. In order to authenticate the interpreted methods, we provided a numerical example for a company that has recruited the best employee for the position of assistant director.
Finally, in order to show the effectiveness and practicality of our approach, we compared our results with the existing operators.
The Hamacher operators based on BCFS generalize Hamacher operators for FS, BFS, and CFS. By obtaining the unreal part equal to zero in both PD and ND, we found Hamacher operators for the data in the structure of BFS; by neglecting the ND, we acquired Hamacher operators for CFS; and by obtaining the unreal part zero in PD and neglecting the ND, we acquired Hamacher operators for FS. However, our proposed approach presents some limitations, since the invented operators cannot manage the information in the structure of bipolar complex intuitionistic FS, bipolar complex fuzzy soft set, etc.
In the future, we shall use our operators and functions in different domains, such as complex fuzzy N-soft sets [47], complex hesitant FS [48], complex dual hesitant FSs [49,50], picture fuzzy N-soft sets [51], complex spherical FS [52], complex Pythagorean FS [53], generalized intuitionistic fuzzy hypergroupoid [54], and decision-making [55,56].

Author Contributions

Conceptualization, T.M., U.u.R., J.A., and G.S.-G.; methodology, T.M., U.u.R., J.A., and G.S.-G.; investigation, T.M., U.u.R., J.A., and G.S.-G.; writing—original draft preparation, T.M., U.u.R., J.A., and G.S.-G.; writing—review and editing, T.M., U.u.R., J.A., and G.S.-G. All authors have read and agreed to the published version of the manuscript.

Funding

The research of Santos-García was funded by the Spanish MINECO projects TRACES TIN2015–67522–C3–3–R and Strongsoft TIN2012–39391–C04–04.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data utilized in this manuscript are hypothetical and artificial, and one can use these data before prior permission by simply citing this manuscript.

Conflicts of Interest

Regarding the publication of this manuscript, the authors declare that they have no conflict of interest.
Ethics Declaration Statement: The authors state that this is their original work, and it is neither submitted nor under consideration in any other journal simultaneously.

Appendix A

Proof of Theorem 2. 
We prove it through mathematical induction.
Let n = 1 , and therefore we find that ϖ 1 = 1 , and Equation (11) becomes
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = J 1 = ( ( ( 1 + ( α 1 ) η J + ) ( 1 η J + ( τ ) ) ) ( ( 1 + ( α 1 ) η J + ) + ( α 1 ) ( 1 η J + ) ) + i ( ( 1 + ( α 1 ) σ J + ) ( 1 σ J + ( τ ) ) ) ( ( 1 + ( α 1 ) σ J + ) + ( α 1 ) ( 1 σ J + ) ) ,   α | η J | ( ( 1 + ( α 1 ) ( 1 + η J ) ) + ( α 1 ) | η J | ) + i   α | σ J | ( ( 1 + ( α 1 ) ( 1 + σ J ) ) + ( α 1 ) | σ J | ) )
Thus, for n = 1 , (11) holds.
Next, suppose that Equation (11) holds for n = m ,
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = m p = 1 ( ϖ p J p ) = ( ( p = 1 m ( 1 + ( α 1 ) η J p + ) ϖ p p = 1 m ( 1 η J p + ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) η J p + ) ϖ p + ( α 1 ) p = 1 m ( 1 η J p + ) ϖ p ) + i ( p = 1 m ( 1 + ( α 1 ) σ J p + ) ϖ p p = 1 m ( 1 σ J p + ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) σ J p + ) ϖ p + ( α 1 ) p = 1 m ( 1 σ J p + ) ϖ p ) , α p = 1 m | η J p | ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 + η J p ) ) ϖ p + ( α 1 ) p = 1 m | η J p | ϖ p ) + i   α p = 1 m | σ J p | ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 + σ J p ) ) ϖ p + ( α 1 ) p = 1 m | σ J p | ϖ p )
Now let n = m + 1 . Then, we have
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ,   J m + 1 ) = m p = 1 ( ϖ p J p ) ( ϖ m + 1 ,   J m + 1 ) = ( ( p = 1 m ( 1 + ( α 1 ) η J p + ) ϖ p p = 1 m ( 1 η J p = 1 + ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) η J p + ) ϖ p + ( α 1 ) p = 1 m ( 1 η J p + ) ϖ p ) + i ( p = 1 m ( 1 + ( α 1 ) σ J p + ) ϖ p p = 1 m ( 1 σ J p + ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) σ J p + ) ϖ p + ( α 1 ) p = 1 m ( 1 σ J p + ) ϖ p ) , α p = 1 m | η J p | ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 + η J p ) ) ϖ p + ( α 1 ) p = 1 m | η J p | ϖ p ) + i   α p = 1 m | σ J p | ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 + σ J p ) ) ϖ p + ( α 1 ) p = 1 m | σ J p | ϖ p ) ) ( ( ( 1 + ( α 1 ) η J + ) ϖ m + 1 ( 1 η J + ) ϖ m + 1 ) ( ( 1 + ( α 1 ) η J + ) ϖ m + 1 + ( α 1 ) ( 1 η J + ) ϖ m + 1 ) + i ( ( 1 + ( α 1 ) σ J + ) ϖ m + 1 ( 1 σ J + ) ϖ m + 1 ) ( ( 1 + ( α 1 ) σ J + ) λ + ( α 1 ) ( 1 σ J + ) λ ) , α | η J | ϖ m + 1 ( ( 1 + ( α 1 ) ( 1 + η J ) ) ϖ m + 1 + ( α 1 ) | η J | ϖ m + 1 ) + i   α | σ J | ϖ m + 1 ( ( 1 + ( α 1 ) ( 1 + σ J ) ) ϖ m + 1 + ( α 1 ) | σ J | ϖ m + 1 ) ) = ( ( p = 1 m + 1 ( 1 + ( α 1 ) η J p + ) ϖ p p m + 1 ( 1 η J p + ) ϖ p ) ( p = 1 m + 1 ( 1 + ( α 1 ) η J p + ) ϖ p + ( α 1 ) p = 1 m + 1 ( 1 η J p + ) ϖ p ) + i ( p = 1 m + 1 ( 1 + ( α 1 ) σ J p + ) ϖ p p m + 1 ( 1 σ J p + ) ϖ p ) ( p = 1 m + 1 ( 1 + ( α 1 ) σ J p + ) ϖ p + ( α 1 ) p = 1 m + 1 ( 1 σ J p + ) ϖ p ) , α p = 1 m + 1 | η J p | ϖ p ( p = 1 m + 1 ( 1 + ( α 1 ) ( 1 + η J p ) ) ϖ p + ( α 1 ) p = 1 m + 1 | η J p | ϖ p ) + i   α p = 1 m + 1 | σ J p | ϖ p ( p = 1 m + 1 ( 1 + ( α 1 ) ( 1 + σ J p ) ) ϖ p + ( α 1 ) p = 1 m + 1 | σ J p | ϖ p ) )
Thus, for n = m + 1 , (11) holds. (11) holds, for all n .
Proof of Theorem 11. 
We prove it through mathematical induction.
Let n = 1 , and therefore we find that ϖ 1 = 1 and Equation (29) becomes
B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J n ) = J 1 = ( α ( η J + ) ( 1 + ( α 1 ) ( 1 η J + ) ) + ( α 1 ) η J + + i   α ( σ J + ) ( 1 + ( α 1 ) ( 1 σ J + ) ) + ( α 1 ) σ J + , ( ) ( ( 1 + ( α 1 ) | η J | ) + ( α 1 ) ( 1 + η J ) ) + i ( ( ( 1 + ( α 1 ) | σ J | ) ( 1 + σ J ) ) ( ( 1 + ) + ( α 1 ) ( 1 + σ J ) ) ) )
Thus, for n = 1 , (29) holds.
Next, suppose that (29) holds for n = m ,
B C F H W G ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = m p = 1 ( J p ) ϖ p = ( α p = 1 m ( η J p + ) ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 η J p + ) ) ϖ p + ( α 1 ) p = 1 m ( η J p + ) ϖ p ) + i   α p = 1 m ( σ J p + ) ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 σ J p + ) ) ϖ p + ( α 1 ) p = 1 m ( σ J p + ) ϖ p ) , ( p = 1 m ( 1 + ( α 1 ) | η J p | ) ϖ p p = 1 m ( 1 + η J p ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) | η J p | ) ϖ p + ( α 1 ) p = 1 m ( 1 + η J p ) ϖ p ) + i   ( ( p = 1 m ( 1 + ( α 1 ) | σ J p | ) ϖ p p = 1 m ( 1 + σ J p ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) | σ J p | ) ϖ p + ( α 1 ) p = 1 m ( 1 + σ J p ) ϖ p ) ) )
Now let n = m + 1 . Then, we have
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ,   J m + 1 ) = m p = 1 ( J p ) ϖ p ( J m + 1 ) ϖ m + 1 = ( α p = 1 m ( η J p + ) ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 η J p + ) ) ϖ p + ( α 1 ) p = 1 m ( η J p + ) ϖ p ) + i   α p = 1 m ( σ J p + ) ϖ p ( p = 1 m ( 1 + ( α 1 ) ( 1 σ J p + ) ) ϖ p + ( α 1 ) p = 1 m ( σ J p + ) ϖ p ) , ( p = 1 m ( 1 + ( α 1 ) | η J p | ) ϖ p p = 1 m ( 1 + η J p ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) | η J p | ) ϖ p + ( α 1 ) p = 1 m ( 1 + η J p ) ϖ p ) + i   ( ( p = 1 m ( 1 + ( α 1 ) | σ J p | ) ϖ p p = 1 m ( 1 + σ J p ) ϖ p ) ( p = 1 m ( 1 + ( α 1 ) | σ J p | ) ϖ p + ( α 1 ) p = 1 m ( 1 + σ J p ) ϖ p ) ) ) ( α ( η J + ) ϖ m + 1 ( ( 1 + ( α 1 ) ( 1 η J + ) ) ϖ m + 1 + ( α 1 ) ( η J + ) ϖ m + 1 ) + i   α ( σ J + ) ϖ m + 1 ( ( 1 + ( α 1 ) ( 1 σ J + ) ) ϖ m + 1 + ( α 1 ) ( σ J + ) ϖ m + 1 ) , ( ( 1 + ( α 1 ) | η J | ) ϖ m + 1 ( 1 + η J ) ϖ m + 1 ) ( ( 1 + ( α 1 ) | η J | ) ϖ m + 1 + ( α 1 ) ( 1 + η J ) ϖ m + 1 ) + i   ( ( ( 1 + ( α 1 ) | σ J | ) ϖ m + 1 ( 1 + σ J ) ϖ m + 1 ) ( ( 1 + ( α 1 ) | σ J | ) ϖ m + 1 + ( α 1 ) ( 1 + σ J ) ϖ m + 1 ) ) ) = ( α p = 1 m + 1 ( η J p + ) ϖ p ( p = 1 m + 1 ( 1 + ( α 1 ) ( 1 η J p + ) ) ϖ p + ( α 1 ) p = 1 m + 1 ( η J p + ( τ ) ) ϖ p ) + i   α p = 1 m + 1 ( σ J p + ) ϖ p ( p = 1 m + 1 ( 1 + ( α 1 ) ( 1 σ J p + ) ) ϖ p + ( α 1 ) p = 1 m + 1 ( σ J p + ) ϖ p ) , ( p = 1 m + 1 ( 1 + ( α 1 ) | η J p | ) ϖ p p = 1 m + 1 ( 1 + η J p ) ϖ p ) ( p = 1 m + 1 ( 1 + ( α 1 ) | η J p | ) ϖ p + ( α 1 ) p = 1 m + 1 ( 1 + η J p ) ϖ p ) + i   ( ( p = 1 m + 1 ( 1 + ( α 1 ) | σ J p | ) ϖ p p = 1 m + 1 ( 1 + σ J p ) ϖ p ) ( p = 1 m + 1 ( 1 + ( α 1 ) | σ J p | ) ϖ p + ( α 1 ) p = 1 m + 1 ( 1 + σ J p ) ϖ p ) ) )
Thus, for n = m + 1 , (29) holds. Therefore, (29) holds, for all n .
Proof of Theorem 3. 
By Definition 11, we have
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = B C F H W A ϖ ( J ,   J ,   J ,   ,   J ) = ( ( p = 1 n ( 1 + ( α 1 ) η J p + ) ϖ p p = 1 n ( 1 η J p + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) η J p + ) ϖ p + ( α 1 ) p = 1 n ( 1 η J p + ) ϖ p ) + i ( p = 1 n ( 1 + ( α 1 ) σ J p + ) ϖ p p = 1 n ( 1 σ J p + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) σ J p + ) ϖ p + ( α 1 ) p = 1 n ( 1 σ J p + ) ϖ p ) , α p = 1 n | η J p | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + η J p ) ) ϖ p + ( α 1 ) p = 1 n | η J p | ϖ p ) + i   α p = 1 n | σ J p | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + σ J p ) ) ϖ p + ( α 1 ) p = 1 n | σ J p | ϖ p ) ) = ( ( p = 1 n ( 1 + ( α 1 ) η J + ) ϖ p p = 1 n ( 1 η J + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) η J + ) ϖ p + ( α 1 ) p = 1 n ( 1 η J + ) ϖ p ) + i ( p = 1 n ( 1 + ( α 1 ) σ J + ) ϖ p p = 1 n ( 1 σ J + ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) σ J + ) ϖ p + ( α 1 ) p = 1 n ( 1 σ J + ) ϖ p ) , α p = 1 n | η J | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + η J ) ) ϖ p + ( α 1 ) p = 1 n | η J | ϖ p ) + i   α p = 1 n | σ J | ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 + σ J ) ) ϖ p + ( α 1 ) p = 1 n | σ J | ϖ p ) ) = ( ( ( 1 + ( α 1 ) η J + ) ( 1 η J + ) ) ( ( 1 + ( α 1 ) η J + ) + ( α 1 ) ( 1 η J + ) ) + i ( ( 1 + ( α 1 ) σ J + ) ( 1 σ J + ) ϖ p ) ( ( 1 + ( α 1 ) σ J + ) + ( α 1 ) ( 1 σ J + ) ) , α | η J | ( 1 + ( α 1 ) ( 1 + η J ) + ( α 1 ) | η J | ) + i   α | σ J | ( 1 + ( α 1 ) ( 1 + σ J ) + ( α 1 ) | σ J | ) ) = J
Proof of Theorem 12. 
By Definition 14, we have
B C F H W A ϖ ( J 1 ,   J 2 ,   J 3 ,   ,   J m ) = B C F H W A ϖ ( J ,   J ,   J ,   ,   J ) = ( α p = 1 n ( η J p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 η J p + ) ) ϖ p + ( α 1 ) p = 1 n ( η J p + ) ϖ p ) + i   α p = 1 n ( σ J p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 σ J p + ) ) ϖ p + ( α 1 ) p = 1 n ( σ J p + ) ϖ p ) , ( p = 1 n ( 1 + ( α 1 ) | η J p | ) ϖ p p = 1 n ( 1 + η J p ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η J p | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η J p ) ϖ p ) + i ( ( p = 1 n ( 1 + ( α 1 ) | σ J p | ) ϖ p p = 1 n ( 1 + σ J p ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | σ J p | ) ϖ p + ( α 1 ) p = 1 n ( 1 + σ J p ) ϖ p ) ) ) = ( α p = 1 n ( η J + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 η J + ) ) ϖ p + ( α 1 ) p = 1 n ( η J + ) ϖ p ) + i   α p = 1 n ( σ J p + ) ϖ p ( p = 1 n ( 1 + ( α 1 ) ( 1 σ J + ) ) ϖ p + ( α 1 ) p = 1 n ( σ J + ) ϖ p ) , ( p = 1 n ( 1 + ( α 1 ) | η J | ) ϖ p p = 1 n ( 1 + η J ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | η J | ) ϖ p + ( α 1 ) p = 1 n ( 1 + η J ) ϖ p ) + i ( ( p = 1 n ( 1 + ( α 1 ) | σ J p | ) ϖ p p = 1 n ( 1 + σ J ) ϖ p ) ( p = 1 n ( 1 + ( α 1 ) | σ J | ) ϖ p + ( α 1 ) p = 1 n ( 1 + σ J ) ϖ p ) ) ) = ( α ( η J + ) ( 1 + ( α 1 ) ( 1 η J + ) + ( α 1 ) ( η J + ) ) + i α ( σ J + ) ( 1 + ( α 1 ) ( 1 σ J + ) + ( α 1 ) ( σ J + ) ) , 1 + ( α 1 ) | η J | ( 1 + ( α 1 ) | η J | + ( α 1 ) ( 1 + η J ) ) + i   1 + ( α 1 ) | σ J | ( 1 + ( α 1 ) | σ J | + ( α 1 ) ( 1 + σ J ) ) ) = J

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Mardani, A.; Nilashi, M.; Zavadskas, E.K.; Awang, S.R.; Zare, H.; Jamal, N.M. Decision Making Methods Based on Fuzzy Aggregation Operators: Three Decades Review from 1986 to 2017. Int. J. Inf. Technol. Decis. Mak. 2018, 17, 391–466. [Google Scholar] [CrossRef]
  3. Merigó, J.M.; Casanovas, M. Fuzzy generalized hybrid aggregation operators and its application in fuzzy decision making. Int. J. Fuzzy System. 2010, 12, 15–24. [Google Scholar]
  4. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Xu, Z. Intuitionistic Fuzzy Aggregation Operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar] [CrossRef]
  6. Rahman, K.; Ayub, S.; Abdullah, S. Generalized intuitionistic fuzzy aggregation operators based on confidence levels for group decision making. Granul. Comput. 2020, 6, 867–886. [Google Scholar] [CrossRef]
  7. Verma, R.; Merigó, J.M. Multiple attribute group decision making based on 2-dimension linguistic intuitionistic fuzzy aggregation operators. Soft Comput. 2020, 24, 17377–17400. [Google Scholar] [CrossRef]
  8. Huang, J.-Y. Intuitionistic fuzzy Hamacher aggregation operators and their application to multiple attribute decision making. J. Intell. Fuzzy Syst. 2014, 27, 505–513. [Google Scholar] [CrossRef]
  9. Garg, H. Intuitionistic Fuzzy Hamacher Aggregation Operators with Entropy Weight and Their Applications to Multi-criteria Decision-Making Problems. Iran. J. Sci. Technol. Trans. Electr. Eng. 2019, 43, 597–613. [Google Scholar] [CrossRef]
  10. Zhang, W.R. Bipolar fuzzy sets and relations: A computational framework for cognitive modeling and multiagent decision analysis. In NAFIPS/IFIS/NASA’94, Proceedings of the First International Joint Conference of The North American Fuzzy Information Processing Society Biannual Conference. The Industrial Fuzzy Control and Intellig, San Antonio, TX, USA, 18–21 December 1994; IEE: Piscataway, NJ, USA, 1994; pp. 305–309. [Google Scholar]
  11. Zhang, W.R. (Yin)(Yang) bipolar fuzzy sets. In Proceedings of the IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98CH36228), Anchorage, AK, USA, 4–9 May 1998; Volume 1, pp. 835–840. [Google Scholar]
  12. Lee, K.-M. Comparison of Interval-valued fuzzy sets, Intuitionistic fuzzy sets, and bipolar-valued fuzzy sets. J. Korean Inst. Intell. Syst. 2004, 14, 125–129. [Google Scholar] [CrossRef] [Green Version]
  13. Zhang, W.-R.; Zhang, L. YinYang bipolar logic and bipolar fuzzy logic. Inf. Sci. 2004, 165, 265–287. [Google Scholar] [CrossRef]
  14. Han, Y.; Shi, P.; Chen, S. Bipolar-Valued Rough Fuzzy Set and Its Applications to the Decision Information System. IEEE Trans. Fuzzy Syst. 2015, 23, 2358–2370. [Google Scholar] [CrossRef]
  15. Yang, H.L.; Li, S.G.; Yang, W.H.; Lu, Y. Notes on “Bipolar fuzzy graphs”. Inf. Sci. 2013, 242, 113–121. [Google Scholar] [CrossRef]
  16. Akram, M. Bipolar fuzzy graphs. Inf. Sci. 2011, 181, 5548–5564. [Google Scholar] [CrossRef]
  17. Zhang, W.-R. Bipolar Quantum Logic Gates and Quantum Cellular Combinatorics—A Logical Extension to Quantum Entanglement. J. Quantum Inf. Sci. 2013, 3, 93–105. [Google Scholar] [CrossRef] [Green Version]
  18. Zhang, W.-R.; Peace, K.E. Causality Is Logically Definable—Toward an Equilibrium-Based Computing Paradigm of Quantum Agent and Quantum Intelligence (QAQI) (Survey and Research). J. Quantum Inf. Sci. 2014, 4, 227–268. [Google Scholar] [CrossRef] [Green Version]
  19. Zhang, W.-R.; Zhang, J.H.; Shi, Y.; Chen, S.-S. BIPOLAR LINEAR ALGEBRA AND YINYANG-N-ELEMENT CELLULAR NETWORKS FOR EQUILIBRIUM-BASED BIOSYSTEM SIMULATION AND REGULATION. J. Biol. Syst. 2009, 17, 547–576. [Google Scholar] [CrossRef]
  20. Lu, M.; Busemeyer, J.R. Do traditional Chinese theories of Yi Jing (’Yin-Yang’ and Chinese medicine go beyond Western concepts of mind and matter. Mind Matter 2014, 12, 37–59. [Google Scholar]
  21. Zhang, W.-R. G-CPT Symmetry of Quantum Emergence and Submergence—An Information Conservational Multiagent Cellular Automata Unification of CPT Symmetry and CP Violation for Equilibrium-Based Many-World Causal Analysis of Quantum Coherence and Decoherence. J. Quantum Inf. Sci. 2016, 6, 62–97. [Google Scholar] [CrossRef] [Green Version]
  22. Zhang, W.R. YinYang bipolar relativity: A unifying theory of nature, agents and causality with applications in quantum computing, cognitive informatics and life sciences. IGI Global. 2011. [Google Scholar] [CrossRef]
  23. Gul, Z. Some Bipolar Fuzzy Aggregations Operators and Their Applications in Multicriteria Group Decision Making. M. Ph.D. Thesis, Hazara University, Mansehra, Pakistan, 2015. [Google Scholar]
  24. Wei, G.; Alsaadi, F.E.; Hayat, T.; Alsaedi, A. Bipolar Fuzzy Hamacher Aggregation Operators in Multiple Attribute Decision Making. J. Intell. Fuzzy Syst. 2018, 20, 1–12. [Google Scholar] [CrossRef]
  25. Jana, C.; Pal, M.; Wang, J.-Q. Bipolar fuzzy Dombi aggregation operators and its application in multiple-attribute decision-making process. J. Ambient. Intell. Humaniz. Comput. 2019, 10, 3533–3549. [Google Scholar] [CrossRef]
  26. Jana, C.; Pal, M.; Wang, J.-Q. Bipolar fuzzy Dombi prioritized aggregation operators in multiple attribute decision making. Soft Comput. 2020, 24, 3631–3646. [Google Scholar] [CrossRef]
  27. Riaz, M.; Tehrim, S.T. A robust extension of VIKOR method for bipolar fuzzy sets using connection numbers of SPA theory based metric spaces. Artif. Intell. Rev. 2021, 54, 561–591. [Google Scholar] [CrossRef]
  28. Sarwar, M.; Akram, M.; Zafar, F. Decision Making Approach Based on Competition Graphs and Extended TOPSIS Method under Bipolar Fuzzy Environment. Math. Comput. Appl. 2018, 23, 68. [Google Scholar] [CrossRef] [Green Version]
  29. Mahmood, T. A Novel Approach towards Bipolar Soft Sets and Their Applications. J. Math. 2020, 2020, 1–11. [Google Scholar] [CrossRef]
  30. Abdullah, S.; Aslam, M.; Ullah, K. Bipolar fuzzy soft sets and its applications in decision making problem. J. Intell. Fuzzy Syst. 2014, 27, 729–742. [Google Scholar] [CrossRef] [Green Version]
  31. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  32. Luqman, A.; Akram, M.; Al-Kenani, A.N.; Alcantud, J.C.R. A Study on Hypergraph Representations of Complex Fuzzy Information. Symmetry 2019, 11, 1381. [Google Scholar] [CrossRef] [Green Version]
  33. Tamir, D.E.; Jin, L.; Kandel, A. A new interpretation of complex membership grade. Int. J. Intell. Syst. 2011, 26, 285–312. [Google Scholar] [CrossRef]
  34. Yazdanbakhsh, O.; Dick, S. A systematic review of complex fuzzy sets and logic. Fuzzy Sets Syst. 2018, 338, 1–22. [Google Scholar] [CrossRef]
  35. Tamir, D.E.; Rishe, N.D.; Kandel, A. Complex fuzzy sets and complex fuzzy logic an overview of theory and applications. In Fifty Years of Fuzzy Logic and Its Applications; Studies in Fuzziness and Soft Computing; Springer: Cham, Switzerland, 2015; Volume 326, pp. 661–681. [Google Scholar]
  36. Dagher, I. Complex fuzzy c-means algorithm. Artif. Intell. Rev. 2012, 38, 25–39. [Google Scholar] [CrossRef]
  37. Bi, L.; Dai, S.; Hu, B. Complex Fuzzy Geometric Aggregation Operators. Symmetry 2018, 10, 251. [Google Scholar] [CrossRef] [Green Version]
  38. Hu, B.; Bi, L.; Dai, S. Complex Fuzzy Power Aggregation Operators. Math. Probl. Eng. 2019, 2019, 1–7. [Google Scholar] [CrossRef]
  39. Bi, L.; Dai, S.; Hu, B.; Li, S. Complex fuzzy arithmetic aggregation operators. J. Intell. Fuzzy Syst. 2019, 36, 2765–2771. [Google Scholar] [CrossRef]
  40. Garg, H.; Rani, D. Novel aggregation operators and ranking method for complex intuitionistic fuzzy sets and their applications to decision-making process. Artif. Intell. Rev. 2019, 5, 1–26. [Google Scholar] [CrossRef]
  41. Mahmood, T.; Ur Rehman, U.; Ali, Z.; Mahmood, T. Hybrid vector similarity measures based on complex hesitant fuzzy sets and their applications to pattern recognition and medical diagnosis. J. Intell. Fuzzy Syst. 2021, 1–22. [Google Scholar] [CrossRef]
  42. Behera, D.; Chakraverty, S. A new method for solving real and complex fuzzy systems of linear equations. Comput. Math. Model. 2012, 23, 507–518. [Google Scholar] [CrossRef]
  43. Ur Rehman, U.; Mahmood, T.; Ali, Z.; Panityakul, T. A Novel Approach of Complex Dual Hesitant Fuzzy Sets and Their Applications in Pattern Recognition and Medical Diagnosis. J. Math. 2021, 2021, 1–31. [Google Scholar] [CrossRef]
  44. Ma, X.; Zhan, J.; Khan, M.; Zeeshan, M.; Anis, S.; Awan, A.S. Complex fuzzy sets with applications in signals. Comput. Appl. Math. 2019, 38, 1–34. [Google Scholar] [CrossRef]
  45. Mahmood, T.; Ur Rehman, U. A novel approach towards bipolar complex fuzzy sets and their applications in generalized similarity measures. Int. J. Intell. Syst. 2021. [Google Scholar] [CrossRef]
  46. Hamacher, H. Über logische Verknüpfungen unscharfer Aussagen und deren zugehörige Bewertungsfunktionen. In Progress in Cybernetics and Systems Research, III; Trappl, R., Klir, G.J., Ricciardi, L., Eds.; RWT: Aachen, Germany, 1975; pp. 276–288. [Google Scholar]
  47. Mahmood, T.; Ur Rehman, U.; Ali, Z. A novel complex fuzzy N-soft sets and their decision-making algorithm. Complex Intell. Syst. 2021, 7, 2255–2280. [Google Scholar] [CrossRef]
  48. Mahmood, T.; Ur Rehman, U.; Ali, Z.; Chinram, R. Jaccard and Dice Similarity Measures Based on Novel Complex Dual Hesitant Fuzzy Sets and Their Applications. Math. Probl. Eng. 2020, 2020, 1–25. [Google Scholar] [CrossRef]
  49. Chinram, R.; Mahmood, T.; Ur Rehman, U.; Ali, Z.; Iampan, A. Some Novel Cosine Similarity Measures Based on Complex Hesitant Fuzzy Sets and Their Applications. J. Math. 2021, 2021, 6690728. [Google Scholar] [CrossRef]
  50. Mahmood, T.; Ur Rehman, U.; Ali, Z. Exponential and non-Exponential Based Generalized Similarity Measures for Complex Hesitant Fuzzy Sets with Applications. Fuzzy Inf. Eng. 2020, 12, 38–70. [Google Scholar] [CrossRef]
  51. Ur Rehman, U.; Mahmood, T. Picture Fuzzy N-Soft Sets and Their Applications in Decision-Making Problems. Fuzzy Inf. Eng. 2021, 13, 335–367. [Google Scholar] [CrossRef]
  52. Akram, M.; Khan, A.; Alcantud, J.C.R.; Santos-García, G. A hybrid decision-making framework under complex spherical fuzzy prioritized weighted aggregation operators. Expert Syst. 2021, 6, e12712. [Google Scholar] [CrossRef]
  53. Ma, X.; Akram, M.; Zahid, K.; Alcantud, J.C.R. Group decision-making framework using complex Pythagorean fuzzy information. Neural Comput. Appl. 2021, 33, 2085–2105. [Google Scholar] [CrossRef]
  54. Konwar, N.; Davvaz, B.; Debnath, P. Results on generalized intuitionistic fuzzy hypergroupoids. J. Intell. Fuzzy Syst. 2019, 36, 2571–2580. [Google Scholar] [CrossRef]
  55. Gao, Y.; Zhang, Z. Consensus reaching with non-cooperative behavior management for personalized individual semantics-based social network group decision making. J. Oper. Res. Soc. 2021, 1–18. [Google Scholar] [CrossRef]
  56. Zhang, Z.; Li, Z.; Gao, Y. Consensus reaching for group decision making with multi-granular unbalanced linguistic information: A bounded confidence and minimum adjustment-based approach. Inf. Fusion 2021, 74, 96–110. [Google Scholar] [CrossRef]
Figure 1. The graphical depiction of the score values of existing and interpreted work.
Figure 1. The graphical depiction of the score values of existing and interpreted work.
Mathematics 10 00023 g001
Table 1. Bipolar complex fuzzy numbers.
Table 1. Bipolar complex fuzzy numbers.
  B 1   B 2   B 3   B 4
  A 1 ( 0.6 + i   0.2 ,   0.4 i 0.6 ) ( 0.9 + i   0.1 ,   0.1 i   0.4 ) ( 0.3 + i   0.3 ,   0.3 i   0.9 ) ( 0.1 + i   0.5 ,   0.3 i   0.9 )
  A 2 ( 0.3 + i   0.9 ,   0.4 i   0.76 ) ( 0.12 + i   0.9 ,   0.2 i   0.5 ) ( 0.4 + i   0.1 ,   0.34 i   0.6 ) ( 0.1 + i   0.4 ,   0.53 i   0.2 )
  A 3 ( 0.9 + i   0.8 ,   0.02 i   0.1 ) ( 0.2 + i   0.5 ,   0.7 i   0.4 ) ( 0.8 + i   0.45 ,   0.3 i   0.76 ) ( 0.45 + i   0.87 ,   0.23 i   0.1 )
  A 4 ( 0.17 + i   0.35 ,   0.9 i   0.27 ) ( 0.64 + i   0.34 ,   0.01 i   0.02 ) ( 0.45 + i   0.19 ,   0.9 i   0.35 ) ( 0.6 + i   0.45 ,   0.23 i   0.25 )
Table 2. Score values and ranking results of interpreted and existing work.
Table 2. Score values and ranking results of interpreted and existing work.
MethodsScore ValuesRanking
Wei et al. [24]FailedFailed
Jana et al. [25]FailedFailed
Jana et al. [26]FailedFailed
Huang [8]FailedFailed
Interpreted BCFHWA operator S B ( x 1 ) = 0.467 ,   S B ( x 2 ) = 0.52 ,   S B ( x 3 ) = 0.729 ,   S B ( x 4 ) = 0.629 A 3 A 4 A 2 A 1
Interpreted BCFHWG operator S B ( x 1 ) = 0.409 ,   S B ( x 2 ) = 0.447 ,   S B ( x 3 ) = 0.643 ,   S B ( x 4 ) = 0.526 A 3 A 4 A 2 A 1
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Mahmood, T.; Rehman, U.u.; Ahmmad, J.; Santos-García, G. Bipolar Complex Fuzzy Hamacher Aggregation Operators and Their Applications in Multi-Attribute Decision Making. Mathematics 2022, 10, 23. https://doi.org/10.3390/math10010023

AMA Style

Mahmood T, Rehman Uu, Ahmmad J, Santos-García G. Bipolar Complex Fuzzy Hamacher Aggregation Operators and Their Applications in Multi-Attribute Decision Making. Mathematics. 2022; 10(1):23. https://doi.org/10.3390/math10010023

Chicago/Turabian Style

Mahmood, Tahir, Ubaid ur Rehman, Jabbar Ahmmad, and Gustavo Santos-García. 2022. "Bipolar Complex Fuzzy Hamacher Aggregation Operators and Their Applications in Multi-Attribute Decision Making" Mathematics 10, no. 1: 23. https://doi.org/10.3390/math10010023

APA Style

Mahmood, T., Rehman, U. u., Ahmmad, J., & Santos-García, G. (2022). Bipolar Complex Fuzzy Hamacher Aggregation Operators and Their Applications in Multi-Attribute Decision Making. Mathematics, 10(1), 23. https://doi.org/10.3390/math10010023

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

Article Metrics

Back to TopTop