Next Article in Journal
A Novel Approach to Multi-Attribute Group Decision-Making based on Interval-Valued Intuitionistic Fuzzy Power Muirhead Mean
Previous Article in Journal
Influence of Cattaneo–Christov Heat Flux on MHD Jeffrey, Maxwell, and Oldroyd-B Nanofluids with Homogeneous-Heterogeneous Reaction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Ranking Methodology for Pythagorean Trapezoidal Uncertain Linguistic Fuzzy Sets Based on Einstein Operations

1
College of Economic and Management, Northwest A & F University Yangling, Shaanxi 712100, China
2
Department of Mathematics, Abdul WAli Khan University, Mardan 23200, Khyber Pakhtunkhwa, Pakistan
3
Department of Mathematics and Statistics, Hazara Univeristy, Mansehra 21120, Khyber Pakhtunkhwa, Pakistan
4
College of Engineering and Informatics, National University Ireland, Galway H91 CF50, Ireland
5
Department of Information Technology, Hazara University, Mansehra 21120, Khyber Pakhtunkhwa, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(3), 440; https://doi.org/10.3390/sym11030440
Submission received: 30 January 2019 / Revised: 2 March 2019 / Accepted: 5 March 2019 / Published: 25 March 2019

Abstract

:
In this article, we proposed new Pythagorean trapezoidal uncertain linguistic fuzzy aggregation information—namely, the Pythagorean trapezoidal uncertain linguistic fuzzy Einstein weighted averaging (PTULFEWA) operator, the Pythagorean trapezoidal uncertain linguistic fuzzy Einstein ordered weighted averaging (PTULFEOWA) operator, and the Pythagorean trapezoidal uncertain linguistic fuzzy Einstein hybrid weighted averaging (PTULFEHWA) operator—using the Einstein operational laws. We studied some important properties of the suggested aggregation operators and showed that the PTULFEHWA is more general than the other proposed operators, which simplifies these aggregation operators. Furthermore, we presented a multiple attribute group decision making (MADM) process for the proposed aggregation operators under the Pythagorean trapezoidal uncertain linguistic fuzzy (PTULF) environment. A numerical example was constructed to determine the effectiveness and practicality of the proposed approach. Lastly, a comparative analysis was performed of the presented approach with existing approaches to show that the proposed method is consistent and provides more information that may be useful for complex problems in the decision-making process.

1. Introduction

The communication of the decision-making process is a very complex problem when we are receiving information about attributes. One the most powerful theories is that of the multi attribute decision making (MADM), which handles problems that extensively impact the human real-life problems. The basic methodology is that a decision maker is presented with his evaluation in a set of many attributes and alternatives to find the best ranking order alternative in MADM approaches. Zadeh [1] introduced a fuzzy set with the generalization of a classical set to solve ambiguous and vague information. Fuzzy set is used in many practical situations and has grown as an independent theory that interests researchers in many fields. After the success, fuzzy set was generalized to intuitionistic fuzzy set (IFS) by Atanassov [2] under the restriction that the membership and non-membership function sum was less than or equal to one. In [2] proposed a different mathematical operation under the IFS environment and studied the important properties. Uncertainty in human real problems is one of the continuous research areas and produces many new theories. Fuzzy decision-making (FDM) problems and their extension are presented in different ways to solve real life problems and have more attractive research to obtain the best results. Many decision making (DM) techniques have been proposed to explain the multi attribute decision-making process. Ramon et al. [3] presented the 2-tuple model and customer segmentation and their algorithms, k-means, which are more effective methods in the calculation of frequency and monetary exploitation.
Revanasiddappa and Harish [4] presented a new feature selection technique based on intuitionistic fuzzy entropy (IFE) for text classification. Firstly, intuitionistic fuzzy C-means (IFCM) clustering technique is employed to compute the intuitionistic membership values. The computed intuitionistic membership values are then used to estimate intuitionistic fuzzy entropy via match degree. Additionally, features with lower entropy values are selected to categorize the text documents. Juan Antonio Morente-Molinera et al. [5] focused on solving the problem by carrying out multi-criteria group decision making approaches using different new methods. Concretely, fuzzy ontologies reasoning procedures are used in order to reduce, at the very least, the experts needed to participate in the preference providing step. In this new advanced technique, the logic of alternative comparison relies on the ontology reasoning process, allowing experts to focus on how important the criteria are to them. Albadan et al. [6] proposed the procedures of selection of personnel delimited only to the making of non-programmed decisions through the implementation of game mechanics. In order to model this selection, the purpose of the following study is to carry out the formulation of inference rules based on fuzzy logic in order to capture the tacit transfer of certain types of information in personnel selection processes and to determine the aspects that allow the shaping of aspirants. In [7], the author defined generalized operation for intuitionistic fuzzy numbers.
Morente-Molinera proposed the technique of fuzzy ontologies in order to allow the experts to focus on determining the importance that should be given to different criteria. Thus, they deal directly with a high number of alternatives. Experts decide the importance of each criterion, and the alternatives ranking is calculated automatically using the fuzzy ontology. Liang et al. [8] presented the partial estimations, which determined that the introduced estimator is more capable and trusted to evaluate, consequently improving the overall results. There are many methodologies that evaluate the overall information that converges in different suppositions. If an ordinary collection of information is not considered in this environment, there is other information that can be considered by linguistic variables (LV) related to FNs, which are related to the membership function to one and the non-membership function to zero—more precisely, “good” and “bad”. Wang et al. [9] proposed ILS, and their MADM approach of using the IL aggregation information achieved some great consideration. Liu et al. [10] presented a new power aggregation operator, while Su et al. [11] generalized the concept to ordered weighted averaging (OWA) and intuitionistic linguistic ordered weighted averaging (ILOWA) operator. Xiao et al. [12] studied the ILOWA operator and applied it in the financial DM process. Liu and Jin [13] extended the intuitionistic uncertain linguistic values (IULVs) by using LV in intuitionistic linguistic variables (ILV) and studying their important properties. We observed that LVs are special facets of IULVs, which are more general and have more information. Liu et al. [14] presented and extended the linguistic (LF) aggregation operators. Yager [15] introduced a new Pythagorean fuzzy (PFS) set that is a generalization of IFS by membership and non-membership functions under the condition that the square sum of these functions is less than or equal to one. To motivate this idea, Yager [16] explained this shortcoming with an example—a decision maker makes a decision in the form of MD as ( 3 2 ) , a N-MD is 1 2 . Under IFS, the value does not satisfy the condition of a sum greater than 1, while in PFS, it satisfies the condition that the square sum is less than or equal to 1. After the successful implementation, Peng and Yang [17] presented the different aggregation operators, namely, the Pythagorean fuzzy weighted averaging (PFWA), the Pythagorean fuzzy weighted power averaging (PFWPA), and the Pythagorean fuzzy weighted power geometric (PFWPG) operator. Garg [18] introduced a new generalized Pythagorean fuzzy aggregation operator using Einstein operational laws and used them in the decision- making process.
Shakeel et al. [19] presented some aggregation operators to use the decision information represented by PTFNS, including the Pythagorean trapezoidal fuzzy weighted averaging (PTFWA) operator, the Pythagorean trapezoidal fuzzy ordered weighted averaging (PTFOWA) operator, and the Pythagorean trapezoidal fuzzy hybrid averaging (PTFHA) operator. Shakeel et al. [20] extended the work of aggregation operators into the interval-valued Pythagorean trapezoidal fuzzy weighted averaging (IVPTFWA) operator, the ordered weighted (IVPTFOWA), and the hybrid averaging (IVPTFHA) operators. Shakeel et al. [20] used Einstein operational laws and proposed a new concept of the Pythagorean trapezoidal fuzzy Einstein ordered weighted geometric (I-IVPTFEOWG) operator, the induced interval-valued Pythagorean trapezoidal fuzzy Einstein hybrid geometric (I-IVPTFEHG) operator, and their applications in decision making problems. Shakeel et al. [21] further extended the work to interval-valued Pythagorean trapezoidal fuzzy aggregation operators, the interval-valued Pythagorean trapezoidal fuzzy Einstein weighted geometric, (IVPTFEWG) operator, the interval-valued Pythagorean trapezoidal fuzzy Einstein ordered weighted geometric (IVPTFEOWG) operator, the interval-valued Pythagorean trapezoidal fuzzy Einstein hybrid geometric (IVPTFEHG), and their applications in decision making. The detail literature survey of aggregation operators and their applications in decision making problems discussed in [22,23,24,25,26,27,28,29,30,31,32].
In this paper, we introduce a new aggregation operator using Einstein operations under trapezoidal uncertain linguistic fuzzy sets and their applications in decision making. The motivations for the study are listed below.
(1)
Our anticipated aggregation information is more general and precise compared to the existing information.
(2)
The objectives of the study include proposing a PTULF Einstein aggregation operator and its operational laws, score, and accuracy function, establishing the MADM program approach based on the PTULF Einstein aggregation operators, and providing illustrative examples of the MADM program.
(3)
The comparative analysis is a strong testament to the new approach, as it shows that the proposed study is consistent.
To solve a MADM process, the weight of the attributes plays an important role in making decisions under the aggregation approaches.
The rest of the paper is arranged is follows. Section 2 consists of the background materials. Section 3 presents a new PTULF aggregation operator under Einstein operations, the Pythagorean trapezoidal uncertain linguistic fuzzy Einstein weighted averaging (PTULFEWA) operator, the Pythagorean trapezoidal uncertain linguistic fuzzy Einstein ordered weighted averaging (PTULFEOWA), and the Pythagorean trapezoidal uncertain linguistic fuzzy Einstein hybrid averaging (PTULFEHA) operator. Section 4 describes the MADM technique under the PTFL environment. In Section 5, a numerical example is given to demonstrate the importance of the methodologies. Section 6 shows a comparative study of the proposed and existing approaches. The conclusion is given in Section 7.

2. Preliminaries

