Next Article in Journal
The Reliability of Stored Water behind Dams Using the Multi-Component Stress-Strength System
Next Article in Special Issue
Geometric Aggregation Operators for Solving Multicriteria Group Decision-Making Problems Based on Complex Pythagorean Fuzzy Sets
Previous Article in Journal
Bio-Inspired Machine Learning Approach to Type 2 Diabetes Detection
Previous Article in Special Issue
An Intuitionistic Fuzzy Version of Hellinger Distance Measure and Its Application to Decision-Making Process
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Enhancing Interval-Valued Pythagorean Fuzzy Decision-Making through Dombi-Based Aggregation Operators

1
Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11564, Saudi Arabia
2
Department of Mathematics, Government College University, Faisalabad 38000, Pakistan
3
Department of Mathematics, Division of Science and Technology, University of Education, Lahore 54770, Pakistan
4
School of Mathematics, Thapar Institute of Engineering & Technology (Deemed University), Patiala 147004, Punjab, India
5
Applied Science Research Center, Applied Science Private University, Amman 11931, Jordan
6
Department of Mathematics, Graphic Era Deemed to be University, Dehradun 248002, Uttarakhand, India
7
College of Technical Engineering, The Islamic University, Najaf 42351, Iraq
8
Department of Basic Sciences, Deanship of Preparatory Year, King Faisal University, Al Ahsa Hofuf 31982, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(3), 765; https://doi.org/10.3390/sym15030765
Submission received: 10 February 2023 / Revised: 6 March 2023 / Accepted: 14 March 2023 / Published: 20 March 2023
(This article belongs to the Special Issue Recent Developments on Fuzzy Sets Extensions)

Abstract

:
The success of any endeavor or process is heavily contingent on the ability to reconcile and satisfy balance requirements, which are often characterized by symmetry considerations. In practical applications, the primary goal of decision-making processes is to efficiently manage the symmetry or asymmetry that exists within different sources of information. In order to address this challenge, the primary aim of this study is to introduce novel Dombi operation concepts that are formulated within the framework of interval-valued Pythagorean fuzzy aggregation operators. In this study, an updated score function is presented to resolve the deficiency of the current score function in an interval-valued Pythagorean fuzzy environment. The concept of Dombi operations is used to introduce some interval-valued Pythagorean fuzzy aggregation operators, including the interval-valued Pythagorean fuzzy Dombi weighted arithmetic (IVPFDWA) operator, the interval-valued Pythagorean fuzzy Dombi ordered weighted arithmetic (IVPFDOWA) operator, the interval-valued Pythagorean fuzzy Dombi weighted geometric (IVPFDWG) operator, and the interval-valued Pythagorean fuzzy Dombi ordered weighted geometric (IVPFDOWG) operator. Moreover, the study investigates many important properties of these operators that provide new semantic meaning to the evaluation. In addition, the suggested score function and newly derived interval-valued Pythagorean fuzzy Dombi aggregation (IVPFDA) operators are successfully employed to select a subject expert in a certain institution. The proposed approach is demonstrated to be successful through empirical validation. Lastly, a comparative study is conducted to demonstrate the validity and applicability of the suggested approaches in comparison with current techniques. This research contributes to the ongoing efforts to advance the field of evaluation and decision-making by providing novel and effective tools and techniques.

1. Introduction

