SS symmetry
Article
Some Interval Neutrosophic Dombi Power
Bonferroni Mean Operators and Their Application
in Multi–Attribute Decision–Making
Qaisar Khan 1 , Peide Liu 2, * , Tahir Mahmood 1 , Florentin Smarandache 3 and
Kifayat Ullah 1
1 Department of Mathematics and Statistic, International Islamic University, Islamabad 44000, Pakistan;
qaisarkhan421@gmail.com (Q.K.); tahirbakhat@iiu.edu.pk (T.M.); kifayat.phdma72@iiu.edu.pk (K.U.)
2 School of Management Science and Engineering, Shandong University of Finance and Economics,
Jinan 250014, Shandong, China
3 Department of Mathematics and Sciences, University of New Mexico, 705 Gurley Ave, Gallup, NM 87301,
USA; fsmarandache@gmail.com
* Correspondence: peide.liu@gmail.com; Tel.: +86-531-8222-2188
Received: 16 August 2018; Accepted: 28 September 2018; Published: 2 October 2018
Abstract: The power Bonferroni mean (PBM) operator is a hybrid structure and can take the
advantage of a power average (PA) operator, which can reduce the impact of inappropriate data given
by the prejudiced decision makers (DMs) and Bonferroni mean (BM) operator, which can take into
account the correlation between two attributes. In recent years, many researchers have extended the
PBM operator to handle fuzzy information. The Dombi operations of T-conorm (TCN) and T-norm
(TN), proposed by Dombi, have the supremacy of outstanding flexibility with general parameters.
However, in the existing literature, PBM and the Dombi operations have not been combined for
the above advantages for interval-neutrosophic sets (INSs). In this article, we first define some
operational laws for interval neutrosophic numbers (INNs) based on Dombi TN and TCN and
discuss several desirable properties of these operational rules. Secondly, we extend the PBM operator
based on Dombi operations to develop an interval-neutrosophic Dombi PBM (INDPBM) operator, an
interval-neutrosophic weighted Dombi PBM (INWDPBM) operator, an interval-neutrosophic Dombi
power geometric Bonferroni mean (INDPGBM) operator and an interval-neutrosophic weighted
Dombi power geometric Bonferroni mean (INWDPGBM) operator, and discuss several properties of
these aggregation operators. Then we develop a multi-attribute decision-making (MADM) method,
based on these proposed aggregation operators, to deal with interval neutrosophic (IN) information.
Lastly, an illustrative example is provided to show the usefulness and realism of the proposed MADM
method. The developed aggregation operators are very practical for solving MADM problems, as it
considers the interaction among two input arguments and removes the influence of awkward data
in the decision-making process at the same time. The other advantage of the proposed aggregation
operators is that they are flexible due to general parameter.
Keywords: interval neutrosophic sets; Bonferroni mean; power operator; multi-attribute decision
making (MADM)
1. Introduction
While dealing with any real world problems, a decision maker (DM) often feels discomfort when
expressing his\her evaluation information by utilizing a single real number in multi-attribute decision
making (MADM) or multi-attribute group decision making (MAGDM) problems due to the intellectual
fuzziness of DMs. For this cause, Zadeh [1] developed fuzzy sets (FSs), which are assigned by a
Symmetry 2018, 10, 459; doi:10.3390/sym10100459 www.mdpi.com/journal/symmetry
Symmetry 2018, 10, 459 2 of 32
truth-membership degree (TMD) in [0, 1] and are a better tool to present fuzzy information for handling
MADM or MAGDM problems. After the introduction of FSs, different fuzzy modelling approaches
were developed to deal with uncertainty in various fields [2–4]. However, in some situations, it
is difficult to express truth-membership degree with an exact number. In order to overcome this
defect and to express TMD in a more appropriate way, Turksen [5] developed interval valued FSs
(IVFSs), in which TMD is represented by interval numbers instead of exact numbers. Since only TMD
was considered in FSs or IVFSs and the falsity-membership degree (FMD) came automatically by
subtracting TMD from one, it is hard to explain some complicated fuzzy information, for example, for
the selection of Dean of a faculty, if the results received from five professors are in favor, two are against
and three are neither in favor nor against. Then, this type of information cannot be expressed by FSs. So,
in order to handle such types of information, Atanassov [6] developed intuitionistic fuzzy sets (IFSs),
which were assigned by TMD and FMD. Atanassov et al. [7] further enlarged IFSs and developed
the interval valued IFS (IVIFSs). However, the shortcoming of FSs, IVFSs, IFSs and IVIFSs are that
they cannot deal with unreliable or indefinite information. To solve such problems, Smarandache [8,9]
developed neutrosophic sets (NSs). In neutrosophic set, every member of the domain set has TMD,
an indeterminacy-membership degree (IMD) and FMD, which capture values in ]0− , 1+ [. Due to the
containment of subsets of ]0− , 1+ [ in NS, it is hard to utilize NS in real world and engineering problems.
To make NSs helpful in these cases, some authors developed subclasses of NSs, such as single valued
neutrosophic sets (SVNSs) [10], interval neutrosophic sets (INSs) [11,12], simplified neutrosophic sets
(SNSs) [13,14] and so forth. In recent years, INSs have gained much attention from the researchers
and a great number of achievement have been made, such as distance measures [15–17], entropies of
INS [18–20], correlation coefficient [21–23]. The theory of NSs has been extensively utilized to handle
MADM and MAGDM problems.
For the last many years, information aggregation operators [24–27] have stimulated much
awareness of authors and have become very dominant research topic of MADM and MAGDM
problems. The conventional aggregation operators (AGOs) proposed by Xu, Xu and Yager [28,29] can
only aggregate a group of real numbers into a single real number. Now these conventional AGOs were
further extended by many authors, for example, Sun et al. [30] proposed the interval neutrosophic
number Choquet integral operator for MADM and Liu et al. [31] developed prioritized ordered
weighted AGOs for INSs and applied them to MADM. In addition, some decision-making methods
were also developed for MADM problems, for example, Mukhametzyanov et al. [32] developed a
statistically based model for sensitivity analysis in MADM problems. Petrovic et al. [33] developed
a model for the selection of aircrafts based on decision making trial and evaluation laboratory and
analytic hierarchy process (DEMATEL-AHP). Roy et al. [34] proposed a rough relational DEMATEL
model to analyze the key success factor of hospital quality. Sarkar et al. [35] developed an optimization
technique for national income determination model with stability analysis of differential equation in
discrete and continuous process under uncertain environment. These methods can only give a ranking
result, however, AGOs can not only give the ranking result, but also give the comprehensive value of
each alternative by aggregating its attribute values.
It is obvious that, different aggregation operators have distinct functions, a few of them can reduce
the impact of some awkward data produced by predispose DMs, such as power average (PA) operator
proposed by Yager [36]. The PA operator can aggregate the input data by designating the weight
vector based on the support degree among the input arguments, and can attain this function. Now the
PA operator was further extended by many researchers into different environments. Liu et al. [37]
proposed some generalized PA operator for INNs, and applied them to MADM. Consequently, some
aggregation operators can include the interrelationship between the aggregating parameters, such as
the Bonferroni mean (BM) operators developed by Bonferroni [38], the Heronian mean (HM) operator
introduced by Sykora [39], Muirhead Mean (MM) operator [40], Maclaurin symmetric mean [41]
operators. In addition, these aggregation operators have also been extended by many authors to deal
with fuzzy information [42–46].
Symmetry 2018, 10, 459 3 of 32
For aggregating INNs, some AGOs are developed by utilizing different T-norms (TNs) and
T-conorms (TCNs), such as algebraic, Einstein and Hamacher. Usually, the Archimedean TN and TCN
are the generalizations of various TNs and TCNs such as algebraic, Einstein, Hamacher, Frank, and
Dombi [47] TNs and TCNs. Dombi TN and TCN have the characteristics of general TN and TCN by a
general parameter, and this can make the aggregation process more flexible. Recently, several authors
defined some operational laws for IFSs [48], SVNSs [49], hesitant fuzzy sets (HFSs) [50,51] based on
Dombi TN and TCN. In practical decision making, we generally need to consider interrelationship
among attributes and eliminated the influence of awkward data. For this purpose, some researchers
combined BM and PA operators to propose some PBM operators and extended them to various
fields [52–55]. The PBM operators have two characteristics. Firstly, it can consider the interaction
among two input arguments by BM operator, and secondly, it can remove the effect of awkward data
by PA operator. The Dombi TN and TCN have a general parameter, which makes the decision-making
process more flexible. From the existing literatures, we know that PBM operators are combined with
algebraic operations to aggregate IFNs, or IVIFNs, and there is no research on combining PBM operator
with Dombi operations to aggregate INNs.
In a word, by considering the following advantages. (1) Since INSs are the more précised class by
which one can handle the vague information in a more accurate way when compared with FSs and all
other extensions like IVFSs, IFSs, IVIFSs and so forth, they are more suitable to describe the attributes
of MADM problems, so in this study, we will select the INSs as information expression; (2) Dombi TN
and TCN are more flexible in the decision making process due to general parameter which is regarded
as decision makers’ risk attitude; (3) The PBM operators have the properties of considering interaction
between two input arguments and vanishes the effect of awkward data at the same time. Hence, the
purpose and motivation are that we try to combine these three concepts to take the above defined
advantages and proposed some new powerful tools to aggregate INNs. (1) we define some Dombi
operational laws for INNs; (2) we propose some new PBM aggregation operators based on these new
operational laws; (3) we develop a novel MADM based on these developed aggregation operators.
The following sections of this article are shown as follows. In Section 2, we review some basic
concepts of INSs, PA operators, BM operators, and GBM operators. In Section 3, we review basic
concept of Dombi TN and TCN. After that, we propose some Dombi operations for INNs, and discuss
some properties. In Section 4, we define INDPBM operator, INWDPBM operator, INDPGBM operator
and INWDPGBM operator and discuss their properties. In Section 5, we propose a MADM method
based on the proposed aggregation operators with INNs. In Section 6, we use an illustrative example
to show the effectiveness of the proposed MADM method. The conclusion is discussed in Section 7.
2. Preliminaries
In this part, some basic definitions, properties about INSs, BM operators and PA operators
are discussed.
2.1. The INSs and Their Operational Laws
Definition 1. Let Ω be the domain set [8,9], with a non-specific member in Ω expressed by v. A NS NS in Ω is
expressed by nD E o
v, t NS v , i NS v , f NS v v ∈ Ω ,
NS = (1)
where, t NS v , i NS v and f NS v respectively express the TMD, IMD and FMD of the element v ∈ U e to
v , i NS v f NS v ∈ ]0− , 1+ [ and 0− ≤ t NS v + i NS v +
the set NS. For each point v ∈ U,
e we have, t
NS
f NS v ≤ 3+ .
The NS was predominantly developed from philosophical perspective, and it is hard to be applied
to engineering problems due to the containment of subsets of ]0− , 1+ [. So, in order to use it more easily
Symmetry 2018, 10, 459 4 of 32
in real life or engineering problem, Wang et al. [8] presented a subclass of NS by changing ]0− , 1+ [ to
[0, 1] and was named SVNS, and is defined as follow:
Definition 2. Let Ω be the domain set [10], with a non-specific member in Ω expressed by v. A SVNS SV in Ω
is expressed by nD E o
u, tSV v , iSV v , f SV v v ∈ Ω ,
SV = (2)
where tSV v , iSV v and f SV v express the TMD, IMD and FMD of the element v ∈ Ω to the set SV
respectively. For each point v ∈ Ω, we have, tSV v , iSV v , f SV v , ∈ [0, 1] and 0 ≤ tSV v + iSV v +
f SV v ≤ 3.
In order to define more complex information, Wang et al. [9] further developed INS which is
define as follows:
Definition 3. Let Ω be the domain set and v ∈ Ω [11]. Then an INS I N in Ω is expressed by
nD E o
v, TR Î N v , ID Î N v , FL Î N v v ∈ Ω ,
IN = (3)
where, TR Î N v , ID Î N v and FL Î N v respectively, express the TMD, IMD and FMD of the element
v ∈ Ω to the set I N. For each point v ∈ U,
e we have, TR I N v , ID I N v , FL I N v ⊆ [0, 1] and
0 ≤ maxID I N v + maxID I N v + maxFL I N v ≤ 3.
L U L U L U
For computational simplicity, we can use in = TR , TR , ID , ID , FL , FL to
expressan element in in an INS,
element in is called an interval neutrosophic number (INN).
and the
L U L U L U U U U
Where TR , TR ⊆ [0, 1], ID , ID ⊆ [0, 1], FL , FL ⊆ [0, 1] and 0 ≤ TR + ID + FL ≤ 3.
L U L U L U
Definition 4. Let in1 = TR1 , TR1 =
, ID1 , ID1 , FL1 , FL1
and in2
L U L U L U
TR2 , TR2 , ID2 , ID2 , FL2 , FL2 be any two INNs [12], and ζ > 0. Then the operational
laws of INNs can be defined as follows:
L L L L U U U U L L U U L L U U
(1) in1 ⊕ in2 = TR1 + TR2 − TR1 TR2 , TR1 + TR2 − TR1 TR2 , ID1 ID2 , ID1 ID2 , FL1 FL2 , FL1 FL2 ; (4)
L L U U L L L L U U U U L L L L U U U U
(2) in1 ⊗ in2 = TR1 TR2 , TR1 TR2 , ID1 + ID2 − ID1 ID2 , ID1 + ID2 − ID1 ID2 , FL1 + FL2 − FL1 FL2 , FL1 + FL2 − FL1 FL2 ; (5)
*" # " # " #+
L ζ U ζ L ζ U ζ L ζ U ζ
ζ
(3) in1 = TR1 , TR1 , 1 − 1 − ID1 , 1 − 1 − ID1 , 1 − 1 − FL1 , 1 − 1 − FL1 ; (6)
*" ζ ζ # " # " #+
L ζ U ζ L ζ U ζ
L U
(4) ζin1 = 1− 1− TR1 ,1− 1− TR1 , ID1 , ID1 , FL1 , FL1 . (7)
L L U U L U
Definition 5. Let in = TR , TR , ID , ID , FL , FL [42], be an INN. Then the score function
S in and accuracy function A in can be defined as follows:
L U L U L U
TR + TR ID + ID FL + FL
(i ) S in = +1− +1− ; (8)
2 2 2
Symmetry 2018, 10, 459 5 of 32
L U L U L U
TR + TR ID + ID FL + FL
(ii ) A in = +1− + . (9)
2 2 2
In order to compare two INNs, the comparison rules were defined by Liu et al. [36], which can be
stated as follows.
L U L U L U
Definition 6. Let in1 = TR1 , TR1 , ID1 , ID1 , FL1 , FL1 and in2 =
L U L U L U
TR2 , TR2 , ID2 , ID2 , FL2 , FL2 be any two INNs [42]. Then we have:
(1) If S in1 > S in2 , then in1 is better than in2 , and denoted by in1 > in2 ;
(2) If S in1 = S in2 , and A in1 > A in2 , then in1 is better than in2 , and denoted by in1 > in2 ;
(3) If S in1 = S in2 , and A in1 = A in2 , then in1 is equal to in2 , and denoted by in1 = in2 .
L U L U L U
Definition 7. Let in1 = TR1 , TR1 , ID1 , ID1 , FL1 , FL1 and in2 =
L U L U L U
TR2 , TR2 , ID2 , ID2 , FL2 , FL2 be any two INNs [15]. Then the normalized Hamming
distance between n1 and n2 is described as follows.
1 L L U U L L U U L L U U
D in1 , in2 = TR1 − TR2 + TR1 − TR2 + ID1 − ID2 + ID1 − ID2 + FL1 − FL2 + FL1 − FL2 (10)
6
2.2. The PA Operator
The PA operator was first presented by Yager [36] and it is described as follows.
Definition 8. For positive real numbers ℘h (h = 1, 2, . . . , l ) [36], the PA operator is described as
l
∑ (1 + T (℘h ))℘h
h =1
PA(℘1 , ℘2 , . . . , ℘l ) = , (11)
l
∑ (1 + T (℘h ))
h =1
l
∑
where, T (℘h ) = sup ℘h , ℘y , and sup ℘h , ℘y is the degree to which ℘h supports ℘y . The support
y=1,h6=y
degree (SPD) satisfies the following properties.
(1) sup ℘h , ℘y = sup ℘y , ℘h ;
(2) sup ℘h , ℘y ∈ [0, 1];
(3) sup ℘h , ℘y ≥ sup(℘c , ℘d ), if ℘h − ℘y ≤ |℘c − ℘d |.
2.3. The BM Operator
The BM operator was initially presented by Bonferroni [38], and it was explained as follows:
Definition 9. For non-negative real numbers ℘h (h = 1, 2, . . . , l ), and x, y ≥ 0 [38], the BM operator is
described as
! 1
l l x +y
1
l 2 − l h∑ ∑ h s
x,y x y
BM (℘1 , ℘2 , . . . , ℘l ) = ℘ ℘ . (12)
=1 s=1,h6=s
Symmetry 2018, 10, 459 6 of 32
The BM operator ignores the importance degree of each input argument, which can be given by
decision makers according to their interest. To overcome this shortcoming of BM operator, He et al. [52]
defined the weighted Bonferroni mean (WBM) operators which can be explained as follows:
Definition 10. For positive real numbers ℘h (h = 1, 2, . . . , l ) and x, y ≥ 0 [52], then the weighted BM operator
(WBM) is described as
! 1
l l x +y
1 κeh κes x y
WBM x,y
(℘1 , ℘2 , . . . , ℘l ) = ∑ ∑ ℘ ℘s
l − l h=1 s=1,h6=s 1 − κeh h
2
, (13)
where κe = (κe1 , κe2 , . . . , κel ) T is the importance degree of every ℘h (h = 1, 2, . . . , l ).
The WBM operator has the following characteristics:
T
1 1 1
Theorem 1. (Reducibility) If the weight vector is κe = l, l,..., l , then
! 1
l l x +y
1 y
WBM x,y (℘ 1 , ℘2 , . . . , ℘ l ) = l 2 −l ∑ ∑ ℘hx ℘s (14)
h=1 s=1,z6=s
= BM x,y (℘1 , ℘2 , . . . , ℘m ).
Theorem 2. (Idempotency) Let ℘h = ℘, (h = 1, 2, . . . , l ). Then BM x,y (℘1 , ℘2 , . . . , ℘l ) = ℘.
Theorem 3. (Permutation) Let (℘1 , ℘2 , . . . , ℘l ) be any permutation of Z1 0 , Z2 0 , . . . , Zl 0 . Then
W MB x,y Z1 0 , Z2 0 , . . . , Zl 0 = WBM(℘1 , ℘2 , . . . , ℘l ).
(15)
Theorem 4. (Monotonicity) Let ℘h ≥ Kh 0 (h = 1, 2, . . . , l ). Then
WBM x,y (℘1 , ℘2 , . . . , ℘l ) ≥ WBM x,y K1 0 , K2 0 , . . . , Kl 0 .
(16)
Theorem 5. (Boundedness) The WBMx,y lies in the min and max operators, that is,
min(℘1 , ℘2 , . . . , ℘l ) ≤ WBM x,y (℘1 , ℘2 , . . . , ℘l ) ≤ max(℘1 , ℘2 , . . . , ℘l ). (17)
Similar to BM operator, the geometric BM operator also considers the correlation among the input
arguments. It can be explained as follows:
Definition 11. For positive real numbers ℘h (h = 1, 2, . . . , l ) and x, y ≥ 0 [53], the geometric BM operator
(GBM) is described as
l l
1 1
GBM x,y (℘1 , ℘2 , . . . , ℘l ) = ∏ ∏
x + y h=1 s=1,h6=s
( x ℘ h + y ℘ s ) l 2 −l . (18)
The GBM operator ignores the importance degree of each input argument, which can be given
by decision makers according to their interest. In a similar way to WBM, the weighted geometric
The GBM operator ignores the importance degree of each input argument, which can be given
by decision makers according to their interest. In a similar way to WBM, the weighted geometric BM
(WGBM) operator was also presented. The extension process is same as that of WBM, so it is omitted
here. Symmetry 2018, 10, 459 7 of 32
The definition of power Bonferroni mean (PBM) and power geometric Bonferroni mean (PGBM)
operators are given in Appendix A.
BM (WGBM) operator was also presented. The extension process is same as that of WBM, so it is
omitted
3. Some here. of INSs Based on Dombi TN and TCN
Operations
The definition of power Bonferroni mean (PBM) and power geometric Bonferroni mean (PGBM)
operators are given in Appendix A.
Dombi TN and TCN
3. Some
Dombi Operations
operations of INSs
consist ofBased on Dombi
the Dombi sum TN
andand TCN product.
Dombi
Dombi TN and TCN
Definition 12. Let and be any two real numbers [47]. Then the Dombi TN and TCN among and
are explained
Dombiasoperations
follows: consist of the Dombi sum and Dombi product.
Definition 12. Let = and ℵ be any two real numbers [47].1 Then the Dombi TN and TCN among = and ℵ are
TD (,) ;
explained as follows: 1
1 1 1
(19)
1
TD (=, ℵ) = 1 ; (19)
1−= l 1−ℵ l l
1+ + ℵ
=
1
TD* (∗,) 1 1 ,
TD (=, ℵ) = 1 − 1
1 , (20)
= l ℵ l l (20)
1 1+ 1−= + 1−ℵ
1
1
where, l ≥ 1, and (=, ℵ) ∈ [0, 1] × [0, 1].
where, 1, and , 0,1 0,1.
According to the Dombi TN and TCN, we develop a few operational rules for INNs.
According to the Dombi TN and TCN, we develop
L
a few
U
operational
L U
rules for
L U
INNs.
Definition 13. Let in = TR , TR , ID , ID , FL , FL , in1 =
L U
ID , ID , FL , FL , in1L TRU1 ,TR1 , ID
L 1 , ID1U , FL1 , FL
L 1 U and
L U L U L U L U L U
Definition L 13.U LetL
in TR ,LTR ,U
U
TR1 , TR1 , ID1 , ID1 , FL1 , FL1 and in2 =
TR2 , TR 2 , ID 2 , ID2 , FL2 , FL 2
in2 TR , ID L , INNs and TCN,
L U U L U
be2 ,TR
any2 three 2 ID2 , FL Φ2 >
2 , FL 0.beThen,
any based
threeonINNs
Dombiand
TN and 0 . Then, based on
the following Dombi laws
operational TN are
anddeveloped
TCN, the
for INNs.
following operational laws are developed for INNs.
in1 in 2 1 1
,1
1 , 1
,
1
1 1
L L
L
L
U
U
1 TR1 TR 2 TR1 TR 2 1 ID1 1 ID 2
(1) 1
1
1 TR1 1 TR 2 1 TR1 ID1 ID12
L L U U L L
1 TR 2
(21)
(21)
1 , 1
,
1 ;
1 1 1
L
U
U
L
v U
U
1 ID1 1 ID 2 1 FL1 1 FL 2 1 FL1 1 FL 2
1 1
1
ID1 FL1 FL 2 FL1
U U L L U U
ID 2 FL 2
*
1 1 1
in1 ⊗ in2 = , , 1 − ,
!γ !γ ! γ1 !γ !γ ! γ1 !γ !γ ! γ1
L L U U L L
1− TR1 1− TR2 1− TR1 1− TR2 ID1 ID2
1+ L + L 1+ U + U 1+ L + L
TR1 TR2 TR1 TR2 1− ID1 1− ID2
(2) (22)
+
1 1 1
1− , 1 − , ;
!γ !γ ! γ1 !γ !γ ! γ1 !γ !γ ! γ1
U U L L U U
ID1 ID2 FL1 FL2 FL1 FL2
1+ U + U 1+ L + L 1+ U + U
1− ID1 1− ID2 1− FL1 1− FL2 1− FL1 1− FL2
Symmetry 2018, 10, 459 8 of 32
*
Φin = 1 1 1 1
1 − ,1− , ,
γ γ1 γ γ1 1 1
L γ γ U γ γ
L U
1− ID 1− ID
1+ Φ TR
L 1+ Φ TR
U 1+ Φ L 1+ Φ U
1− TR 1− TR
(3) ID ID
(23)
+
1 1
1 , 1
;
L γ γ U γ γ
1+ Φ 1− FLL 1+ Φ 1− FLU
FL FL
*
Φ
1 1 1 1
in = , , 1 − ,1−
1
L γ γ
1
U γ γ
L
γ γ1 U
γ γ1
1+ Φ 1−TRL 1+ Φ 1−TRU 1+ Φ ID
L 1+ Φ ID
U
(4) TR TR 1− ID 1− ID
(24)
+
1 1
1 − ,1−
L
γ γ1 U
γ γ1
1+ Φ FL 1+ Φ FL
L U
1− FL 1− FL
Now, based on these new operational laws for INNs, we develop some aggregation operators to
aggregate IN information in the preceding sections.
4. The INPBM Operator Based on Dombi TN and Dombi TCN
In this part, based on the Dombi operational laws for INNs, we combine PA operator and BM
to introduce interval neutrosophic Dombi power Bonferroni mean (INDPBM), interval neutrosophic
weighted Dombi power Bonferroni mean, interval neutrosophic Dombi power geometric Bonferroni
mean (INDPGBM) and interval neutrosophic weighted Dombi power Bonferroni mean (INWDPGBM)
operators and discuss some related properties.
4.1. The INDPBM Operator and INWDPBM Operator
L U L U L L
Definition 14. Let ini = TRi , TRi , IDi , IDi , FLi , FLi , (i = 1, 2, . . . , l ), be a group of INNs,
and x, y ≥ 0. If
x
y x+1 y
1 l l 1 + T (ini ) l 1 + T (in j )
I NDPBM x,y in1 , in2 , . . . , inl (25)
= 2 ⊕ ini ⊗D in j .
l −l l l
⊕ 1 + T (inu ) ⊕ 1 + T (inu )
i, j = 1
u =1 u =1
i 6= j
then I NDPBM x,y is said to be IN Dombi power Bonferroni mean (INDPBM) operator, where T inz =
l
⊕ Sup inz , ins . Sup inz , ins is the support degree for inz from ins , which satisfies the following
s=1,s6=z
axioms: (1) Sup inz , ins ∈ [0, 1]; (2) Sup inz , ins = Sup ins , inz ; (3) Sup inz , ins ≥ Sup in a , inb ,
if D inz , ins < D in a , inb , in which D in a , inb is the distance measure between INNs in a and inb defined
in Definition 7.
In order to simplify Equation (25), we can give
1 + T inz
Λz = (26)
l
⊕ 1 + T inz
z =1
In order to simplify Equation (25), we can give
z
1 T in z
1 T in
l (26)
z
Symmetry 2018, 10, 459 z 1 9 of 32
l
and call 1 , 2 ,..., l is the power weight vector (PWV), such that z 0, z l1. It turns
T
and call Λ = (Λ1 , Λ2 , . . . , Λl ) T is the power weight vector (PWV), such that Λz z ≥
1 0, ⊕ Λ = 1. It
z
z =1
Equation (25)Equation
turns into the (25)
following
into theform
following form
1
1
y x y
1 l
x x +y
INDPBM x, y
in1 , in 2 ,...., inl 2 l i ini D l j in j . (27)
l 1l i , j 1 l
x y
I NDPBM x,y in1 , in2 , . . . , inl = 2 i j lΛi ini ⊗ D lΛ j in j .
⊕ (27)
l − l
i, j = 1
i 6= j
Theorem 6. Let ini TRi , TRi , IDi , IDi , FLi , FLi ,(i 1, 2,..., l ) be a group of INNs. Then the value obtained
L U L U L L
by utilizing Equation (25) is expressed
Las U
L U
L L
Theorem 6. Let ini = TRi , TRi , IDi , IDi , FLi , FLi , (i = 1, 2, . . . , l ) be a group of INNs.
Then the value obtained by utilizing Equation
INDPBM (25)
x, y
inis expressed
1 , in 2 ,...., ine as
1
1
2 e 2 l
l l x y , l l x y ,
1 1 x y 1 i 1
1 1 x y 1 i 1
TR i TR Lj TR i TRUj
L U
i , jj1 i , jj1
li l j li l j
1 TR i 1 TR 1 TR i 1 TRU
L L U
j
j
1
1
2 l 2 l
l l x y ,1 l l x y ,
1 1 1 x y 1 i 1 L
1 1 x y 1 i 1
1 ID i 1 ID Lj 1 ID i 1 IDUj
U
i , jj1 i , jj1
li l j li l j
ID i ID ID i IDU
L L U
j
j
(28)
(28)
1
1
2 l 2 l
l l x y l l x y
1 1 1 x y 1 1 L
L
,1 1 1 x y 1 1 U
.
U
ii, jj1 1 FLi 1 FL j ii, jj1 1 FLi 1 FL j
l i L l j L l i U l i U
FLi FL FLi FL
j j
Proof. Proof of Theorem 6 is given in Appendix B.
Proof. Proof of Theorem 6 is given in Appendix B. □
In orderInto determine
order the PWV
to determine the PWV ,Λ,we
wefirstly
firstly need todetermine
need to determinethethe support
support degree
degree among
among INNs.
INNs. InIngeneral, the similarity measure among INNs can replace the support degree among
general, the similarity measure among INNs can replace the support degree among INNs. That is, INNs.
That is,
Sup ini , inm = 1 − D ini , inm (i, m = 1, 2, . . . , l ). (29)
Example 1. Let in1 = h[0.3, 0.7], [0.2, 0.4], [0.3, 0.5]i, in2 = h[0.4, 0.6], [0.1, 0.3], [0.2, 0.4]i and in3 =
h[0.1, 0.3], [0.4, 0.6], [0.2, 0.4]i be any three INNs, x = 1, y = 1, γ = 3. Then by Theorem 6
in
Equation (28),
we can aggregate
three INNs and generate the comprehensive value in =
these
L U L U L U
TR , TR , ID , ID , FL , FL which is calculated as follows:
Symmetry 2018, 10, x 10 of 32
Sup ini , inm 1 D ini , inm (i, m 1, 2,...., l ). (29)
Sup ini , inm 1 D ini , inm (i, m 1, 2,...., l ). (29)
Symmetry
Example2018, 10,
1. 459 Let in1 0.3,0.7, 0.2,0.4, 0.3,0.5 , in2 0.4,0.6, 0.1,0.3, 0.2,0.4 and 10 of 32
in3 0.1,0.3 , 0.4,0.6 , 0.2,0.4 be any three INNs, y 1, 3 . Then by Theorem (6) in Equation
x ,1,0.3,0.5
Example 1. Let in1 0.3,0.7, 0.2,0.4 , in2 0.4,0.6,0.1,0.3,0.2,0.4 and
Step 1. Determine the
(28), we can aggregate these three i INNssupports Sup in , in j , i, j = 2, 3 by using
and 1,generate Equation (29),value
the comprehensive and then
in3 L U0.1,0.3
in TR , TR ID L ,ID, U0.4,0.6
L , FL
, U0.2,0.4
becalculated
any
three INNs, x 1, y 1, 3 . Then
by Theorem
(6) in Equation
we ,get
in1 , in2 which
Sup , FL = isSup in2 , inas1 follows:
= 0.9, Sup in1 , in3 = Sup in3 , in1 =
(28), we can aggregate these
three
INNs and generate the comprehensive value
0.933, Sup Lin2 ,Uin3 =
TR L , TRU , ID
Stepin1. Determine
the, ID supports
Sup in3 , in2 = 1.
, FL L , FLUSup
which
j 1,2,3 by asusing
ini , in j ,isi, calculated
3
follows: Equation (29), and then we get
supports
Step 2. Sup Determine the PWV Because T in z = ∑ Sup in z , in , and
in1 , in2 Sup in 2 , in1 0.9, Sup in1, in3 Sup in3 , in1 0.933, Sup in 2 , in 3 Sup in 3 , in2 1.
s
Step 1. Determine the
Step 2. Determine the PWV
s=1,s6=z
Sup ini , in j , i, j 1,2,3 by using Equation (29), and then we get
Sup Tin1in
Because
Sup
, inz 2 Sup
3
in 2 , inin1 z ,in0.9,
andin1, in3 Sup in3 , in1 0.933, Sup in 2 , in 3 Sup in 3 , in2 1.
s , Sup
s 1, s z
Sup in , inthe PWV
Step 2.T inDetermine Sup in , in 1.833, T in Sup in , in Sup in , in 1.9, T in Sup in , in Sup in , in 1.933,
1 1 2 1 3 2 2 1 2 3 3 3 1 3 2
then 3
Because T in z Sup in z , in s , and
s 1, s z
T in1 + 1
then Λ1 = = 0.3269,
T in1 Sup in1 , in2 TSup inin , in3 1 1.833, 2 Sup 1 T 3 1.9, T in3 Sup in3 , in1 Sup in3 , in2 1.933,
11 + + TTTin inin
1 1
2 + 1
in +
2 , in Supin in2 , in+
3 1
1 0.3269,
T in1 1 T in 2 1 T in3 1
then T in 2 + 1
Λ2 = = 0.3346,
T in1 + 1 + T Tin2 in21T in T in3 + 1
+1 1 1+
2 1 0.3346, 0.3269,
T in1 1 T in2 1 T in3 1
in3 1
T in1 T1 in3T in 1
T
+ 1
2
= 0.3385.
Λ3 =
T in3 1
T in1 + 1 + T in2T in +21 1+ T in3 + 1
0.3385.
1 T in 1
0.3346,
T in 1 T in 1 T in 1
T in 1 T in
3
2
1 2 L2 3U L U L U
Step 3.
Determine the comprehensive value in = TR , TR , ID , ID , FL , FL 1
by using 3
U L U L U
Step 3. Determine the comprehensive value in TR , TR , ID , ID , FL , FL by using Equation (28), we
L
Equation (28), we have T in3 1
have 3 0.3385.
T in1 1 T in
2 1 T in3 1
3
x y 1 2 1 2 1 2
1 L 3 U1
, ID L, IDUL ,3 FL L, FLLU 3 1
TR L in TR
1 3
Step 3. Determine the comprehensive value
i , j 1 TR L
3
TR L
3
TR L
, TR
L 31 TR 33 TR
by using
TREquation
TR(28),
we
L 3 L 3
3i 3 31 3
L L
i j
3 2 31
i j 1 2 1 3 2 1
L
j
L
L
2
L
L
1 TRi 1 TR j 1 TR1 1 TR 2 1 TR1 1 TR 3 1 TR 2 1 TR1
have
1 2 1 2 1 2
1 L 3 3
1 3
3
1 3
3
0.1281
3
TR 2 x TR 3 yL
TR 3
L
1 TR1
L
2 TR L TR 1 2
L
2 1 2
3 21 L 3L3 3 L
3 1 L 31 L 3L
33 L33 3 1L
3
3 2 3 3 1 3
3
i ,j 1 1 TR 3
TR
TR1 2 TR L TR L TR L
L LL
i j 1 TR 2 TRi 1 TR3 TR j 1 1 TR1 TR2 1 TR3 1 TR
3i 3 j 3 3 31 33 3 2 3
3 2 1
L
L
1
L
2
L
L
L
L
1
L
1 TRi 1 TR j 1 TR1 1 TR 2 1 TR1 1 TR 3 1 TR 2 1 TR1
1
1
3
3
2
1 1 2 1 2
1 1 3 1 0.1281
3L 3 3
3 TR
2
L 1 TRL 1
3 3 3
3
TR L1 1 TR
L L
3
2
1 TR
33 1 1 1 3 TR 0.2590
i , j133 L 31L 1 L L 3
−
33 2
3 3 1
3 1L 3 2
3 2
L
∑
2
TR3
L L
1/1 + 1 TR 2 × 1/ TR3 i j 1/
1 TR 3
TR 1 TR13 +
TR = 0.2590
i j
1 1 1 TR 2
1 TR Lj
3
1+1 i L
jγ γ
L
L
!
3Λ i i TR
1 TR TR
3Λ j j L
i, j = 1
i
L
1− TR
i 6= j
i 1− TR j 1
3
Similarly, we can get n
0.2590,
2
3
0.5525 , 0.2221,0.4373 , 0.2334,0.4365 .
3 3
1
1 1 0.2590
1 1 1 1 i
1
TR iL
TR Lj
Similarly, we can get n = 0.5525], [0.2221,
h[0.2590,
, j 1
i j
0.4373 ] , [ 0.2334, 0.4365 ]i .
3 j
3 i
1 TR Lj
L
1 TR
i
L U L U L L
Theorem 7. (Idempotency) Let ini = TRi , TRi , IDi , IDi FLi , FLi , (i =
Similarly, we can get n 0.2590,
all 0.5525 , 1,0.2221,0.4373
2, . . . , l ) are , 0.2334,0.4365
equal, that is . ini
2, . . . , l ), be
1, a group of INNs, if ini (i = = in =
L U L U L U
TR , TR , ID , ID , FL , FL , (i = 1, 2, . . . , l ),. Then
I NDPBM x,y in1 , in2 , . . . , inl = in. (30)
Symmetry 2018, 10, 459 11 of 32
Proof. Proof of Theorem 7 is given in Appendix C.
Symmetry 2018, 10, x 11 of 32
Theorem 8. (Commutativity) Assume that in0 u is any permutation of inu (u = 1, 2, . . . , l ), then
Theorem 7. (Idempotency) Let ini TRiL , TRUi , IDiL ,IDUi FLiL , FLiL ,(i 1,
2,..., l ) , be a group
of INNs, if all
I NDPBM x,y in0 1 ,in0 2 , . . . , in0 l = I NDPBM x,y in1 , in2 , . . . , inl . (31)
ini i 1, 2,..., l are equal, that is ini in TR , TR , ID , ID , FL , FL , i 1, 2,..., l , .
L U L U L U
Then
Proof. From Definition 14, we have
INDPBM x , y in1 , in2 ,..., inl in. (30)
1
x +y
Proof. Proof of Theorem 7 is given in Appendix
C.□
1 y l x
x,y
∑ lΛ0 i in0 i ⊗ D lΛ0 j in0 j
I NDPBM 0 0 0
in 1 , in 2 , . . . , in e = 2
,
l − l
u is any i,permutation
j=1 of inu u 1, 2,..., l , then
Theorem 8. (Commutativity) Assume that in
i 6= j
and
INDPBM x, y in1 , in2 ,..., inl INDPBM x , y in1 , in2 ,..., inl . (31)
1
x +y
Proof. From Definition (14), we have
l x 1 y
1
I NDPBM x,y in1 , in2 , . . . , inl = ∑
2 lΛi ini y ⊗ xD
y lΛ j in j .
l − 1l
i D l j in j ,
l x
l 2 l i
INDPBM x , y in1 , in2 ,..., ine i in1
i, l =
j
, j 1
i j
i 6= j
and
Because, 1
x y
INDPBM0x , y 0in1 ,xin2 ,..., inl 0 0 2 y l i ini D l j inx j .
l x y
l 1 l y
∑ lΛ i in i ⊗ D lΛ j in lj l=i , j 1 ∑ lΛi ini ⊗ D lΛ j in j ,
i, j = 1 i j
i, j = 1
Because, i 6= j i 6= j
l in
l x y l x y
i i D l j in j l i ini D l j in j ,
Hence, I NDPBM x,y in0ii1,j,j1in0 2 , . . . , in0 l = I NDPBM i , j 1x,y
i j in1 , in2 , . . . , inl .
hence, INDPBM x , y in1 , in2 ,..., inl INDPBM
x, y
inl . □
in1 , in2 ,...,
L
U
L
L
L
U
Theorem 9. (Boundedness) Let ini = TRi , TRi
, IDi ,
, FLi , FLi , (i = 1, 2, . . . , l )
IDi
ini TRi , TRi l , IDi , IDL i , FL
U i , FLli ,(i 1,L 2,..., l U
L U L U L L
l
Theorem 9. (Boundedness) Let + ) be a group L of INNs,
U −
and
be a group of INNs, and in
= TRi , TR
max i , min ID i , ID i , min FLi , FLi , in =
l l L U l L U l L U i=1 i =1l i =1
U TRi , TRi , max IDi , IDi , max FLi , FLi , . Then
l L U L U l L U
in max L TR , TRU , minl IDi , IDLi , minU FLi , lFLi , inL min
i
i 1
i
i1 i1 i 1 i1 i1
min TR i , TRi , max ID i , ID i , max FLi , FLi ,. Then
i =1 i =1 i =1
INDPBM in1 , in2 ,..., inl
− in in . + (32)
in ≤ I NDPBM in1 , in2 , . . . , inl ≤ in . (32)
Proof. Proof of Theorem 9 is given in Appendix D. □
Proof. Proof of Theorem 9 is given in Appendix D.
Now, we shall study a few special cases of the INDPBM x, y with respect to x and y.
Now, we shall study a few special cases of the I NDPBM x,y with respect to x and y. (1) When
(1) When y 0, 0, then we can get
y → 0, γ > 0, then we can get
INDPBM x,0 in1 , in2 ,...., inl
Symmetry 2018, 10, x 11 of 32
Symmetry
Symmetry 2018,
2018, 10, 10,
459x 12
12ofof3232
Symmetry 2018, 10, x 12 of 32
Theorem 7. (Idempotency) Let ini TRi , TRi , IDi , IDi FLi , FLi ,(i 1, 2,..., l ) , be a group of INNs, if all
L U L U L L
1
1
1 1
in i 1, 2,..., l
L U L U L U
are equal, that is ini in
TR , TR ,ID ,ID , FL , FL , i 1, 2,..., l , . Then
, 1 1 l 2 l 1 l 1
i
l 2 l l
1
x x
lim 1 1 2
1
2
,
l x l x l
TR i ,
y 0
l
l
L U
x l x
TR i ,
i , j 1 i , j 1
lim 1 1 1 1 1 1 1 1
i j
l i
i j
l i
y 0
x i , j 1 xL , Ly x i , j 1
2 ,..., inl in.
U U
TR i i in TR i i
i j INDPBM 1 TR 1, in i j 1 TR (30)
l i l i
1 TR i
L U
1 TR i
1
1
1 1
Proof of Theorem 7 is given
Proof. in Appendix
C.□
l 2 l l x l 2 l l x
1 1 1 2 1 1
, 1 1 2 1 1 ,
1 l x l 1 ii , jj1 1
l
1 x ID iL 1 l x l 1 ii , jj1 1
l 1 x IDUi
1 1 x
, 1
, (33)
(33)
in u 1, 2,..., l ,
is anyin
i , j 1 l
i i , j 1 l
i
then
L x U
Theorem
8. (Commutativity) i Assume
j
li
that
1 IDID
L
i i u
permutation of i j u
l i
1 IDID
U
i i (33)
ID i ID i
L U
1 1
INDPBM
x, y
in 1 , in 2 ,..., in l INDPBM
x , y
in 1 , in 2 ,..., in l . 1
(31)
1
l 2 l l x l 2 l l x
1 1 1 2 1 1
, 1 1 2 1 1 .
1 l x l 1 ii , jj1 1
l
1 x ID iL 1 l x l 1 ii , jj1 1
l 1 x IDUi
Proof. 1 1
From Definition
i , jwe
(14), have l i LL
, 1
i , j 1
l i UU
.
x 1
x 1 ID
i j
1 ID ID i i
i j
ID i i
l l
ID iL
1
i i
U
x y IDi
in , in ,..., in l
1
l in
l
x y
x, y
INDPBM 1 2 e i D l j in j ,
l i , j 1
2 i
i j
(2)(2)
When
x 1,=y1,y0,→
Whenx γ>
0,0, 0, we
then then weget
can can get
(2) When x 1, y 0, 0, then we can get
and
INDPBM 1,0 in1 , in2 ,...., inl 1
1,0 in1 ,l in2 ,...., inl
x y
l in
INDPBM
INDPBM x , y in1 , in2 ,..., inl 2 .
x y
1
l l i
l in
i i D j j
1 , j 1 1
1 i j
1
Because,
l x ly
y l
lim 1 1 l 2
l
l
1
1 l 2 l 1 l i in
1
x
1
, 1 1 l 2
l 1
1 1
1 U
,
i , j 1i D l1j inL j , l1i in1i l 2 D l j inj i , j 1 ,
l l
y 0
TR
lim 1
i , j 1
i , j 1
i j 1
l i TR i
i, j 1 l 1
i , j 1
i j 1
l i i ,
L U
y 0
i j
L
i j i j
U
i j TR
1 TRLi 1 TRUi
TR
l i l i
i i
hence, INDPBM
x, y
in1 , in2 ,...,inl INDPBM
1 TR i x
,
1
in
y
1 , in
2 ,..., in
l . □
1 TR i
1
1 1
L
L U
U
(34)
l L
L
l
Theorem 1 l 2 l 1 Let 1ini
1 19. (Boundedness) TRi1, TRi ,ID i ,IDi , FL ,(i 1, 2,..., l ) be a group of INNs, , and
l 1 L , 1
1 i , FL
l 2 i
l
1
l 1
1
i , j 1 1 , 1 i , j 1 1 1 1 IDUi ,
1 l 1 L 1 Ul ll 1 L l Li 1 UIDLi l L U l L i
1 l 2 l 1 (34)
l
2
j iU
UU
iU l j
L
in max TRi , TR i , min IDi , ID ii j , min FLi , 1FL
i L i ,in i ,TR i
l
FLi1,FL
.Then
(34)
min TR , max ID
i , ID , max ,
i , j 1 , j 1
i1 l ID i i1 i1 l ID i
i Ui
i1 ID
i1
i ID
i1
i j i
i
ID i
L i
U
ID i
1 1
in INDPBM in1 , in 2 ,..., in in . (32)
1
1
l
l l
1 1 1 l 2 l 1 1
1
, 1 1 l 2 l 1 1
1
.
1 l 2 l 1
i , j 1 1 in Appendix 1 L D.□ i , j 1 1 1 U .
l 2 l 91 is given
1 of1Theorem
l l
i i
1Proof ,
l i 1 FLLi l i 1 FLUi
Proof. i j 1 i j
i, jj1
FLi i i
, j 1
1 FL i j 1 FL
L U
FL
l i l i i
Now,
L
the
U
we shall study a few special withrespect to xFLiand y.
x , y
FL cases
i of INDPBM
(1) When y 0, 0, then we can get
(3) When x = y = 1, γ > 0, then we can get
(3) When x y 1, 0, then we can get
(3) When x y 1, 0, then we can get x ,0
INDPBM 1,1in1 , in2 ,...., inl
INDPBM in1 , in2 ,...., ine
INDPBM 1,1 in1 , in2 ,...., ine
Symmetry 2018, 10, x 11 of 32
Symmetry 2018, 10, 459 13 of 32
Let ini TRi , TRi , IDi , IDi FLi , FLi ,(i 1, 2,..., l ) , be a group of INNs,
L U L U L L
Theorem
Symmetry
Symmetry 2018,7.
2018, 10,(Idempotency)
10, xx 13of
13 if32
of all
32
ini i 1, l are equal, ini in TR , TR ,11ID , ID , FL , FL , i 1, 2,..., l , .
L U L U L U
2,..., that is Then 11
22 l l 22 l l
1 ll ll 1 x , y , 1 1 ll ll 1
, ,
11 11
x y xx yy
x y
i 2l2 in i
11 1 22 1
INDPBM in 1, , in 1 in
1 2 ,..., 1 . (30)
LL LL
TR TRi i TR
UU UU
,ij, j 11
,ij, j 11
i i j j llj j TR j j LL i i j j TR llj j TR j jUU
TRi i TR
l
l lli i
11TR 11TR 11TR
i
L UU
i L
TRi i TRj j
TRi i 11TRTRj j
Proof. Proof of Theorem 7 is given in Appendix C. □
11
11
Theorem
1 1
22
8. ll ll
l l
1 (Commutativity)
11
Assume xx that yyinu is 22
any permutation
ll ll of l l in u 1, 2,..., l , then
11
u xx yy
, ,
1 1 1 22 11 LL
LL
,1,1 11 11 22 11 UU
UU
(35)
1 IDj j (35) (35)
i ,ij, j 11
11ID 1 ID i ,ij, j 11
11ID
i i j j llj j1 IDLL j j i i j j llj j1 ID
IDi i IDi i
l
l l
l
ID x , y
1 , in
ID l INDPBM in1, in2 ,..., inl ID.IDi i IIDDj j
i i LL x, y i i UU UU
INDPBM IDi i in 2ID,...,
j j in (31)
11
11
From
Proof. Definition
(14), we have
22 l l 22 l l
1 1 1 ll ll 1 xx yy ,1,1 11 1 ll ll 1 1 xx yy . .
1
1 1
22 1
i ,ij,j11
11
LL 1
22 1 1
i ,ij,j11 y
1
1
x y
FLi i 11FL FLi i 11FL
1x1,yFL
LL UU UU
i i j j FL
l
x i i j j 11FL FL
l
L 1 , in2j ,...,
l LLe
jj
2 i D l j in j lli i, UU lli i UU
i in
l
jj
INDPBM i i Lin
l l in
FLi i FL
j
FL FLj j l l i , j 1
ii
FLFL j j
i j
and
In the INDPBM operator, we can only take the correlation among the input 1 arguments and cannot
In the
In the INDPBM
INDPBM operator, operator, we we can can only only take take the correlation
the correlation among among the the inputinput
x y arguments and
arguments and
consider the importance degree of input arguments. 1 In what follows, the INWPDBM operator shall be
l x y
cannot consider
cannot
proposed
shall be
shall
consider thethe importance
to overcome
be proposed
proposed to
importance
INDPBM
to overcome
the shortcoming
overcome the
degree
x , y degree
in1 , in2 ,..., in of
of
shortcomingof
the shortcoming
input
input
ofl the
arguments.
arguments.
INDPBM
ofl 2the
l iINDPBM
the ,INDPBM
j 1
lIn
In what
what
i ini
operator.
follows,
follows,
D l j in j
operator.
operator.
the
the
INWPDBM
INWPDBM
. operator
operator
i j
Because, L U L U L L
Definition Letininin
15.Let i = TR LL
TRTR
UU
,ID TR
LL
i i i ,,,FL
UU
ID LL
, ID
LL
i,(ii ,1,1,2,...,
FLill),) ,FL , (i = 1, 2, . .then. , l ),the
be INWDPBM
a group of INNs,
ii
Definition
Definition 15.
15. Let TRili ,,TR i i ,,i ID i i ,x,ID
ID FLi i ,,iFL
FL i i y ,( 2,..., , be
be
x iaa group
group of INNs,
of INNs, then the INWDPBM
l y
then the INWDPBM operator
operator isis defined
operator defined as
as
is idefined as
i , j 1
l in i D l
j in j i
i , j 1
l in i D l j in j ,
i j i j
11
hence, INDPBM x , y in1 , in2 ,..., inl INDPBM x , y in1 , in2 ,..., inl .xx□ yy xxyy
lw inii))11 lw inii))11
11 ll ii
lw TT((in lwii TT((in
inll 2 L U in ll injj ,,
ll L U L iniLi DD 1, 2,...,
xx, ,yy
(36)(36)
INWDPBM in
INWDPBM in11,,in
in22,...,
,...,in in
Theorem 9. (Boundedness) Let inill2 TR 11 i , IDi , IDi , FLi , FLi ,(i
INNs,
(36)
ll iii, ,j,jTR
iijj
l ) be a group of and
w wzz TT((in zz1)
in 1)
ww T
T ((in
in z 1)
1)
L U zz11 l zz z
l
l zz11U
in max TRi , TRi , min IDi , IDi , min FLi , FLi , in min TRi , TRi , max IDi , IDi , max FLi , FLi , . Then
l L U l L U L U L l L U
i 1 i1 i1
i 1 i1 i1
ll l
0,x,INDPBM TT inl in . T
where,TTT in
where,
where, in
inii i
= ∑
Sup
Sup Sup
in
in ii,, in
in in
jj ,,
i ,
xxin
,, in
y
y j ,
0,
=jj 1,i 6= j
wwy
> 11 22
w
w0,,,ww
w in
= 1 ,(in
,....,
,...., w
w
wll
2 ,...,
1 , w is
2 ,
is . .
the.
the , w l ) is the importance
importance
importance degree of
degree of thedegree
the INNs,
INNs, (32)INNs,
ofsuch
the
such
jj1,1,iij
ll l
Proof.Proof
such00that
that
that wzz0≤
w 1w
1of 1,
z ≤
zzTheorem
1,2,...,
2,..., 9 is and
1(z ll= 1,
and
given
2, . , lk)k
..w
in w 1.1. ∑ D.
and
Appendix
wk = 1.
□
kk11 k =1
x , y
Now, we shall study LL a few
L special UUU cases LL ofLLthe INDPBM
L with respect to x and y.
L U L
Theorem
Theorem 10. 10.
10. Let in
Let inini i i TR
Let =
UU
TR ,
LL
TR
, ID , ID
FLi i i,(,(ii 1,1,2,...,
, FL , FL
be , (i = of
1, 2, . . . , l )Then
be a the
group of INNs.
Theorem TRi i ,,TR
TRi i ,,i ID IDi i ,,ID
ID i i ,, FL FLi i ,,iFL 2,...,ill)) be aa group
group of INNs.
INNs. Then the value
value
i i
(1) When y 0, 0, then we can get
Then the value obtained using Definition 15, is represented by
obtained using
obtained using Definition
Definition (15), (15), is is represented
represented by by
INDPBM
INDPBM xx, y, y x ,0
INDPBMin
in11,,in
in ,,....,
in221,....,
in2in inl l inl
,....,
Symmetry 2018, 10, 459 14 of 32
Symmetry 2018, 10, x 14 of 32
1
1
l2 l l x y l2 l l x y
1 1 , 1 1 ,
TR TR
1 1 1 1
x y x y
ii ,jj1 lwi T (ini ) 1 L
lw j T (ini ) 1 L
ii ,jj1 lwi T (ini ) 1 U
lw j T (ini ) 1 U
i TR j i TR j
1 TR 1 TR
l L l
1 TR j
L l U
l
1 TR j
U
wz T (in z 1) i wz T (in z 1)
wz T (in z 1) i wz T (in z 1)
z 1 z 1 z 1 z 1
1
1
l2 l l x y l2 l l x y
1 1 1 , 1 1 , (37)
(37)
1 ID 1 ID
1 1 1 1
x y x y
ii ,jj1 lwi T (ini ) 1 L
lw j T (ini ) 1 L
ii ,jj1 lwi T (ini ) 1 U
lw j T (ini ) 1 U
i 1 ID j i 1 ID j
ID ID
l L l L
l U l U
wz T (in z 1) i zw T (in z 1) ID j wz T (in z 1) i z
w T (in z 1) ID j
z 1 z 1 z 1 z 1
1
1
l2 l l x y l2 l l x y
1 1 1 , 1 1 .
1 FL 1 FL
1 1 1 1
x y x y
ii ,jj1 lwi T (ini ) 1 L
lw j T (ini ) 1 L
ii ,jj1 lwi T (ini ) 1 U
lw j T (ini ) 1 U
i 1 FL j i 1 FL j
FL FL
l L l
FL j
L l U
l
FL j
U
wz T (in z 1) i wz T (in z 1)
wz T (in z 1) i wz T (in z 1)
z 1 z 1 z 1 z 1
Proof. Proof of Theorem 10 is similar to Theorem 6. □
Proof. Proof of Theorem 10 is similar to Theorem 6.
Similar to the INDPBM operator, the INWDPBM operator has the properties of boundedness,
Similar to the INDPBM operator, the INWDPBM operator has the properties of boundedness,
idempotency and commutativity.
idempotency and commutativity.
4.2. The INDPGBM Operator and INWDPGBM Operator
4.2. The INDPGBM Operator and INWDPGBM Operator
In this subpart, we develop INDPGBM and INWDPGBM operators.
In this subpart, we develop INDPGBM and INWDPGBM operators.
Definition 16. Let ini TR
L i , TRiU , IDi , IDLi , FL
Ui , FLi ,(
L U L U L L
i 1, 2,...,
L l ) be a group of INNs. Then the INDPGBM
, TR , ID ,ID
L
Definition 16. Let ini = TR i i i i , FL i , FL i , (i = 1, 2, . . . , l ) be a group of INNs.
operator is defined as
Then the INDPGBM operator is defined as
1
l T ( ini ) 1 l T ( ini ) 1 l l 1
2
l 2 −l
l (T (lin )+1)
iT ( in z ) 1 1 1)
l
1 l
lT( T( in z )i)+
(in
INDPGBM x inl l xin yin jz1∑l (T (inz )+ 1) . (38)
,y l z 1
in1 , in 2 ,..., ∑ (i T (inz )+1)
1 x y
x,y
∏ i xinj i
i , j 1 z = 1 z = 1
I NDPGBM in1 , in2 , . . . , inl = + yin j . (38)
x+y
i, j = 1
x, y i 6= j
Then, INDPGBM is said to be an interval neutrosophic Dombi power geometric Bonferroni mean
l
Then, I NDPGBM
(INDPGBM) operator. Where T in z Sup in z , in s , Sup in z , in s is the support degree for nz from
x,y is said to be an interval neutrosophic Dombi power geometric Bonferroni mean
sl 1, s z
(INDPGBM) operator. Where T inz = ∑ Sup inz , ins , Sup inz , ins is the support degree for nz
ns , which satisfies the following s=axioms: 1,s6=z (1) Supin z , in s 0,1 ;
in z , ins Sup ins , in z ; (3)
(2) Sup
from ns , which satisfies the following axioms: (1) Sup inz , ins ∈ [0, 1]; (2) Sup inz , ins = Sup ins , inz ;
in z , ins Sup ina , in
Sup
z , ins D ina , inb ,in which D na , nb
b , if D in
is the distance measure between INNs in a
(3) Sup inz , ins ≥ Sup in a , inb , if D inz , ins < D in a , inb , in which D (n a , nb ) is the distance
and in b defined in Definition (7).
measure between INNs in a and inb defined in Definition 7.
In order to simplify Equation (38), we can describe
In order to simplify Equation (38), we can describe
1z
1 T
+ T inz
in z
, (39)
Λz =
l
l 1 T in z
, (39)
∑ 1+ z 1T in z
z =1
l
and call 1 , 2 ,..., l is the power weight vector (PWV), such that z 0, l z 1. Then
T
and call Λ = (Λ1 , Λ2 , . . . , Λl ) T is the power weight vector (PWV), such that Λz ≥ 0,z 1 ∑ Λz = 1.
Equation (38) can be written as follows: z =1
Then Equation (38) can be written as follows:
Symmetry 2018, 10, 459 15 of 32
1
Symmetry 2018, 10, x
l 2 −l
15 of 32
l
1 ∏
lΛi lΛ
1 j
I NDPGBM x,y in1 , in2 , . . . , inl =
xini + yin . (40)
l 2j l
x+y l
1 i, j = 1 l i l j
in1 , in2 ,..., inl 1 j
INDPGBM x, y
xin yin . (40)
x y i ,ij 6=
i j
i j
L U U LL U L L
Theorem 11. Let in = L U
TR ,TR L
, ID
Theorem 11. Let ini i TRi , TRi i , IDi i, IDi , FL , ID L
i i , FLii ,(i 1,i 2,..., l )i be, (ai =
, FL , FL 1, 2, .of
group l ) be a group
. . ,INNs. Then of
theINNs.
result
Then the result obtained from Equation (38) is expressed as
obtained from Equation (38) is expressed as
INDPGBM x, y in1 , in2 ,...., inl
1
1
l2 l l x y l2 l l x y
1 1 1 1 1 L
, 1 1 1 1
,
x y ii ,jj1 1 TR i 1 TR L x y ii ,jj1 1 TR i
U
1 TRU
l i l l i l j
j j
TRiL L
j
U U
TR j TR i TR j
1
1
l2 l l x y l2 l l x y
1 1 1 1
, 1 1 1 1
,
x y ii ,jj1 IDi
L
ID L x y ii ,jj1 IDi
U
IDU (41)
l i l j
l i l j
j
1 IDiL L
j
U U
1 ID j 1 IDi 1 ID j
1
1
l2 l l x y l2 l l x y
1 1 1 1
, 1 1 1 1
.
x y ii ,jj1 FLi
L
FL L x y ii ,jj1 FLi
U
FLU
l i l j
l i l i
j
1 FLiL L
j
U U
1 FL j 1 FLi 1 FL j
L U L U L L
(Idempotency) Let ini TRi , TR
(Idempotency) Let ini =
, IDi , IDi , FL
Theorem 12. TRi ,L TRiL , IDi , IDi ,
L U L U FLi , FLi , (i =
Theorem 12. i , FL i ,(i 1, 2,..., l ) be a group of INNs, if all
i
2, . . . , l ) be a group of
1, INNs, if all L iniU(i = 1,L 2, .U . . , l ) L areU equal, that is ini = in =
ini i 1, 2,...,
L l U are equal,
L that
U is inLi in U TR , TR , ID , ID , FL , FL , i 1, 2,..., l , then
TR , TR , ID , ID , FL , FL , (i = 1,2, . . . , l ), then
INDPGBM x , y in1 , in2 ,..., inl in .
I NDPGBM x,y in1 , in2 , . . . , inl = in. (42)
(42)
Theorem 13.13.
(Commutativity)
(Commutativity)Assume
Assumethat that in in0uu is is any permutationofofinin
anypermutation u u 1, 2,..., l , then
Theorem u ( u = 1, 2, . . . , l ), then
x,y x , y 0 0
in0ll =INDPGBM
I NDPGBM x,yin1in
x, y
INDPGBM
I NDPGBM in 1in, in
1 , in
2 , .2 .,...,
. , in , in ,...,
1 ,2in 2 , .in
. l. , in
. l . (43)
(43)
Theorem 14. (Boundedness) Let ini TRi , TRi , IDi , IDi , FLi , FLi ,(i 1, 2,..., l ) be a group of INNs, and
L U L U L L
in max TRi , TRi , min IDi , IDi , min FLi , FLi , in min TRi , TRi , max IDi , IDi , max FLi , FLi ,
l L U l L U l L L U U l L U l L U l
i1 then
i 1 i1 i 1
i1 i1
in INDPGBM in1 , in2 ,..., inl in . (44)
Definition 17. Let ini TRi , TRi , IDi , IDi , FLi , FLi ,(i 1, 2,..., l )
L U L U L L
be a group of INNs, then the
Symmetry 2018, 10, 459 16 of 32
L U L U L L
Theorem 14. (Boundedness) Let ini = TRi , TRi , IDi , IDi , FLi , FLi , (i = 1, 2, . . . , l )
+ l L U l L U l L U −
be a group of INNs, and in = max TRi , TRi , min IDi , IDi , min FLi , FLi , in =
i =1 i =1 i =1
l L U l L U l L U
min TRi , TRi , max IDi , IDi , max FLi , FLi , then
i =1 i =1 i =1
− +
in ≤ I NDPGBM in1 , in2 , . . . , inl ≤ in . (44)
L U L U L L
Definition 17. Let ini = TRi , TRi , IDi , IDi , FLi , FLi , (i = 1, 2, . . . , l ) be a group of INNs,
then the INWDPGBM operator is defined as
Symmetry 2018, 10, x 16 of 32
1
l 2 −l
lwi ( T (ini )+1) lw j ( T (ini )+
1 1)
l l 2 l
lwi Tl( ini ) 1 lw j T ( ini )l1
∑ wz ( T (inz )+1) ∑ wz ( T (inz )+1)
1 ∏l xin
I NWDPGBM x,y in1 , in2 , . . . , inl =
z =1 z =1
. (45)
l l
+ yin
x + y 1 wiz T ( in z ) 1 wz T (jin z ) 1
INWDPGBM x , y in1 , in 2 ,..., inl yin jz1
i, j =
z1
1 xini . (45)
x y i , j 1
i 6=i jj
L U L U L L
Theorem 15. Let ini = TRi , TRi , IDi , IDi , FLi , FLi , (i = 1, 2, . . . , l ) be a group of INNs.
Theorem 15. Let ini TRi , TRi , IDi , IDi , FLi , FLi ,(i 1, 2,..., l ) be a group of INNs. Then the aggregated
L U L U L L
Then the aggregated result from Equation (45) is expressed as
result from Equation (45) is expressed as
INWDPGBM x, y in1 , in2 ,...., inl
1
1
l l
l2 l x y l2 l x y
1 1 1 , 1 1 ,
1 TR
1 TR
1 1 1 1
x y x y
L U
ii,jj1 lwi T (ini ) 1 lw j T (in j ) 1 1 TR L ii,jj1 lwi T (ini ) 1 lwj T (in j ) 1 1 TRU
l
i
j
l
i
j
TR L
TR U
L l U l
wz T (in z ) 1 i
wz T (inz ) 1 TR j wz T (in z ) 1 i
wz T (in z ) 1 TR j
z 1 z 1 z 1 z 1
1
1
l l (46)
l2 l x y l2 l x y
1 1 , 1 1 ,
ID
ID
1 1 1 1
x y ii ,jj1 lwi T (ini ) 1
L
lw j T (in j ) 1 ID L
x y ii,jj1 lwi T (ini ) 1
U
lw j T (in j ) 1 IDU
(46)
l
i
j l
i
j
1 ID
1 ID
L U
L l
U l
wz T (in z ) 1 wz T (inz ) 1 1 ID j wz T (in z ) 1 wz T (inz ) 1 1 ID j
i i
z 1 z 1 z 1 z 1
1
1
l
l2 l l x y l2 l x y
1 1 , 1 1 .
FL
FL
1 1 1 1
x y x y
i , j 1 lwi T (ini ) 1 L
lw j T (in j ) 1 FL L ii,jj1 lwi T (ini ) 1
U
lw j T (in j ) 1 FLU
i j i
j
l
i
j
1 FL 1 FL
l L U
L
U l
wz T (in z ) 1 wz T (in z ) 1 z
in
i
wz T (inz ) 1 1 FL j
i w T (in ) 1 1 FL j
z 1
z
z 1
z 1
z 1
5.MADM
5. MADMApproach
ApproachBased
Basedon
onthe
theDeveloped
DevelopedAggregation
AggregationOperator
Operator
In this
In this section,
section, based
basedupon
uponthe
thedeveloped
developedINWDPBM INWDPBMand andINWDPGBM
INWDPGBM operators,
operators, wewe willwill
propose aanovel
propose novelMADM
MADMmethod,
method,which
whichisisdefined
definedasasfollows.
follows.
n o
Assumethat
Assume that in
in aa MADM
MADM problem,
problem, we need to evaluate evaluate uualternatives eM= M
alternatives M M M
e11,,M . , uM
, . .M
e22,..., eu
n o
with respect to v attributes e = C
C e1 , C
e2 , . . . , C
ev , and the importance degree of the attributes
with respect to v attributes C C1 , C 2 ,..., C v , and the importance degree of the attributes is
v
represented by 1 , 2 ,..., v , satisfying the condition h 0,1 , h 1. The decision
T
h1
matrix for this decision problem is denoted by D d gh , where
mn
d gh TR gh , TR gh , ID gh , ID gh , FL gh FL gh
L U L U L U
is an INN for the alternative M g with respect to the attribute
Symmetry 2018, 10, 459 17 of 32
v
is represented by v = (v1 , v2 , . . . , vv ) T , satisfying the condition vh ∈ [0, 1], ∑ vh = 1.
h i h =1
The decision matrix for this decision problem is denoted by D = d gh e e , where degh =
m×n
L U L U L U
TR gh , TR gh , ID gh , ID gh , FL gh FL gh is an INN for the alternative Me g with respect to the
attribute Ceh , ( g = 1, 2, . . . , u; h = 1, 2, . . . , v). Then the main purpose is to rank the alternative and
select the best alternative.
In the following, we will use the proposed INWDPBM and INWDPGBM operators to solve this
MADM problem, and the detailed decision steps are shown as follows:
Step 1. Standardize the attribute values. Normally, in real problems, the attributes are of two types,
(1) cost type, (2) benefit type. To get right result, it is necessary to change cost type of attribute
values to benefit type using the following formula:
L U U L L U
degh = FL gh , FL gh , 1 − ID gh , 1 − ID gh , TR gh , TR gh . (47)
Step 2. Calculate the supports
Supp degh , degl = 1 − D degh , degl , ( g = 1, 2, . . . , u; h, l = 1, 2, . . . , v), (48)
where, D degh , degl is the distance measure defined in Equation (10).
Step 3. Calculate T degh
u
T degh = ∑ Supp degh , degl , ( g = 1, 2, . . . , u; h, l = 1, 2, . . . , v). (49)
l=1
l 6= h
Step 4. Aggregate all the attribute values degh (h = 1, 2, . . . , v) to the comprehensive value R g by
using INWDPBM or INWDPGBM operators shown as follows.
R g = I NWDPBM deg1 , deg2 , . . . , degv ; (50)
or
R g = I NWDPGBM deg1 , deg2 , . . . , degv . (51)
Step 5. Determine the score values, accuracy values of R g ( g = 1, 2, . . . , u), using Definition 5.
Step 6. Rank all the alternatives according to their score and accuracy values, and select the best
alternative using Definition 6.
Step 7. End.
This decision steps are also described in Figure 1.
Step 5. Determine the score values, accuracy values of Rg ( g 1, 2,..., u), using Definition (5).
Step 6. Rank all the alternatives according to their score and accuracy values, and select the best
alternative using Definition (6).
Step 7. End.
Symmetry 2018, 10, 459 18 of 32
This decision steps are also described in Figure 1.
Figure 1.
Figure 1. Flow
Flow chart
chart for
for developed
developed approach.
approach.
6. Illustrative Example
In this part, an example adapted from [42] is used to illustrate the application and effectiveness of
the developed method in MADM problem.
An investment company wants to invest a sum of money in the best option. The company
must invest a sum of money in the following four possible companies (alternatives): (1) car company
Me 1 ; (2) food company M e 2 ; (3) Computer company M e 3 ; (4) An arm company M e 4 , and the attributes
under consideration are (1) risk analysis C e1 ; (2) growth analysis C e2 ; (3) environmental impact analysis
C3 . The importance degree of the attributes is v = (0.35, 0.4, 0.25) T . The four possible alternatives
e
Me g ( g = 1, 2, 3, 4) are evaluated with respect to the above attributes C eh (h = 1, 2, 3) by the form of INN,
and the IN decision matrix D is listed in Table 1. The purpose of this decision-making problem is to
e
rank the alternatives.
Table 1. The IN decision matrix D.
Alternatives/Attributes C
e1 C
e2 C
e3
M
e1 h[0.4, 0.5], [0.2, 0.3], [0.3, 0.4]i h[0.4, 0.6], [0.1, 0.3], [0.2, 0.4]i h[0.7, 0.9], [0.7, 0.8], [0.4, 0.5]i
M
e2 h[0.6, 0.8], [0.1, 0.2], [0.1, 0.2]i h[0.6, 0.7], [0.15, 0.25], [0.2, 0.3]i h[0.3, 0.6], [0.2, 0.3], [0.8, 0.9]i
M
e3 h[0.3, 0.6], [0.2, 0.3], [0.3, 0.4]i h[0.5, 0.6], [0.2, 0.3], [0.3, 0.4]i h[0.4, 0.5], [0.2, 0.4], [0.7, 0.9]i
M
e4 h[0.7, 0.8], [0.01, 0.1], [0.2, 0.3]i h[0.6, 0.7], [0.1, 0.2], [0.3, 0.4]i h[0.4, 0.6], [0.5, 0.6], [0.8, 0.9]i
6.1. The
. Decision-Making Steps
Step 1. Since C
e1 , C
e2 are of benefit type, and C
e3 is of cost type. So, C
e3 will be changed into benefit
type using Equation (47). So, the normalize decision matrix D is given in Table 2.
M4 0.7,0.8,0.01,0.1,0.2,0.3 0.6,0.7,0.1,0.2,0.3,0.4 0.4,0.6,0.5,0.6,0.8,0.9
6.1. The Decision-Making Steps
Step 1. Since C 1 , C 2 are of benefit type, and C 3 is of cost type. So, C 3 will be changed into benefit
Symmetry 2018, 10, 459
type using Equation (47). So, the normalize decision matrix D is given in Table 2. 19 of 32
Table
Table 2. The2.Normalize
The Normalize IN decision
IN decision matrix
matrix D. D .
Alternatives/Attributes C1 e2 2
C C
e33
Alternatives/Attributes C
e1 C C
M1 0.4,0.5,0.2,0.3,0.3,0.4 0.4,0.6,0.1,0.3,0.2,0.4 0.4,0.5,0.2,0.3,0.7,0.9
M
e1 h[0.4, 0.5], [0.2, 0.3], [0.3, 0.4]i h[0.4, 0.6], [0.1, 0.3], [0.2, 0.4]i h[0.4, 0.5], [0.2, 0.3], [0.7, 0.9]i
e2 M 2
M 0.6,0.8
h[0.6, 0.8 ], [0.1,,0.2
0.1,0.2
], [0.1,,0.2 ]i h[0.6,0.6,0.7
0.1,0.2 ,0.15,0.25
0.7], [0.15, 0.25], [0.2,
, 0.2,0.3
0.3]i 0.8,0.9
h[0.8, 0.9],[,0.6,
0.6,0.7
0.7],,[0.3,
0.3,0.6
0.6]i
M
e3
M3 h[ 0.3, 0.3,0.6,0.2,0.3,0.3,0.4
0.6 ] , [ 0.2, 0.3 ] , [ 0.3, 0.4 ]i h[ 0.5,0.6,0.2,0.3,0.3,0.4
0.5, 0.6 ] , [ 0.2, 0.3 ] , [ 0.3, 0.4 ]i 0.7,0.9,0.6,0.8,0.4,0.5
h[0.7, 0.9 ] , [ 0.6, 0.8 ] , [ 0.4, 0.5 ]i
M h[0.7, 0.8], [0.01, 0.1], [0.2, 0.3]i h[0.6, 0.7], [0.1, 0.2], [0.3, 0.4]i h[0.8, 0.9], [0.4, 0.5], [0.4, 0.6]i
0.7,0.8,0.01,0.1,0.2,0.3 0.6,0.7,0.1,0.2,0.3,0.4 0.8,0.9,0.4,0.5,0.4,0.6
e4
M4
Step 2. Determine the supports Supp deSuppgh , d gld gh, , (dggl =
1, 2, 3, 4; h, l = 1, 2, 3) by Equation (48) (for
, ( g 1,2,3,4; h, l 1,2,3) by Equation (48) (for
e
Step 2. Determine the supports
g
simplicity we denote Supp degh , degl with Sgh,gl ),g we have
simplicity we denote Supp d gh , d gl with S gh, gl ), we have
1
S11,12 S12,11
1
0.950; S12,13
1
S13,12
1
0.800; S11,13
1
S13,11
1
0.85; S11,12
2
S12,11
2
0.933; S12,13
2
S13,12
2
0.717; S11,13
2
S13,11
2
0.683;
3
S11,12 S12,11
3
0.967; S12,13
3
S13,12
3
0.733; S11,13
3
S13,11
3
0.700; S114 ,12 S12,11
4
0.902; S12,13
4
S13,12
4
0.783; S11,13
4
S13,11
4
0.752;
Step 3.
Step 3. Determine
T d gh ;( g 1, 2,3, 4; h 1, 2,3) by Equation (49), and we get
Determine T degh ; ( g = 1, 2, 3, 4; h = 1, 2, 3) by Equation (49), and we get
T111 1.800, T121 1.750, T131 1.650, T112 1.617, T122 1.650, T132 1.400,
1 = 1.800, 1 1 = 2 = 1.617, 2 = 1.650, 2 = 1.400,
T11 T113 T
1.667, 12 1.700,
12 =T1.750,
3 T13 T133 1.650, T1111
1.433, T 4
1.653, T124 1.685, T134 1.535.
T12 T13
3 3 3 4
T11 = 1.667, T12 = 1.700, T13 = 1.433, T11 = 1.653, T12 = 1.685, T13 4 4 = 1.535.
Step 4. (a) Determine the comprehensive value of every alternative using the INWDPBM operator,
Step 4. (a) that is, Equation
Determine the(50) Assumethat x value
comprehensive y 1;of 3 , we alternative
every have using the INWDPBM
operator, that is, Equation (50) ( Assume that x = y = 1; γ = 3 , we have
, 0.1823,0.3023 , 0.3353,0.4796 ) ;
R 0.3974,0.5195
1
2 =
RR
1
0.6457,0.7954 , 0.1700,0.2885
h[0.3974, 0.5195 , 0.2044,0.3265
], [0.1823, 0.3023 ; ]i;
], [0.3353, 0.4796
R2 = h[0.6457, 0.7954], [0.1700, 0.2885], [0.2044, 0.3265]i;
R3 = h[0.4846, 0.6503], [0.2556, 0.3711], [0.3376, 0.4394]i;
R4 = h[0.6938, 0.7953], [0.1062, 0.2154], [0.3069, 0.4278]i.
(b) Determine the comprehensive value of every alternative using the INWDPGBM
operator, that is Equation (51), ( Assume that x = y = 1; γ = 3), we have
R1 = h[0.4026, 0.5381], [0.1570, 0.2977], [0.2998, 0.4520]i;
R2 = h[0.6654, 0.8193], [0.1558, 0.2686], [0.1836, 0.3035]i;
R3 = h[0.5159, 0.6732], [0.2366, 0.3473], [0.3265, 0.4279]i;
R4 = h[0.5159, 0.8193], [0.0938, 0.1952], [0.2862, 0.4037]i.
Step 5. (a) Determine the score values of R g ( g = 1, 2, 3, 4) by Definition 5, we have
S( R1 ) = 1.8087, S( R2 ) = 2.2259, S( R3 ) = 1.8656, S( R4 ) = 2.2164;
(b) Determine the score values of R g ( g = 1, 2, 3, 4) by Definition 5, we have
S( R1 ) = 1.8671, S( R2 ) = 2.2866, S( R3 ) = 1.9254, S( R4 ) = 2.1781;
Step 6. (a) According to their score and accuracy values, by using Definition 6, the ranking order
e2 > M
is M e4 > M e3 > M e 1 . So the best alternative is M
e 2 , while the worst alternative
is M
e 1.
Symmetry 2018, 10, 459 20 of 32
(b) According to their score and accuracy values, by using Definition 6, the ranking order
e2 > M
is M e4 > M e3 > M e 1 . So the best alternative is M
e 2 , while the worst alternative
is M1 .
e
So, by using INWDPBM or INWDPGBM operators, the best alternative is M
e 2 , while the worst
alternative is M1 .
e
6.2. Effect of Parameters γ, x and y on Ranking Result of this Example
In order to show the effect of the parameters x and y on the ranking result of this example, we set
different parameter values for x and y, and γ = 3 is fixed, to show the ranking results of this example.
The ranking results are given in Table 3.
As we know from Tables 3 and 4, the score values and ranking order are different for different
values of the parameters x and y, when we use INWDPBM operator and INWDPGBM operator.
We can see from Tables 3 and 4, when the parameter values x = 1 or 0 and y = 0 or 1, the best choice is
Me 4 and the worst one is M e 1 . In simple words, when the interrelationship among attributes are not
considered, the best choice is M e 4 and the worst one is M
e 1 . On the other hand, when different values
for the parameters x and y are utilized, for INWPBM and INWDPGBM operators, the ranking result is
changed. That is, from Table 4, we can see that when the parameter values x = 1, y = 1, the ranking
results are changed as the one obtained for x = 1 or 0 and y = 0 or 1. In this case the best alternative is
Me 2 while the worst alternative remains the same.
Table 3. Ranking orders of decision result using different values for x and y for INWDPBM.
Parameter Values INWDPBM Operator Ranking Orders
S( R1 ) = 1.9319, S( R2 ) = 2.4172,
x = 1, y = 0, γ = 3 e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 2.0936, S( R4 ) = 2.4222;
S( R1 ) = 1.8338, S( R2 ) = 2.2684,
x = 1, y = 5, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.9049, S( R4 ) = 2.2666;
S( R1 ) = 1.8169, S( R2 ) = 2.2398,
x = 3, y = 7, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.8777, S( R4 ) = 2.2327;
S( R1 ) = 1.8143, S( R2 ) = 2.2354,
x = 5, y = 10, γ = 3 e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.8738, S( R4 ) = 2.2275;
S( R1 ) = 1.8501, S( R2 ) = 2.2966,
x = 1, y = 10, γ = 3 e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.9355, S( R4 ) = 2.3012;
S( R1 ) = 1.8182, S( R2 ) = 2.2419,
x = 10, y = 4, γ = 3 e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.8796, S( R4 ) = 2.2352;
S( R1 ) = 1.8285, S( R2 ) = 2.2592,
x = 3, y = 12, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.8958, S( R4 ) = 2.2557;
Table 4. Ranking orders of decision result using different values for x and y for INWDPGBM.
Parameter Values INWDPGBM Operator Ranking Orders
S( R1 ) = 1.5032, S( R2 ) = 1.7934,
x = 1, y = 0, γ = 3 e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.5136, S( R4 ) = 1.8037;
S( R1 ) = 1.8220, S( R2 ) = 2.2256,
x = 1, y = 5, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.8717, S( R4 ) = 2.1140;
S( R1 ) = 1.8539, S( R2 ) = 2.2686,
x = 3, y = 7, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.9094, S( R4 ) = 2.1584;
S( R1 ) = 1.8583, S( R2 ) = 2.2745,
x = 5, y = 10, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.9146, S( R4 ) = 2.1647;
S( R1 ) = 1.7814, S( R2 ) = 2.1710,
x = 1, y = 10, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.8248, S( R4 ) = 2.0632;
S( R1 ) = 1.8087, S( R2 ) = 2.2259,
x = 10, y = 4, γ = 3 e2 > M
M e4 > M
e3 > M
e 1.
S( R3 ) = 1.8656, S( R4 ) = 2.2164;
S( R1 ) = 1.8671, S( R2 ) = 2.2866,
x = 3, y = 12, γ = 3 e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.9254, S( R4 ) = 2.1781;
Symmetry 2018, 10, 459 21 of 32
From Tables 3 and 4, we can observe that when the values of the parameter increase, the score
values obtained using INWDPBM decrease. While using the INWDPGBM operator, the score values
increase but the best choice is M2 for x = y ≥ 1.
From Table 5, we can see that different ranking orders are obtained for different values of γ. When
γ = 0.5 and γ = 2, the best choice is M4 by the INWPBM operator; when we use the INWPGBM
operator, it is M2 . Similarly, for other values of γ > 2, the best choice is M2 while the worst is M1 .
Table 5. Ranking orders of decision result using different values for γ.
Parameter Values INWDPBM Operator INWDPGBM Operator Ranking Orders
S( R1 ) = 1.6662, S( R2 ) = 2.1025, S( R1 ) = 1.7870, S( R2 ) = 2.2347, e4 > M
M e2 > M
e3 > M
e 1.
x = 1, y = 1, γ = 0.5
S( R3 ) = 1.7606, S( R4 ) = 2.1972; S( R3 ) = 1.9103, S( R4 ) = 2.1812; e2 > M
M e4 > M
e3 > M
e 1.
S( R1 ) = 1.7783, S( R2 ) = 2.2015, S( R1 ) = 1.8491, S( R2 ) = 2.2786, e4 > M
M e2 > M
e3 > M
e 1.
x = 1, y = 1, γ = 2
S( R3 ) = 1.8408, S( R4 ) = 2.2091; S( R3 ) = 1.9213, S( R4 ) = 2.1799; e2 > M
M e4 > M
e3 > M
e 1.
S( R1 ) = 1.8229, S( R2 ) = 2.2363, S( R1 ) = 1.8740, S( R2 ) = 2.2856, e2 > M
M e4 > M
e3 > M
e 1.
x = 1, y = 1, γ = 4
S( R3 ) = 1.8803, S( R4 ) = 2.2219; S( R3 ) = 1.9275, S( R4 ) = 2.1751; e2 > M
M e4 > M
e3 > M
e 1.
S( R1 ) = 1.8375, S( R2 ) = 2.2455, S( R1 ) = 1.8747, S( R2 ) = 2.2763, e2 > M
M e4 > M
e3 > M
e 1.
x = 1, y = 1, γ = 7
S( R3 ) = 1.9037, S( R4 ) = 2.2315; S( R3 ) = 1.9331, S( R4 ) = 2.1669; e2 > M
M e4 > M
e3 > M
e 1.
S( R1 ) = 1.8418, S( R2 ) = 2.2477, S( R1 ) = 1.8701, S( R2 ) = 2.2698, e2 > M
M e4 > M
e3 > M
e 1.
x = 1, y = 1, γ = 10
S( R3 ) = 1.9160, S( R4 ) = 2.2365; S( R3 ) = 1.9373, S( R4 ) = 2.1622; e2 > M
M e4 > M
e3 > M
e 1.
S( R1 ) = 1.8447, S( R2 ) = 2.2488, S( R1 ) = 1.8642, S( R2 ) = 2.2637, e2 > M
M e4 > M
e3 > M
e 1.
x = 1, y = 1, γ = 15
S( R3 ) = 1.9270, S( R4 ) = 2.2409; S( R3 ) = 1.9414, S( R4 ) = 2.1582; e2 > M
M e4 > M
e3 > M
e 1.
S( R1 ) = 1.8460, S( R2 ) = 2.2492, S( R1 ) = 1.8608, S( R2 ) = 2.2604, e2 > M
M e4 > M
e3 > M
e 1.
x = 1, y = 1, γ = 20
S( R3 ) = 1.9328, S( R4 ) = 2.2432; S( R3 ) = 1.9435, S( R4 ) = 2.1562; e2 > M
M e4 > M
e3 > M
e 1.
6.3. Comparing with the Other Methods
To illustrate the advantages and effectiveness of the developed method in this article, we solve
the above example by four existing MADM methods, including IN weighted averaging operator, IN
weighted geometric operator [12], the similarity measure defined by Ye [15], Muirhead mean operators
developed by Liu et al. [42], IN power aggregation operator developed by Liu et al. [37].
From Table 6, we can see that the ranking orders are the same as the ones produced by the existing
aggregation operators when the parameter values x = 1, y = 0, γ = 3, but the ranking orders are
different when the interrelationship among attributes are considered. That is why the developed
method based on the proposed aggregation operators is more flexible due the parameter and practical
as it can consider the interrelationship among input arguments.
Table 6. Ranking order of the alternatives using different aggregation operators.
Aggregation Operator Parameter Score Values Ranking Order
S( R1 ) = 1.8430, S( R2 ) = 2.2497,
INWA operator [12] No e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.9151, S( R4 ) = 2.2788;
S( R1 ) = 1.7286, S( R2 ) = 2.0991,
INWGA operator [12] No e4 > M
M e2 > M
e3 > M
e 1.
S( R3 ) = 1.7751, S( R4 ) = 2.1608;
Similarity measure D1 ( R∗ , R1 ) = 0.7948, D1 ( R∗ , R2 ) = 0.9581,
No e4 > M
M e2 > M
e3 > M
e 1.
Hamming distance [15] D1 ( R∗ , R3 ) = 0.8805, D1 ( R∗ , R4 ) = 0.9725;
Generalized power Yes S( R1 ) = 1.8460, S( R2 ) = 2.2543, e4 > M
M e2 > M
e3 > M
e 1.
Aggregation operator [37] λ=1 S( R3 ) = 1.9163, S( R4 ) = 2.2799;
Yes S( R1 ) = 1.8054, S( R2 ) = 2.2321,
INWMM operator [42] e4 > M
M e2 > M
e3 > M
e 1.
P(1, 1, 1) S( R3 ) = 1.9172, S( R4 ) = 2.2773;
Yes S( R1 ) = 1.6260, S( R2 ) = 1.9202,
INWDMM operator [42] e4 > M
M e2 > M
e3 > M
e 1.
P(1, 1, 1) S( R3 ) = 1.7061, S( R4 ) = 2.0798;
Proposed INWDPBM S( R1 ) = 1.9319, S( R2 ) = 2.4172,
Yes e4 > M
M e2 > M
e3 > M
e 1.
x = 1, y = 0, γ = 3 S( R3 ) = 2.0936, S( R4 ) = 2.4222;
Proposed INWDPGBM S( R1 ) = 1.5032, S( R2 ) = 1.7934,
Yes e4 > M
M e2 > M
e3 > M
e 1.
x = 1, y = 0, γ = 3 S( R3 ) = 1.5136, S( R4 ) = 1.8037;
INWDPBM operator in this Yes S( R1 ) = 1.8087, S( R2 ) = 2.2259, e2 > M
M e4 > M
e3 > M
e 1.
article x = y = 1, γ = 3 S( R3 ) = 1.8656, S( R4 ) = 2.2164;
INWDPBM operator in this Yes S( R1 ) = 1.8671, S( R2 ) = 2.2866, e2 > M
M e4 > M
e3 > M
e 1.
article x = y = 1, γ = 3 S( R3 ) = 1.9254, S( R4 ) = 2.1781;
Symmetry 2018, 10, 459 22 of 32
From the above comparative analysis, we can know the proposed method has the following
advantages, that is, it can consider the interrelationship among the input arguments and can relieve
the effect of the awkward data by PWV at the same time, and it can permit more precise ranking order
than the existing methods. The proposed method can take the advantages of PA operator and BM
operator concurrently, these factors makes it a little complex in calculations.
The score values and ranking orders by these methods are shown in Table 6.
7. Conclusions
The PBM operator can take the advantage of PA operator, which can eliminate the impact of
awkward data given by the predisposed DMs, and BM operator, which can consider the correlation
between two attributes. The Dombi operations of TN and TCN proposed by Dombi have the edge
of good flexibility with general parameter. In this article, we combined PBM with Dombi operation
and proposed some aggregation operators to aggregate INNs. Firstly, we defined some operational
laws for INSs based on Dombi TN and TCN and discussed some properties of these operations.
Secondly, we extended PBM operator based on Dombi operations to introduce INDPBM operator,
INWDPBM operator, INDPGBM operator, INWDPGBM operator and discussed some properties of
these aggregation operators. The developed aggregation operators have the edge that they can take
the correlation among the attributes by BM operator, and can also remove the effect of awkward data
by PA operator at the same and due to general parameter, so they are more flexible in the aggregation
process. Further, we developed a novel MADM method based on developed aggregation operators
to deal with interval neutrosophic information. Finally, an illustrative example is used to show the
effectiveness and practicality of the proposed MADM method and comparison were made with the
existing methods. The proposed aggregation operators are very useful to solve MADM problems.
In future research, we shall define some distinct aggregation operators for SVHFSs, INHFSs,
double valued neutrosophic sets and so on based on Dombi operations and apply them to MAGDM
and MADM.
Author Contributions: Q.K. and P.L. visualized and work together to achieve this work. Q.K. and P.L. wrote the
paper. T.M., F.S. and K.U. offered plenty of advice enhancing the readability of work. All authors approved the
publication work.
Funding: National Natural Science Foundation of China: 71771140, 71471172, Special Funds of Taishan Scholars
Project of Shandong Province: ts201511045.
Acknowledgments: We, the authors of this project are deeply grateful for the valuable suggestions and comments
provided by the respected reviewers to improve the quality and value of this research.
Conflicts of Interest: No potential conflict of interest was reported by authors.
Appendix A. Basic Concept of PBM Operator
Definition A1. For positive real numbers ℘h (h = 1, 2, . . . , l ) and x, y > 0 the aggregation mapping [54]
1
x +y
x y
1 l l ( T (℘ ) + 1) l ( T (℘ ) + 1)
x,y
PBM (℘1 , ℘2 , . . . , ℘l ) = 2 ∑ i
℘i × i
℘j (A1)
l − l
l
l
∑ ( T (℘o ) + 1) ∑ ( T (℘o ) + 1)
i = 1, j = 1
o =1 o =1
i 6= j
is said to be power Bonferroni mean (PBM) mean operator.
Symmetry 2018, 10, 459 23 of 32
Definition A2. For positive real numbers ℘h (h = 1, 2, . . . , l ) and x, y > 0 the aggregation mapping [54]
1
l 2 −l
l ( T (℘ j )+1)
l ( T (℘i )+1)
l l
l ∑ ( T (℘o )+1) ∑ ( T (℘o )+1)
1
PBM x,y (℘1 , ℘2 , . . . , ℘l ) = ∏ o =1 o =1
x ℘i + y℘ j (A2)
x + y
i = 1, j = 1
i 6= j
is said to be power geometric Bonferroni mean (PGBM) mean operator.
l
In Definitions A1 and A2, T (℘i ) = ∑ supp(℘i , ℘ j ), and supp(℘i , ℘ j ) is the SPD for ℘i from ℘ j
j=1,j6=i
satisfying the axioms as;
(1) sup(℘i , ℘ j ) = 1 − D (℘i , ℘ j ), so sup(℘i , ℘ j ) ∈ [0, 1];
(2) sup(℘i , ℘ j ) = sup(℘ j , ℘i );
(3) sup ℘i , ℘ j ≥ sup(℘c , ℘d ), if ℘i − ℘y ≤ |℘c − ℘d |.
where D (℘i , ℘ j ) is the distance measure among ℘i and ℘ j .
Appendix B. Proof of Theorem 6
Symmetry 2018,
Proof. 10, x
Since 24 of 32
Symmetry 2018, 10, x 24 of 32
Symmetry 2018, 10, x 24 of 32
l i ini li ini1 1 , , ,
1 1 11 11 1 1 1 1 1 1
,11,1 11 ,
,1 ,1 1 1
,1 1 ,1 1 ; ;
l i ini 1 1 1 1 1 1 1 1 1 1 1
L L 1 ,1 U U 1, ,1 1 ,1
1
1
L L U U1 , L
L1iL FL 1 FLU 1 U
;
1 l1l TR TRLi
i iTR TRTRiUi
11IDLi i
ID 1 1ID
Ui ID
i 1 FL i Ui 1
FL
L 1 1 l l i TRi U
1 lli 1 IDLi
1 1 1 IDUi U 1
l il
l1i 1 l FLLi 1 l i11FL
l
i
1 i l i 1 LTR 1 l i i 1 TRUUi 1 l i i IDLi L 1 l i i ID 1 l i L 1 l i FL U
Ui IDi i FLLi FL Ui FL
i Ui i
1 1TR i Li
1 TR ID
1 TRii IDi i ID
i
FL i i
TRi
i FLi
and and
andand
l j in j 1 , , .
1 1 1 1 1 1
,1 1
,1 1
,1
1 1 11 11 1 1 1 1 1 1 .
l j inljj in j 1 1 1 ,1 1 , ,1 ,
1 1
1 1,1
,1 1 , L 1
,1 U 1
, L 1
,1 U 1
.
TRU j 1 IDL j 1 IDU j 1 FLL j
L U
TRL j
1 1 1 1
1 FLU j
1
1 l j TR L j
L 1
j l
l j j 1 LIDj 1 l j j 1U ID
1 l 1 l
j 1 l j j FLLL 1 FL
1 l 1
l 1 FL
1 l j FL
1 l j 1TR U j
TR U 1 ID L 1 ID U 1 FL L
U
U
l j TR1j TR j U j 1 U j 1
j j j j j
1 1l 1 TR L j
1 l TR
1 l j IDLj
j
IDUj
1 l j j
j
l j
FL
j
1
l 1
L j
j 1 TRUj ID j L
j
j ID j j FL
ID U FL
j j FL
L FL U
1 TR j 1 TR j ID j j
Let
Let
Let L U L U L U L U
Let TRLi TRUi 1 IDLi 1 IDUi 1 FLLi 1 FLUi TRLj TRUj
a TRi , b TRi , c 1 IDLiL , di 1 IDUi U, gi 1 FLLi ,Lhi 1 FLUi , aUj TR j L , bLj TR j U , U
ai i L LL, bi i U UU , ci i , d , g , h , a , b ,
TR1 i TRi 1 i TRi
TR 1 ID
IDL i
1IDUID i
LiFLi i
1FL 1Ui FLij 1 TRLTR
FL j
1 TRUj TR j
ai 1 TR ibi i , ci
ii i i j
j
L
, 1 TRU
ID i
L
, d i ID i
U
, g i FL
L
i
L
, hi FL i
U
,
U
a
1 j TR j
L
,
1 b j TR
L
j
U
, U
1 TRi 1 TRi ID
1 ID i Lj 1 ID
IDiUj 1 FLLij 1 FL
FLUi j 1 TR j 1 TR j
c j 1 IDL j , d j 1 IDU j , g j 1 FLL j , h j 1 FLU j .
cj L
L ,d j
U
U, g j
L
L, h j
U
. U
1 ID
ID
IDj j j
IDID
1ID j
j jFL,j
1FL
FL 1 jj FL j
FL
FL
cj ,d j ,gj , hj
j j
L,
L U U
.
then, we have ID j ID j FL j FL j
then, we have ,
l i ini 1 1 1 , 1 1 , 1 1 ;
then, we have 1 1 1 1 1 1
1 1 ,1 1 1 , 1 1 ,
l i ini 1 ,1 , , , , ;
11lli aai 11lli bbi 11lli cci 11lli ddi 11lli ggi 11lli hhi
1 1 1 1 1 1
i i 1 i i1
l i ini 1 , , ;
1 i i 1 i i1 i i 1 i i
,1 , ,
1 1
1 1
1
1
l j in j 1 1 l 1i 1 ai ,1 1 l1i 1 bi,1 1l i 1 c,i 1 1l i1 d
1 1 1 1 1 l g 1 l h
1 1
i, 1 1i , i 1 1 i i .
l j in j 1 ,1
11llj j aaj j 11llj j bbj j 11llj j ccj j 11llj j ddj j 11llj j ggj j 11llj j hhj j
1 1 , 1
, 1 , 1
, 1 .
1 1 1 1 1 1
l j in j 1
and 1
,1 1 , 1
, 1 , 1
, 1 .
and
1 j j
l a 1 j j j j j j j j j j
l b 1 l c 1 l d 1 l g 1 l h
llinin
x
1 1 1 1 1 1
i x 1 1
, 1 1 ,1 1 1
,1 1 1 ,1 1 1
,1 1 1 ;
and
i
1 , 1
, 1 1 ,1 1
, 1 1 ,1 1
;
1 x l 1 d 1 x l 1 g 1 x l 1 h
11xx lli aai 11xx lli bbi 11xx lli cci
i 1
i
1 1 1 1 1 1 1 1
i i i i i i 1 x l i i di i 1 x l i i gi i 1 x l i i hi i
1 l TR j 1 1 ID j 1 ID1 j 1 FL 1 j 1 FL j
1 ,1l j 1 U 1 1 , l j 1 L 1 1 l 1
TR j
Let l in 1 j 1 L 1 l 1 l
l in
j
1 ,1 1 , 1 1 ,1 1 ,1 j 1 IDU 1 , 1 , j 1 FL L 1 ,1 1 ,1 j 1 FLU 1 1. .
L 1 TRj LU1 1 TR j L U 1 ID
j
j
L L U jU U
L 1U ID
U
j j j j
U 1L ID
L U L
j 1 l TRU TR j 1 l1 ID
j TR j j 1 l1j ID j j 1 l1j FL 1 j FL j 1 l1j FL 1 j FL j
L
TR 1
i 1 l
l TR TRi 1 l1 IDi 1 1l jID
, b j 1 LTR j , c j 1U TR
j j j
L, ID
j 1 1 FL
l j , hU
1 FL 1 il j L FLTR j 1 l j TR U FL jU
ai j j
L U i L i U L
, d g , a j j
L IDij U j FL j L j FL j U ,
, b
ID
L i 1 TR j U i 1 TR L j i U ID j i
j
Let1 TRi 1 TRi IDi IDi FLi FLi 1 TR j 1 TR j
L U L U L U L U
LetTR10,
Symmetry 2018, i 459 TRi 1 IDi 1 IDi
L
1 FLi
U
1 FLi
L U
TR j TR j 24 of 32
U Ui 1 IDL j
ai
Let , biL ,c , di L 1 ID , g 1 L FL , hjLi U1 U
, aFLj j , bj ,
cL
, d U j Ui
, g , h . LL U
1 TRTR TRi 1 TR
U j
TRiiTRi
L
1i ID
L1i IDi
L j
IDID 1i U IDi j FL
U
1
LL
i FL 1 i FLi U 1TR
jFL U
TR
L
TRj j 1TR UTR j
, d1i ID j i ,Ug ,g1i , h1i
i
ai ai L , biL , bi U , cUi , cID jIDi ,Ld FL FLi ,FL ja j ,b
i
i
FL i
jLh
, Ua
, j
, b L j
j
, U,
L U L i , U
L i U i L U j L j U
then, we have 1
1 TRi TR i 1
1 TRi TR i 1 ID IDi 1 ID IDi j ID i 1 FLFL FL i
FL1 FL j 1 TR j
FL i 1 TR j 1
1 TR j j TR
then, we have cj L
ij
, d jL U
, gUj i j
L
,Lh j i U . U
1j j ID j 1 ID 1jj ID j 1 FL 1 FL j 1 j jFL j
L U L U
c c1j ID
ID ,Ld j
,d ID Ug j
, , g FLj j L, , h ,h1j FL FL .U .
then,l 1 j L 1 j
U 1j L 1j
U
1 1 ;
i ini
we have 1 ,1 ID j ID j ,ID j ID j FL
FL, j , , 1 FL j , j
j FL ,
1 1 1 1 1
then, then,wewe have 1 l i ai
have 1 l i bi 1 l i ci 1 l i di 1 l i gi 1 l i hi
l i ini 1 , , ;
1 1 1 1 1 1
,1 , ,
1 l 1 a1 11
i1 i 1,1 1,1 l11i bi 1 ,1, l1i1 ci ,1 1 , l1 i 1di1, 1, l1i g1,1i 1, 1li h1i ;1 ;
1 1 1 1
1 1 1 1
liini
l i in 11
l j in j 1i 11 l 1 1,1 ,
1 li ai i ai 1 1l i 1l i ,bi 1 1ll i1 1c
, 1 l 1d 1 l gi 11l,l i hi
.
1 1 1 1 1
i l d
i 1 l i gi i 1
i
1
b c h
i i
i
1 l 1 a 1 l 1 j b j 1 l1 j c j 1 1l j d j 1 1 l j g j 11 l j h j
i i i i
l j in j 1 j 1 j ,1 , , , , .
1
1 1 11 11 1 11 1 1
j 1 1 l j a j 1,1 1,1 l j b j 1 ,1, l j c j 1, 1 , l j d 1j , 1, l j g1,j 1, l j h1 j . .
1
j in 1 1 1 1
and l j lin j 1
and 1 1l j l1 aj j a j 1 1lj l1 bj j bj 1 1lj l1 cj j 1c j 1lj l1 dj jdj 1 1lj l1 gj j g1 j 1lj l1 hj j h j
and x
l i inand
i and
1
1
, 1
1
,
1 1
1
,1 1
1
, 1 1
1
,1 1
1
1 ;
1 1 1 1 1
l i ini
x
1 x l 1 a 1, x l1 b , 1 1 x 1 l c,1 1 x 1 l ,d1 1 1x l ,1 g 11 x l i ; hi
x 1 i i i i
i
11 1 i
11 1
11 i i
11 1
1 1 1
1 1i
i 1
l xin , 1 11 c ,1 1 , 11 x 11l g ,11 x 11 l h ;
l i ini i i 1 x 1 l 1i ai 1,1 x 1 l 1 i bi 1,11 x 1 l i 1 1 x1 l1 i d i i i 1 i ;
1 , 1
i ,1
1, 1
i
1,1
1 x1 xl lai 1ai x1 xl lbi bi 1 x1 xl lci ci 1 x1 xl ldi di 1 x1 xl lgi gi 1 x1 xl lhi hi
1 1
1 1 1 1 1 1
i i i
i i i i i i i i i
l j n j y 1 1 1 , 1 1 1 , 1 1
1 1 1 1 1
,1 1 1 1 .
1
y
,1 , 1 1 1
1
l j n j 1y yy 1l j 1 a1j1 1, y 1 l1j 11bj , 1 1 y1 1 11
1
,1 1
.
l nl j nj1 y l1 a 11, y , l1 b 1 , 1,11 y
1 ,1
11l j1 c j ,1 1 y11 l
1
1 1 d j, 1 1
1 y 1 1 l g
,1
j ,1 j
1 1 1y 1
lj . h j
d 1, 1
j 1 1
l c 1 1 y
,1 l 1 y 1
l g1,1 1 y 1 l h
1 j .
11 y j l1j a 11 y j l1j b 11 y j l1 j c j
1 y l aj 1 j y l bj j 1 y l cj j 1 y1 yl ldj dj 1 y1 yl lgj g j 1 y1 yl lhj h j
j j 1 1 1
j 1 j1 j 1j
j j j j j j j j j j j j
Moreover, wewe
Moreover,
Moreover, have
we have
have
Moreover, we have
Moreover, we have
y
y , 1 1
x y
11 11 1 1
l i inlii ini D lx
x
in , ,1 1 ,
D j l j in j y , 1
1 1 , 1
,1 1 , 1
x j
1 11 , 1 1 1 1 ,
l i in D l j in
l i ini D l j in j 11x xl l aayy ll aa 1 1,1
1
1
1
1
, 1 ,1
1 i iixi li ai jjy jjl j aj 1 xi iil j jj j 1 x i li icii i y ljj jcj j j 1 x liii di iy ilj jdj j j j
i j
, 1
,1
,
1 1 1 1
i bi y l j bj
xx l l b b y yl l b b 1
1 1 x l x c l cy l y c l1 c 1 x 1
l d x l y d
l d 1 y l d
1 x l i ai y l j a j 1 x l ibi y l j b j 1 x l i ci y l j c j 1 x l i di y l j d j
i
1 1 1 1 11 1
1 1
1 1 ,1
,1 ,1 1 1
,
, ,
1 ,1 1 1,
1 1
j l x 1l
1
1 1x l
i ji j x li ii hi i yi lj j hjj j j
1
x gl1ig xiyl
j j 1
ygl
jg
1 h
y l
h
1 x l i gi y l j g j
l g y g 1 x l h x l yh l y h l
h
i i j j
i i
and and
and and
and
l
l in l in
l l x y
x y
l l in l inx l in
i ini D l j in j
l in y
l x y
i i i iD Dj jj j
i j
i , j 1 i , j 1i D j
i i ,jj 1 i j
i ,i j j1
i j
Symmetry 2018, 10, 459 25 of 32
Symmetry 2018, 10, x 25 of 32
Symmetry 2018, 10, x 25 of 32
1
1
1
1
l
l
1 1 l 1 1 1 ,1 1 l 1 1 1
1 1 1 1
1 1 1 i 1 1 1 1
1 ,1 1 1 i , j 1 1
, j 1 1 1
1 1
i , j 1 i j 1 x l i ai y l j a j 1 x l i ai y l j a j ii , jj1 1 ix j l 1b x yl l y l jbj
1 x l b y l
1 x l i bi y l j b j
i bi
1 1
i j 1 x l i ai y l j a j 1 x l i ai y l j a j jbj jbj
i i
i i
1
1
1
1
l
l
1 l 1 1 1 1
1 , 1 l 1 1 1 1 1
1 1 1 1
1 1 1 1i ,
j 1 1 1 1
1 , 1 1 1 1i , j 1
1 1 1
1
i , j 1 i j 1 x l i ci y1 l j cj 1 x l i ci y1 l c j i , j 1 i j 1 x l i d i y1 l j d j 1 x l i di y1 l j d j
i j 1 x l i ci y l j c j 1 x l i ci y l j c j i j 1 x l i d i y l j d j 1 x l i di y l j d j
j
1
1
1
1
l
1 l 1 1 1 1 1 1 l l 1 1
1 1 1 1i , j 1
1 1 1 1 , 1 1 1 1 1 1 1 1 1
1 x l i gi y 1 e j g j 1 x l i gi y1 l j g j i
1 , 1 1 1 1i , j 1 1
1 x l i hi y1 l j hj 1 x l i hi 1y lv
1 x l h y lv h j j
i , j 1 i j , j 1 i j
h
i j
1 x l g
i i y e g
j j
1 x l g y l g
i i j j
i j
1 x l h
i i y l h
j j
i i j j
1
1
1
l l 1
l
1 1
1 1 l1 1x x y
,1 1 l1 1x x y , 1 l1 1x x
y ,
1 i 1 i 1 i
1 1 1 l a,1 1 1 l b , 1 1 ,
y y y
l i ai l i bi l i ci l j c j
i , j 1 i lj i ai l j a j i , j 1 i lji bi l j b j i , j 1 i lji ci l j c j
, j 1 j j , j 1 j j , j 1
i j
i j i j
l
1 1 1
1 1
y l l y l l y
1
l x x x
1 1 1x y , 1 1 1x y , 1 1 1x y
1 1 l i di l j dj , 1 1 l g l g, 1 1 l h .
.
1 1 1 1
i , j 1 ii, jlj l d i , j 1 ii, jlj 1 li i g j j i , j 1 ii , jlj 1 l i hi
l j h j j j
i di j j i gi j j i hi
i j i j i j
So,So,
wewecancan
have
have
So, we can have
1 l x
x y
1 l2
il l
l
in i
l i ini D l y j in j
l j in j
l 2 l i , j 1 ii, jj1
D
i j
1
1
1
1
1 l
1
1
x y 1 1 1 1l 1x x y y
1 11 2 1 1 l1 1x
l
,
l a 1 1 1 1 1 i
11 y
1 1 l2 ll1l 1 1 1 i, jl l i ai
e a e a ,
1
ii ,j j1 i j i ai l j a j
j j i , j 1 i,jej
1 ei i j a j j j
i ai
i j
1
1
1
1
1 l
1
y
1
l
x 1 1 1 l1 1x x y y ,
1 1 11 2 1 1 l1 1x y
1 1 1 2 l1l 1 1 1 i, j 1 l ibi l j bj 1 1 1 1 1 i, j 1 l ibi l jbj ,
l l ii ,j j1 i lj ibi l j b j i , j 1 i lj i bi l jb j
i j
1
1
1
1
l
1
1
l
1x x y y 1 1l 1x x y y ,
1 11 21 1 1 1l
1 1 2 1 1 1 1 i ,j 1 l 1 1 1 i ,j 1 l
l c ,
i , j 1 i jl c ilci c lj cj
l l c
i , j 1 i jl i ci il i j c j j j
l l i j i i
j j
i j
1
1
1 1
1
y
1
1 l l x y
l x
1 1 1 1x
j d j 1 1 1 i
y
1 11 y 1 1 1x
l
1 1 2 l 21l 1 1 1 i ,j 1 l i d i l l
j d j
,j 1 i ildi j d jl
l
l
i , j 1
i jl i d i l j d j i , j 1
i jl i d
i j i j
Symmetry
Symmetry 10,10,
2018,
2018, x 459 26 26 of 32
of 32
Symmetry 2018, 10, x Symmetry 2018, 10, x 26 of 32
1 1
1
1
l 1 1
l
1
1 l 1 x y
1 1 l l1 x y , l
1 1
l 1 l 1 1 1
i , j 1 1 l x e l1y e 1 1 11 11 1 i ,j1 x i ei x y e
y 1 x
1 1 l
2
1 l 1 1
ii, jj1 l e l e l l
1
l 2 l 1 1 1 , l i ei
i i j j 2
i, j
1 i , j 1 l l
j
i li j e j
e l
j
j j
e
i j i i j j i j
i ei
i , j 1
i j
i j
i j
1 1
1
1
l 1
l 1
1
1
1 1 1 l 1 x y x y l l x y
y .
l
11 1
1 l 2 l 1 1 1 1 l h l1 h 1
1 1
11 11 1 1 1 l h l h . 1 1
1 1 1 x x y x
l l
2
i , j 1
i j
i
i j j
l i hi l j h j l 2 l i
, j
1 l
i hli hl j hl
i i j j
j h j
1
l h
i j ii ,j j1 i i
i i
i
i , j j 1 i , ji 1 j j i , j 1
i j
1
1
1
1 1 1
1
1 ll x l 1
1 11 l 1 xx yy 1 x l y y , 1 11 1 1 x x ly y ,
l
11 1 1 ,,11 11 11 221
1 l 2l 2l li
l
1
, ij,j11 ll
a l a
1 l1 b l b x y 2 l 2 l l
1l 1l i , ij,j111 l 2 i bii il 1 j bjj j
, 1 1
,l 1l i ,1j 1i , j 11
1
1c
x
j j
,
y
1 1
i i ai i l jj a jj i il
l l l c l
c 1 c , 1
i i jj
l l l a l a i j i j l l
i i
2 j j l b l b
l2
i i j j
i , j 1 i i j j i , j 1 i i j j
i j i j
11
1
1 1
1
yy
xx 11 l l xx yy x x y y
1 1
l l
11 1 l x ,, 1 1y 11 2 2 1 1 1 l x
l l
11 1 1 11 11 , 1 11 22
1 1
l2l 2l li y
11
l
1 i i i i 1 j j j j
1 1
l 2 l i
l
l d
, ji ,j11 i i i id ll jj jj
dd 1l
l
1l li ,ij,j11 l
l g g l
l g g l
l, l l
i , j 1 l
1i , j 1 1 h
l h l lh
j j 1j j
h , 1 1
i i jj l l i , j 1 l i di l j dj i j i j l l i , j 1 l i gi l j g j
i i i i
i ij j 2 2
, j 1
i j
i j
i j
Then,
Then,
Then,
Then, 1
1
1 ll x y
y x y
1
2 1 ll
x
y
i i ini DD l j j in j
x y
x
ll 2 ll ii
in l in
l in
i j
1
l
x y
l 2 l i
, j 1
i , jj1 l i ini j
i j
, j 1
D j
i j
1
1
1
2 1 2 l 1 2 l 1
2 l l l l x y l 2 l l x y l
2 1 l
l
x y 1
1 1l l 1 1 x y , 1 1 l l 1 1 x
1
,
l j bj l , 1 1 1x y 1 i , j 1 1l 2i ci l j cj l ,
, 1 1 1 1
1 1 x y 1 1 x y 1
y l l x y (54)
ii ,
1 l i a i l j aj
j 1 1 l i bi 2
2 l
x y
i , j 1
, 1
x y
i ,jj11 1l i bi l 1j b j 1
x y , 1i j i1, j 1 l ici 1 l jcj 1 (A3)
(54)
, 1 1 1 l l 1
ii,jij1j l i ai l j a j
l l x y l l x y
i j x y
l a l a i j x y l b l b
x y 1
l
ii ,jj1 i i j j
ii ,jj1 i i j j ii ,jj1
1
1
1
2 l 1 2 l 1 2 l 1
1 1 1 2 l l 1 l 1 x y , 1 l l
1 1 l 2 l 1 l 1 x
x
y l l
1 1 1 l 21 l 1 1 l x
x
y
i , j 1 l i di l j d j 1 l i gi l j g j y .
1
x y 1 1 x y 1 ii ,j 1 1 1xy 1 ii ,jj1 1l i hi2 l j h j l .
l l x y y
1 1 1 x y 1 1 , 1 1 2
2 l
l g l l g x y
ii ,jj1 l i di l j d j
i j
x y1 1 1i ,j j 1 l l y x y i , j 1 ll hl l h x l l 1
i j
x y
i i1
j 1j
i j
l i di l j d j
, 1
1 1 i i 1 j j 1
x y
li g i l j g j
1 1 1 x y 1
i , j 1 i , j 1
ii ,jj1
i j
i j
Now, put
Now, put
Now, put L U L Now,
U put L U L U
TRL i TRUi 1 IDiL 1 IDi U 1 FLi L 1 FLi U TR j L TR j U
ai ,b ,c , di , gi , hi ,aj ,b ,
TRi L i TRi U i 1 ID L 1 ID
U 1 FL
L 1 UFL TRL j L j TRULjU
ai L i,b U i ,c i L ,d , gUi TRi Li , hi L TR
, a j 1 UIDj i L , b j 1TR
i i Li Ui L U L
1 TR L i
1 TR U i
ID L i
ID i
U
FL FL i
U
1 TR 1 IDj , 1 FL U
1 FLi TR j
, di 1TR
iU TR
TRi 1 TRi TR1i TRi 1−ID IDi Li , d =IDi U
1− IDiai FLi L 1L − i i ,FL
, bFL
i
FL
, c1i − 1 i TR TRj ,g
i
j, hi ,aj , bj
ai = , b i = , c i = 1 IDL j i 1 ID j U , g
11
=
i FL h i=
i jU L aj =
, j U j , bi =
j L , U L
h j i 1 TR 1 TR j
L U L FL U L U
1− TRi 1− TRi c j IDLi L , d j IDU ,ig
TRj iL ,FL i U
. FLi IDi 1−IDTRi FL
1−i TR j FLi
j
1 IDIDj jL 1 ID j U 1FL
U j
FL
L
1 FL j
U
c j 1− , d j ID1jU− ID , gj j , h j Lj FL j U .1−1FL U L
j U L U
jID j 1 ID j 1 FL j 1 FL j
j
IDL j L 1− FL
c j = ID jL , d j =ID j U , g j FL =j L , hFL j = j c j U L.
, d j U
, g j L
, h j U
.
in Equation (54), we can get ID j ID j FL j FL jID j ID j FL j FL j
in Equation (54), we can get1
in Equation (A3), x yget
we can in Equation (54), we can get
1
l x y 1
l 2 l l l i inix D l j in j y x y 1
1
l 2 l i
i , j 1
i j l ini
D l j in j
1
l
l in
x y
x y
l 2 l i
i
, j 1 l i ini j
i j , j 1
D j
i j
Symmetry 2018, 10, 459 27 of 32
Symmetry 2018, 10, x 27 of 32
Symmetry 2018, 10, x 27 of 32
1
1
1 1
l l
l l
2
x y l l2
x y
1 1 1 i 1
, 1 1 x y 1 1
,
TRU y
x
l l y TR
L
TRy
L
ii , jj1 l TR i x
U
2
i , jlj1 x l 2
l
1
i i
j
1 l i l j
,
1 1 1 , 1 1 1
U
l l j
x y 1 TRLi x y 1 TR i U 1 TR
j
TRi jTR
L LL U U
ii ,jj1 TR i
TR j
1 TR i , j 1
j
i j l i
j
l j
l l
i j
L L U U
1 TRi 1 TR j 1 TR i 1 TR j 1
1
1 1
2
l
l 2
l l x y l l x y
1 1 1 1 1
,1 1
1
1 1
,
x y i , j 1 1 xIDi
L
L
1 yID j x y ii ,jj1 l 1 IDi
U
1 IDU
l 2 l i lj
2
l l x jy
1 1 1 1 1 l i j
l
L ,1 1 1 1 1 l i U j
l
,
L L U U
i , j 1 ID j1 IDU
x y ID ID x y ID 1i ID
L
i j
i , j 1 1 IDi
i
1 ID j
j
i j
l i l j l i l
i j
L
L
U
j
U
ID i ID j
1 ID i ID j 1
l 1 l 1
l 2 l x y l 2 l x y
1 1 1 1 1
,1 1 1 1 1
.
x y 1 FLi 1 FL L x y
L U U
i , j 1
ii ,jj1 1 FLi
l 2 l l
i j
l i x L l j y L
j
l2 l l l i l 1 FL j y
x
1 FLUi .
i
U
FLi L
1 1 1 1 1 ,1 1 1 1
FL j L U FL j
x y x y U
i , j 1
i j 1 FLi 1 FL j
i , j 1
i j 1 FLi 1 FL j
l i l j l i l i
L
L
U
U
FLi FL j FLi FL j
This is the required
This is the required proof of the Theorem 6. □proof of the Theorem 6.
This isC.
Appendix theProof
required proof of7 the Theorem 6. □
of Theorem
Appendix C. Proof of Theorem 7
Appendix
Proof. SinceC. Proof
all ini of TR , TR 7
inTheorem
L U
, ID L , IDU , FL L , FLU , i 1, 2,..., l , so we have Supp in , in 1, for
p q
L U L U L U
1 L , TRU TR, ID ,, TR
ID , FL , FL , ID
FLl ,, FL
L U L U
Proof.
Proof. Since
all p, qSince all
1, 2,..., in
alll ,in =
i i in
so TR=
p in , for all p 1, 2,...,
, ID
l. Then
, i 1,, 2,..., so we ,have (i = 1,Supp , l )p ,, in
2, . . . in 1,have
soq we for
l
all p, q 1, 2,..., l , so p , for all in
INDPBM
l
p 1, in
1,22,..., INDPBM
l.l Then
,..., in
Supp in p , inq = 1, for all1p, q = x1,, y 2, . . . , l, so Λ p = 1l , for allx , yp = 1, 2, . . . , l. Then
in, in,..., in
INDPBM
l
x, y
in , in ,..., in INDPBM in, in,..., in
1 2
1
l
x, y
l
1
l2 l x x 1 l2 l x x 1
1
1 1 1 ,
1 1
1 1 ,
TR L TRU
x y ii ,jj1 1 TR
L
x y i , j 1 U
l
1 1 TR 1
i j
l l l
l l 1 TR
L
l 1 TR L l l 1 TR
U
l 1 TRU
l 2 l x x l2 l x x
1 1 1 1
, 1 1 1 1
,
x y
1 TR 1 x y 1 TR 1
L L U U
i j
i , j 1 1 TR i j
i , j 1 1 TR
l l l l
l 1 TR l 1 TR L l 1 TR l 1 TR
L U U
l 2 l
l2 l x x l l x x
1 1 1 x y 1 i 1
1, 1
1 1 1
,1
1 1 ID 1 1 ID x y 1 1 ID 1 1 ID
L L U U
i ,jj1 ii ,jj1
l l l l
l ID
L
l ID L U
ID
U
ID
l l
l 2 l l x x l2 l l x x ,
1 1 1
1 1 1
1 1
L
L
, 1 U
U
x y ii ,jj1 1 1 ID
1 1 ID
x y
i j i , j 1
1 1 ID
1 1 ID
1 1
l l l
ll l
l ID L l IDU
ID ID
L U
l 2 l
l l
x x l2 l x x
1 1 1
x y
1 1 L
L
1 , 1 1 1 1 U
U
., 1
i , j 1 1 1 FL 1 1 FL x y ii ,jj1 1 1 FL 1 1 FL
i j l l
l l
l FL
L
l FL L l FL
U
l FLU
l
l 2 l x x l2 l l x x
1 1 1 1 1 L
L
, 1 1 1 1 U
U
.,
x y ii ,jj1 1 1 FL
1 1 FL x y i , j 1
1 1 FL
1 1 FL
l l
i j
l l
l FL l FL L l FL l FLU
L U
Symmetry 2018, 10, x 28 of 32
Symmetry 10, 459
2018, 1
28 of 32
1
Symmetry
10, x
2018,
28 of 32
l
l
l2 l , 1 1 l l
x y
2
x y ,
i i
1 1 x y 1 1 1 1
U1
x y
1
, j 1
i j
TR
L
, j 1
i j TR
U
1 TR
L
2
2
l x y
1 l l 1
l x y 1 TR
1
l l
1 x y 1 1
, 1 x y i
1
,
TR
L U
i , j 1
i j TR , j 1
i j
L
1
1 TR
U
1
1 TR
l
x 1y
1 l l 1 1 x y , 1 1 l l ,
2 2
l
1
1 1
x y
i , j1
1 1
i , j 1
U
1 ID
L
x y
i j l 2 l i j 1
ID
1 ID , 1 x y U ,
1 l 2
l x y 1 l l
1 1 x y 1 i x y 1 i
L
L
1
U ID
1 ID , j 1
1 ID
i j i j
, j 1
ID
L U
1
ID
1
1
1
2 l l
1 l l 1 1 x y , 1 l2 l
1 x
y ,
1 i 1 2 i
x yl 2 l
1
l x yL y 1 U
x y
1 , j1 , 1 1 l xl
l
1i j
, j 1
i j 1 1 FL
i
1 1 x y
1FL
L ,
1 1
x y ii, jj1 1 FL , j 1 1 FL U U
i j
L
U
FL FL
L
FL
FL
1
1 1
1
2 2 2
11 1l l l 1 1 1 1 xx y ,, 1 1 1 1 l ll l 1 1 x y x y ,
2
1 x yx 1 1
,
x yx y
y U U
LL
TR
TR TR TR
1 TR LL U U
1 TR
1 TR 1 TR
1
1
1 1
1 l l 1
2
x y
, 1
2
1 l l
x y
1 1 2 1 x 1 1
U ,
1 1 l l 1
x y L
1 1xIDy
,
1
ly2 l x y
11 ID ,
1 x y
1
1
U U
1 ID LL
x y
ID 1 ID
ID
U
L
ID 1 ID
1
1
2
1
l l
2
x y , l l
1 1 x y
1 1 1 x y 1 1 L
1 x y 1 U ,
2
1 FL 1 FL
1 l2 l x y ,
1 FL 1 1 1 FL
l l x y
1 1 x y 1
L U
L ,
1
1 FL x y 1 FL
U
L FL L U L U
L U
U
FL
TR , TR , ID , ID , FL ,FL in.
□ L U
L U
L U
TR , TR ,
ID , ID ,
FL , FL in.
Appendix D. Proof of Theorem 9
□
Appendix D. Proof of Theorem 9
Proof. Since
max TR , min ID 9 , min FLiL , FLUi , in min TRiL , TRUi , max IDiL , IDUi , max FLiL , FLUi ,
Appendix D. Proof
in of, TR
Theorem , ID
l L U l L U l l l l
i1 i 1 i1 i1
i i i i
i 1 i 1
Proof. Since
Proof.then,
Sincethere are
L L L U U U L L L U U U L L L
TR TRL (ni ) U TR , TR
TRi , TRi , min IDi ,TR
IDi (ni ,)min
TR , ID UID (ni ) ID , ID LID (U
, in min TRi , TRni i ) ,max
ID , FLL FL
IDi , IDi ,(nmax FL,iL , FLUi ,
i ) FL
l l L U l L l l U l
in max FLi , FL
i 1
i1
i1 U
i
U
Ui1
i1
i1
FL FL (ni ) FL ,
then, there
for all are
i 1, 2,..., l. We have
L L L U U U L L L U U U L L L
TR TR (ni ) TR , TR TR (ni ) TR , ID ID (ni ) ID , ID ID (ni ) ID , FL FL (ni ) FL ,
U U U
FL FL (ni ) FL ,
for all i 1, 2,..., l. We have
□
Appendix D. Proof of Theorem 9
Proof. Since2018, 10, 459
Symmetry 29 of 32
in max TRi , TRi , min IDi , IDi , min FLi , FLi , in min TRi , TRi , max IDi , IDi , max FLi , FLi ,
l L U l L U l L U l L U l L U l L U
i 1
i1 i1 i 1
i1 i1
then, there are
then, there are
L L L U U U L L L U U U L L L
TR TR (ni ) TR , TR TR (ni ) TR , ID ID (ni ) ID , ID ID (ni ) ID , FL FL (ni ) FL ,
U U U
FL FL (ni ) FL ,
for all i 1, 2,..., l. We have
for all i =
Symmetry 1, 2,10,. .x. , l. We have
2018, 29 of 32
1
1
L l2 l l x y l2 l l x y L
TR (ini ) 1 1 1 1
1 1 1 1
TR ,
x y ii ,jj1 TR L TR L x y ii ,jj1 TR L TR L
l i l j l i l j
i j i j
L L L L
1 TR 1 TR 1 TR 1 TR j
i j i
1
1
U l2 l l x y l2 l l x y U
TR (ini ) 1 1 1 1
1 1 1 1
TR ,
x y ii ,jj1 TRU TRU x y ii ,jj1 TRU TRU
l i l j l i l
i j i j
U U U j
U
1 TRi 1 TR j 1 TRi 1 TR j
1
1
L l2 l l x y l2 l l x y L
ID ini 1 1 1 1 1 L
1 1 1 1 1 L
ID
x y ii ,jj1 1 IDi 1 ID L x y ii ,jj1 1 IDi 1 ID L
l i l j j
l i l j j
IDi L L IDi L L
ID j ID j
1
1
U l2 l l x y l2 l l x y U
ID ini 1 1 1 1 1
1 1 1 1 1 U
ID
x y ii ,jj1 1 IDi
U
1 IDU x y ii ,jj1 1 IDi 1 IDU
l i l j l i l
j j
IDUi Ui U
j
U
ID j ID j
1
1
L l2 l l x y l2 l l x y L
FL ini 1 1 1 1 1 L
1 1 1 1 1 L
FL
x y ii ,jj1 1 FLi 1 FL L x y ii ,jj1 1 FLi 1 FL L
l i l l i l
j j
L j
L
L j
L
FLi FL j FLi FL j
1
1
l2 l l l2 l l U
U ini 1 1
1
x y
1 1
i , j 1
x
1 U
1
y
U
1 1
1
x y
1 1
i , j 1
x
1 U
y
1 Uj
i j i U l j U
l i j
i j
i U l j U
l i
i i
j
j
Then there are the following scores
L U L U L U
TR TR ID ID FL FL
1 1
2 2 2
1
1
l l2
l
x y l l2
l x y
1 1 1 1
1 1 1 1
2
x y ii ,jj1 TR L TR L x y ii ,jj1 TRU TRU
l i
i
l j
l i i
l j
j
L j
L U U
1 TRi 1 TR j 1 TR i 1 TR j
1
1
l l 2
l
x y l2 l l x y
1 1 1 1 1 1
1 1 1 1 1
2
x y i j L
L
x y ii ,jj1 1 IDU 1 IDU
1 IDi 1 ID j
i , j 1
l i l i l j
i j
l
L j
L U U
IDi ID j IDi ID j
1
1
l2 l l x y l2 l l x y
1 1 1 1 1 1
1 1 1 1 1
2
x y ii ,jj1 1 FL L 1 FL L x y ii ,jj1 1 FLU 1 FLU
l i
i
l j
l i
i
l j
j
L j
L U U
FLi FL j FLi FL j
L U L U L U
TR TR ID ID FL FL
1 1 .
2 2 2
L l2 l l x y l2 l l x y L
FL ini 1 1 1 1 1 L
1 1 1 1 1 L
FL
x y ii ,jj1 1 FLi 1 FL L x y ii ,jj1 1 FLi 1 FL L
l i l j j
l i l j j
FLi L L FLi L L
FL j FL j
1
1
Symmetry 2018, 10, 459
l2 l l l2 l l 30 of 32
U
ini 1 1 1
x y
1 1
i , j 1
x
1 U
y
1 Uj
1 1
1
x y
1 1
i , j 1
x
1 U
y
1 Uj
U
i j l i U l j U
i
i j l i U l j U
i
i i
j j
Then there are the following scores
Then there are the following scores
L U L U L U
TR TR ID ID FL FL
1 1
2 2 2
1
1
l l 2
l
x y l l 2
l x y
1 1 1 1
1 1 1 1
2
x y i j
i , j 1 L
L
x y ii ,jj1 TRU TRU
l i
TR i
l TR j l i
i
l j
j
L j
L
U U
1 TRi 1 TR j 1 TR i 1 TR j
1
1
l2 l l x y l2 l l x y
1 1 1 1 1 1 L
L
1 1 1 1 1
2
x y ii ,jj1 1 ID 1 ID x y ii ,jj1 1 IDU 1 IDU
l i l l i l j
i j i j
L j
L U U
IDi ID j
ID ID
i j
1
1
l2 l l x y l2 l l x y
1 1 1 1 1 1
1 1 1 1 1
2
x y ii ,jj1 1 FL L 1 FL L x y ii ,jj1 1 FLU 1 FLU
l i i
l j j
l i i
l j
j
L L U U
FLi FL j FLi FL j
L U L U L U
TR TR ID ID FL FL
1 1 .
2 2 2
Therefore
Thereforeaccording
accordingtotothe
theDefinition
Definition6,(6),
wewehave
have
≤ INDPBM
−
in in INDPBM inin11,,in
in22,,...,
. . .in l . .
, in l
−
In a similar way, the other part can be proved. That is in ≤ I NDPBM in1 , in2 , . . . , inm ≤
+
in . Hence
− +
in ≤ I NDPBM in1 , in2 , . . . , inm ≤ in .
References
1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [CrossRef]
2. Medina, J.; Ojeda-Aciego, M. Multi-adjoint t-concept lattices. Inf. Sci. 2010, 180, 712–725. [CrossRef]
3. Pozna, C.; Minculete, N.; Precup, R.E.; Kóczy, L.T.; Ballagi, A. Signatures: Definitions, operators and
applications to fuzzy modelling. Fuzzy Sets Syst. 2012, 201, 86–104. [CrossRef]
4. Kumar, A.; Kumar, D.; Jarial, S.K. A hybrid clustering method based on improved artificial bee colony and
fuzzy C-Means algorithm. Int. J. Artif. Intell. 2017, 15, 24–44.
5. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [CrossRef]
6. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [CrossRef]
7. Atanassov, K.; Gargov, G. Interval valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349.
[CrossRef]
8. Smarandache, F. Neutrosophic Probability, Set, and Logic. In Neutrosophy; American Research Press:
Rehoboth, IL, USA, 1998.
9. Smarandache, F. Neutrosophic set—A generalization of the intuitionistic fuzzy set. Int. J. Pure Appl. Math.
2010, 1, 107–116.
10. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single valued neutrosophic sets. In Proceedings of
the 8th joint conference on information Sciences, Salt Lake City, UT, USA, 21–26 July 2005; pp. 94–97.
Symmetry 2018, 10, 459 31 of 32
11. Wang, H.; Smarandache, F.; Sunderraman, R.; Zhang, Y.Q. Interval Neutrosophic Sets and Logic: Theory and
Application in Computing; Hexis: Phoenix, AZ, USA, 2005.
12. Zhang, H.Y.; Wang, J.Q.; Chen, X.H. Interval neutrosophic sets and their application in multi-criteria decision
making problems. Sci. World J. 2014, 2014, 645953. [CrossRef]
13. Ye, J. A multi-criteria decision-making method using aggregation operators for simplified neutrosophic sets.
J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [CrossRef]
14. Peng, J.J.; Wang, J.Q.; Wang, J.; Zhang, H.Y.; Chen, X.H. Simplified neutrosophic sets and their applications
in multi-criteria group decision-making problems. Int. J. Syst. Sci. 2016, 47, 2342–2358. [CrossRef]
15. Ye, J. Similarity measures between interval neutrosophic sets and their applications in multicriteria
decision-making. J. Intell. Fuzzy Syst. 2014, 26, 165–172. [CrossRef]
16. Broumi, S.; Smarandache, F. New distance and similarity measures of interval neutrosophic sets.
In Proceedings of the 17th International Conference on Information Fusion (FUSION), Salamanca, Spain,
7–10 July 2014; pp. 1–7.
17. Broumi, S.; Smarandache, F. Cosine similarity measure of interval valued neutrosophic sets. Neutrosophic
Sets Syst. 2014, 5, 15–20.
18. Ye, J.; Shigui, D. Some distances, similarity and entropy measures for interval-valued neutrosophic sets and
their relationship. Int. J. Mach. Learn. Cybern. 2017, 1–9. [CrossRef]
19. Majumdar, P.; Samanta, S.K. On similarity and entropy of neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26,
1245–1252. [CrossRef]
20. Tian, Z.P.; Zhang, H.Y.; Wang, J.; Wang, J.Q.; Chen, X.H. Multi-criteria decision-making method based on a
cross-entropy with interval neutrosophic sets. Int. J. Syst. Sci. 2016, 47, 3598–3608. [CrossRef]
21. Ye, J. Improved correlation coefficients of single valued neutrosophic sets and interval neutrosophic sets for
multiple attribute decision making. J. Intell. Fuzzy Syst. 2014, 27, 2453–2462. [CrossRef]
22. Zhang, H.; Ji, P.; Wang, J.; Chen, X. An improved weighted correlation coefficient based on integrated weight
for interval neutrosophic sets and its application in multi-criteria decision-making problems. Int. J. Comput.
Intell. Syst. 2015, 8, 1027–1043. [CrossRef]
23. Ye, J. Multiple attribute decision-making method using correlation coefficients of normal neutrosophic sets.
Symmetry 2017, 9, 80. [CrossRef]
24. Yu, D. Group decision making based on generalized intuitionistic fuzzy prioritized geometric operator. Int. J.
Intell. Syst. 2012, 27, 635–661. [CrossRef]
25. Liu, P. Multiple attribute group decision making method based on interval-valued intuitionistic fuzzy power
Heronian aggregation operators. Comput. Ind. Eng. 2017, 108, 199–212. [CrossRef]
26. Mahmood, T.; Liu, P.; Ye, J.; Khan, Q. Several hybrid aggregation operators for triangular intuitionistic fuzzy
set and their application in multi-criteria decision making. Granul. Comput. 2018, 3, 153–168. [CrossRef]
27. Liao, H.; Xu, Z. Intuitionistic fuzzy hybrid weighted aggregation operators. Int. J. Intell. Syst. 2014, 29,
971–993. [CrossRef]
28. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [CrossRef]
29. Xu, Z.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gener. Syst.
2006, 35, 417–433. [CrossRef]
30. Sun, H.X.; Yang, H.X.; Wu, J.Z.; Ouyang, Y. Interval neutrosophic numbers Choquet integral operator for
multi-criteria decision making. J. Intell. Fuzzy Syst. 2015, 28, 2443–2455. [CrossRef]
31. Liu, P.; Wang, Y. Interval neutrosophic prioritized OWA operator and its application to multiple attribute
decision making. J. Syst. Sci. Complex. 2016, 29, 681–697. [CrossRef]
32. Mukhametzyanov, I.; Pamucar, D. A sensitivity analysis in MCDM problems A statistical approach.
Decis. Mak. Appl. Manag. Eng. 2018, 1. [CrossRef]
33. Petrović, I.; Kankaraš, M. DEMATEL-AHP multi-criteria decision making model for the selection and
evaluation of criteria for selecting an aircraft for the protection of air traffic. Decis. Mak. Appl. Manag. Eng.
2018, 1. [CrossRef]
34. Roy, J.; Adhikary, K.; Kar, S.; Pamučar, D. A rough strength relational DEMATEL model for analysing the
key success factors of hospital service quality. Decis. Mak. Appl. Manag. Eng. 2018, 1, 121–142. [CrossRef]
35. Biswajit, S.; Sankar, P.M.; Sun, H.; Ali, A.; Soheil, S.; Rekha, G.; Muhammad, W.I. An optimization technique
for national income determination model with stability analysis of differential equation in discrete and
continuous process under the uncertain environment. RAIRO Oper. Res. 2018. [CrossRef]
Symmetry 2018, 10, 459 32 of 32
36. Yager, R.R. The power average operator. IEEE Trans. Syst. Man Cybern. Part A 2001, 31, 724–731. [CrossRef]
37. Liu, P.; Tang, G. Some power generalized aggregation operators based on the interval neutrosophic sets and
their application to decision making. J. Intell. Fuzzy Syst. 2016, 30, 2517–2528. [CrossRef]
38. Bonferroni, C. Sulle medie multiple di potenze. Bollettino dell’Unione Matematica Italiana 1950, 5, 267–270.
39. Sykora, S. Mathematical Means and Averages: Generalized Heronian Means. Stan’s Libr. 2009. [CrossRef]
40. Muirhead, R.F. Some methods applicable to identities and inequalities of symmetric algebraic functions of n
letters. Proc. Edinb. Math. Soc. 1902, 21, 144–162. [CrossRef]
41. Maclaurin, C. A second letter to Martin Folkes, Esq.; concerning the roots of equations, with the
demonstration of other rules of algebra. Philos. Trans. 1729, 36, 59–96.
42. Liu, P.; You, X. Interval neutrosophic Muirhead mean operators and their applications in multiple-attribute
group decision making. Int. J. Uncertain. Quant. 2017, 7, 303–334. [CrossRef]
43. Qin, J.; Liu, X. An approach to intuitionistic fuzzy multiple attribute decision making based on Maclaurin
symmetric mean operators. J. Intell. Fuzzy Syst. 2014, 27, 2177–2190. [CrossRef]
44. Li, Y.; Liu, P.; Chen, Y. Some single valued neutrosophic number Heronian mean operators and their
application in multiple attribute group decision making. Informatica 2016, 27, 85–110. [CrossRef]
45. Xu, Z.; Yager, R.R. Intuitionistic fuzzy Bonferroni means. IEEE Trans. Syst. Man Cybern. Part B 2011, 41,
568–578. [CrossRef]
46. Zhou, W.; He, J.M. Intuitionistic fuzzy geometric Bonferroni means and their application in multi-criteria
decision making. Int. J. Intell. Syst. 2012, 27, 995–1019. [CrossRef]
47. Dombi, J. A general class of fuzzy operators, the DeMorgan class of fuzzy operators and fuzziness measures
induced by fuzzy operators. Fuzzy Sets Syst. 1982, 8, 149–163. [CrossRef]
48. Liu, P.; Liu, J.; Chen, S.H. Some intuitionistic fuzzy Dombi Bonferroni mean operators and their application
to multi-attribute group decision making. J. Oper. Res. Soc. 2018, 69, 1–24. [CrossRef]
49. Chen, J.; Ye, J. Some single-valued neutrosophic Dombi weighted aggregation operators for multiple attribute
decision-making. Symmetry 2017, 9, 82. [CrossRef]
50. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [CrossRef]
51. He, X. Typhoon disaster assessment based on Dombi hesitant fuzzy information aggregation operators.
Nat. Hazards 2018, 90, 1153–1175. [CrossRef]
52. He, Y.; He, Z.; Deng, Y.; Zhou, P. IFPBMs and their application to multiple attribute group decision making.
J. Oper. Res. Soc. 2016, 67, 127–147. [CrossRef]
53. He, Y.; He, Z.; Jin, C.; Chen, H. Intuitionistic fuzzy power geometric Bonferroni means and their application
to multiple attribute group decision making. Int. J. Uncertain. Fuzz. Knowl.-Based Syst. 2015, 23, 285–315.
[CrossRef]
54. He, Y.; He, Z.; Wang, G.; Chen, H. Hesitant fuzzy power Bonferroni means and their application to multiple
attribute decision making. IEEE Trans. Fuzzy Syst. 2015, 23, 1655–1668. [CrossRef]
55. Liu, P.; Liu, X. Multi-attribute group decision making methods based on linguistic intuitionistic fuzzy power
Bonferroni mean operators. Complexity 2017, 2017, 1–15.
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license (http://creativecommons.org/licenses/by/4.0/).
You might also like
- Bergson and The Metaphysics of Media PDFDocument197 pagesBergson and The Metaphysics of Media PDFDrMlad100% (2)
- Fuzzy TopsisDocument12 pagesFuzzy TopsisSubbrahmanyam CvvNo ratings yet
- Action Research On Spelling AbilityDocument7 pagesAction Research On Spelling AbilityCiedelle Honey Lou Dimalig100% (1)
- A Vendor Selection in Manufacturing Industry Using AHP and ANNDocument6 pagesA Vendor Selection in Manufacturing Industry Using AHP and ANNthesijNo ratings yet
- Proactive Vs Reactive MaintenanceDocument7 pagesProactive Vs Reactive MaintenanceyoyokpurwantoNo ratings yet
- Cognitive Radio Cognitive Network SimulatorDocument60 pagesCognitive Radio Cognitive Network SimulatorChandra Mohanty0% (1)
- Line Following Robot in VerilogDocument12 pagesLine Following Robot in VerilogAparna GopalNo ratings yet
- 30 Minutes Lesson Plan For CEFR Year 5Document3 pages30 Minutes Lesson Plan For CEFR Year 5Cyril RyanNo ratings yet
- An Extended Taxonomy Method Based On Normal T-Spherical Fuzzy Numbers For Multiple-Attribute Decision-MakingDocument18 pagesAn Extended Taxonomy Method Based On Normal T-Spherical Fuzzy Numbers For Multiple-Attribute Decision-MakingYounas KtkNo ratings yet
- Multicriteria Decision-Making Approach For Pythagorean Fuzzy Hypersoft Sets' Interaction Aggregation OperatorsDocument17 pagesMulticriteria Decision-Making Approach For Pythagorean Fuzzy Hypersoft Sets' Interaction Aggregation OperatorsScience DirectNo ratings yet
- Neutrosophic Hypersoft Matrices With Application To Solve Multiattributive Decision-Making ProblemsDocument18 pagesNeutrosophic Hypersoft Matrices With Application To Solve Multiattributive Decision-Making ProblemsScience DirectNo ratings yet
- Multi-Criteria Decision-Making Method Based On Simplified Neutrosophic Linguistic Information With Cloud ModelDocument23 pagesMulti-Criteria Decision-Making Method Based On Simplified Neutrosophic Linguistic Information With Cloud ModelMia AmaliaNo ratings yet
- Neutrosophic Hypersoft Matrices With Application To Solve Multiattributive Decision-Making ProblemsDocument17 pagesNeutrosophic Hypersoft Matrices With Application To Solve Multiattributive Decision-Making ProblemsScience DirectNo ratings yet
- Single-Valued Neutrosophic Hesitant Fuzzy Choquet Aggregation Operators For Multi-Attribute Decision MakingDocument15 pagesSingle-Valued Neutrosophic Hesitant Fuzzy Choquet Aggregation Operators For Multi-Attribute Decision MakingScience DirectNo ratings yet
- Big Bang - Big Crunch Learning Method For Fuzzy Cognitive MapsDocument10 pagesBig Bang - Big Crunch Learning Method For Fuzzy Cognitive MapsenginyesilNo ratings yet
- A Comparative Study of FCSM, FSAW and TOPSIS Techniques Using Triangular Fuzzy NumbersDocument14 pagesA Comparative Study of FCSM, FSAW and TOPSIS Techniques Using Triangular Fuzzy NumbersUMT JournalsNo ratings yet
- Multivalued Neutrosophic Power Partitioned Hamy Mean Operators and Their Application in MAGDMDocument23 pagesMultivalued Neutrosophic Power Partitioned Hamy Mean Operators and Their Application in MAGDMScience DirectNo ratings yet
- Einstein Weighted Geometric Operator For Pythagorean Fuzzy Hypersoft With Its Application in Material SelectionDocument27 pagesEinstein Weighted Geometric Operator For Pythagorean Fuzzy Hypersoft With Its Application in Material SelectionScience DirectNo ratings yet
- Research ArticleDocument27 pagesResearch ArticleScience DirectNo ratings yet
- Thesis Report FormDocument5 pagesThesis Report FormScott Bou100% (2)
- Jurnal Managemen CPMDocument8 pagesJurnal Managemen CPMHandy NugrohoNo ratings yet
- BuildingsDocument20 pagesBuildingsScience DirectNo ratings yet
- Tensorsom: March 2016Document42 pagesTensorsom: March 2016muhazizmNo ratings yet
- Research ArticleDocument22 pagesResearch ArticleAhmed EshebliNo ratings yet
- An Ensemble-Based Method For The Selection of Instances in The Multi-Target Regression ProblemDocument18 pagesAn Ensemble-Based Method For The Selection of Instances in The Multi-Target Regression Problemmont21No ratings yet
- A New Study of Trapezoidal, Simpson'S 1/3 and Simpson'S 3/8 Rules of Numerical Integral ProblemsDocument14 pagesA New Study of Trapezoidal, Simpson'S 1/3 and Simpson'S 3/8 Rules of Numerical Integral ProblemsRIYA GUPTANo ratings yet
- Research ArticleDocument8 pagesResearch ArticleAseef EmonNo ratings yet
- Algorithms: Variable Selection in Time Series Forecasting Using Random ForestsDocument25 pagesAlgorithms: Variable Selection in Time Series Forecasting Using Random ForestsLucas PiroulusNo ratings yet
- Knowledge-Based Systems: Jun Ma, Jumei ShenDocument14 pagesKnowledge-Based Systems: Jun Ma, Jumei ShenReshma KhemchandaniNo ratings yet
- 2011 - Gardner, McKenzie - Why The Damped Trend Works - Journal of The Operational Research SocietyDocument5 pages2011 - Gardner, McKenzie - Why The Damped Trend Works - Journal of The Operational Research SocietyalNo ratings yet
- A General Fuzzy TOPSIS Model in Multiple Criteria Decision MakingDocument15 pagesA General Fuzzy TOPSIS Model in Multiple Criteria Decision Makingdelia2011No ratings yet
- Generalized Interval Neutrosophic Choquet Aggregation Operators and Their ApplicationsDocument17 pagesGeneralized Interval Neutrosophic Choquet Aggregation Operators and Their ApplicationsMia AmaliaNo ratings yet
- A New Modified Ridge-Type Estimator For The Beta Regression Model: Simulation and ApplicationDocument23 pagesA New Modified Ridge-Type Estimator For The Beta Regression Model: Simulation and Applicationأبن الرماديNo ratings yet
- An MCDM Technique Using Cosine and Set-Theoretic Similarity Measures For Neutrosophic Hypersoft SetDocument15 pagesAn MCDM Technique Using Cosine and Set-Theoretic Similarity Measures For Neutrosophic Hypersoft SetScience DirectNo ratings yet
- Similarity Measures For Interval-Valued Neutrosophic Hypersoft Set With Their Application To Solve Decision Making ProblemDocument16 pagesSimilarity Measures For Interval-Valued Neutrosophic Hypersoft Set With Their Application To Solve Decision Making ProblemScience DirectNo ratings yet
- Sensors: Metaheuristic Based Scheduling Meta-Tasks in Distributed Heterogeneous Computing SystemsDocument12 pagesSensors: Metaheuristic Based Scheduling Meta-Tasks in Distributed Heterogeneous Computing SystemsalkimistuNo ratings yet
- Uncertain Evaluation For An Ultrasonic Data Fusion Based Target Differentiation Problem Using Generalized Aggregated Uncertanty Measure 2Document6 pagesUncertain Evaluation For An Ultrasonic Data Fusion Based Target Differentiation Problem Using Generalized Aggregated Uncertanty Measure 2Mia AmaliaNo ratings yet
- Calculation of Average Mutual Information (AMI) and False-Nearest Neighbors (FNN) For The Estimation of Embedding Parameters of Multidimensional Time Series in MatlabDocument10 pagesCalculation of Average Mutual Information (AMI) and False-Nearest Neighbors (FNN) For The Estimation of Embedding Parameters of Multidimensional Time Series in MatlabSebastian WallotNo ratings yet
- Trigonometric Similarity Measures For Neutrosophic Hypersoft Sets With Application To Renewable Energy Source SelectionDocument11 pagesTrigonometric Similarity Measures For Neutrosophic Hypersoft Sets With Application To Renewable Energy Source SelectionScience DirectNo ratings yet
- Extension of Aggregation Operators To Site Selection For Solid Waste Management Under Neutrosophic Hypersoft SetDocument34 pagesExtension of Aggregation Operators To Site Selection For Solid Waste Management Under Neutrosophic Hypersoft SetScience DirectNo ratings yet
- Integration of Fuzzy Shannon's Entropy With Fuzzy TOPSIS For Industrial Robotic System SelectionDocument13 pagesIntegration of Fuzzy Shannon's Entropy With Fuzzy TOPSIS For Industrial Robotic System SelectionHadiBiesNo ratings yet
- 1 s2.0 S0377221713000908 Main PDFDocument11 pages1 s2.0 S0377221713000908 Main PDFAngga Eka PrasetyaNo ratings yet
- Distance and Similarity Measures For Neutrosophic HyperSoft Set (NHSS) With Construction of NHSS-TOPSIS and ApplicationsDocument14 pagesDistance and Similarity Measures For Neutrosophic HyperSoft Set (NHSS) With Construction of NHSS-TOPSIS and ApplicationsScience DirectNo ratings yet
- An Algorithm Based On Correlation Coefficient Under Neutrosophic Hypersoft Set Environment With Its Application For Decision-MakingDocument13 pagesAn Algorithm Based On Correlation Coefficient Under Neutrosophic Hypersoft Set Environment With Its Application For Decision-MakingScience DirectNo ratings yet
- Application of DSmT-ICM With Adaptive Decision Rule To Supervised Classi Cation in Multisource Remote SensingDocument11 pagesApplication of DSmT-ICM With Adaptive Decision Rule To Supervised Classi Cation in Multisource Remote SensingMia AmaliaNo ratings yet
- Triangular Single Valued Neutrosophic Data Envelopment Analysis: Application To Hospital Performance MeasurementDocument14 pagesTriangular Single Valued Neutrosophic Data Envelopment Analysis: Application To Hospital Performance MeasurementScience DirectNo ratings yet
- L. Marchisio, Dennis Vigil, O. Fox - 2003 - Implementation of The Quadrature Method of Moments in CFD Codes For Aggregation-Breakage ProDocument15 pagesL. Marchisio, Dennis Vigil, O. Fox - 2003 - Implementation of The Quadrature Method of Moments in CFD Codes For Aggregation-Breakage ProlgroscheNo ratings yet
- Tensor Decompositions For Learning Latent Variable Models: Mtelgars@cs - Ucsd.eduDocument54 pagesTensor Decompositions For Learning Latent Variable Models: Mtelgars@cs - Ucsd.eduJohn KirkNo ratings yet
- Estimation Strategies For The Regression Coefficient Parameter Matrix in Multivariate Multiple RegressionDocument20 pagesEstimation Strategies For The Regression Coefficient Parameter Matrix in Multivariate Multiple RegressionRonaldo SantosNo ratings yet
- Parametric Model Order Reduction Using Grasamnn ManifoldsiDocument16 pagesParametric Model Order Reduction Using Grasamnn ManifoldsiAtsis PapadopoulosNo ratings yet
- Research Article: Optimization of Integer Order Integrators For Deriving Improved Models of Their Fractional CounterpartsDocument12 pagesResearch Article: Optimization of Integer Order Integrators For Deriving Improved Models of Their Fractional CounterpartsvamshiNo ratings yet
- Energies 09 00697Document22 pagesEnergies 09 00697Nanang Puji NugrohoNo ratings yet
- PID6626337Document8 pagesPID6626337369.vaasuNo ratings yet
- Journal of Statistical Software: PDC: An R Package For Complexity-BasedDocument23 pagesJournal of Statistical Software: PDC: An R Package For Complexity-BasedFabian Isaac Mendoza FloresNo ratings yet
- DDR PDFDocument15 pagesDDR PDFMaha ElarbiNo ratings yet
- Spherical Fuzzy Logarithmic Aggregation Operators Based On Entropy and Their Application in Decision Support SystemsDocument36 pagesSpherical Fuzzy Logarithmic Aggregation Operators Based On Entropy and Their Application in Decision Support SystemsScience DirectNo ratings yet
- Hybrid-Distance Monge ElkanDocument6 pagesHybrid-Distance Monge ElkanFelipe Román AlboresNo ratings yet
- CNN Approaches To Classify Multivariate Time Series Using Class-Specific FeaturesDocument8 pagesCNN Approaches To Classify Multivariate Time Series Using Class-Specific FeaturessdfghNo ratings yet
- Using Data Complexity Measures For Thresholding in Feature Selection RankersDocument11 pagesUsing Data Complexity Measures For Thresholding in Feature Selection RankersedersonschmeingNo ratings yet
- TOPSIS Approach For MCGDM Based On Intuitionistic Fuzzy Rough Dombi Aggregation OperationsDocument33 pagesTOPSIS Approach For MCGDM Based On Intuitionistic Fuzzy Rough Dombi Aggregation OperationsScience DirectNo ratings yet
- Ashtiani 2009Document5 pagesAshtiani 2009Genet AlemayehuNo ratings yet
- A Comparative Study of Uncertainty Propagation Methods For Black-Box Type FunctionsDocument10 pagesA Comparative Study of Uncertainty Propagation Methods For Black-Box Type FunctionsmaenfadelNo ratings yet
- Multidimensional Scaling: Multidimensional Scaling (MDS) Is A Set of RelatedDocument16 pagesMultidimensional Scaling: Multidimensional Scaling (MDS) Is A Set of RelatedJatinder SainiNo ratings yet
- Progress in Electromagnetics Research, Vol. 110, 23-42, 2010Document20 pagesProgress in Electromagnetics Research, Vol. 110, 23-42, 2010pena kayuNo ratings yet
- Versao Final 25 07 2017 InglesDocument14 pagesVersao Final 25 07 2017 InglesFrancisco SilvaNo ratings yet
- The Mimetic Finite Difference Method for Elliptic ProblemsFrom EverandThe Mimetic Finite Difference Method for Elliptic ProblemsNo ratings yet
- Acts Chapter 29: Art and Science and Theology in DialogueDocument204 pagesActs Chapter 29: Art and Science and Theology in DialogueScience DirectNo ratings yet
- The Fluid Margin Between Physical Causal Closure and Non-Physical Causal Closure, Extended To The Neutrosophic Causal Closure PrincipleDocument4 pagesThe Fluid Margin Between Physical Causal Closure and Non-Physical Causal Closure, Extended To The Neutrosophic Causal Closure PrincipleScience DirectNo ratings yet
- NCMPy: A Modelling Software For Neutrosophic Cognitive Maps Based On Python PackageDocument22 pagesNCMPy: A Modelling Software For Neutrosophic Cognitive Maps Based On Python PackageScience DirectNo ratings yet
- Neutrosophic SuperHyperAlgebra and New Types of TopologiesDocument254 pagesNeutrosophic SuperHyperAlgebra and New Types of TopologiesScience DirectNo ratings yet
- Neutrosophic Linear Models and Algorithms To Find Their Optimal SolutionDocument183 pagesNeutrosophic Linear Models and Algorithms To Find Their Optimal SolutionScience DirectNo ratings yet
- Empleo de La Neutrosofía en El Análisis Del Conocimiento Sobre Juventud y Democracia Desde El Desarrollo SostenibleDocument9 pagesEmpleo de La Neutrosofía en El Análisis Del Conocimiento Sobre Juventud y Democracia Desde El Desarrollo SostenibleScience DirectNo ratings yet
- Remark On Regenerative Medicine and Potential Utilization of Low-Intensity Laser Photobiomodulation To Activate Human Stem CellsDocument4 pagesRemark On Regenerative Medicine and Potential Utilization of Low-Intensity Laser Photobiomodulation To Activate Human Stem CellsScience DirectNo ratings yet
- Foundation of Revolutionary Topologies: An Overview, Examples, Trend Analysis, Research Issues, Challenges, and Future DirectionsDocument22 pagesFoundation of Revolutionary Topologies: An Overview, Examples, Trend Analysis, Research Issues, Challenges, and Future DirectionsScience DirectNo ratings yet
- Soft Set Product Extended To Hypersoft Set and Indetermsoft Set Product Extended To Indetermhypersoft SetDocument4 pagesSoft Set Product Extended To Hypersoft Set and Indetermsoft Set Product Extended To Indetermhypersoft SetScience DirectNo ratings yet
- SuperHyperFunction, SuperHyperStructure, Neutrosophic SuperHyperFunction and Neutrosophic SuperHyperStructure: Current Understanding and Future DirectionsDocument9 pagesSuperHyperFunction, SuperHyperStructure, Neutrosophic SuperHyperFunction and Neutrosophic SuperHyperStructure: Current Understanding and Future DirectionsScience DirectNo ratings yet
- Neutrosophic Treatment of The Modified Simplex Algorithm To Find The Optimal Solution For Linear ModelsDocument8 pagesNeutrosophic Treatment of The Modified Simplex Algorithm To Find The Optimal Solution For Linear ModelsScience DirectNo ratings yet
- CSsEv: Modelling QoS Metrics in Tree Soft Toward Cloud Services Evaluator Based On Uncertainty EnvironmentDocument10 pagesCSsEv: Modelling QoS Metrics in Tree Soft Toward Cloud Services Evaluator Based On Uncertainty EnvironmentScience DirectNo ratings yet
- The MultiAlist System of Thought (Philosophical Essay)Document8 pagesThe MultiAlist System of Thought (Philosophical Essay)Science DirectNo ratings yet
- Godel, Escherian Staircase and Possibility of Quantum Wormhole With Liquid Crystalline Phase of Iced-Water - Part II: Experiment DescriptionDocument16 pagesGodel, Escherian Staircase and Possibility of Quantum Wormhole With Liquid Crystalline Phase of Iced-Water - Part II: Experiment DescriptionScience DirectNo ratings yet
- Approach To The Personnel Selection Process in A Group Decision-Making Environment Based On The PSI MethodDocument7 pagesApproach To The Personnel Selection Process in A Group Decision-Making Environment Based On The PSI MethodScience DirectNo ratings yet
- A Study of Systems of Neutrosophic Linear EquationsDocument10 pagesA Study of Systems of Neutrosophic Linear EquationsScience DirectNo ratings yet
- Finding A Basic Feasible Solution For Neutrosophic Linear Programming Models: Case Studies, Analysis, and ImprovementsDocument8 pagesFinding A Basic Feasible Solution For Neutrosophic Linear Programming Models: Case Studies, Analysis, and ImprovementsScience DirectNo ratings yet
- Godel, Escherian Staircase and Possibility of Quantum Wormhole With Liquid Crystalline Phase of Iced-Water - Part I: Theoretical UnderpinningDocument6 pagesGodel, Escherian Staircase and Possibility of Quantum Wormhole With Liquid Crystalline Phase of Iced-Water - Part I: Theoretical UnderpinningScience DirectNo ratings yet
- Analyzing Imprecise Data From Wireless Temperature SensorDocument13 pagesAnalyzing Imprecise Data From Wireless Temperature SensorScience DirectNo ratings yet
- Remark On Creatio Ex Nihilo, Intelligent Design and Emergence Philosophy Approaches To Origin of The UniverseDocument20 pagesRemark On Creatio Ex Nihilo, Intelligent Design and Emergence Philosophy Approaches To Origin of The UniverseScience DirectNo ratings yet
- Thinking Out Loud On Early Creation Through The Lens of Hermeneutics of Sherlock HolmesDocument13 pagesThinking Out Loud On Early Creation Through The Lens of Hermeneutics of Sherlock HolmesScience DirectNo ratings yet
- Beyond Negation and Excluded Middle: An Exploration To Embrace The Otherness Beyond Classical Logic System and Into Neutrosophic LogicDocument7 pagesBeyond Negation and Excluded Middle: An Exploration To Embrace The Otherness Beyond Classical Logic System and Into Neutrosophic LogicScience DirectNo ratings yet
- On Some Metaphysical Problems of Many Worlds Interpretation of Quantum MechanicsDocument12 pagesOn Some Metaphysical Problems of Many Worlds Interpretation of Quantum MechanicsScience DirectNo ratings yet
- Re-Reading Wilczek's Remark On "Lost in Math": The Perils of Postempirical Science and Their ResolutionDocument10 pagesRe-Reading Wilczek's Remark On "Lost in Math": The Perils of Postempirical Science and Their ResolutionScience DirectNo ratings yet
- On Newtonian Dynamics With A Variable Earth Mass: Geodetic Evidence and Its Implications On Pioneer Spacecraft Anomaly and LAGEOS SatelliteDocument9 pagesOn Newtonian Dynamics With A Variable Earth Mass: Geodetic Evidence and Its Implications On Pioneer Spacecraft Anomaly and LAGEOS SatelliteScience DirectNo ratings yet
- Solving Numerically Ermakov-Type Equation For Newtonian Cosmology Model With VortexDocument7 pagesSolving Numerically Ermakov-Type Equation For Newtonian Cosmology Model With VortexScience DirectNo ratings yet
- Remark On Artificial Intelligence, Humanoid and Terminator Scenario: A Neutrosophic Way To FuturologyDocument7 pagesRemark On Artificial Intelligence, Humanoid and Terminator Scenario: A Neutrosophic Way To FuturologyScience DirectNo ratings yet
- Reinterpreting Tlön, Uqbar, Orbis Tertius: On The Antirealism Tendency in Modern PhysicsDocument13 pagesReinterpreting Tlön, Uqbar, Orbis Tertius: On The Antirealism Tendency in Modern PhysicsScience DirectNo ratings yet
- It's Déjà Vu All Over Again: A Classical Interpretation of Syntropy and Precognitive Interdiction Based On Wheeler-Feynman's Absorber TheoryDocument6 pagesIt's Déjà Vu All Over Again: A Classical Interpretation of Syntropy and Precognitive Interdiction Based On Wheeler-Feynman's Absorber TheoryScience DirectNo ratings yet
- Response To Pitkanen's Solar System ModelDocument20 pagesResponse To Pitkanen's Solar System ModelScience DirectNo ratings yet
- Brain Controlled Car For Disabled Using AiDocument21 pagesBrain Controlled Car For Disabled Using AiS.T KAUSALYAA100% (1)
- Principle of Beneficial Construction Nature and ScopeDocument13 pagesPrinciple of Beneficial Construction Nature and ScopeEkansh AroraNo ratings yet
- Service: Mașină de Spălat Cu TamburDocument44 pagesService: Mașină de Spălat Cu TamburRacoviţă Ionuţ-LucianNo ratings yet
- Joshua Anzalones ResumeDocument1 pageJoshua Anzalones Resumeapi-404755828No ratings yet
- COE LUISA-Main Class Annual-Requirements-SignedDocument6 pagesCOE LUISA-Main Class Annual-Requirements-SignedNavo MareNo ratings yet
- Advance Shoes For Blind PeopleDocument19 pagesAdvance Shoes For Blind PeopleMoiz Iqbal100% (1)
- Adc 10158Document26 pagesAdc 10158Felipe LorenziNo ratings yet
- Science 7 DLPDocument6 pagesScience 7 DLPMary Apostol0% (1)
- 2017 Curriculum Structure PDFDocument2 pages2017 Curriculum Structure PDFAhmad ZubirNo ratings yet
- Peter Wynn Kirby - Troubled Natures - Waste, Environment, Japan-University of Hawaii Press (2010)Document265 pagesPeter Wynn Kirby - Troubled Natures - Waste, Environment, Japan-University of Hawaii Press (2010)Tereza KovalskáNo ratings yet
- Snarling Dogs Blues Bawls WahDocument2 pagesSnarling Dogs Blues Bawls WahMy HaHNo ratings yet
- Kinetics Body Work&Energy Impulse&MomentumDocument26 pagesKinetics Body Work&Energy Impulse&MomentumKano MolapisiNo ratings yet
- Syllabus: Craft Instructors Training Scheme (Cits)Document21 pagesSyllabus: Craft Instructors Training Scheme (Cits)Abdul MalikNo ratings yet
- التنمية المستدامةDocument10 pagesالتنمية المستدامةJiana AlsharifNo ratings yet
- Comments On Candidate Performance: ReadingDocument13 pagesComments On Candidate Performance: ReadingBarun BeheraNo ratings yet
- Aula 2 - Ser e Estar PronomesDocument6 pagesAula 2 - Ser e Estar PronomesWagnerMouraNo ratings yet
- SQL Queries PDFDocument10 pagesSQL Queries PDFmfarooq28No ratings yet
- DefenseDocument23 pagesDefenseCharles Gabriel Vinson CandelonNo ratings yet
- Setting Up MRI - SpecificationsDocument59 pagesSetting Up MRI - SpecificationssuneedhNo ratings yet
- David Crystal - Main IdeasDocument2 pagesDavid Crystal - Main IdeasКсения ЛогиноваNo ratings yet
- Metraflex Fireloop™: Down Have The 180 Return Supported. (See Installation Instructions.)Document4 pagesMetraflex Fireloop™: Down Have The 180 Return Supported. (See Installation Instructions.)ANTONIO GUTIERREZ MIRANDANo ratings yet
- Test Bank For Campbell Biology, 10th Edition, Jane B. Reece, Lisa A. Urry, Michael L. Cain, Steven A. Wasserman, Peter V. Minorsky Robert B. JacksonDocument35 pagesTest Bank For Campbell Biology, 10th Edition, Jane B. Reece, Lisa A. Urry, Michael L. Cain, Steven A. Wasserman, Peter V. Minorsky Robert B. Jacksonhermeticfairhoodr2ygm100% (10)
- Fahrenheit 451 Reading ScheduleDocument2 pagesFahrenheit 451 Reading ScheduleRod FobertNo ratings yet
- Catalog Profile StandardDocument16 pagesCatalog Profile StandardBogdan AndreiNo ratings yet