Definition 1.
[10]. Let [ s θ ( p ) ,   s t ( p ) ] s ¯ , and P is a given domain as follows:
U = { [ s θ ( p ) ,   s t ( p ) ] , ( Ψ u ( p ) ,   ϒ u ( p ) ) ] :    p P } ,
is called an intuitionistic uncertain linguistic set (IULS), where s θ ( p ) ,   s t ( p ) s ¯ . Where Ψ u ( p ) and ϒ u ( p ) represent the MD and N-MD, respectively, with the condition 0 Ψ u ( p ) + ϒ u ( p ) 1 , p P . The MD and N-MD of the element p to the ULV [ s θ ( p ) ,   s t ( p ) ] . For each I L S , U in p , if π U ( p ) = 1 Ψ U ( p ) ϒ U ( p ) , for all p P , then π u ( p ) is called the degree of indeterminacy degree of p to the ULV [ s θ ( p ) ,   s t ( p ) ] . It is obvious that 0 π u ( p ) 1 , p P .
Definition 2.
[10]. Let U = { [ s θ ( p ) ,   s t ( p ) ] , ( Ψ u ( p ) ,   ϒ u ( p ) ) ] } :    p P } , be (IULS), the quaternion [ s θ ( p ) ,   s t ( p ) ] , ( γ u ( p ) ,   ς u ( p ) ) ] is called an I U L V , and U can also be viewed as a collection of the I U L V . Thus, it can also be expressed as follows:
U = { [ s θ ( p ) ,   s t ( p ) ] , ( Ψ u ( p ) ,   ϒ u ( p ) ) ] } :    p P } .
Definition 3.
[24] Let α ˜ 1 = ( [ p 1 ,   q 1 ,   r 1 ,   s 1 ] ;   Ψ α ˜ 1 ,   ϒ α ˜ 1 ) , and α ˜ 2 = ( [ p 2 ,   q 2 ,   r 2 ,   s 2 ] ;   Ψ α ˜ 2 , ϒ α ˜ 2 ) be two ITF numbers and δ 0 . Then,
(1) 
α ˜ 1 α ˜ 2 = ( [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; ( Ψ α ˜ 1 ) + ( Ψ α ˜ 2 ) ( Ψ α ˜ 1 Ψ α ˜ 2 ) ,   ϒ α ˜ 1 ϒ α ˜ 2 )
(2) 
α ˜ 1 α ˜ 2 = ( [ p 1 p 2 ,   q 1 q 2 ,   r 1 r 2 ,   s 1 s 2 ] ; Ψ α ˜ 1 Ψ α ˜ 2 , ( ϒ α ˜ 1 ) + ( ϒ α ˜ 2 ) ( ϒ α ˜ 1 ϒ α ˜ 2 ) )
(3) 
δ α ˜ = ( [ δ p ,   δ q ,   δ r ,   δ s ] ;   1 ( 1 Ψ α ˜ ) δ ; ( ϒ α ˜ ) δ )
(4) 
α ˜ δ = ( [ p δ ,   q δ ,   r δ ,   s δ ] ;   Ψ α ˜ δ ,   1 ( 1 ϒ α ˜ ) δ ) .
Example 1.
Let = ( [ 0.2 , 0.3 , 0.4 , 0.5 ] ; ( 0.5 , 0.3 ) ) α 1 = ( [ 0.1 , 0.3 , 0.3 , 0.2 ] ; ( 0.3 , 0.6 ) ) , α 2 = ( [ 0.8 , 0.2 , 0.6 , 0.1 ] ; ( 0.4 , 0.2 ) ) be any three ITFNs, and δ = 0.2 . Then, we verify the above results such that,
(1) 
α ˜ 1 α ˜ 2 = ( [ 0.9 ,   0.5 ,   0.9 ,   0.3 ] ; ( 0.3 ) + ( 0.4 ) ( 0.3 )   ( 0.4 ) ,   ( 0.6 )   ( 0.2 ) ) = ( [ 0.9 ,   0.5 ,   0.9 ,   0.3 ] ;   0.58 ,   0.12 ) .
(2) 
α ˜ 1 α ˜ 2 = ( [ 0.08 ,   0.06 ,   0.18 ,   0.02 ] ; ( 0.3 )   ( 0.4 ) ,   ( 0.6 ) + ( 0.2 ) ( 0.6 )   ( 0.2 ) ) = ( [ 0.08 ,   0.06 ,   0.18 ,   0.02 ] ; ( 0.12 ,   0.68 ) .
(3) 
δ α ˜ = ( [ 0.2 ( 0.2 ) ,   0.2 ( 0.3 ) ,   0.2 ( 0.4 ) ,   0.2 ( 0.5 ) ] ; 1 ( 1 0.5 ) 0.2 ,   ( 0.3 ) 0.2 ) = [ 0.04 ,   0.06 ,   0.08 ,   0.1 ] ; ( 0.25 ,   0.78 ) .
(4) 
α ˜ δ = ( [ ( 0.2 ) 0.2 , ( 0.3 ) 0.2 , ( 0.4 ) 0.2 , ( 0.5 ) 0.2 ] ; ( 0.5 ) 0.2 ,   1 ( 1 0.3 ) 0.2 ) = ( [ ( 0.72 ) , ( 0.78 ) , ( 0.83 ) , ( 0.87 ) ] ; ( 0.87 ) ,   0.06 ) .
Definition 4.
[15]. Let L be a fixed set. The P F S , U in L is an object having the form;
A = { l ,   Ψ U ( l ) ,   ϒ U ( l ) |   l L }
Definition 5.
[16]. Let α ˜ = ( Ψ α ˜ ,   ϒ α ˜ ) , α ˜ 1 = ( Ψ α ˜ 1 ,   ϒ α ˜ 1 ) and α ˜ 2 = ( Ψ α ˜ 2 ,   ϒ α ˜ 2 ) be three P F N s and δ > 0 . Then,
(1) 
α ˜ c = ( ϒ α ˜ ,   Ψ α ˜ )
(2) 
α ˜ 1 α ˜ 2 = ( ( Ψ α ˜ 1 ) 2 + ( Ψ α ˜ 2 ) 2 ( Ψ α ˜ 1 2 Ψ α ˜ 2 2 ) ,   ϒ α ˜ 1 ϒ α ˜ 2 )
(3) 
α ˜ 1 α ˜ 2 = ( Ψ α ˜ 1 Ψ α ˜ 2 ,   ( ϒ α ˜ 1 ) 2 + ( ϒ α ˜ 2 ) 2 ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) )
(4) 
δ α ˜ = 1 ( 1 Ψ α ˜ 2 ) δ ; ( ϒ α ˜ ) δ )
(5) 
α ˜ δ = ( Ψ α ˜ δ ,   1 ( 1 ϒ α ˜ 2 ) δ ) .
Example 2.
Let α ˜ = ( 0.8 ,   0.3 ) , α ˜ 1 = ( 0.5 ,   0.6 ) , α ˜ 2 = ( 0.4 ,   0.7 ) be any three PFNs, and δ = 0.3 . Then, we verify the above results such that,
(1) 
α ˜ 1 α ˜ 2 = ( ( 0.5 ) 2 + ( 0.4 ) 2 ( 0.5 2 ) ( 0.4 2 ) , ( 0.6 )   ( 0.7 ) ) = ( 0.37 ,   0.42 ) = ( 0.85 ,   0.17 ) .
(2) 
α ˜ 1 α ˜ 2 = ( ( 0.5 )   ( 0.4 ) , ( 0.6 ) 2 + ( 0.7 ) 2 ( 0.6 ) 2 ( 0.7 2 ) ) = ( ( 0.5 )   ( 0.4 ) ,   0.6736 ) = ( 0.20 ,   0.82 ) .
(3) 
δ α ˜ = ( 1 ( 1 0.8 2 ) 0.3 ; ( 0.3 ) 0.3 ) = ( 0.50 ,   0.69 ) .
(4) 
α ˜ δ = ( ( 0.8 ) 0.3 ,   1 ( 1 0.3 2 ) 0.3 ) = ( 0.93 ,   0.16 ) .
Definition 6.
[19] Let α ˜ = ( [ p ,   q ,   r ,   s ] ; [ Ψ α ˜ ,   ϒ α ˜ ] ) be a PTFN, the score function s is;
s ( α ˜ ) = ( p + q + r + s 4 ( Ψ α ˜ 2 ϒ α ˜ 2 ) )   s ( α ˜ ) [ 1 ,   1 ] .
Example 3.
Let p ˜ 1 = { [ 0.4 ,   0.3 , 0.5 ,   0.6 ] ; ( 0.6 , 0.5 ) } , p ˜ 2 = { [ 0.1 ,   0.4 , 0.3 ,   0.2 ] ; ( 0.7 ,   0.4 ) } and p ˜ 3 = { [ 0.2 ,   0.1 , 0.6 , 0.5 ] ; ( 0.8 , 0.5 ) } be PTFNs, a score new example function S of PTFNs can be represented as follows:
S ( p ˜ 1 ) = 0.4 + 0.3 + 0.5 + 0.6 4 ( 0.6 2 0.5 2 ) = 0.0495 , S ( p ˜ 2 ) = 0.1 + 0.4 + 0.3 + 0.2 4 ( 0.7 2 0.4 2 ) = 0.060 ,   S ( p ˜ 3 ) = 0.2 + 0.1 + 0.6 + 0.5 4 ( 0.8 2 0.5 2 ) = 0.1365 .
Definition 7.
[19]. Let   α ˜ = ( [ p ,   q ,   r ,   s ] ; [ Ψ ,   ϒ ] ) be PTFN, an accuracy function h is:
h ( α ˜ ) = ( p + q + r + s 4 ( Ψ α ˜ 2 + ϒ α ˜ 2 ) )   h ( α ˜ ) [ 0 ,   1 ] .
Example 4.
Let p ˜ 1 = { [ 0.4 ,   0.3 , 0.5 ,   0.6 ] ; ( 0.6 ,   0.5 ) } , p ˜ 2 = { [ 0.1 ,   0.4 , 0.3 ,   0.2 ] ; ( 0.7 ,   0.4 ) } and p ˜ 3 = { [ 0.2 ,   0.1 , 0.6 ,   0.5 ] ; ( 0.8 ,   0.5 ) } be PTFNs, an accuracy new example function h of PTFNs can be represented as follows:
h ( p ˜ 1 ) = 0.4 + 0.3 + 0.5 + 0.6 4 ( 0.6 2 + 0.5 2 ) = 0.2745 , S ( p ˜ 2 ) = 0.1 + 0.4 + 0.3 + 0.2 4 ( 0.7 2 + 0.4 2 ) = 0.1625 ,   S ( p ˜ 3 ) = 0.2 + 0.1 + 0.6 + 0.5 4 ( 0.8 2 + 0.5 2 ) = 0.3115 .

Einstein Operations with Pythagorean Trapezoidal Fuzzy Numbers