Selecting the best possible option from a set of candidates based on a number of criteria or qualities is the goal of multi-criteria decision-making. Generally, it is assumed that all data used to evaluate an option in terms of its qualities and the relative weights of those features are presented in the form of crisp numbers. However, in many real-life situations, there are problems taken into account where the objectives and constraints are conventionally vague and imprecise in nature. To cope with this problem, Zadeh [1] introduced the concept of fuzzy sets (FSs) as a generalization of crisp sets.
In fuzzy sets, information about the degree to which certain criteria are met is obtained in the form of membership functions, whose complements are taken as insufficient degrees. In 1970, Bellman and Zadeh [2] discussed the multiple attribute decision-making process in the FS theory. In addition, the theory of solving decision-making problems under fuzzy environments was developed in [3,4]. In 1982, Dombi [5] discussed a general class of fuzzy operators. The theory of intuitionistic fuzzy sets has been widely adopted and has a significant impact on various disciplines, including decision-making, engineering, information technology, pattern recognition, and medical diagnostics. The concept of intuitionistic fuzzy sets, which represents a generalization of fuzzy sets, was first proposed by Atanassov in 1986 [6]. It meets the condition that the sum of the membership and non-membership degrees of a given element must not exceed unity.
In 1986, Turksen [7] put forward the idea of the interval-valued fuzzy set (IVFS) as a modification to fuzzy sets. In real-life situations, where information is often inadequate and imprecise, decision-makers may find it challenging to express their opinions with precise numerical values. To address this challenge, Atanassov [8] introduced the IV IFS concept in 1989. In this approach, the membership and non-membership degrees are represented by an interval within [0, 1] rather than a precise numerical value. In 2000, De et al. [9] introduced three basic operations for an IFS, namely concentration, dilation, and normalization. The intuitionistic fuzzy set theory has attracted more attention from many researchers since its inception. However, later on, many deficiencies were found in this technique, which led the mathematician, Atanassov, to explore some higher order fuzzy sets.
The significance of the concepts of IFSs and IVIFSs is quite evident as many mathematicians have introduced different types of aggregation operators and information measures based on these sets, which have been effectively utilized in addressing MCDM problems in various circumstances [10,11,12,13,14,15]. Despite the numerous advantages of these theories, there still exist real-world situations that cannot be addressed by the above-mentioned strategies. For instance, if a decision-maker assigns a membership degree of 0.7 and a non-membership degree of 0.5 to an element, their sum would exceed 1. To broaden the scope of membership and non-membership degrees, Yager [16] introduced the concept of Pythagorean Fuzzy Sets (PFSs), where the sum of the squares of the membership and non-membership is less than or equal to 1.
In 2014, Zhang and Xu [17] discussed decision-making using PFSs. In addition, more develop methods in the framework of the interval-valued intuitionistic fuzzy (IVIF) environment can be found in [18,19]. In 2017, Chen and Huang [20] discussed decision-making based on particle swarm optimization techniques. In 2016, Zhang [21] presented the concept of the IV Pythagorean fuzzy set. Moreover, one can view the recent developments of IVPFSs in [22,23,24,25,26,27,28,29,30,31,32,33]. In 2016, Peng and Yang [34] discussed the fundamental properties of aggregation operators of IVPFSs. Furthermore, different Dombi Operators in various sets were discussed in [35,36,37,38,39,40]. In addition, many useful strategies were invented to address the issue of energy crises in [41,42,43]
Dombi operators can take multi-purpose aggregation, decision-making abilities, and operational characteristics and turn them into a highly adaptable tool for gathering imprecise information. The information is converted into a single value with the help of the averaging operators. Dombi operators are incredibly adaptable when it comes to operational conditions, and they are also highly effective at solving decision-making issues. The main benefit of our approach is that it can handle the interrelationship between the arguments, which the other approaches cannot do. Our approach is therefore more versatile. Furthermore, it is important to note that the existing techniques lack the ability to dynamically adjust the parameter in accordance with the decision-makers’ risk aversion, which makes the MADM solution difficult to implement in real life. However, the techniques presented in this article are very capable of addressing this weakness in this situation.
Our research work aims to achieve several primary objectives, which are as follows:
  • Develop an updated score function that overcomes the deficiencies of existing score functions in IVPF environment. This will involve the integration of advanced mathematical and statistical techniques to create a more robust and accurate scoring system.
  • Formulate fundamental Dombi operations for IVPFSs. This will involve the development of mathematical models that describe the relationships between different elements of IVPFSs, allowing for more accurate analysis and prediction of outcomes.
  • Initiate the study of IVPFD aggregation operators. This will involve exploring the ways in which different IVPFD operators can be combined to create more effective aggregation methods for IVPFSs.
  • Prove many key properties of the newly defined operators. This will involve rigorous mathematical analysis and formal proofs aimed at demonstrating the validity and effectiveness of the proposed operators.
  • Present an algorithm to solve Multiple Attribute Decision-Making (MADM) problems using IVPFD aggregation operators. This will involve developing a step-by-step process for using the new operators to analyze and evaluate complex decision-making problems.
  • Select the best subject expert in a certain institution using the newly suggested technique. This will involve applying the proposed algorithm to real-world scenarios, such as selecting the most qualified candidate for a job or identifying the most suitable expert for a specific project.
  • Present a comparative analysis to show the validity of the proposed technique compared with existing strategies. This will involve testing the effectiveness of the proposed algorithm against existing methods, using real-world data sets and scenarios.
After a brief discussion of IVPFSs, the rest of the work is organized as: in Section 2, some basic definitions are defined to understand the novelty of the work presented in this article. In Section 3, the deficiency of existing score functions to solve MADM problems is discussed and an improved score function is determined to counter this problem under the IVPF environment. In Section 4, some Dombi aggregation operators for these sets are developed. In Section 5, a numerical example is given to show the validity of this new approach. In addition, a comparative analysis is presented to depict the validity and feasibility of this new strategy with existing methods. Finally, some concrete conclusions about the paper are summarized in Section 6.

2. Preliminaries