The main Einstein operational laws are defined as follows:
a ε b = a . b 1 + ( 1 a 2 ) ( 1 b 2 ) ,   a ε b = ( a 2 + b 2 ) ( 1 + a 2 b 2 ) ,   for   all   ( a ,   b ) [ 0 ,   1 ] 2
Definition 8.
[20]. Let α ˜ = { [ p ,   q ,   r ,   s ] ; ( Ψ α ˜ ,   ϒ α ˜ ) } , α ˜ 1 = { [ p 1 ,   q 1 ,   r 1 ,   s 1 ] ; ( Ψ α ˜ 1 ,   ϒ α ˜ 1 ) } and α ˜ 2 = { [ p 2 ,   q 2 ,   r 2 ,   s 2 ] ; ( Ψ α ˜ 2 ,   ϒ α ˜ 2 ) } be any three P T F , numbers and δ 0 . Then,
(1) 
α ˜ 1 α ˜ 2 = { [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; ( Ψ α ˜ 1 ) 2 + ( Ψ α ˜ 2 ) 2 ( Ψ α ˜ 1 Ψ α ˜ 2 ) 2 ,   ϒ α ˜ 1 ϒ α ˜ 2 }
(2) 
α ˜ 1 α ˜ 2 = { [ p 1 p 2 ,   q 1 q 2 ,   r 1 r 2 ,   s 1 s 2 ] ;   Ψ α ˜ 1 Ψ α ˜ 2 , ( ϒ α ˜ 1 ) 2 + ( ϒ α ˜ 2 ) 2 ( ϒ α ˜ 1 ϒ α ˜ 2 ) 2 }
(3) 
δ α ˜ = { ( [ δ p ,   δ q ,   δ r ,   δ s ] ;   1 ( 1 Ψ α ˜ 2 ) δ ; ( ϒ α ˜ ) δ ) }
(4) 
α ˜ δ = { ( [ p δ ,   q δ ,   r δ ,   s δ ] ;   Ψ α ˜ δ ,   1 ( 1 ϒ α ˜ 2 ) δ ) } .
Example 5.
Let α ˜ = { ( s 2 , s 3 ) [ 0.3 , 0.4 , 0.5 , 0.6 ] ( 0.7 , 0.4 ) } ,   α ˜ 1 = { ( s 3 , s 6 ) [ 0.3 , 0.4 , 0.5 , 0.6 ] ( 0.8 , 0.5 ) } and α ˜ 2 = { ( s 4 , s 3 ) [ 0.5 , 0.3 , 0.4 , 0.4 ] ( 0.8 , 0.3 ) } be any three P T U L F N S and δ = 0.4 . Then, we verify the results as follows:
(1) 
α ˜ 1 α ˜ 2 = ( [ 0.3 + 0.5 ,   0.4 + 0.3 ,   0.5 + 0.4 ,   0.6 + 0.4 ] ; ( 0.8 ) 2 + ( 0.8 ) 2 ( 0.8 ) 2 ( 0.8 ) 2 , ( 0.5 ) ( 0.3 ) ) = ( [ 0.8 ,   0.7 ,   0.9 ,   0.6 + 1.0 ] ; ( 0.64 ) + ( 0.64 ) ( 0.64 ) ( 0.64 , ( 0.5 ) ( 0.3 ) ) = ( [ 0.8 ,   0.7 ,   0.9 ,   0.6 + 1.0 ] ;   ( 0.93 ,   0.15 ) )
(2) 
α ˜ 1 α ˜ 2 = ( [ ( 0.8 ) ( 0.5 ) , ( 0.4 ) ( 0.3 ) , ( 0.5 ) ( 0.4 ) , ( 0.6 ) ( 0.4 ) ; ( 0.8 ) ( 0.8 ) , 0.5 2 + 0.3 2 ( ( 0.5 ) 2 ( 0.3 ) 2 , ) = ( [ 0.4 , 0.12 , 0.20 , 0.24 ] ; ( 0.64 ) , 0.25 + 0.09 0.0225 , ) = ( [ 0.4 ,   0.12 ,   0.20 ,   0.24 ; ( 0.64 ,   0.5634 )
(3) 
δ α ˜ = ( [ ( 0.4 ) ( 0.3 ) , ( 0.4 ) ( 0.4 ) , ( 0.4 ) ( 0.5 ) , ( 0.4 ) ( 0.6 ) ] ; [ 1 ( 1 0.7 2 ) 0.4 , ( 0.4 ) 0.4 ] , ) = ( [ 0.12 , 0.16 , 0.20 , 0.16 ] ; 1 ( 1 0.7 2 ) 0.4 , ( 0.4 ) 0.4 , ) = ( [ 0.12 , 0.16 , 0.20 , 0.16 ] ; ( 0.4859 , 0.6901 ) )
(4) 
α ˜ δ = ( [ 0.3 0.4 , 0.4 0.4 , 0.5 0.4 , 0.6 0.4 ] ; , [ 0.4 0.4 , 1 ( 1 0.7 2 ) 0.4 ] ) = ( [ 0.61 , 0.69 , 0.75 , 0.85 ] ; , [ 0.4 0.4 , 1 ( 1 0.7 2 ) 0.4 ] ) = ( [ 0.61 , 0.69 , 0.75 , 0.85 ] ; , ( 0.69 , 0.48 ) ) .
Definition 9.
Consider α ˜ = { ( s θ ( p ) , s t ( p ) ) [ p , q , r , s ] ( Ψ α , Υ α ) } ,   α ˜ 1 = { ( s θ ( p ) , s t ( p ) ) [ p 1 , q 1 , r 1 , s 1 ] ( Ψ α 1 , Υ α 1 ) } and α ˜ 2 = { ( s θ ( p 2 ) , s t ( p 2 ) ) [ p 2 , q 2 , r 2 , s 2 ] ( Ψ α 2 , Υ α 2 ) } be a PTULNs and δ 0 . Then
(1) 
α ˜ 1 ε α ˜ 2 = { ( s θ ( p 1 ) + s θ ( p 2 ) ,   s t ( p 1 ) + s t ( p 2 ) ) , [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; ( Ψ α ˜ 1 ) 2 + ( Ψ α ˜ 2 ) 2 1 + ( Ψ α ˜ 1 ) 2 ( Ψ α ˜ 2 ) 2 ,   ϒ α ˜ 1 ϒ α ˜ 2 1 + ( 1 ϒ α ˜ 1 2 ) ( 1 ϒ α ˜ 2 2 ) }
(2) 
α ˜ 1 ε α ˜ 2 = { ( s θ ( p 1 ) s θ ( p 2 ) ,   s t ( p 1 ) s t ( p 2 ) ) , [ p 1 p 2 ,   q 1 q 2 ,   r 1 r 2 ,   s 1 s 2 ] ; Ψ α ˜ 1 Ψ α ˜ 2 1 + ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) ,   ( ϒ α ˜ 1 ) 2 + ( ϒ α ˜ 2 ) 2 1 + ( ϒ α ˜ 1 ) 2 ( ϒ α ˜ 2 ) 2 , }
(3) 
δ ε . α ˜ = { ( s δ θ ( p ) ,   s δ t ( p ) ) [ δ p ,   δ q ,   δ r ,   δ s ] ; ( 1 + Ψ α ˜ 2 ) δ ( 1 Ψ α ˜ 2 ) δ ( 1 + Ψ α ˜ 2 ) δ + ( 1 Ψ α ˜ 2 ) δ ,   2 ( ϒ α ˜ 2 ) δ ( 2 ϒ α ˜ 2 ) δ + ( ϒ α ˜ 2 ) δ , }
(4) 
α ˜ ε δ = { ( s θ ( p ) δ ,   s t ( p ) δ ) ,   [ p δ ,   q δ ,   r δ ,   s δ ] ; 2 ( Ψ α ˜ 2 ) δ ( 2 Ψ α ˜ ) δ + ( Ψ α ˜ ) δ ,   ( 1 + ϒ α ˜ 2 ) δ ( 1 ϒ α ˜ 2 ) δ ( 1 + ϒ α ˜ 2 ) δ + ( 1 ϒ α ˜ 2 ) δ } .
Example 6.
Let α ˜ = { ( s 2 , s 3 ) [ 0.3 , 0.4 , 0.5 , 0.6 ] ( 0.7 , 0.4 ) } ,   α ˜ 1 = { ( s 1 , s 2 ) [ 0.3 , 0.4 , 0.5 , 0.6 ] ( 0.8 , 0.5 ) } and α ˜ 2 = { ( s 3 , s 3 ) [ 0.5 , 0.3 , 0.4 , 0.4 ] ( 0.8 , 0.3 ) } be any three PTULFNs and δ = 0.4 . Then, we verify the above laws as follows:
(1) 
α ˜ 1 α ˜ 2 = { ( s 1 + s 3 ,   s 2 + s 2 ) [ 0.3 + 0.5 ,   0.4 + 0.3 ,   0.5 + 0.4 ,   0.6 + 0.4 ] ; 0.8 2 + 0.8 2 1 + ( 0.8 ) 2 ( 0.8 ) 2 ,   ( 0.5 ) ( 0.3 ) 1 + ( 1 0.5 2 ) ( 1 0.3 2 ) } = { ( s 4 ,   s 4 ) [ 0.8 ,   0.7 ,   0.9 ,   0.6 + 1.0 ] ; 0.8 2 + 0.8 2 1 + ( 0.8 ) 2 ( 0.8 ) 2 ,   ( 0.5 ) ( 0.3 ) 1 + ( 1 0.5 2 ) ( 1 0.3 2 ) } = { ( s 4 ,   s 4 ) [ 0.8 ,   0.7 ,   0.9 ,   0.6 + 1.0 ] ; ( 1.1313 1.5099 ,   0.15 1.2884 ) } = { ( s 4 ,   s 4 ) [ 0.8 ,   0.7 ,   0.9 ,   0.6 + 1.0 ] ;   ( 0.7492 ,   0.1164 ) }
(2) 
α ˜ 1 ε α ˜ 2 = { ( s 1 s 3 ,   s 2 s 2 ) [ ( 0.3 ) ( 0.5 ) , ( 0.4 ) ( 0.3 ) , ( 0.5 ) ( 0.4 ) , ( 0.6 ) ( 0.4 ) ] ; ( 0.8 ) ( 0.8 ) 1 + ( 1 0.8 2 ) ( 1 0.8 2 ) ,   0.5 2 + 0.3 2 1 + ( 0.5 ) 2 ( 0.3 ) 2 } = { ( s 3 ,   s 4 ) [ 0.15 ,   0.12 ,   0.20 ) ,   0.24 ] ;   ( 0.64 ) 1.1296 ,   0.34 1.0225 } = { ( s 3 ,   s 4 ) [ 0.15 ,   0.12 ,   0.20 ) ,   0.24 ] ;   0.64 1.0628 ,   0.5830 1.0111 } = { ( s 3 ,   s 4 ) [ 0.15 ,   0.12 ,   0.20 ) ,   0.24 ] ; ( 0.6021 ,   0.5765 ) }
(3) 
δ ε . α ˜ = { ( s 0.4 ( 2 ) ,   s 0.4 ( 3 ) ) [ 0.4 ( 0.3 ) ,   0.4 ( 0.4 ) , 0.4 ( 0.5 ) ,   0.4 ( 0.6 ) ] ; ( 1 + 0.7 2 ) 0.4 ( 1 0.7 2 ) 0.4 ( 1 + 0.7 2 ) 0.4 + ( 1 0.7 2 ) 0.4 ,   2 ( 0.4 2 ) 0.4 ( 2 0.4 2 ) 0.4 + ( 0.4 2 ) 0.4 , } = { ( s 0.8 ,   s 0.9 ) [ 0.12 ,   0.16 ,   0.20 ,   0.24 ] ; 1.1729 0.76 0 1.1729 + 0.76 0 ,   0.9600 ( 1.2762 + ( 0.9609 ) , } = { ( s 0.8 ,   s 0.9 ) [ 0.12 ,   0.16 ,   0.20 ,   0.24 ] ; 0.6425 0.9658 ,   0.9797 1.4973 , } = { ( s 0.8 ,   s 0.9 ) [ 0.12 ,   0.16 , 0.20 ,   0.24 ] ;   0.6652 ,   0.6543 , }
(4) 
α ˜ ε δ = { ( s 2 0.4 ,   s 3 0.4 ) ,   [ 0.3 0.4 ,   0.4 0.4 ,   0.5 0.4 ,   0.6 0.4 ] ; 2 ( 0.7 2 ) 0.4 ( 2 0.7 ) 0.4 + ( 0.7 ) 0.4 ,   ( 1 + 0.4 2 ) 0.4 ( 1 0.4 2 ) 0.4 ( 1 + 0.4 2 ) 0.4 + ( 1 0.4 2 ) 0.4 } = { ( s 1.13 ,   s 1.55 ) ,   [ 0.61 ,   0.69 ,   0.75 ,   0.81 ] ; 1.50 ( 1.17 + ( 0.67 ) ,   1.0611 0.9326 1.0611 + 0.9326 } = { ( s 1.13 ,   s 1.55 ) ,   [ 0.61 ,   0.69 ,   0.75 ,   0.81 ] ; 1.2247 1.3564 ,   0.3589 1.4119 } = { ( s 1.13 ,   s 1.55 ) ,   [ 0.61 ,   0.69 , 0.75 ,   0.81 ] ; 0.9029 ,   0.2548 }
Definition 10.
Consider α ˜ = ( s θ ( p ) ,   s t ( p ) ) ,   [ p ,   q ,   r ,   s ] ; [ Ψ α ˜ ,   ϒ α ˜ ] ) be PTULFNs, a score function s is;
s ( α ˜ ) = { ( s θ ( p ) ,   s t ( p ) ) , [ p + q + r + s ] 8 ( Ψ α ˜ 2 ϒ α ˜ 2 ) }   s ( α ˜ ) [ 1 ,   1 ] .
Definition 11.
Suppose α ˜ = ( s θ ( p ) ,   s t ( p ) ) ,   [ p ,   q ,   r ,   s ] ; [ Ψ α ˜ ,   ϒ α ˜ ] ) be PTULNs, an accuracy function h is;
h ( α ˜ ) = { ( s θ ( p ) ,   s t ( p ) ) , [ p + q + r + s ] 8 ( Ψ α ˜ 2 + ϒ α ˜ 2 ) }   s ( α ˜ ) [ 1 ,   1 ] .
Theorem 1.
Let α ˜ 1 ,   α ˜ 2 and α ˜ be three Pythagorean trapezoidal uncertain linguistic fuzzy Einstein fuzzy (PTULFENs) and n , m R + ,
(1) 
α ˜ 1 α ˜ 2
(2) 
α ˜ 1 α ˜ 2
(3) 
δ ε . α ˜
(4) 
α ˜ ε δ are also PTULFENs.
Proof. 
(1), (2) Easy to proof.
(3). Let n be a positive integer and α ˜ is PTULFE. Then,
n ε . α ˜ =   α ˜ ε α ˜ ε ε α ˜ n .
To prove the above theorem, we use mathematical induction. First, Equation ( 9 ) holds for n = 2 .
Since
α ˜ + α ˜ = ( ( s θ ( p ) + s θ ( p ) ,   s t ( p ) + s t ( p ) ) , [ p + p ,   q + q ,   r + r ,   s + s ] ; ( Ψ α ˜ ) 2 + ( Ψ α ˜ ) 2 1 + ( Ψ α ˜ ) 2 ( Ψ α ˜ ) 2 ,   ϒ α ˜ ϒ α ˜ 1 + ( 1 ϒ α ˜ 2 ) ( 1 ϒ α ˜ 2 ) ) = ( ( 2 s θ ( p ) ,   2 s t ( p ) ) ,   [ 2 p ,   2 q ,   2 r ,   2 s ] ; ( 1 + Ψ α ˜ 2 ) 2 ( 1 Ψ α ˜ 2 ) 2 ( 1 + Ψ α ˜ 2 ) 2 + ( 1 Ψ α ˜ 2 ) 2 ,   2 ( ϒ α ˜ 2 ) 2 ( 2 ϒ α ˜ ) 2 + ( ϒ α ˜ ) 2 ) = 2 ε . α ˜ .
Therefore, Equation (9) holds for n = 2 . If Equation (9) holds for n = k . Then, n ε . α ˜ =   α ˜ ε α ˜ ε ε α ˜ . n When n = k + 1 , we have
α ˜ ε α ˜ ε ε α ˜ n + 1 =   α ˜ ε α ˜ ε ε α ˜ ε α ˜ = n   n ε . α ˜ ε α ˜ = ( n s θ ( p ) ,   n s t ( p ) [ n p ,   n q ,   n r ,   n s ] ; ( 1 + Ψ α ˜ 2 ) n ( 1 Ψ α ˜ 2 ) n ( 1 + Ψ α ˜ 2 ) n + ( 1 Ψ α ˜ 2 ) n ,   2 ( ϒ α ˜ 2 ) n ( 2 ϒ α ˜ 2 ) n + ( ϒ α ˜ 2 ) n ) ε ( s θ ( p ) ,   s t ( p ) ) ,   [ p ,   q ,   r ,   s ] ;   Ψ α ˜ ,   ϒ α ˜ )   , = ( ( n + 1 ) s θ ( p ) , ( n + 1 ) s t ( p ) ) , [ ( n + 1 ) p , ( n + 1 ) q , ( n + 1 ) r , ( n + 1 ) s ] ; ( 1 + Ψ α ˜ 2 ) n + 1 ( 1 Ψ α ˜ 2 ) n + 1 ( 1 + Ψ α ˜ 2 ) n + 1 + ( 1 Ψ α ˜ 2 ) n + 1 ,   2 ( ϒ α ˜ 2 ) n + 1 ( 2 ϒ α ˜ 2 ) n + 1 + ( ϒ α ˜ 2 ) n + 1 ) , = ( n + 1 ) ε . α ˜ .
Hence Equation (9) holds for n = k + 1 , therefore Equation (9) holds for all n .
(4). Let m be any positive integer and α ˜ is Pythagorean trapezoidal fuzzy number. Then,
α ˜ ε m =   α ˜ ε α ˜ ε ε α ˜ . m
First, we show that Equation (9) holds for m = 2 . Since
α ˜ ε α ˜ = ( ( s θ ( p ) . s θ ( p ) ,   s t ( p ) . s t ( p ) ) ,   [ p . p ,   q . q ,   r . r ,   s . s ] ; Ψ α ˜ Ψ α ˜ 1 + ( 1 Ψ α ˜ 2 ) ( 1 Ψ α ˜ 2 ) ( ϒ α ˜ ) 2 + ( ϒ α ˜ ) 2 1 + ( ϒ α ˜ ) 2 ( ϒ α ˜ ) 2 ) = ( ( s θ ( p ) 2 ,   s t ( p ) 2 ) ,   [ p 2 ,   q 2 ,   r 2 ,   s 2 ] ; 2 ( Ψ α ˜ 2 ) 2 ( 2 Ψ α ˜ 2 ) 2 + ( ϒ α ˜ 2 ) 2 ( 1 + ϒ α ˜ 2 ) 2 ( 1 ϒ α ˜ 2 ) 2 ( 1 + ϒ α ˜ 2 ) 2 + ( 1 ϒ α ˜ 2 ) 2 ) = α ˜ ε 2 .
Therefore, Equation (9) holds for m = 2 . If Equation (9) holds for m = k , such that
α ˜ 1 ε m = α ˜ 1 ε α ˜ 1 ε ε α ˜ 1 m .
Then, we have
α ˜ ε α ˜ ε ε α ˜ m + 1 =   α ˜ ε α ˜ ε ε α ˜ ε α ˜ = m   α ˜ ε m ε α ˜ = ( ( s θ ( p ) m ,   s t ( p ) m ) ,   [ p m ,   q m ,   r m ,   s m ] ; 2 ( Ψ α ˜ 2 ) m ( 2 Ψ α ˜ 2 ) m + ( Ψ α ˜ 2 ) m ( 1 + ϒ α ˜ 2 ) m ( 1 ϒ α ˜ 2 ) m ( 1 + ϒ α ˜ 2 ) m + ( 1 ϒ α ˜ 2 ) m , ) ε ( s θ ( p ) ,   s t ( p ) ) ,   [ p ,   q ,   r ,   s ] ;   Ψ α ˜ ,   ϒ α ˜ )   = ( ( s θ ( p ) m + 1 ,   s t ( p ) m + 1 ) [ p ( m + 1 ) ,   q ( m + 1 ) ,   r ( m + 1 ) ,   s ( m + 1 ) ] ; 2 ( Ψ α ˜ 2 ) m + 1 ( 2 Ψ α ˜ 2 ) m + 1 + ( Ψ α ˜ 2 ) m + 1 . ( 1 + ϒ α ˜ 2 ) m + 1 ( 1 ϒ α ˜ 2 ) m + 1 ( 1 + ϒ α ˜ 2 ) m + 1 + ( 1 ϒ α ˜ 2 ) m + 1 ) = α ˜ 1 ε m + 1 .
Hence Equation (9) holds for m = k + 1 . Therefore, Equation (9) holds for all m . The Einstein operational laws of PTF numbers satisfy the following properties:
Theorem 2.
α ˜ 1 = { ( s θ ( p 1 ) ,   s t ( p 1 ) ) , [ p 1 ,   q 1 ,   r 1 ,   s 1 ] ;   Ψ α ˜ 1 ,   ϒ α ˜ 1 } and α ˜ 2 = { ( s θ ( p 2 ) ,   s t ( p 2 ) ) , [ p 2 ,   q 2 ,   r 2 ,   s 2 ] ;   Ψ α ˜ 2 ,   ϒ α ˜ 2 } be any two PTULFNs. Then, the operational laws between α ˜ 1 and α ˜ 2 are shown as follows:
(1) 
α ˜ 1 α ˜ 2 = α ˜ 2 α ˜ ;
(2) 
δ ( α ˜ 1 α ˜ 2 ) = δ α ˜ 1 δ α ˜ 2     δ 0 ;
(3) 
δ 1 α ˜ 1 δ 2 α ˜ 1 = ( δ 1 + δ 2 ) α ˜ 1    δ 1 ,   δ 2 0 .
Proof. 
(1) Result is obvious.
(2) By Einstein operational laws (1) in Definition 9 we have
α ˜ 1 α ˜ 2 = { ( s θ ( p 1 ) + s θ ( p 1 ) ,   s t ( p 1 ) + s t ( p 2 ) ) , [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; ( 1 + Ψ α ˜ 1 2 ) ( 1 + Ψ α ˜ 2 2 ) ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) ( 1 + Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) + ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) , 2 ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) ( 2 ϒ α ˜ 1 2 ) ( 2 ϒ α ˜ 2 2 ) + ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) } ,
α ˜ 1 α ˜ 2 = { ( s θ ( p 1 ) + s θ ( p 1 ) ,   s t ( p 1 ) + s t ( p 2 ) ) , [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; ( 1 + Ψ α ˜ 1 2 ) ( 1 + Ψ α ˜ 2 2 ) ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) ( 1 + Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) + ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) , 2 ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) ( 2 ϒ α ˜ 1 2 ) ( 2 ϒ α ˜ 2 2 ) + ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) } .
We can write the above equation into the following form:
α ˜ 1 α ˜ 2 = [ ( s θ ( p 1 ) + s θ ( p 1 ) ,   s t ( p 1 ) + s t ( p 2 ) ) , [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; ( 1 + Ψ α ˜ 1 2 ) ( 1 + Ψ α ˜ 2 2 ) ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) ( 1 + Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) + ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) , 2 ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) ( 2 ϒ α ˜ 1 2 ) ( 2 ϒ α ˜ 2 2 ) + ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) ]
Let x = ( 1 + Ψ α ˜ 1 2 ) ( 1 + Ψ α ˜ 2 2 ) ,   y = ( 1 Ψ α ˜ 1 2 ) ( 1 Ψ α ˜ 2 2 ) , z = ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) ,   g = ( 2 ϒ α ˜ 1 2 ) ( 2 ϒ α ˜ 2 2 ) .
Then,
α ˜ 1 + α ˜ 2 = { ( s θ ( p 1 ) + s θ ( p 1 ) ,   s t ( p 1 ) + s t ( p 2 ) ) , [ p 1 + p 2 ,   q 1 + q 2 ,   r 1 + r 2 ,   s 1 + s 2 ] ; x y x + y ,   2 z g + z } .
We have
δ ( α ˜ 1 α ˜ 2 ) = ( ( s δ ( θ ( p 1 ) + θ ( p 2 ) ) ,   s δ ( t ( p 1 ) + t ( p 2 ) ) , [ δ ( p 1 + p 2 ) ,   δ ( q 1 + q 2 ) ,   δ ( r 1 + r 2 ) ,   δ ( s 1 + s 2 ) ] ; ( 1 + x y x y ) δ ( 1 x y x y ) δ ( 1 + x y x y ) δ + ( 1 x y x y ) δ , 2 ( 2 z g + z ) δ ( 2 2 z g + z ) δ + ( 2 z g + z ) δ ) = ( ( s δ ( θ ( p 1 ) + θ ( p 2 ) ) ,   s δ ( t ( p 1 ) + t ( p 2 ) ) , [ δ ( p 1 + p 2 ) ,   δ ( q 1 + q 2 ) ,   δ ( r 1 + r 2 ) ,   δ ( s 1 + s 2 ) ] ; ( x ) δ ( y ) δ ( x ) δ + ( y ) δ ,   2 ( z ) δ ( g ) δ + ( z ) δ ) = ( ( s δ ( θ ( p 1 ) + θ ( p 2 ) ) ,   s δ ( t ( p 1 ) + t ( p 2 ) ) , [ δ ( p 1 + p 2 ) ,   δ ( q 1 + q 2 ) ,   δ ( r 1 + r 2 ) ,   δ ( s 1 + s 2 ) ] ; ( 1 + Ψ α ˜ 1 2 ) δ ( 1 + Ψ α ˜ 2 2 ) δ ( 1 Ψ α ˜ 1 2 ) δ ( 1 Ψ α ˜ 2 2 ) δ ( 1 + Ψ α ˜ 1 2 ) δ ( 1 + Ψ α ˜ 2 2 ) δ + ( 1 Ψ α ˜ 1 2 ) δ ( 1 Ψ α ˜ 2 2 ) δ , 2 ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) δ ( 2 ϒ α ˜ 1 2 ) δ ( 2 ϒ α ˜ 2 2 ) δ + ( ϒ α ˜ 1 2 ) δ ( ϒ α ˜ 2 2 ) δ )
Let δ α ˜ 1 = ( ( s θ δ ( p 1 ) ,   s t δ ( p 1 ) ) , [ δ p 1 ,   δ q 1 ,   δ r 1 ,   δ s 1 ] ; ( 1 + Ψ α ˜ 1 2 ) δ ( 1 Ψ α ˜ 1 2 ) δ ( 1 + Ψ α ˜ 1 2 ) δ + ( 1 Ψ α ˜ 1 2 ) δ ,   2 ( ϒ α ˜ 1 2 ) δ ( 2 ϒ α ˜ 1 2 ) δ + ( ϒ α ˜ 1 2 ) δ , ) , δ α ˜ 2 = ( ( s θ δ ( p 2 ) ,   s t δ ( p 2 ) ) , [ δ p 2 ,   δ q 2 ,   δ r 2 ,   δ s 2 ] ; ( 1 + Ψ α ˜ 2 2 ) δ ( 1 Ψ α ˜ 2 2 ) δ ( 1 + Ψ α ˜ 2 2 ) δ + ( 1 Ψ α ˜ 2 2 ) δ ,   2 ( ϒ α ˜ 2 2 ) δ ( 2 ϒ α ˜ 2 2 ) δ + ( ϒ α ˜ 2 2 ) δ , ) .
We consider
x 1 = ( 1 + Ψ α ˜ 1 2 ) δ   ,   y 1 = ( 1 Ψ α ˜ 1 2 ) δ ,   z 1 = ( ϒ α ˜ 1 2 ) δ x 2 = ( 1 + Ψ α ˜ 2 2 ) δ   ,   g 2 = ( 2 ϒ α ˜ 2 2 ) δ ,   z 2 = ( ϒ α ˜ 2 2 ) δ .
Then
δ α ˜ 1 = ( ( s θ δ ( p 1 ) ,   s t δ ( p 1 ) ) ,   [ δ p 1 ,   δ q 1 ,   δ r 1 ,   δ s 1 ] ;   x 1 y 1 x 1 + y 1 ,   2 z 1 g 1 + z 1 ) δ α ˜ 2 = ( ( s θ δ ( p 2 ) ,   s t δ ( p 2 ) ) ,   [ δ p 2 ,   δ q 2 ,   δ r 2 ,   δ s 2 ] ;   x 2 y 2 x 2 + y 2 ,   2 z 2 g 2 + z 2 ) .
By property (1) and (3), and Definition 9,
δ α ˜ 1 δ α ˜ 2 = ( ( s θ δ ( p 1 ) ,   s t δ ( p 1 ) ) ,   [ δ p 1 ,   δ q 1 ,   δ r 1 ,   δ s 1 ] ; x 1 y 1 x 1 + y 1 ,   2 z 1 g 1 + z 1 ) ( ( s θ δ ( p 2 ) ,   s t δ ( p 2 ) ) ,   [ δ p 2 ,   δ q 2 ,   δ r 2 ,   δ s 2 ] ; x 2 y 2 x 2 + y 2 ,   2 z 2 g 2 + z 2 ) = ( ( s θ δ ( p 1 ) + s θ δ ( p 2 ) ,   s t δ ( p 1 ) + s t δ ( p 2 ) ) , [ δ p 1 + δ p 2 ,   δ q 1 + δ q 2 , δ r 1 + δ r 2 ,   δ s 1 + δ s 2 ] ; x 1 y 1 x 1 + y 1 x 2 y 2 x 2 + y 2 1 + x 1 y 1 x 1 + y 1 . x 2 y 2 x 2 + y 2 ,   2 z 1 g 1 + z 1 . 2 z 2 g 2 + z 2 1 + ( 1 2 z 1 g 1 + z 1 ) . ( 1 2 z 2 g 2 + z 2 ) ) ,
= ( ( s θ δ ( p 1 + p 2 ) ,   s t δ ( p 1 + p 2 ) ) , [ δ ( p 1 + p 2 ) ,   δ ( q 1 + q 2 ) , δ ( r 1 + r 2 ) ,   δ ( s 1 + s 2 ) ] ; x 1 x 2 y 1 y 2 x 1 x 2 + y 1 y 2 ,   2 z 1 z 2 g 1 g 2 + z 1 z 2 ) = ( ( s θ δ ( p 1 + p 2 ) ,   s t δ ( p 1 + p 2 ) ) , [ δ ( p 1 + p 2 ) ,   δ ( q 1 + q 2 ) , δ ( r 1 + r 2 ) ,   δ ( s 1 + s 2 ) ] ; ( 1 + Ψ α ˜ 1 2 ) δ ( 1 + Ψ α ˜ 2 2 ) δ ( 1 Ψ α ˜ 1 2 ) δ ( 1 Ψ α ˜ 2 2 ) δ ( 1 + Ψ α ˜ 1 2 ) δ ( 1 + Ψ α ˜ 2 2 ) δ + ( 1 Ψ α ˜ 1 2 ) δ ( 1 Ψ α ˜ 2 2 ) δ , 2 ( ϒ α ˜ 1 2 ϒ α ˜ 2 2 ) δ ( 2 ϒ α ˜ 1 2 ) δ ( 2 ϒ α ˜ 2 2 ) δ + ( ϒ α ˜ 1 2 ) δ ( ϒ α ˜ 2 2 ) δ ) .
Therefore, it is proved that δ ( α ˜ 1 α ˜ 2 ) = δ α ˜ 1 δ α ˜ 2 .
(3) Since
δ 1 α ˜ 1 = ( ( s θ δ 1 ( p 1 ) ,   s t δ 1 ( p 1 ) ) , [ δ 1 p 1 ,   δ 1 q 1 ,   δ 1 r 1 ,   δ 1 s 1 ] ; ( 1 + Ψ α ˜ 1 2 ) δ 1 ( 1 Ψ α ˜ 1 2 ) δ 1 ( 1 + Ψ α ˜ 1 2 ) δ 1 + ( 1 Ψ α ˜ 1 2 ) δ 1 ,   2 ( ϒ α ˜ 1 2 ) δ 1 ( 2 ϒ α ˜ 1 2 ) δ 1 + ( ϒ α ˜ 1 2 ) δ 1 , ) δ 2 α ˜ 1 = ( ( s θ δ 2 ( p 1 ) ,   s t δ 2 ( p 1 ) ) , [ δ 2 p 1 ,   δ 2 q 1 ,   δ 2 r 1 ,   δ 2 s 1 ] ; ( 1 + Ψ α ˜ 1 2 ) δ 2 ( 1 Ψ α ˜ 1 2 ) δ 2 ( 1 + Ψ α ˜ 1 2 ) δ 2 + ( 1 Ψ α ˜ 1 2 ) δ 2 ,   2 ( ϒ α ˜ 1 2 ) δ 2 ( 2 ϒ α ˜ 1 2 ) δ 2 + ( ϒ α ˜ 1 2 ) δ 2 , )
where δ 1 ,   δ 1 0 .
Let
x 1 = ( 1 + Ψ α ˜ 1 2 ) δ 1   ,   y 1 = ( 1 Ψ α ˜ 1 2 ) δ 1 , z 1 = ( ϒ α ˜ 1 2 ) δ 1 ,   g 1 = ( 2 ϒ α ˜ 1 2 ) δ 1 x 2 = ( 1 + Ψ α ˜ 1 2 ) δ 2   ,   y 2 = ( 1 Ψ α ˜ 1 2 ) δ 2 , z 2 = ( ϒ α ˜ 1 2 ) δ 2 ,   g 2 = ( 2 ϒ α ˜ 1 2 ) δ 2 .
Then, we have
δ 1 α ˜ 1 = ( ( s θ δ 1 ( p 1 ) ,   s t δ 1 ( p 1 ) ) ,   [ δ 1 p 1 ,   δ 1 q 1 ,   δ 1 r 1 ,   δ 1 s 1 ] ; x 1 y 1 x 1 + y 1 ,   2 z 1 g 1 + z 1 ) δ 2 α ˜ 1 = ( ( s θ δ 2 ( p 1 ) ,   s t δ 2 ( p 1 ) ) ,   [ δ 2 p 1 ,   δ 2 q 1 ,   δ 2 r 1 ,   δ 2 s 1 ] ; x 2 y 2 x 2 + y 2 ,   2 z 2 g 2 + z 2 ) .
Using (1) and (3) with Definition 9, we have
δ 1 α ˜ 1 δ 2 α ˜ 1 = ( ( s θ δ 1 ( p 1 ) ,   s t δ 1 ( p 1 ) ) ,   [ δ 1 p 1 ,   δ 1 q 1 ,   δ 1 r 1 ,   δ 1 s 1 ] ; x 1 y 1 x 1 + y 1 ,   2 z 1 g 1 + z 1 ) ( ( s θ δ 2 ( p 1 ) ,   s t δ 2 ( p 1 ) ) ,   [ δ 2 p 1 ,   δ 2 q 1 ,   δ 2 r 1 ,   δ 2 s 1 ] ; x 2 y 2 x 2 + y 2 ,   2 z 2 g 2 + z 2 )
= ( ( s θ δ 1 ( p 1 ) + s θ δ 2 ( p 1 ) ,   s t δ 1 ( p 1 ) + s t δ 2 ( p 1 ) ) , [ δ 1 p 1 + δ 2 p 1 ,   δ 1 q 1 + δ 2 q 1 , δ 1 r 1 + δ 2 r 1 ,   δ 1 s 1 + δ 2 s 1 ] ; x 1 y 1 x 1 + y 1 x 2 y 2 x 2 + y 2 1 + x 1 y 1 x 1 + y 1 . x 2 y 2 x 2 + y 2 ,   2 z 1 g 1 + z 1 . 2 z 2 g 2 + z 2 1 + ( 1 2 z 1 g 1 + z 1 ) . ( 1 2 z 2 g 2 + z 2 ) ) = ( ( s θ ( δ 1 + δ 2 ) p 1 ) ,   s t ( δ 1 + δ 2 ) p 1 ) ) , [ p 1 ( δ 1 + δ 2 ) ,   q 1 ( δ 1 + δ 2 ) , r 1 ( δ 1 + δ 2 ) ,   s 1 ( δ 1 + δ 2 ) ] ; x 1 x 2 y 1 y 2 x 1 x 2 + y 1 y 2 ,   2 z 1 z 2 g 1 g 2 + z 1 z 2 )
= ( ( s θ ( δ 1 + δ 2 ) p 1 ) ,   s t ( δ 1 + δ 2 ) p 1 ) ) , [ ( δ 1 + δ 2 )   p 1 ,   ( δ 1 + δ 2 )   q 1 , ( δ 1 + δ 2 )   r 1 ,   ( δ 1 + δ 2 )   s 1 ] ; ( 1 + Ψ α ˜ 1 2 ) δ 1 + δ 2 ( 1 Ψ α ˜ 1 2 ) δ 1 + δ 2 ( 1 + Ψ α ˜ 1 2 ) δ 1 + δ 2 + ( 1 Ψ α ˜ 1 2 ) δ 1 + δ 2 , 2 ( ϒ α ˜ 1 2 ) δ 1 + δ 2 ( 2 ϒ α ˜ 1 2 ) δ 1 + δ 2 + ( ϒ α ˜ 1 2 ) δ 1 + δ 2 ) = ( δ 1 + δ 2 )   α ˜ 1 .

3. Pythagorean Trapezoidal Uncertain Linguistic Fuzzy Einstein Aggregation Operators

In this section, we suggested some new aggregation information using Einstein operation laws and studied their important properties.

Pythagorean Trapezoidal Uncertain Linguistic Fuzzy Einstein Averaging Aggregation Operators

Definition 12.
Consider α ˜ j = { ( s θ ( p j ) ,   s t ( p j ) ) ,   [ p j ,   q j ,   r j ,   s j ] ;   Ψ α ˜ j ,   ϒ α ˜ j } a group of PTLUFNs. Then ( P T U L F E W A ) operator is n dimension mapping P T U L F E W A    :    Ω n > Ω , defined is
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ j )   ,
where w = ( w 1 ,   w 2 , w n ) T is the weight vector of α ˜ j ( j = 1 ,   2 ,   n ) with w j [ 0 ,   1 ] and j = 1 n w j = 1 .
Theorem 3.
Let α ˜ j ( j = 1 ,   2 , ,   n ) be a collection of PTULFNs, then the value aggregated by using P T U L F E W A operator is also a PTULFNs;
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ j ) = ( ( j = 1 n s w j θ ( p j ) ,   j = 1 n s w j t ( p j ) ) , [ j = 1 n w j p j ,   j = 1 n w j q j ,   j = 1 n w j r j ,   j = 1 n w j s j ] ; j = 1 n ( 1 + Ψ α ˜ j 2 ) w j j = 1 n ( 1 Ψ α ˜ j 2 ) w j j = 1 n ( 1 + Ψ α ˜ j 2 ) w j + j = 1 n ( 1 Ψ α ˜ j 2 ) w j , 2 j = 1 n ( ϒ α ˜ j 2 ) w j j = 1 n ( 2 ϒ α ˜ j 2 ) w j + j = 1 n ( ϒ α ˜ j 2 ) w j )
where w = ( w 1 ,   w 2 , w n ) T is the weight vector of α ˜ j ( j = 1 ,   2 ,   n ) , with w j [ 0 ,   1 ] and j = 1 n w j = 1 .
Proof. 
In the following, we prove the second result by using mathematical induction on n .
(1) We first prove that Equation (11) holds for n = 2 . Since
w 1 α ˜ 1 = ( ( s w 1 θ ( p 1 ) ,   s w 1 t ( p 1 ) ) ,   [ w 1 p 1 ,   w 1 q 1 ,   w 1 r 1 ,   w 1 s 1 ] ; ( 1 + Ψ α ˜ 1 2 ) w 1 ( 1 Ψ α ˜ 1 2 ) w 1 ( 1 + Ψ α ˜ 1 2 ) w 1 + ( 1 Ψ α ˜ 1 2 ) w 1 , 2 ( ϒ α ˜ 1 2 ) w 1 ( 2 ϒ α ˜ 1 2 ) w 1 + ( ϒ α ˜ 1 2 ) w 1 )
And
w 2 α ˜ 2 = ( ( s w 2 θ ( p 2 ) ,   s w 2 t ( p 2 ) ) ,   [ w 2 p 2 ,   w 2 q 2 ,   w 2 r 2 ,   w 2 s 2 ] ; ( 2 + Ψ α ˜ 2 2 ) w 2 ( 2 Ψ α ˜ 2 2 ) w 2 ( 2 + Ψ α ˜ 2 2 ) w 2 + ( 2 Ψ α ˜ 2 2 ) w 2 , 2 ( ϒ α ˜ 2 2 ) w 2 ( 2 ϒ α ˜ 2 2 ) w 2 + ( ϒ α ˜ 2 2 ) w 2 )
Let
x 1 = ( 1 + Ψ α ˜ 1 2 ) w 1 ,   y 1 = ( 1 Ψ α ˜ 1 2 ) w 1 , z 1 = ( ϒ α ˜ 1 2 ) w 1 ,   g 1 = ( 2 ϒ α ˜ 1 2 ) w 1 , x 2 = ( 1 + Ψ α ˜ 2 2 ) w 2 ,   y 2 = ( 1 Ψ α ˜ 2 2 ) w 2 , z 2 = ( ϒ α ˜ 2 2 ) w 2 ,   g 2 = ( 2 ϒ α ˜ 2 2 ) w 2 .
Then, w 1 α ˜ 1 = ( ( s w 1 θ ( p 1 ) ,   s w 1 t ( p 1 ) ) , [ w 1 p 1 ,   w 1 q 1 ,   w 1 r 1 ,   w 1 s 1 ] ;   x 1 y 1 x 1 + y 1 ,   2 z 1 g 1 + z 1 ) .
And
w 2 α ˜ 2 = ( s w 2 θ ( p 2 ) ,   s w 2 t ( p 2 ) ) , [ w 2 p 2 ,   w 2 q 2 ,   w 2 r 2 ,   w 2 s 2 ] ;   x 2 y 2 x 2 + y 2 ,   2 z 2 g 2 + z 2 ) .
Thus, by ( 3 ) and Definition 9,
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 ) = w 1 α ˜ 1 ε w 2 α ˜ 2 = ( ( s w 1 θ ( p 1 ) + s w 2 θ ( p 2 ) ,   s w 1 t ( p 1 ) + s w 2 t ( p 2 ) ) , [ w 1 p 1 + w 2 p 2 ,   w 1 q 1 + w 2 q 2 , w 1 r 1 + w 2 r 2 ,   w 1 s 1 + w 2 s 2 ] ; x 1 x 2 y 1 y 2 x 1 x 2 + y 1 y 2 ,   2 z 1 z 2 g 1 g 2 + z 1 z 2 )   = ( ( j = 1 2 s w j θ ( p j ) ,   j = 1 2 s w j t ( p j ) ) , [ j = 1 2 w j p j ,   j = 1 2 w j q j ,   j = 1 2 w j r j ,   j = 1 2 w j s j ] ; j = 1 2 ( 1 + Ψ α ˜ j 2 ) w j j = 1 2 ( 1 Ψ α ˜ j 2 ) w j j = 1 2 ( 1 + Ψ α ˜ j 2 ) w j + j = 1 2 ( 1 Ψ α ˜ j 2 ) w j , 2 j = 1 2 ( ϒ α ˜ j 2 ) w j j = 1 2 ( 2 ϒ α ˜ j 2 ) w j + j = 1 2 ( ϒ α ˜ j 2 ) w j ) .
(2) If Equation (11) holds for n = k , that is
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ k )   = ε j = 1 k ( w j α ˜ j ) = ( ( j = 1 k s w j θ ( p j ) ,   j = 1 k s w j t ( p j ) ) , [ j = 1 k w j p j ,   j = 1 k w j q j ,   j = 1 k w j r j ,   j = 1 k w j s j ] ; j = 1 k ( 1 + Ψ α ˜ j 2 ) w j j = 1 k ( 1 Ψ α ˜ j 2 ) w j j = 1 k ( 1 + Ψ α ˜ j 2 ) w j + j = 1 k ( 1 Ψ α ˜ j 2 ) w j , 2 j = 1 k ( ϒ α ˜ j 2 ) w j j = 1 k ( 2 ϒ α ˜ j 2 ) w j + j = 1 k ( ϒ α ˜ j 2 ) w j )
when, n = k + 1 , we have
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ k + 1 ) = P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ k ) ε ( w k + 1 α ˜ k + 1 ) = P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ k ) ε = ( ( s w k + 1 θ ( p k + 1 ) ,   s w k + 1 t ( p k + 1 ) ) , [ w k + 1 p k + 1 ,   w k + 1 q k + 1 , w k + 1 r k + 1 ,   w k + 1 s k + 1 , ] ; ( 1 + Ψ α ˜ k + 1 2 ) w k + 1 ( 1 Ψ α ˜ k + 1 2 ) w k + 1 ( 1 + Ψ α ˜ k + 1 2 ) w k + 1 + ( 1 Ψ α ˜ k + 1 2 ) w k + 1 , 2 ( ϒ α ˜ k + 1 2 ) w k + 1 ( 2 ϒ α ˜ k + 1 2 ) w k + 1 + ( ϒ α ˜ k + 1 2 ) w k + 1 )   .
Let
x 1 = j = 1 k ( 1 + Ψ α ˜ j 2 ) w j ,   y 1 = j = 1 k ( 1 Ψ α ˜ j ) w j , z 1 = j = 1 k ( ϒ α ˜ j 2 ) w j ,   g 1 = j = 1 k ( 2 ϒ α ˜ j 2 ) w j ,   x 2 = ( 1 + Ψ α ˜ k + 1 2 ) w j ,   y 2 = ( 1 Ψ α ˜ k + 1 2 ) w j , z 2 = ( ϒ α ˜ k + 1 2 ) w j ,   g 2 = ( 2 ϒ α ˜ k + 1 2 ) w j .
Then, by ( 3 ) and Definition 9,
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ k + 1 ) = P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ k ) ε ( w k + 1 α ˜ k + 1 ) , = ( ( j = 1 k s w j θ ( p j ) ,   j = 1 k s w j t ( p j ) ) , [ j = 1 k w j p j ,   j = 1 k w j q j ,   j = 1 k w j r j ,   j = 1 k w j s j ] ; x 1 y 1 x 1 + y 1 ,   2 z 1 g 1 + z 1 , ) ε ( ( s w k + 1 θ ( p k + 1 ) ,   s w k + 1 t ( p k + 1 ) ) , [ w k + 1 p k + 1 ,   w k + 1 q k + 1 , w k + 1 r k + 1 ,   w k + 1 s k + 1 , ] ; x 2 y 2 x 2 + y 2 ,   2 z 2 g 2 + z 2 ) ,
= ( ( j = 1 k + 1 s w j θ ( p j ) ,   j = 1 k + 1 s w j t ( p j ) ) , [ j = 1 k + 1 w j p j ,   j = 1 k + 1 w j q j ,   j = 1 k + 1 w j r j ,   j = 1 k + 1 w j s j ] ; x 1 x 2 y 1 y 2 x 1 x 2 + y 1 y 2 ,   2 z 1 z 2 g 1 g 2 + z 1 z 2 , ) = ( ( j = 1 k + 1 s w j θ ( p j ) ,   j = 1 k + 1 s w j t ( p j ) ) , [ j = 1 k + 1 w j p j ,   j = 1 k + 1 w j q j ,   j = 1 k + 1 w j r j ,   j = 1 k + 1 w j s j ] ; j = 1 k + 1 ( 1 + Ψ α ˜ j 2 ) w j j = 1 k + 1 ( 1 Ψ α ˜ j 2 ) w j j = 1 k + 1 ( 1 + Ψ α ˜ j 2 ) w j + j = 1 k + 1 ( 1 Ψ α ˜ j 2 ) w j , 2 j = 1 k + 1 ( ϒ α ˜ j 2 ) w j j = 1 k + 1 ( 2 ϒ α ˜ j 2 ) w j + j = 1 k + 1 ( ϒ α ˜ j 2 ) w j , )   .
Theorem 4.
Let α ˜ j ( j = 1 ,   2 , ,   n ) be a collection of P T U L F E N s , where w = ( w 1 ,   w 2 , ,   w n , ) T is the weighting vector of α ˜ j ( j = 1 ,   2 , ,   n ) , with w j [ 0 ,   1 ] and j = 1 n w j = 1 . Then, the P T U L F E W A operator satisfies the following properties:
Proof. 
(1) ( Idempotency ) If all α ˜ j ( j = 1 ,   2 , ,   n ) are equal, i.e., α ˜ j = α ˜ for all j , then
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = α ˜ .
By Definition 11, we have
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = w 1 α ˜ 1 ε w 2 α ˜ 2 ε ε w n α ˜ n , = w 1 α ˜ ε w 2 α ˜ ε ε w n α ˜ , = j = i n w j α ˜ = α ˜ .
(2) ( Boundray ) Let α ˜ min = min { α ˜ 1 ,   α ˜ 2 , ,   α ˜ n } and α ˜ max = max { α ˜ 1 ,   α ˜ 2 , ,   α ˜ n } , then
α ˜ min P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) α ˜ max .
Let
f ( x ) = 1 x 2 1 + x 2 , x [ 0 ,   1 ] ;   then   f / ( x ) = 2 x ( 1 + x 2 ) 2 1 + x 2 1 x 2 < 0 .
Since f ( x ) is decreasing function Ψ α ˜ min Ψ α ˜ j Ψ α ˜ max for all j ,
Then
f ( Ψ α ˜ max ) f ( Ψ α ˜ j ) f ( Ψ α ˜ min ) ;
( 1 Ψ α ˜ max 2 1 + Ψ α ˜ max 2 ) ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) ( 1 Ψ α ˜ min 2 1 + Ψ α ˜ min 2 ) , ( 1 Ψ α ˜ max 2 1 + Ψ α ˜ max 2 ) w j ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j ( 1 Ψ α ˜ min 2 1 + Ψ α ˜ min 2 ) w j , j = 1 n ( 1 Ψ α ˜ max 2 1 + Ψ α ˜ max 2 ) w j j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j j = 1 n ( 1 Ψ α ˜ min 2 1 + Ψ α ˜ min 2 ) w j , ( 1 Ψ α ˜ max 2 1 + Ψ α ˜ max 2 ) j = 1 n w j j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j ( 1 Ψ α ˜ min 2 1 + Ψ α ˜ min 2 ) j = 1 n w j ,
( 1 Ψ α ˜ max 2 1 + Ψ α ˜ max 2 ) j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j ( 1 Ψ α ˜ min 2 1 + Ψ α ˜ min 2 ) , ( 1 Ψ α ˜ max 2 1 + Ψ α ˜ max 2 ) + 1 j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j + 1 ( 1 Ψ α ˜ min 2 1 + Ψ α ˜ min 2 ) + 1 , ( 2 1 + Ψ α ˜ max 2 ) j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j + 1 ( 2 1 + Ψ α ˜ min 2 ) , ( 1 + Ψ α ˜ max 2 2 ) 1 j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j + 1 ( 1 + Ψ α ˜ min 2 2 ) , 1 + Ψ α ˜ max 2 2 j = 1 n ( 1 Ψ α ˜ 2 1 + Ψ α ˜ 2 ) w j + 1 1 Ψ α ˜ max 2 , Ψ α ˜ max j = 1 n ( 1 + Ψ α ˜ j 2 ) w j j = 1 n ( 1 Ψ α ˜ j 2 ) w j j = 1 n ( 1 + Ψ α ˜ j 2 ) w j + j = 1 n ( 1 Ψ α ˜ j 2 ) w j Ψ α ˜ min .
Again suppose g ( y ) = 2 y 2 y 2 ,   y ( 0 ,   1 ] , then g / ( y ) = 2 y 3 y 2 2 y 2 < 0 . Thus g ( y ) is a decreasing function. Since ϒ α ˜ max ϒ α ˜ j ϒ α ˜ min for all j , where ϒ α ˜ max > 0 , then g ( ϒ α ˜ min ) ϒ α ˜ j g ( ϒ α ˜ max ) , therefore
( 2 ϒ α ˜ min 2 ) ( ϒ α ˜ min 2 ) ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ( 2 ϒ α ˜ max 2 ) ( ϒ α ˜ max 2 ) , ( ( 2 ϒ α ˜ min 2 ) ( ϒ α ˜ min 2 ) ) w j ( ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ) w j ( ( 2 ϒ α ˜ max 2 ) ( ϒ α ˜ max 2 ) ) w j , j = 1 n ( ( 2 Ψ α ˜ min 2 ) ( Ψ α ˜ min 2 ) ) w j j = 1 n ( ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ) w j j = 1 n ( ( 2 ϒ α ˜ max 2 ) ( ϒ α ˜ max 2 ) ) w j , ( ( 2 ϒ α ˜ min 2 ) ( ϒ α ˜ min 2 ) ) i = 1 n w j j = 1 n ( ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ) w j j = 1 n ( ( 2 ϒ α ˜ max 2 ) ( ϒ α ˜ max 2 ) ) i = 1 n w j , ( ( 2 ϒ α ˜ min 2 ) ( ϒ α ˜ min 2 ) ) + 1 j = 1 n ( ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ) w j + 1 ( ( 2 ϒ α ˜ max 2 ) ( ϒ α ˜ max 2 ) ) + 1 ,
( 2 ( ϒ α ˜ min 2 ) ) 1 + j = 1 n ( ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ) w j ( 2 ( ϒ α ˜ max 2 ) ) , ( ( ϒ α ˜ max 2 ) 2 ) 1 1 + j = 1 n ( ( 2 ϒ α ˜ j 2 ) ( ϒ α ˜ j 2 ) ) w j ( ( ϒ α ˜ min 2 ) 2 ) , ( ϒ α ˜ max ) 2 j = 1 n ( ϒ α ˜ j 2 ) w j j = 1 n ( 2 ϒ α ˜ j 2 ) w j + j = 1 n ( ϒ α ˜ j 2 ) w j ( ϒ α ˜ min ) .
Since
p min p j p max ,   q min q j q max , r min r j r max ,   s min s j s max , w j p min w j p j w j p max ,   w j q min w j q j w j q max , w j r min w j r j w j r max ,   w j s min w j s j w j s max , j = 1 n w j p min j = 1 n w j p j j = 1 n w j p max , j = 1 n w j q min j = 1 n w j q j j = 1 n w j q max , j = 1 n w j r min j = 1 n w j r j j = 1 n w j r max , j = 1 n w j ,   s min j = 1 n w j s j j = 1 n w j s max .
Then,
p min j = 1 n w j p p max ,   q min j = 1 n w j q q max , r min j = 1 n w j r r max ,   s min j = 1 n w j s s max .
Let,
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = α ˜ = ( ( s θ ,   s t ) ,   [ p ,   q ,   r ,   s ] ;   Ψ α ,   ϒ α )
then, we have
p min p p max ,   q min q q max ,   r min r r max , s min s s max ,   Ψ α ˜ min Ψ α ˜ Ψ α ˜ max ,     ϒ α ˜ min ϒ α ˜ ϒ α ˜ max .
we get
p min + q min + r min + s min p + q + r + s p max + q max + r max + s max , Ψ α ˜ min ϒ α ˜ min Ψ α ˜ ϒ α ˜ Ψ α ˜ max ϒ α ˜ max .
Similarly,
s ( θ ) min s ( θ ) s ( θ )   max , s ( t ) min s ( t ) s ( t )   max , Ψ α ˜ min Ψ α ˜ Ψ α ˜ max ,    ϒ α ˜ min ϒ α ˜ ϒ α ˜ max , s ( θ ) min + s ( t ) min s ( θ ) + s ( t ) s ( t ) min + s ( t )   max , Ψ α ˜ min ϒ α ˜ min Ψ α ˜ ϒ α ˜ Ψ α ˜ max ϒ α ˜ max .
Therefore α ˜ min P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) α ˜ max .
(3) ( Monotonicity ) Let α ˜ j = ( ( s θ ( p j ) ,   s t ( p j ) ) ,   [ p j ,   q j ,   r j ,   s j ] ,   Ψ α ˜ j ,   ϒ α ˜ j ) ( j = 1 ,   2 ,   n ) be a collection of Pythagorean trapezoidal fuzzy numbers. If α ˜ j α ˜ j , for all j , then
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) P T F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .
Let
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = j = 1 n w j α ˜ j ,   P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = j = 1 n w j α ˜ j .
Since α ˜ j α ˜ j for all j, then we have w j α ˜ j w j α ˜ j . Therefore, we have
P T U L F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) P T U l F E W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .
Definition 13.
Let α ˜ j = ( ( s θ ( p j ) ,   s t ( p j ) ) ,   [ p j ,   q j ,   r j ,   s j ] ,   Ψ α ˜ j ,   ϒ α ˜ j ) where j = ( 1 ,   2 ,   n ) be a collection of PTULFNs. The ( P T U L F E O W A ) operator of dimension n is mapping P T U L F E O W A    :    Ω n > Ω , and w = ( w 1 ,   w 2 , w n ) T is the weight vector of α ˜ j ( j = 1 ,   2 ,   n ) , with w j [ 0 ,   1 ] and j = 1 n w j = 1 .
P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ σ ( j ) )
where   ( σ ( 1 ) ,   σ ( 2 ) , ,   σ ( n ) ) is a permutation of ( 1 ,   2 ,   n ) , such that, α ˜ σ ( j ) α ˜ σ ( j 1 ) for all   j = 1 ,   2 , ,   n .
Theorem 5.
Let α ˜ i ( i = 1 ,   2 , ,   n ) be a collection of PTULFNs, then their aggregated value by using the P T U L F E O W A operator is also and PTULFNs,
P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ σ ( j ) ) = ( ( s θ ( p σ ( j ) ) ,   s t ( p σ ( j ) ) ) , [ j = 1 n w j p σ ( j ) ,   j = 1 n w j q σ ( j ) ,   j = 1 n w j r σ ( j ) ,   j = 1 n w j s σ ( j ) ] ; j = 1 n ( 1 + Ψ α ˜ σ ( j ) 2 ) w j j = 1 n ( 1 Ψ α ˜ σ ( j ) 2 ) w j j = 1 n ( 1 + Ψ α ˜ σ ( j ) 2 ) w j + j = 1 n ( 1 Ψ α ˜ σ ( j ) 2 ) w j , 2 j = 1 n ( ϒ α ˜ σ ( j ) 2 ) w j j = 1 n ( 2 ϒ α ˜ σ ( j ) 2 ) w j + j = 1 n ( ϒ α ˜ σ ( j ) 2 ) w j )
where   ( σ ( 1 ) ,   σ ( 2 ) , ,   σ ( n ) ) is a permutation of ( 1 ,   2 ,   n ) , such that, α ˜ σ ( j ) α ˜ σ ( j 1 ) for all j = 1 ,   2 , ,   n . w = ( w 1 ,   w 2 , w n ) T is weight vector of P T U L F E O W A operator, with w j [ 0 ,   1 ] and j = 1 n w j = 1 .
Proof. 
Similar to Theorem 3. □
Theorem 6.
Let α ˜ i ( i = 1 ,   2 , ,   n ) ( j = 1 ,   2 ,   n ) be a collection of P T U L F E N s , and w = ( w 1 ,   w 2 , w n ) T is the weighting vector of P T U L F E O W A with w j [ 0 ,   1 ] and j = 1 n w j = 1 , which satisfies the following properties;
(1) 
(Idmpotency) If for all α ˜ j ( j = 1 ,   2 ,   n ) are equal, i.e., α ˜ j = α ˜ , for all j , then
P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = α ˜ .
(2) 
(Boundray) Let α ˜ min = min { α ˜ 1 ,   α ˜ 2 , ,   α ˜ n } and α ˜ max = max { α ˜ 1 ,   α ˜ 2 , ,   α ˜ n } , then
α ˜ min P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) α ˜ max .
(3) 
(Monotonicity) Let
α ˜ j = ( ( s θ ( p j ) ,   s t ( p j ) ) ,   [ p j ,   q j ,   r j ,   s j ] ,   Ψ α ˜ j ,   ϒ α ˜ j )
( j = 1 ,   2 ,   n ) be a collection of PTULFNs. If α ˜ j α ˜ j , for all j , then
(4) 
(Commutativity) Let α ˜ j = ( ( s θ ( p j ) ,   s t ( p j ) ) , [ p j ,   q j ,   r j ,   s j ] ,   Ψ α ˜ j ,   ϒ α ˜ j ) ( j = 1 ,   2 ,   n ) be a collection of PTULFNs, then
P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .
where ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) is any permutation of ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .
Proof. 
Let
P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ σ ( j ) )   , P T U L F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ σ ( j ) ) .
Since ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) is any permutation of ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) , we have α ˜ σ ( j ) α ˜ σ ( j ) , then
P T F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = P T F E O W A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .
Definition 14.
Let α ˜ j ( j = 1 ,   2 ,   n ) be a collection of Pythagorean trapezoidal uncertain linguistic fuzzy numbers. Pythagorean trapezoidal uncertain linguistic fuzzy Einstein hybrid averaging ( P T U L F E H A ) operator of dimension n is mapping P T U L F E H A    : Ω n > Ω having weight w = ( w 1 ,   w 2 , w n ) T such that w j [ 0 ,   1 ] and j = 1 n w j = 1 .
P T U L F E H A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ σ ( j ) )
where β ˜ σ ( j ) is the j t h largest of the weighted Pythagorean trapezoidal uncertain linguistic fuzzy numbers β ˜ j ( β ˜ j = n w j α ˜ j ,   j = 1 ,   2 , ,   n ) , and w = ( w 1 ,   w 2 , w n ) T such that w j [ 0 ,   1 ] and j = 1 n w j = 1 ,
P T U L F E H A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = ε j = 1 n ( w j α ˜ σ ( j ) . ) = ( ( j = 1 n s w j θ ( σ ( j ) ) . ,   j = 1 n s w j t ( σ ( j ) ) . ) ,   [ j = 1 n w j p . σ ( j ) ,   j = 1 n w j q . σ ( j ) , j = 1 n w j r . σ ( j ) ,   j = 1 n w j s . σ ( j ) ] ; j = 1 n ( 1 + Ψ . α ˜ σ ( j ) 2 ) w j j = 1 n ( 1 Ψ . α ˜ σ ( j ) 2 ) w j j = 1 n ( 1 + Ψ . α ˜ σ ( j ) 2 ) w j + j = 1 n ( 1 Ψ . α ˜ σ ( j ) 2 ) w j , 2 j = 1 n ( ϒ . α ˜ σ ( j ) 2 ) w j j = 1 n ( 2 ϒ . α ˜ σ ( j ) 2 ) w j + j = 1 n ( ϒ . α ˜ σ ( j ) 2 ) w j )
Proof. 
Similar to Theorem 3. □
Theorem 7.
The P T U L F E W A operator is a special case of the P T U L F E H A operator.
Proof. 
Let w = ( 1 n ,   1 n , ,   1 n , ) , Then
P T U L F E H A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = w 1 α ˜ σ ( 1 ) w 2 α ˜ σ ( 1 ) w n α ˜ σ ( n ) = 1 n α ˜ σ ( 1 ) 1 n α ˜ σ ( 1 ) 1 n α ˜ σ ( n ) = w 1 α ˜ 1 w 2 α ˜ 2 w n α ˜ n = P T U L F E H A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .
Theorem 8.
The P T U L F E O W A operator is a special case of the P T F E H A operator.
Proof. 
Let w = ( 1 n ,   1 n , ,   1 n , ) , Then
P T U L F E H A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) = w 1 α ˜ σ ( 1 ) w 2 α ˜ σ ( 1 ) w n α ˜ σ ( n ) = 1 n α ˜ σ ( 1 ) 1 n α ˜ σ ( 1 ) 1 n α ˜ σ ( n ) = P T U L F E H A ( α ˜ 1 ,   α ˜ 2 , ,   α ˜ n ) .