In this section, we briefly review some basic concepts, properties, operations, and magnitude comparison methods of IVPFSs over the non-empty universal set X that are important to the achievement of this study.
Definition 1
[7]. An IVFS A defined on X is given by A = {〈x, [µAL(x), µAU(x)]〉: x ∈ X}, where 0 ≤ µAL(x) ≤ µAU(x) ≤ 1.
Definition 2
[14]. Let X be a classical set. A PFS A on X is represented as: A = {〈x,µA(x),νA(x)〉: x ∈ X}, where µA: X→[0,1] and νA: X→[0,1] denote the membership and non-membership functions, respectively, that satisfy the condition  0 μ A 2 ( x ) + ν A 2 ( x ) 1 . The hesitancy margin of the PFS A is defined as: πA(x) =  1 μ A 2 ( x ) ν A 2 ( x ) .
Definition 3
[18]. An IVPFS A on X is defined as: A = {〈x, [µAL(x), µAU(x)], [νAL(x), νAU(x)]〉: x ∈ X}, where [µAL(x), µAU(x)] and [νAL(x), νAU(x)], respectively, represent the membership and non-membership degree of A that are able to satisfy the condition 1 ≥ µAU(x) ≥ µAL(x) ≥ 0 and 0 ≤ νAL(x) ≤ νAU(x) ≤ 1. Moreover, 0 ≤ (µAL(x))2 + (νAL(x))2 ≤ 1 and 0 ≤ (µAU(x))2 + (νAU(x))2 ≤ 1. The hesitancy degree of the IVPFS A is defined as:
π A ( x ) = [ π A L ( x ) , π A U ( x ) ] = [ 1 ( µ A L ( x ) ) 2 ( ν A L ( x ) ) 2 ,   1 ( µ A U ( x ) ) 2 ( ν A U ( x ) ) 2 ]
Definition 4
[35]. Consider the three IVPF g = 〈[ µ g L ,  µ g U ],[   ν g L ,  ν g U ]〉, g1 = 〈[ µ g 1 L ,  µ g 1 U ],[   ν g 1 L ,  ν g 1 U ]〉 and g2 = 〈[ µ g 2 L ,  µ g 2 U ],[   ν g 2 L ,  ν g 2 U ]〉. The basic operations on these numbers are defined in the subsequent way:
i. 
g1∪g2 = 〈[max{ µ g 1 L ,  µ g 2 L ,}, max{ µ g 1 U ,  µ g 2 U ,}], [min{ ν g 1 L ,  ν g 2 L }, min{ ν g 1 U , ν g 2 U ,}]〉
ii. 
g1∩ g2 = 〈[min{ µ g 1 L ,    µ g 2 L ,}, min{ µ g 1 U ,    µ g 2 U ,}], [max{ ν g 1 L ,    ν g 2 L }, max{ ν g 1 U ,   ν g 2 U ,}] 〉
iii. 
g1⨁g2  = [ ( μ g 1 L ) 2 + ( μ g 2 L ) 2 ( μ g 1 L ) 2 ( μ g 2 L ) 2 , ( μ g 1 U ) 2 + ( μ g 2 U ) 2 ( μ g 1 U ) 2 ( μ g 2 U ) 2 ] , [ ν g 1 L ν g 2 L , ν g 1 U ν g 2 U ]
iv.  
g1⨂g2 =  [ μ g 1 L μ g 2 L , μ g 1 U μ g 2 U ] , [ ( ν g 1 L ) 2 + ( ν g 2 L ) 2 ( ν g 1 L ) 2 ( ν g 2 L ) 2 , ( ν g 1 U ) 2 + ( ν g 2 U ) 2 ( ν g 1 U ) 2 ( ν g 2 U ) 2 ]
v.  
χg =   [ 1 ( 1 ( µ g L ) 2 ) X   , 1 ( 1 ( µ g U ) 2 ) X   ] , [ ( ν g L ) X , ( ν g U ) X ] , for all χ > 0.
vi. 
gχ =  [ ( µ g L ) X , ( µ g U ) X ] , [ 1 ( 1 ( ν g L ) 2 ) X   , 1 ( 1 ( ν g U ) 2 ) X   ] , for all χ > 0.
vii. 
gC =  [ ν g L , ν g U ] , [ μ g L , μ g U ] .
Some certain types of triangular norms and conorms are discussed in the following definition.
Definition 5
[5]. Let ã and    b ˜  be any two real numbers. The Dombi t-norms and Dombi t-conorms are described in the following way:
i. 
Dom(ã,  b ˜ ) =  1 1 + { { ( 1 ã ã ) Ќ + ( 1 b ˜ b ˜ ) Ќ } } 1 Ќ
ii. 
DomC(ã,  b ˜ ) =    1 1 + { { ( ã 1 ã ) Ќ + ( b ˜ 1 b ˜ ) Ќ } } 1 Ќ
where  Ќ 1   and  ( ã ,   b ˜ ) [ 0 , 1 ] × [ 0 , 1 ] . In the above discussion, (i) represents the Dombi product and (ii) represents the Dombi sum.
Definition 6
[35]. Let gċ = (µċ, νċ) (ċ = 1, 2, 3, …, j) be j number of PFEs. A Pythagorean fuzzy Dombi weighted averaging (PFDWA) operator is characterized by a function PFDWA: PFEj → PFE such that
PFDWA ( g 1 , g 2 , , g j ) = ċ = 1 j ( ċ g ċ ) = ( 1 1 1 + { ċ = 1 j ċ ( µ ċ 2 1 µ ċ 2 ) ϑ } 1 ϑ   ,   1 1 + { ċ = 1 j ċ ( 1 ν ċ 2 ν ċ 2 ) ϑ } 1 ϑ   )
where  = ( 1 , 2 , 3 , , j ) T is the weight vector of  g ċ ( ċ = 1 , 2 , 3 , , j ) with  ċ > 0   ,   ċ = 1 j ċ = 1 and  ϑ 1 .
Definition 7
[35]. Let gċ = (µċ, νċ) (ċ = 1, 2, 3, …, j) be j number of PFEs. A PFD ordered weighted averaging operator of dimension j is characterized by a function PFDOWA: PFEj → PFE with the associated weighted vector ꝕ =  ( 1 , 2 , 3 , , j ) T   such that  ċ > 0 ,   ċ = 1 j ċ = 1  and  ϑ 1 . Then,
PFDOWA ( g 1 , g 2 , , g j ) = ċ = 1 j ( ċ g ρ ( ċ ) ) = ( 1 1 1 + { ċ = 1 j ċ ( µ ρ ( ċ ) 2 1 µ ρ ( ċ ) 2 ) ϑ } 1 ϑ , 1 1 + { ċ = 1 j ċ ( 1 ν ρ ( ċ ) 2 ν ρ ( ċ ) 2 ) ϑ } 1 ϑ   )
where ( ρ ( 1 ) , ρ ( 2 ) , , ρ ( j ) ) represents the permutations of  ċ = 1 , 2 , 3 , , j , and  g ρ ( ċ 1 )   g ρ ( ċ )   ċ = 1 , 2 , , j .
Definition 8
[35]. Let gċ = (µċ, νċ) (ċ = 1, 2, 3, …, j) be j number of PFEs. A PFD weighted geometric operator is characterized by a function PFDWG: PFEj→PFE such that
PFDWG ( g 1 , g 2 , , g j ) = ċ = 1 j ( g ċ ) ċ = ( 1 1 + { ċ = 1 j ċ ( 1 µ ċ 2 µ ċ 2 ) ϑ } 1 ϑ   ,   1 1 1 + { ċ = 1 j ċ ( ν ċ 2 1 ν ċ 2 ) ϑ } 1 ϑ   )
where  = ( 1 , 2 , 3 , , j ) T is the weight vector of  g ċ ( ċ = 1 , 2 , 3 , , j ) with  ċ > 0 ,   ċ = 1 j ċ = 1 and  ϑ 1 .
Definition 9
[34]. Let gċ = (µċ, νċ) (ċ = 1, 2, 3, …, j) be j number of PFEs. A PFD ordered weighted geometric operator of dimension j is characterized by a function PFDOWG: PFEj →PFE with the associated weighted vector  = ( 1 , 2 , 3 , , j ) T  such that  ċ > 0   ,   ċ = 1 j ċ = 1  and  ϑ 1 . Then,
PFDOWG ( g 1 , g 2 , , g j ) = ċ = 1 j ( g ρ ( ċ ) ċ ) = ( 1 1 + { ċ = 1 j ċ ( 1 µ ρ ( ċ ) 2 µ ρ ( ċ ) 2 ) ϑ } 1 ϑ , 1 1 1 + { ċ = 1 j ċ ( ν ρ ( ċ ) 2 1 ν ρ ( ċ ) 2 ) ϑ } 1 ϑ )
where  ( ρ ( 1 ) , ρ ( 2 ) , , ρ ( j ) ) represents the permutations of  ċ = 1 , 2 , 3 , , j , and  g ρ ( ċ 1 )   g ρ ( ċ )     ċ = 1 , 2 , , j .
Definition 10
[27]. The score function for IVPF number  α = [ a , b ] ,   [ c , d ]  is defined in the following way:
S ( α ) = ( a 2 c 2 ) ( 1 + 1 a 2 c 2 ) + ( b 2 d 2 ) ( 1 + 1 b 2 d 2 ) 4
where  S ( α ) [ 1 , 1 ] . Particulary, if  S ( α ) = 1 , then  α is the largest IVPFN, i.e.,  [ 1 , 1 ] , [ 0 , 0 ] ; if  S ( α ) = −1, then  α is the least IVPFN, i.e.,  [ 0 , 0 ] , [ 1 , 1 ] . Moreover, the score function satisfies the following properties for any two IVPFNs  α and  β
  • If  S ( α ) < S ( β ) , then  α β
  • If  S ( α ) > S ( β ) , then  α β
  • If  S ( α ) = S ( β ) , then  α β