4. A Novel Method for MAGDM Based on the Proposed PTULFEWA and PTULFEHA Operators

This section introduces the MADM process under the suggested aggregation information to propose a technique based on the PTULFSs. The detail description of the algorithm given in Figure 1.
Algorithm: 
To present the method of the MADM process, suppose A = { A 1 ,   A 2 , ,   A m } is a collection of alternatives, C = { C 1 ,   C 2 , ,   C n } is a collection of attributes, and w = ( w 1 ,   w 2 , ,   w n ) T is the weight vector such that w j [ 0 ,   1 ] and j = 1 n w j = 1 . Consider M = { m 1 ,   m 2 , ,   m p } the set of decision-makers and λ = ( λ 1 ,   λ 2 , ,   λ p ) T is the weight vector of decision-makers λ k [ 0 ,   1 ] and k = 1 p λ k = 1 . Let R ( k ) = ( r i j ( k ) ) m × n ( k = 1 ,   2 , p ) be PTULF decision matrix, where h i j ( k ) = ( ( s θ i j ( k ) ,   s t i j ( k ) ) ,   [ h 1 i j ( k ) ,   h 2 i j ( k ) ,   h 3 i j ( k ) ,   h 4 i j ( k ) ] ;   Ψ i j ( k ) ,   ϒ i j ( k ) ) is PTULFN given by the decision-makers m k M ,
0 Ψ i j ( k ) 1 ,   0 ϒ i j ( k ) 1 , 0 Ψ i j 2 ( k ) + ϒ i j 2 ( k ) 1 ,   i = 1 ,   2 , , m ,   j = 1 ,   2 , , n .
We use the P T U L F E W A and P T U L F E H A operators to present a method in the MADM process using the following steps.
  • Step 1. Construct PTULF matrix R ( k ) = ( r i j ( k ) ) m × n , from the decision of DM.
  • Step 2. Use the information of PTULF matrix R ( k ) = ( r i j ( k ) ) m × n , and apply the P T U L F E W A operator to collect the separate overall preference values r i ( k ) of the alternative A i , by using the weight vector.
    r i ( k ) = P T U L F E W A ( r i 1 ( k ) ,   r i 2 ( k ) , ,   r i n ( k ) ) ,   i = 1 ,   2 , ,   m ,   k = 1 ,   2 , , p .
  • Step 3. Utilizing the P T U L F E H A operator to collect all the information from the separated set to PTULF values r i ( k ) ( k = 1 ,   2 , p ) r i , where w = ( w 1 ,   w 2 , ,   w n ) T is the corresponding vector and λ = ( λ 1 ,   λ 2 , ,   λ p ) T is the weight vector of decision-makers.
    r i = P T U L F E H A ( r i ( 1 ) ,   r i ( 2 ) , ,   r i ( p ) ) ,   i = 1 ,   2 , ,   m ,   k = 1 ,   2 , , p .
  • Step 4. Use Equation (7) to find the scores values. If some of the score values are equal, use Equation (8) to find the accuracy.
  • Step 5. Rank the scores values.

5. Illustrative Example Surface Irrigation Problem

An illustrative example was considered to demonstrate the suggested technique in DM. The ratio of upper respiratory tract infection (URTI) was increasing day-by-day in Pakistan; consequently, we wanted to control the ratio of this disease. For this, we considered four possible alternatives, A i ( i = 1 ,   2 ,   3 ,   4 ) such as,
  • A1: Augmentin,
  • A2: Moxiflaxacin,
  • A3: Levofloxacin,
  • A4: Clathromycin.
A group of decision makers was invited to assess the best one under the following four attributes, Cj (j = 1, 2, 3, 4). Suppose w = (0.40, 0.30, 0.20, 0.10) is a weight vector of Cj
  • C1: Spending of the Medicine,
  • C2: Potentials of the Medicine,
  • C3: Less side effects of the Medicine,
  • C4: Accessibility in the market.
The detail description of criteria and alternative are given in Figure 2a,b, respectively.
The decision makers gave their decisions and considered the weights λ = (0.10, 0.20, 0.30, 0.40).
Table 1, Table 2, Table 3 and Table 4 show the decisions of the exports under the PTLUF, R ( k ) = ( r i j ( k ) ) 4 × 4 ( k = 1 ,   2 ,   3 ,   4 ) .
  • Step 1. The decision makers’ decisions are presented in the following Tables.
  • Step 2. Use the PTULF matrix, R ( k ) ( k = 1 , 2 , 3 , 4 ) , and the P T U L F E W A operator to collect the different overall preference PTL values r i ( k ) ( i = 1 ,   2 ,   3 ,   4 ) of the alternative A i (in Table 5)
  • Step 3. Apply the P T U L F E H A operator to collect the overall values see in Table 6.
  • Step 4. Find the scores and ranking of A i are given in Figure 3.
    S ( r ˜ 1 ) = 0.8517 ,    S ( r ˜ 2 ) = 0.6930 ,    S ( r ˜ 3 ) = 0.3730 ,    S ( r 4 ) = 0.1546 .
  • Step 5. Arrange the scores, A 1 > A 2 > A 3 > A 4 . The best one is A 1 .