3. Deficiency of the Existing Score Function of IVPFS and Its Improvement

In this section, we provide an example that indicates the deficiencies in the score function of the IVPFS developed in [28] and improve it in the subsequent discussion.
Example 1.
Let  ς 1 = [ 0.4 , 0.7 ] , [ 0.4 , 0.7 ]  and  ς 2    =  [ 0.3 , 0.4 ] , [ 0.3 , 0.4 ]  be any two IVPFNs. Then, by applying Definition 10 on  ς 1  and  ς 2 , we obtain
S ( ς 1 ) = S ( ς 2 ) = 0
Then, in view of the property (iii) of Definition 10, we have  ς 1 ς 2 , but  ς 1 ς 2 .
This indicates the deficiency in the score function under consideration. The above discussion leads us to improve this score function in the following definition.
Definition 11.
Consider the IVPFN  α = [ a , b ] , [ c , d ] . The improved score function  S ( α )   is defined for  α  as:
S ( α ) = 1 4   ( ( a 2 c 2 + 1 2 ) ( 1 + 1 a 2 c 2 ) + ( b 2 d 2 + 1 3 ) ( 1 + 1 b 2 d 2 ) )
where  h ( α ) is the range of the score function and −0.29  h ( α ) 0.58 .
Moreover, the above score function satisfies the following comparison law for any two IVPFNs  α and  β
  • If  S ( α ) < S ( β ) , then  α β
  • If  S ( α ) > S ( β ) , then  α β
  • If  S ( α ) = S ( β ) , then  α β
Consider the following example to demonstrate the effectiveness of the score function proposed for IVPFN.
Example 2.
The application of the proposed score function  S ( α )  in Equation (1) of Example 1 gives that  S ( ς 1 ) = 0.392  and  S ( ς 2 ) = 0.386 . Thus, in view of property ii of Definition 11, we have  ς 1   ς 2 . This fact suggests that the alternative  ς 1  is better than the alternative  ς 2 .
So, we conclude that the suggested score function offers a more appropriate and efficient approach for decision analysis compared with the current score function, which has proven to be inadequate.

4. Dombi Operations on Interval-Valued Pythagorean Fuzzy Numbers