6. Comparison Analysis with Existing Methods

To demonstrate the effectiveness of the suggested technique, a systematic comparison analysis was presented with the existing methods from [17,18], and [6].

6.1. A Comparison Analysis with Existing MADM Pythagorean Trapezoidal Fuzzy Sets

  • Step 1. According to the decision information given in the PTFNs decision matrix Z ( k ) = ( z i j k ) in Table 7.
  • Step 2. Utilize the P T F W A operator to aggregate the decision matrices into a single collective decision matrix r i k of the alternative B i see in Table 8. Suppose that the weighted vectors of the alternative are ( 0.3 ,   0.4 ,   0.1 ,   0.2 ) such that,
  • Step 3. Calculate the scores S ( r ˜ i ) of all the overall Pythagorean trapezoidal fuzzy values, shown in Figure 4.
    S ( r ˜ 1 ) = 0.2291 ,   S ( r ˜ 2 ) = 0.1185 ,    S ( r ˜ 3 ) = 0.0939 ,    S ( r 4 ) = 0.1108 .
  • Step 4. Arrange all the scores, A 1 > A 2 > A 4 > A 3 . The best alternative is A 1 .

6.2. A Comparison Analysis with Existing MADM Linguistic Pythagorean Fuzzy Sets

  • Step 1. The matrix given by PTULF is Z ( k ) = ( z i j k ) given in Table 9.
  • Step 2. Utilize the L P F W A operator to aggregate all the decision matrix into a single collective decision matrix r i k of the alternative B i in Table 10. Suppose that the weighted vectors of the alternative are ( 0.3 ,   0.4 ,   0.1 ,   0.2 ) such that,
  • Step 3. Calculate the scores S ( r ˜ i ) of all the overall linguistic Pythagorean fuzzy values such that,
    S ( r ˜ 1 ) = 6.6099 s   = 2.5709 , S ( r ˜ 2 ) = 2.3590 s ,    = 1.5359 , S ( r ˜ 3 ) = 14.7350 s ,    = 3.8386 ,   S ( r 4 ) = 11.5361 s = 3.3964 .
  • Step 4. We arrange the score value in descending order such that A 3 > A 4 > A 1 > A 2 . Thus, the most desirable alternative is A 3 .

6.3. A Comparison Analysis with Existing MADM Pythagorean Fuzzy Sets

  • Step 1. According to the decision information given in the Pythagorean fuzzy number decision matrix Z ( k ) = ( z i j k ) in Table 11.
  • Step 2. Utilize the P F W A operator to aggregate all the decision matrix into single collective decision matrix r i k of the alternative B i in Table 12. Suppose that the weighted vectors of the alternative are ( 0.3 ,   0.4 ,   0.1 ,   0.2 ) such that,
  • Step 3. Calculate the scores S ( r ˜ i ) of all the overall intuitionistic trapezoidal fuzzy values in see in Figure 5.
    S ( r ˜ 1 ) = 0.2598 ,    S ( r ˜ 2 ) = 0.4292 ,    S ( r ˜ 3 ) = 0.1858 ,    S ( r 4 ) = 0.0331 .
  • Step 4. We arrange the score value in descending order such that A 2 > A 1 > A 3 > A 4 . The sensitive analysis of comparison of different aggregation operators with the proposed aggregation operators is given in Table 13 and Figure 6.

7. Conclusions

We proposed a new PTULF operator using Einstein operations and studied some important properties. We defined different types of aggregation operators—PTULFEWA, PTULFEOWA, and PTULFEHA—using the Einstein operations. A MADM approach was presented for the proposed aggregation operators based on the PTULF environment. An illustrative example was given to show that the presented MADM approach was more accurate, general, and effective. Moreover, our presented method is different from the existing methods for MADM due to the use of PTULF numbers, which did not produce any loss of information in the process. A systematic comparison analysis was given to verify the results. In future research work, we will try to extend the work in various directions, such as confidence level, picture fuzzy set, symmetric aggregation operators, logarithmic aggregation operators, power aggregation operators, Dombi aggregation operators, and their applications in decision making.

Author Contributions

Conceptualization, S.A. and A.A.K.; methodology, M.S. and A.A.K.; software, N.u.A.; validation, F.K., S.A. and M.S.; formal analysis, F.K.; investigation, S.A.; resources, J.L.; data curation, M.S.; Writing—Original Draft preparation, F.K. and M.S.; Writing—Review and Editing, S.A.; visualization, N.u.A.; supervision, S.A.; project administration, J.L.; funding acquisition, J.L.

Funding

This paper is supported by “Research on the Pilot Effect Evaluation, Operational Pattern, Supporting Policies of the Contracted Management of Farm Land Mortgage Finance” and “Research on the Effectiveness Evaluation, Risk Control and System Construction of the Agriculture Credit Guarantee Policy”, The National Natural Science Foundation of China (NSFC), Jan 2016-2019, No 71573210 and NSFC No 71873100, Sponsor and Host Jianchao Luo.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L. A Fuzzy set. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Carrasco, R.A.; Blasco, M.F.; García-Madariaga, J.; Herrera-Viedma, E. A Fuzzy Linguistic RFM Model Applied to Campaign Management. Int. J. Interact. Multimed. Artif. Intell. 2018, in press. [Google Scholar] [CrossRef]
  4. Revanasiddappa, M.B.; Harish, B.S. A New Feature Selection Method based on Intuitionistic Fuzzy Entropy to Categorize Text Documents. Int. J. Interact. Multimed. Artif. Intell. 2018, in press. [Google Scholar] [CrossRef]
  5. Morente-Molinera, J.A.; Kou, G.; Crespo, R.G.; Corchado, J.M. SoMeT, Managing Multi-Criteria Group Decision Making Environments with High Number of Alternatives Using Fuzzy Ontologies. In Proceedings of the 17th International Conference on Intelligent Software, Granada, Spain, 26–28 September 2018; pp. 493–506. [Google Scholar] [CrossRef]
  6. Albadán-Romero, J.; Gaona-García, P.; Montenegro-Marin, C.; Ruben Gonzalez, C. Fuzzy logic models for non-programmed decision-making in personnel selection processes based on gamification. Informatica 2018, 29, 1–20. [Google Scholar] [CrossRef]
  7. Deschrijver, G.; Kerre, E.E. A generalization of operators on intuitionistic fuzzy sets using triangular norms and conorms. Notes IFS 2002, 8, 19–27. [Google Scholar]
  8. Liang, Q.; Liao, X.; Liu, J. A social ties-based approach for group decision-making problems with incomplete additive preference relations. Knowl. Based Syst. 2017, 119, 68–86. [Google Scholar] [CrossRef]
  9. Wang, W.; Liu, X. Intuitionistic fuzzy information aggregation using Einstein operations. IEEE Trans. Fuzzy Syst. 2012, 20, 923–938. [Google Scholar] [CrossRef]
  10. Liu, P.; Wang, Y. Multiple attribute group decision making methods based on intuitionistic linguistic power generalized aggregation operators. Appl. Soft Comput. 2014, 17, 90–104. [Google Scholar] [CrossRef]
  11. Su, W.; Li, W.; Zeng, S.; Zhang, C. Atanassov’s intuitionistic linguistic ordered weighted averaging distance operator and its application to decision making. J. Intell. Fuzzy Syst. 2014, 26, 1491–1502. [Google Scholar]
  12. Xiao, Y.; Zhang, C. A new method for financial decision making under Intuitionistic linguistic envi-ronment. Econ. Comput. Econ. Cybern. Stud. Res. 2016, 50, 303–318. [Google Scholar]
  13. Liu, P.; Jin, F. Methods for aggregating intuitionistic uncertain linguistic variables and their application to group decision making. Inf. Sci. 2012, 205, 58–71. [Google Scholar] [CrossRef]
  14. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  15. Yager, R.R. Pythagorean membership grades in multicriteria decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  16. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  17. Garg, H. A new generalized Pythagorean fuzzy information aggregation using Einstein operations and its application to decision making. Int. J. Intell. Syst. 2016, 31, 886–920. [Google Scholar] [CrossRef]
  18. Shakeel, M.; Abduulah, S.; Shahzad, M.; Mahmood, T.; Siddiqui, N. Averaging aggregation operators with Pythagorean trapezoidal fuzzy numbers and their application to group decision making. J. Intell. Fuzzy Syst. 2018, 1–17. [Google Scholar] [CrossRef]
  19. Shakeel, M.; Abdullah, S.; Khan, M.S.A.; Rahman, K. Averaging aggregation operators with Interval Pythagorean trapezoidal fuzzy numbers and their application to group decision making. J. Math. 2018, 50, 147–170. [Google Scholar]
  20. Shakeel, M.; Abdullah, S.; Shahzad, M.; Fahmi, A. Induced interval-valued Pythagorean trapezoidal fuzzy aggregation operators based on Einstein operations and their application in group decision making. J. Integr. Neurosci. 2018, 17, 633–659. [Google Scholar] [CrossRef]
  21. Shakeel, M.; Abdullah, S.; Shahzad, M.; Siddiqui, N. Geometric aggregation operators with interval-valued Pythagorean trapezoidal fuzzy numbers based on Einstein operations and their application in group decision making. Int. J. Mach. Learn. Cybern. 2019, 1–20. [Google Scholar] [CrossRef]
  22. Ma, Z.; Xu, Z. Symmetric Pythagorean fuzzy weighted geometric/averaging operators and their application in multi-criteria decision-making problems. Int. J. Intell. Syst. 2016, 31, 1198–1219. [Google Scholar] [CrossRef]
  23. Garg, H. Linguistic Pythagorean fuzzy sets and its applications in multi attribute decision-making process. Int. J. Intell. Syst. 2018, 33, 1234–1263. [Google Scholar] [CrossRef]
  24. Ban, A.I.; Tuse, D.A. Trapezoidal/triangular intuitionistic fuzzy numbers versus interval-valued trapezoidal/triangular fuzzy numbers and applications to multicriteria decision making methods. Notes Intuitionistic Fuzzy Sets 2014, 20, 43–51. [Google Scholar]
  25. Wang, J.Q.; Li, H.B. Multi-criteria decision-making method based on aggregation operators for intuitionistic linguistic fuzzy numbers. Control Decis. 2010, 25, 1571–1574. [Google Scholar]
  26. Liu, P.; Liu, J.; Merigó, J.M. Partitioned Heronian means based on linguistic intuitionistic fuzzy numbers for dealing with multi-attribute group decision making. Appl. Soft Comput. 2018, 62, 395–422. [Google Scholar] [CrossRef]
  27. Zhao, X.; Wei, G. Some intuitionistic fuzzy Einstein hybrid aggregation operators and their application to multiple attribute decision making. Knowl. Based Syst. 2013, 37, 472–479. [Google Scholar] [CrossRef]
  28. Zhang, S.; Yu, D. Some geometric Choquet aggregation operators using Einstein operations under intuitionistic fuzzy environment. J. Intell. Fuzzy Syst. 2014, 26, 491–500. [Google Scholar]
  29. Zhang, X.; Xu, Z. Extension of TOPSIS to multiple criteria decision making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  30. Lowen, R. Fuzzy real numbers. In Fuzzy Set Theory; Springer: Dordrecht, The Netherlands, 1996; pp. 143–168. [Google Scholar]
  31. Jianqiang, W.; Zhong, Z. Aggregation operators on intuitionistic trapezoidal fuzzy number and its application to multi-criteria decision-making problems. J. Syst. Eng. Electron. 2009, 20, 321–326. [Google Scholar]
  32. Morente-Molinera, J.A.; Kou, G.; González-Crespo, R.; Corchado, J.M. Solving multi-criteria group decision making problems under environments with a high number of alternatives using fuzzy ontologies and multi-granular linguistic modelling methods. Knowl. Based Syst. 2017, 137, 54–64. [Google Scholar] [CrossRef]