In this section, we present the Dombi operations in the framework of the IVPF environment.
Definition 12.
Let 1  ϑ 0  X  and  g 1 = [ µ g 1 L , µ g 1 U ] , [ ν g 1 L , ν g 1 U ]  and  g 2 = [ µ g 2 L , µ g 2 U ] , [ ν g 2 L , ν g 2 U ]  be any two IVPFEs. The Dombi operations of t-norms and t-conorms of IVPFEs are explained in the following way:
i. 
g 1 g 2   = ( [ 1 1 1 + { ( ( µ g 1 L ) 2 1 ( µ g 1 L ) 2 ) ϑ + ( ( µ g 2 L ) 2 1 ( µ g 2 L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ( ( µ g 1 U ) 2 1 ( µ g 1 U ) 2 ) ϑ + ( ( µ g 2 U ) 2 1 ( µ g 2 U ) 2 ) ϑ } 1 ϑ ] , [ 1 1 + { ( 1 ( ν g 1 L ) 2 ( ν g 1 L ) 2 ) ϑ + ( 1 ( ν g 2 L ) 2 ( ν g 2 L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ( 1 ( ν g 1 U ) 2 ( ν g 1 U ) 2 ) ϑ + ( 1 ( ν g 2 U ) 2 ( ν g 2 U ) 2 ) ϑ } 1 ϑ ] )
ii. 
g 1 g 2   = ( [ 1 1 + { ( 1 ( µ g 1 L ) 2 ( µ g 1 L ) 2 ) ϑ + ( 1 ( µ g 2 L ) 2 ( µ g 2 L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ( 1 ( µ g 1 U ) 2 ( µ g 1 U ) 2 ) ϑ + ( 1 ( µ g 2 U ) 2 ( µ g 2 U ) 2 ) ϑ } 1 ϑ ] , [ 1 1 1 + { ( ( ν g 1 L ) 2 1 ( ν g 1 L ) 2 ) ϑ + ( 1 ( ν g 2 L ) 2 ( ν g 2 L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ( ( ν g 1 U ) 2 1 ( ν g 1 U ) 2 ) ϑ + ( ( ν g 2 U ) 2 1 ( ν g 2 U ) 2 ) ϑ } 1 ϑ ] )
iii. 
X .   g 1 = ( [ 1 1 1 + { X ( ( µ g 1 L ) 2 1 ( µ g 1 L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { X ( ( µ g 1 U ) 2 1 ( µ g 1 U ) 2 ) ϑ } 1 ϑ ] , [ 1 1 + { X ( 1 ( ν g 1 L ) 2 ( ν g 1 L ) 2 ) ϑ } 1 ϑ ,   1 1 + { X ( 1 ( ν g 1 U ) 2 ( ν g 1 U ) 2 ) ϑ } 1 ϑ ] )
iv. 
g 1 X = ( [ 1 1 1 + { X ( 1 ( µ g 1 L ) 2 ( µ g 1 L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { X ( 1 ( µ g 1 U ) 2 ( µ g 1 U ) 2 ) ϑ } 1 ϑ ] , [ 1 1 + { X ( ( ν g 1 L ) 2 1 ( ν g 1 L ) 2 ) ϑ } 1 ϑ ,   1 1 + { X ( ( ν g 1 U ) 2 1 ( ν g 1 U ) 2 ) ϑ } 1 ϑ ] )
In the following definition, we propose a Dombi arithmetic aggregation operator with IVPFEs, namely, the IVPFDWA operator.
Definition 13.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ] ) be  j  number of IVPFEs. The IVPFDWA operator is characterized by a function $IVPFDWA: IVPFEj IVPFE such that
I V P F D W A ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( ċ g ċ )
where  = ( 1 , 2 , 3 , , j ) T is the weight vector of  g ċ ( ċ = 1 , 2 , 3 , , j ) with  ċ > 0 and  ċ = 1 j ċ = 1 .
Theorem 1.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ]  be  j  number of IVPFEs. The aggregated value of these IVPFEs in the framework of the IVPFDWA operator is an IVPFE and is determined in the following way:
I V P F D W A ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( ċ g ċ ) = ( [ 1 1 1 + { ċ = 1 j ċ ( ( µ g ċ L ) 2 1 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 j ċ ( ( µ g ċ U ) 2 1 ( µ g ċ U ) 2 ) ϑ } 1 ϑ ] , [ 1 1 + { ċ = 1 j ċ ( 1 ( ν g ċ L ) 2 ( ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 j ċ ( 1 ( ν g ċ U ) 2 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ] )
where  = ( 1 , 2 , 3 , , j ) T is the weight vector of  g ċ and 0 ċ ,   ċ = 1 j ċ = 1 .
Proof. 
The proof of this result is established through the use of mathematical induction. □
The application of Definition 12 for  ċ = 2 gives the following outcome:
I V P F D W A ( g 1 , g 2 ) = 1 g 1 2 g 2 = ( [ 1 1 1 + { 1 ( ( µ g 1 L ) 2 1 ( µ g 1 L ) 2 ) ϑ + 2 ( ( µ g 2 L ) 2 1 ( µ g 2 L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { 1 ( ( µ g 1 U ) 2 1 ( µ g 1 U ) 2 ) ϑ + 2 ( ( µ g 2 U ) 2 1 ( µ g 2 U ) 2 ) ϑ } 1 ϑ   ] , [ 1 1 + { 1 ( 1 ( ν g 1 L ) 2 ( ν g 1 L ) 2 ) ϑ + 2 ( 1 ( ν g 2 L ) 2 ( ν g 2 L ) 2 ) ϑ } 1 ϑ ,   1 1 + { 1 ( 1 ( ν g 1 U ) 2 ( ν g 1 U ) 2 ) ϑ + 2 ( 1 ( ν g 2 U ) 2 ( ν g 2 U ) 2 ) ϑ } 1 ϑ ]   )
This means that
I V P F D W A ( g 1 , g 2 ) = ( [ 1 1 1 + { ċ = 1 2 ċ ( ( µ g ċ L ) 2 1 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 2 ċ ( ( µ g ċ U ) 2 1 ( µ g ċ U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 + { ċ = 1 2 ċ ( 1 ( ν g 1 L ) 2 ( ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 2 ċ ( 1 ( ν g 1 U ) 2 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ]   )
Thus, Equation (2) holds for  ċ = 2.
Suppose that Equation (2) holds for  ċ = p. Therefore, we have
I V P F D W A ( g 1 , g 2 , g 3 , , g p ) = ċ = 1 p ( ċ g ċ ) = ( [ 1 1 1 + { ċ = 1 p ċ ( ( µ g ċ L ) 2 1 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 p ċ ( ( µ g ċ U ) 2 1 ( µ g ċ U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 + { ċ = 1 p ċ ( 1 ( ν g 1 L ) 2 ( ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 p ċ ( 1 ( ν g 1 U ) 2 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ]   )
Moreover, for ċ = p + 1, we have
I V P F D W A ( g 1 , g 2 , g 3 , , g p ,     g p + 1 ) = ċ = 1 p ( ċ g ċ ) ( p + 1 g p + 1 ) = ( [ 1 1 1 + { ċ = 1 p ċ ( ( µ g ċ L ) 2 1 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 p ċ ( ( µ g ċ U ) 2 1 ( µ g ċ U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 + { ċ = 1 p ċ ( 1 ( ν g 1 L ) 2 ( ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 p ċ ( 1 ( ν g 1 U ) 2 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ]   ) ( [ 1 1 1 + { p + 1 ( ( µ g p + 1 L ) 2 1 ( µ g p + 1 L ) 2 ) ϑ } 1 ϑ , 1 1 1 + { p + 1 ( ( µ g p + 1 U ) 2 1 ( µ g p + 1 U ) 2 ) ϑ } 1 ϑ     ] ,   [ 1 1 + { p + 1 ( 1 ( ν p + 1 L ) 2 ( ν g p + 1 L ) 2 ) ϑ } 1 ϑ ,   1 1 + { p + 1 ( 1 ( ν g p + 1 U ) 2 ( ν g p + 1 U ) 2 ) ϑ } 1 ϑ ]   )
This means that
I V P F D W A ( g 1 , g 2 , g 3 , , g p ,     g p + 1 ) = ( [ 1 1 1 + { ċ = 1 p + 1 ċ ( ( µ g ċ L ) 2 1 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 p + 1 ċ ( ( µ g ċ U ) 2 1 ( µ g ċ U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 + { ċ = 1 p + 1 ċ ( 1 ( ν g 1 L ) 2 ( ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 p + 1 ċ ( 1 ( ν g 1 U ) 2 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ]   )
Thus, Equation (2) is true for  ċ = p + 1 . Hence, we conclude that Equation (2) is true for any  ċ N .
The following example describes the above-stated fact.
Example 3.
Consider the IVPFEs  ς 1  =  [ 0.1 , 0.5 ] , [ 0.4 , 0.6 ] ,   ς 2 = [ 0.3 , 0.4 ] , [ 0.5 , 0.7 ] , and  ς 3 = [ 0.0 , 0.3 ] , [ 0.1 , 0.6 ] . Let  = (0.2,0.5,0.3)T be the weighted vector of  ς ċ   ( ċ = 1 , 2 , 3 )  and  ϑ = 4 . Then,
I V P F D W A ( ς 1 , ς 2 , ς 3 ) = ċ = 1 3 ( ċ ς ċ ) = ( [ 1 1 1 + { ċ = 1 3 ċ ( ( µ g ċ L ) 2 1 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 3 ċ ( ( µ g ċ U ) 2 1 ( µ g ċ U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 + { ċ = 1 3 ċ ( 1 ( ν g 1 L ) 2 ( ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 3 ċ ( 1 ( ν g 1 U ) 2 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ]   )
Consequently,
I V P F D W A ( ς 1 , ς 2 , ς 3 ) = [ 0.28 , 0.39 ] , [ 0.12 , 0.62 ]  
In the following definition, we propose a Dombi arithmetic aggregation operator with IVPFEs, namely, the IVPFDOWA operator.
Definition 14.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ]  be   j  number of IVPFEs. A IVPFDOWA operator of dimension j is characterized by a function.
IVPFDOWA: IVPFEj   IVPFE with the associated weighted vector  = ( 1 , 2 , 3 , , j ) T such that with  ċ > 0 and  ċ = 1 j ċ = 1 . Therefore,  I V P F D O W A ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( ċ g ρ ( ċ ) ) , where ( ρ ( 1 ) , ρ ( 2 ) , ρ ( 3 ) , , ρ ( j ) ) represents the permutations of  1 , 2 , 3 , , j , respectively, and  g ρ ( ċ 1 ) g ρ ( ċ )     ċ = 1 , 2 , , j .
Theorem 2.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ]  be the j number of IVPFEs. Then, the aggregated value of these IVPFEs in the framework of IVPFDOWA operator is an IVPFE and is determined in the following way:
I V P F D O W A ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( ċ g ρ ( ċ ) ) = ( [ 1 1 1 + { ċ = 1 j ċ ( ( µ g ρ ( ċ ) L ) 2 1 ( µ g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 j ċ ( ( µ g ρ ( ċ ) U ) 2 1 ( µ g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 + { ċ = 1 j ċ ( 1 ( ν g ρ ( ċ ) L ) 2 ( ν g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 j ċ ( 1 ( ν g ρ ( ċ ) U ) 2 ( ν g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ]   ) ,
where  = ( 1 , 2 , 3 , , j ) T is the weighted vector of  g ċ with 0  ċ ,   ċ = 1 j ċ = 1 and  ϑ 1 . Moreover, ( ρ ( 1 ) , ρ ( 2 ) , ρ ( 3 ) , , ρ ( j ) ) represent the permutations of 1, 2, 3, …, j, respectively, and  g ρ ( ċ 1 ) g ρ ( ċ )     ċ = 1 , 2 , , j .
Proof. 
The proof of this theorem is analogous to Theorem 1. □
The following example describes the above-stated fact.
Example 4.
Three researchers  ς 1 , ς 2 , ς 3  of mathematics want to estimate the performance of a student. The estimated values from researchers with respect to research work for a student P specified by IVPF information such as:
ς 1 = [ 0.1 , 0.3 ] , [ 0.2 , 0.5 ] , ς 2 = [ 0.3 , 0.4 ] , [ 0.4 , 0.7 ] , ς 3 = [ 0.4 , 0.4 ] , [ 0.3 , 0.7 ] where the corresponding weighted vector is  = (0.3,0.3,0.4)T and the operational parameter  ϑ = 3 .  To aggregate these values by the IVPDOWA operator, we firstly permute these numbers by using Equation (1) and obtain the following information
ς 1 = 0.31 ,   ς 2 = 0.2 ,   and   ς 3 = 0.27 .
By applying Definition 14, we then permuted values of IVPEs as follows:
ς ρ ( 1 ) = [ 0.1 , 0.3 ] , [ 0.2 , 0.5 ] ς ρ ( 2 ) = [ 0.4 , 0.4 ] , [ 0.3 , 0.7 ] and  ς ρ ( 3 ) = [ 0.3 , 0.4 ] , [ 0.4 , 0.7 ] .
Now,
I V P F D O W A ( ς 1 , ς 2 , ς 3 ) = ċ = 1 j ( ċ ς ρ ( ċ ) ) = ( [ 1 1 1 + { ċ = 1 3 ċ ( ( µ g ρ ( ċ ) L ) 2 1 ( µ g ρ ( ċ ) L ) 2 ) 3 } 1 3 ,   1 1 1 + { ċ = 1 3 ċ ( ( µ g ρ ( ċ ) U ) 2 1 ( µ g ρ ( ċ ) U ) 2 ) 3 } 1 3   ] ,   [ 1 1 + { ċ = 1 3 ċ ( 1 ( ν g ρ ( ċ ) L ) 2 ( ν g ρ ( ċ ) L ) 2 ) 3 } 1 3 ,   1 1 + { ċ = 1 3 ċ ( 1 ( ν g ρ ( ċ ) U ) 2 ( ν g ρ ( ċ ) U ) 2 ) 3 } 1 3 ]   )
Consequently,  I V P F D O W A ( ς 1 , ς 2 , ς 3 ) = ( [ 0.34 , 0.39 ] , [ 0.24 , 0.57 ] ) .
In the following definition, we propose a Dombi geometric aggregation operator with IVPFEs, namely, the IVPFDWG operator.
Definition 15.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ]  be the j number of IVPFEs. The IVPFDWG operator is characterized by a function IVPFDWG: IVPFEj   IVPFE such that
I V P F D W G ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( g ċ ) ċ
where  = ( 1 , 2 , 3 , , j ) T is the weight vector of  g ċ such that  ċ > 0 and  ċ = 1 j ċ = 1 . .
Theorem 3.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ]  be the j number of IVPFEs. The aggregated value of these IVPFEs in the framework of the IVPFDWG operator is an IVPFE and is determined in the following way:
I V P F D W G ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( g ċ ) ċ = ( [ 1 1 + { ċ = 1 j ċ ( 1 ( µ g ċ L ) 2 ( µ g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 j ċ ( 1 ( µ g ċ U ) 2 ( µ g ċ U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 1 + { ċ = 1 j ċ ( ( ν g ċ L ) 2 ( 1 ν g ċ L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 j ċ ( ( ν g ċ U ) 2 1 ( ν g ċ U ) 2 ) ϑ } 1 ϑ ]   ) ,
where  = ( 1 , 2 , 3 , , j ) T is the weight vector of  g ċ , 0  ċ ,   ċ = 1 j ċ = 1 and  ϑ 1 .
Proof. 
Proof of this result is analogous to Theorem 1. □
The following example describes the above-stated fact.
Example 5.
The three analyzers  ς 1 , ς 2 , ς 3  want to check the working ability of a certain machine. The estimated values of the working ability of a certain machine are specified by IVPF information such as:
ς 1 = ( [ 0.4 , 0.6 ] , [ 0.5 , 0.6 ] ) , ς 2 = ( [ 0.5 , 0.7 ] , [ 0.2 , 0.5 ] ) , ς 3 = ( [ 0.3 , 0.4 ] , [ 0.6 , 0.77 ] ) with the corresponding weighted vector  = (0.3,0.5,0.2)T and the operational parameter  ϑ = 5 . Then,
I V P F D W G ( ς 1 , ς 2 , ς 3 ) = ċ = 1 3 ( ς ċ ) ċ = ( [ 1 1 + { ċ = 1 3 ċ ( 1 ( µ g ċ L ) 2 ( µ g ċ L ) 2 ) 5 } 1 5 ,   1 1 + { ċ = 1 3 ċ ( 1 ( µ g ċ U ) 2 ( µ g ċ U ) 2 ) 5 } 1 5   ] ,   [ 1 1 1 + { ċ = 1 3 ċ ( ( ν g ċ L ) 2 ( 1 ν g ċ L ) 2 ) 5 } 1 5 ,   1 1 1 + { ċ = 1 3 ċ ( ( ν g ċ U ) 2 1 ( ν g ċ U ) 2 ) 5 } 1 5 ]   )
Consequently,  I V P F D W G ( ς 1 , ς 2 , ς 3 ) = ( [ 0.34 , 0.46 ] , [ 0.54 , 0.72 ] ) .
In the following definition, we propose a Dombi geometric aggregation operator with IVPFEs, namely, the IVPFDOWG operator.
Definition 16.
Let  ċ = 1 , 2 , 3 , , j  and  g ċ = [ µ g ċ L , µ g ċ U ] , [ ν g ċ L , ν g ċ U ]  be the j number of IVPFEs. An IVPFDOWG operator of dimension j is characterized by a function $IVPFDOWG: IVPFEj   IVPFE with the associated weighted vector  = ( 1 , 2 , 3 , , j ) T  such that  ċ > 0  and  ċ = 1 j ċ = 1 . Therefore,
where  ρ ( 1 ) , ρ ( 2 ) , ρ ( 3 ) , , ρ ( j ) represent the permutations of  1 , 2 , 3 , , j , respectively, and  g ρ ( ċ 1 ) g ρ ( ċ )     ċ = 1 , 2 , , j .
Theorem 4.
Let  g ċ = [ µ g ρ ( ċ ) L , µ g ρ ( ċ ) U ] , [ ν g ρ ( ċ ) L , ν g ρ ( ċ ) U ]  (1, 2, 3, …, j) be j number of IVPFEs. Then. The amassed value of these IVPFEs in the framework of the IVPFDOWA operator is an IVPFE and is determined in the following way:
I V P F D O W G ( g 1 , g 2 , g 3 , , g j ) = ċ = 1 j ( g ρ ( ċ ) ) ċ = ( [ 1 1 + { ċ = 1 j ċ ( 1 ( µ g ρ ( ċ ) L ) 2 ( µ g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 j ċ ( 1 ( µ g ρ ( ċ ) U ) 2 ( µ g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ] , [ 1 1 1 + { ċ = 1 j ċ ( ( ν g ρ ( ċ ) L ) 2 1 ( ν g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 j ċ ( ( ν g ρ ( ċ ) U ) 2 1 ( ν g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ] )
where   = ( 1 , 2 , 3 , , j ) T  is the weighted vector of  g ċ such that 0 ċ ,   ċ = 1 j ċ = 1 and  ϑ 1 . Moreover,  ρ ( 1 ) , ρ ( 2 ) , ρ ( 3 ) , , ρ ( j ) represent the permutations of  1 , 2 , 3 , , j , respectively, where  g ρ ( ċ 1 ) g ρ ( ċ )     ċ = 1 , 2 , , j .
Proof. 
The proof of this result is established through the use of mathematical induction. □
The application of definition 12 for  ċ = 2 gives the following outcome:
I V P F D O W G ( g 1 , g 2 ) = g ρ ( 1 ) 1 g ρ ( 2 ) 2 = ( [ 1 1 + { 1 ( 1 ( µ g ρ ( 1 ) L ) 2 ( µ g ρ ( 1 ) L ) 2 ) ϑ + 2 ( 1 ( µ g ρ ( 2 ) L ) 2 ( µ g ρ ( 2 ) L ) 2 ) ϑ } 1 ϑ , 1 1 + { 1 ( 1 ( µ g ρ ( 1 ) U ) 2 ( µ g ρ ( 1 ) U ) 2 ) ϑ + 2 ( 1 ( µ g ρ ( 2 ) U ) 2 ( µ g ρ ( 2 ) U ) 2 ) ϑ } 1 ϑ ] ,   [ 1 1 1 + { 1 ( ( ν g ρ ( 1 ) L ) 2 1 ( ν g ρ ( 1 ) L ) 2 ) ϑ + 2 ( ( ν g ρ ( 2 ) L ) 2 1 ( ν g ρ ( 2 ) L ) 2 ) ϑ } 1 ϑ , 1 1 1 + { 1 ( ( ν g ρ ( 1 ) U ) 2 1 ( ν g ρ ( 1 ) U ) 2 ) ϑ + 2 ( ( ν g ρ ( 2 ) U ) 2 1 ( ν g ρ ( 2 ) U ) 2 ) ϑ } 1 ϑ ] )
This means that
I V P F D O W G ( g 1 , g 2 ) = ( [ 1 1 + { ċ = 1 2 ċ ( 1 ( µ g ρ ( ċ ) L ) 2 ( µ g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 2 ċ ( 1 ( µ g ρ ( ċ ) U ) 2 ( µ g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 1 + { ċ = 1 2 ċ ( ( ν g ρ ( ċ ) L ) 2 1 ( ν g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 2 ċ ( ( ν g ρ ( ċ ) U ) 2 1 ( ν g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ]   )
Thus, Equation (3) holds for  ċ = 2.
Let us assume that Equation (3) holds for  ċ   = p . Therefore, we have
I V P F D O W G ( g 1 , g 2 , g 3 , , g p ) = ċ = 1 p ( g ρ ( ċ ) ) ċ = ( [ 1 1 + { ċ = 1 p ċ ( 1 ( µ g ρ ( ċ ) L ) 2 ( µ g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ , 1 1 + { ċ = 1 p ċ ( 1 ( µ g ρ ( ċ ) U ) 2 ( µ g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ] [ 1 1 1 + { ċ = 1 p ċ ( ( ν g ρ ( ċ ) L ) 2 1 ( ν g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 p ċ ( ( ν g ρ ( ċ ) U ) 2 1 ( ν g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ] )
Moreover ,   for   ċ = p + 1 , we have
I V P F D O W G ( g 1 , g 2 , g 3 , , g p   , g p + 1 ) = ċ = 1 p ( g ρ ( ċ ) ) ċ ( g ρ ( p + 1 ) ) p + 1 = ( [ 1 1 + { ċ = 1 p ċ ( 1 ( µ g ρ ( ċ ) L ) 2 ( µ g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 + { ċ = 1 p ċ ( 1 ( µ g ρ ( ċ ) U ) 2 ( µ g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ   ] ,   [ 1 1 1 + { ċ = 1 p ċ ( ( ν g ρ ( ċ ) L ) 2 1 ( ν g ρ ( ċ ) L ) 2 ) ϑ } 1 ϑ ,   1 1 1 + { ċ = 1 p ċ ( ( ν g ρ ( ċ ) U ) 2 1 ( ν g ρ ( ċ ) U ) 2 ) ϑ } 1 ϑ ]   ) ( [ 1 1 + { p + 1 ( 1 ( µ g ρ ( p + 1 ) L ) 2 ( µ g ρ ( p + 1 ) L ) 2 ) ϑ } 1 ϑ , 1 1 + { p + 1 ( 1 ( µ g ρ ( p + 1 ) U ) 2 ( µ g ρ ( p + 1 ) U ) 2 ) ϑ } 1 ϑ     ] ,   [ 1 1 1 + { p + 1 ( ( ν ρ ( p + 1