Figure 1. Flow chart of proposed algorithm.
Figure 1. Flow chart of proposed algorithm.
Symmetry 11 00440 g001
Figure 2. (a) Four alternatives; (b) Four attributes.
Figure 2. (a) Four alternatives; (b) Four attributes.
Symmetry 11 00440 g002
Figure 3. Score representation.
Figure 3. Score representation.
Symmetry 11 00440 g003
Figure 4. Score representation.
Figure 4. Score representation.
Symmetry 11 00440 g004
Figure 5. Score representation.
Figure 5. Score representation.
Symmetry 11 00440 g005
Figure 6. Score representation.
Figure 6. Score representation.
Symmetry 11 00440 g006
Table 1. Decision Matrix Z(1).
Table 1. Decision Matrix Z(1).
AiC1C2
A1{(s6,s2),[0.4,0.5,0.6,0.5];(0.7,0.5)}{(s5,s2),[0.3,0.4,0.5,0.4];(0.6,0.5)}
A2{(s3,s2),[0.9,0.6,0.3,0.4];(0.8,0.3)}{(s2,s3),[0.4,0.5,0.4,0.1];(0.6,0.4)}
A3{(s2,s4),[0.4,0.5,0.1,0.2];(0.6,0.5)}{(s4,s2),[0.7,0.6,0.3,0.2];(0.5,0.5)}
A4{(s3,s4),[0.3,0.4,0.3,0.5];(0.6,0.5)}{(s6,s2),[0.8,0.4,0.3,0.4];(0.8,0.2)}
AiC3C4
A1{(s2,s3),[0.6,0.2,0.3,0.4];(0.7,0.3)}{(s6,s2),[0.4,0.5,0.6,0.9];(0.8,0.4)}
A2{(s3,s4),[0.4,0.5,0.6,0.7];(0.7,0.5)}{(s4,s3),[0.3,0.4,0.5,0.9];(0.5,0.5)}
A3{(s6,s3),[0.4,0.6,0.2,0.3];(0.7,0.4)}{(s5,s2),[0.6,0.7,0.8,0.6];(0.8,0.5)}
A4{(s4,s5),[0.4,0.6,0.3,0.4];(0.9,0.3)}{(s2,s3),[0.4,0.5,0.6,0.5];(0.9,0.2)}
Table 2. Decision Matrix Z(2).
Table 2. Decision Matrix Z(2).
AiC1C2
A1{(s2,s3),[0.9,0.3,0.1,0.2];(0.8,0.3)}{(s5,s4),[0.3,0.4,0.5,0.6];(0.6,0.4)}
A2{(s3,s2),[0.4,0.2,0.2,0.5];(0.7,0.5)}{(s2,s3),[0.4,0.5,0.6,0.4];(0.6,0.5)}
A3{(s6,s5),[0.3,0.4,0.5,0.7];(0.6,0.5)}{(s3,s2),[0.4,0.6,0.3,0.5];(0.5,0.5)}
A4{(s6,s2),[0.4,0.9,0.6,0.3];(0.8,0.2)}{(s2,s2),[0.6,0.3,0.1,0.4];(0.6,0.4)}
AiC3C4
A1{(s4,s3),[0.1,0.4,0.5,0.3];(0.7,0.5)}{(s2,s4),[0.6,0.2,0.5,0.1];(0.5,0.5)}
A2{(s3,s2),[0.4,0.7,0.8,0.9];(0.7,0.3)}{(s6,s3),[0.4,0.6,0.3,0.2];(0.8,0.4)}
A3{(s2,s3),[0.6,0.8,0.3,0.2];(0.7,0.4)}{(s3,s4),[0.5,0.8,0.7,0.3];(0.8,0.5)}
A4{(s5,s4),[0.3,0.4,0.7,0.2];(0.6,0.5)}{(s4,s3),[0.3,0.5,0.6,0.9];(0.9,0.1)}
Table 3. Decision Matrix Z(3).
Table 3. Decision Matrix Z(3).
AiC1C2
A1{(s4,s3),[0.3,0.4,0.4,0.3];(0.8,0.2)}{(s2,s2),[0.7,0.5,0.6,0.3];(0.6,0.4)}
A2{(s2,s4),[0.4,0.3,0.6,0.3];(0.6,0.5)}{(s3,s4),[0.3,0.1,0.2,0.4];(0.5,0.5)}
A3{(s6,s3),[0.5,0.3,0.6,0.4];(0.8,0.3)}{(s5,s2),[0.2,0.1,0.3,0.5];(0.6,0.4)}
A4{(s3,s4),[0.9,0.6,0.4,0.1];(0.7,0.5)}{(s3,s3),[0.4,0.3,0.4,0.2];(0.6,0.5)}
AiC3C4
A1{(s3,s2),[0.3,0.5,0.6,0.6];(0.6,0.5)}{(s3,s4),[0.4,0.5,0.2,0.3];(0.9,0.1)}
A2{(s5,s3),[0.4,0.5,0.7,0.2];(0.7,0.4)}{(s4,s2),[0.4,0.3,0.2,0.1];(0.8,0.5)}
A3{(s3,s4),[0.3,0.1,0.2,0.3];(0.7,0.5)}{(s5,s2),[0.6,0.8,0.9,0.2];(0.5,0.5)}
A4{(s6,s5),[0.4,0.3,0.4,0.6];(0.7,0.3)}{(s2,s3),[0.4,0.5,0.4,0.3];(0.8,0.4)}
Table 4. Decision Matrix Z(4).
Table 4. Decision Matrix Z(4).
AiC1C2
A1{(s3,s5),[0.4,0.5,0.7,0.5];(0.7,0.5)}{(s2,s2),[0.4,0.3,0.6,0.7];(0.6,0.5)}
A2{(s2,s3),[0.3,0.4,0.4,0.6];(0.6,0.5)}{(s4,s4),[0.3,0.4,0.5,0.6];(0.5,0.5)}
A3{(s4,s2),[0.5,0.4,0.2,0.3];(0.8,0.3)}{(s6,s3),[0.4,0.5,0.7,0.8];(0.6,0.4)}
A4{(s3,s4),[0.4,0.6,0.3,0.4];(0.8,0.2)}{(s2,s2),[0.3,0.4,0.5,0.7];(0.6,0.4)}
AiC3C4
A1{(s2,s3),[0.8,0.2,0.3,0.4];(0.7,0.3)}{(s3,s4),[0.8,0.2,0.3,0.4];(0.7,0.3)}
A2{(s3,s2),[0.4,0.3,0.2,0.1];(0.7,0.4)}{(s2,s4),[0.4,0.5,0.3,0.1];(0.8,0.5)}
A3{(s4,s4),[0.4,0.5,0.7,0.8];(0.6,0.4)}{(s4,s2),[0.4,0.5,0.3,0.1];(0.8,0.5)}
A4{(s5,s2),[0.4,0.5,0.6,0.7];(0.6,0.5)}{(s2,s3),[0.4,0.3,0.1,0.3];(0.9,0.1)}
Table 5. Collective aggregation information using P T U L F E W A .
Table 5. Collective aggregation information using P T U L F E W A .
r i ( k ) Aggregated Values r i ( k ) Aggregated Values
r 1 ( 1 ) {(s4.9,s2.2),[0.41,0.41,0.51,0.49];(0.68,0.44)} r 2 ( 1 ) {(s3.3,s3.4),[0.53,0.34,0.34,0.33];(0.71,0.38)}
r 1 ( 2 ) {(s2.8,s2.9),[0.62,0.53,0.41,0.42];(0.71,0.38)} r 2 ( 2 ) {(s3.0,s2.4.),[0.40,0.43,0.45,0.52];(0.68,0.44)}
r 1 ( 3 ) {(s3.7,s3.0),[0.48,0.45,0.33,0.45];(0.80,0.31)} r 2 ( 3 ) {(s3.2,s3.6),[0.41,0.57,0.42,0.50];(0.65,0.47)}
r 1 ( 4 ) {(s4.0,s3.5),[0.48,0.45,0.33,0.45];(0.80,0.31)} r 2 ( 4 ) {(s4.4,s2.5),[0.43,0.58,0.47,0.37];(0.37,0.27)}
r 3 ( 1 ) {(s2.9,s2.6),[0.43,0.44,0.46,0.36];(0.73,0.27)} r 4 ( 1 ) {(s2.5,s3.6),[0.47,0.37,0.57,0.55];(0.68,0.44)}
r 3 ( 2 ) {(s3.3,s3.2),[0.37,0.31,0.46,0.29];(0.65,0.47)} r 4 ( 2 ) {(s2.8,s3.2),[0.33,0.39,0.38,0.45];(0.65,0.47)}
r 3 ( 3 ) {(s5.1,s2.8),[0.38,0.25,0.46,0.39];(0.71,0.38)} r 4 ( 3 ) {(s4.6,s2.7),[0.43,0.44,0.43,0.54];(0.71,0.38)}
r 3 ( 4 ) {(s3.5,s2.9),[0.96,0.44,0.40,0.25];(0.68,0.44)} r 4 ( 4 ) {(s3.1,s2.9),[0.37,0.49,0.40,0.54];(0.73,0.27}
Table 6. Collective aggregation information using P T U L F E H A .
Table 6. Collective aggregation information using P T U L F E H A .
r(k)Aggregated Values
r(1){(s3.76,s3.10),[0.49,0.59,0.51,0.40];(0.76,0.28)}
r(2){(s3.65,s2.00),[0.66,0.52,0.57,0.53];(0.73,0.32)}
r(3){(s3.88,s2.90),[0.30,0.31,0.33,0.34];(0.59,0.56)}
r(4){(s3.47,s2.97),[0.18,0.15,0.18,0.17];(0.47,0.71)}
Table 7. Decision Matrix Zk.
Table 7. Decision Matrix Zk.
AiC1C2
A1{(s6,s2),[0.4,0.5,0.6,0.5];(0.8,0.5)}{(s3,s4),[0.9,0.6,0.3,0.4];(0.7,0.4)}
A2{(s5,s3),[0.3,0.4,0.5,0.4];(0.4,0.8)}{(s2,s2),[0.4,0.5,0.4,0.1];(0.5,0.6)}
A3{(s4,s2),[0.6,0.2,0.3,0.4];(0.5,0.7)}{(s6,s3),[0.4,0.5,0.6,0.7];(0.4,0.7)}
A4{(s2,s4),[0.4,0.5,0.6,0.9];(0.4,0.8)}{(s3,s2),[0.3,0.4,0.5,0.9];(0.3,0.5)}
AiC1C2
A1{(s5,s2),[0.4,0.5,0.1,0.2];(0.5,0.5)}{(s4,s3),[0.3,0.4,0.3,0.5];(0.6,0.5)}
A2{(s6,s3),[0.6,0.7,0.3,0.2];(0.4,0.7)}{(s1,s2),[0.8,0.4,0.3,0.4];(0.3,0.8)}
A3{(s3,s4),[0.4,0.6,0.2,0.3];(0.3,0.8)}{(s4,s3),[0.4,0.5,0.3,0.4];(0.7,0.7)}
A4{(s4,s3),[0.6,07,0.8,0.6];(0.5,0.6)}{(s3,s5),[0.4,0.5,0.6,0.5];(0.7,0.4)}
Table 8. r(k).
Table 8. r(k).
r(k)Aggregated Values
r(1){[0.58,0.52,0.37,0.43];(0.85,0.49)}
r(2){[0.48,0.46,0.40,0.26];(0.70,0.44)}
r(3){[0.51,0.55,0.32,0.40];(0.56,0.32)}
r(4){[0.18,0.41,0.44,0.65];(0.60,0.31)}
Table 9. Z(k).
Table 9. Z(k).
AiC1C2C3C4
A1(s2,0.8,0.5)(s4,0.7,0.4)(s5,0.5,0.5)(s6,0.6,0.5)
A2(s1,0.8,0.4) (s2,0.5,0.6)(s3,0.7,0.4) (s5,0.8,0.3)
A3(s2,0.5,0.7) (s3,0.4,0.7) (s5,0.8,0.3) (s6,0.7,0.7)
A4(s4,0.4,0.8) (s5,0.3,0.5) (s8,0.5,0.6) (s7,0.7,0.4)
Table 10. r(k).
Table 10. r(k).
r(k)Aggregated Values
r(1){(0.6989,0.4781)}
r(2){(0.7607,0.3866)}
r(3){(0.7742,0.6431)}
r(4){(0.5663,0.5362)}
Table 11. Z(k).
Table 11. Z(k).
AiC1C2C3C4
A1(0.8,0.5)(0.7,0.4)(0.5,0.5)(0.6,0.5)
A2(0.8,0.4)(0.5,0.6)(0.7,0.4)(0.8,0.3)
A3(0.5,0.7)(0.4,0.7)(0.8,0.3)(0.7,0.7)
A4(0.4,0.8)(0.3,0.5)(0.5,0.6)(0.7,0.4)
Table 12. Collective aggregation information.
Table 12. Collective aggregation information.
r(k)Aggregated Values
r(1){s3.6,0.6980,0.4781}
r(2){s2.3,0.7607,0.3866}
r(3){s3.3,0.7742,0.6431}
r(4){s4.8,0.5663,0.5362}
Table 13. Comparison of existing methods.
Table 13. Comparison of existing methods.
Method Ranking Results
PTULFEinformationA1 > A2 > A3 > A4
PTFinformationA1 > A2 > A4 > A3
LPFinformationA3 > A4 > A1 > A2
PFinformationA2 > A1 > A3 > A4

Share and Cite

MDPI and ACS Style

Khan, A.A.; Abdullah, S.; Shakeel, M.; Khan, F.; Amin, N.u.; Luo, J. A New Ranking Methodology for Pythagorean Trapezoidal Uncertain Linguistic Fuzzy Sets Based on Einstein Operations. Symmetry 2019, 11, 440. https://doi.org/10.3390/sym11030440

AMA Style

Khan AA, Abdullah S, Shakeel M, Khan F, Amin Nu, Luo J. A New Ranking Methodology for Pythagorean Trapezoidal Uncertain Linguistic Fuzzy Sets Based on Einstein Operations. Symmetry. 2019; 11(3):440. https://doi.org/10.3390/sym11030440

Chicago/Turabian Style

Khan, Arshad Ahmad, Saleem Abdullah, Muhammad Shakeel, Faisal Khan, Noor ul Amin, and Jianchao Luo. 2019. "A New Ranking Methodology for Pythagorean Trapezoidal Uncertain Linguistic Fuzzy Sets Based on Einstein Operations" Symmetry 11, no. 3: 440. https://doi.org/10.3390/sym11030440

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