# Interval Neutrosophic Sets and Their Application in Multicriteria Decision Making Problems

Authors: Hong-yu Zhang; Jian-qiang Wang; Xiao-hong Chen
Journal: The Scientific World Journal
 (2014)

---

## Abstract

As a generalization of fuzzy sets and intuitionistic fuzzy sets, neutrosophic sets have been developed to represent uncertain, imprecise, incomplete, and inconsistent information existing in the real world. And interval neutrosophic sets (INSs) have been proposed exactly to address issues with a set of numbers in the real unit interval, not just a specific number. However, there are fewer reliable operations for INSs, as well as the INS aggregation operators and decision making method. For this purpose, the operations for INSs are defined and a comparison approach is put forward based on the related research of interval valued intuitionistic fuzzy sets (IVIFSs) in this paper. On the basis of the operations and comparison approach, two interval neutrosophic number aggregation operators are developed. Then, a method for multicriteria decision making problems is explored applying the aggregation operators. In addition, an example is provided to illustrate the application of the proposed method.


---

## Body

## 1. Introduction

Zadeh proposed his remarkable theory of fuzzy sets (FSs in short) in 1965 [1] to encounter different types of uncertainties. Since then, it has been applied successfully in various fields [2]. As the traditional fuzzy set uses one single value μ
A
(
x
)
∈
[
0,1
] to represent the grade of membership of the fuzzy set A defined on a universe, it cannot handle some cases where μ
A is hard to be defined by a specific value. So interval valued fuzzy sets (IVFSs) were introduced by Turksen [3]. And to cope with the lack of knowledge of nonmembership degrees, Atanassov introduced intuitionistic fuzzy sets (IFSs in short) [4–7], an extension of Zadeh’s FSs. In addition, Gau and Buehrer [8] defined vague sets. Later on, Bustince pointed out that vague sets and Atanassov’s IFSs are mathematically equivalent objects [9]. As for the present, IFSs have been widely applied in solving multicriteria decision making problems [10–14], neural networks [15, 16], medical diagnosis [17], color region extraction [18, 19], market prediction [20], and so forth.IFSs took into account the membership degree, nonmembership degree, and degree of hesitation simultaneously. So IFSs are more flexible and practical in addressing the fuzziness and uncertainty than the traditional FSs. Moreover, in some actual cases, the membership degree, nonmembership degree, and hesitation degree of an element in the IFS may not be a specific number. Hence, it was extended to the interval valued intuitionistic fuzzy sets (IVIFSs in brief) [21]. To handle the situations where people are hesitant in expressing their preference over objects in a decision making process, hesitant fuzzy sets (HFSs) were introduced by Torra [22] and Torra and Narukawa [23].Although the FSs theory has been developed and generalized, it can not deal with all sorts of uncertainties in different real physical problems. Some types of uncertainties such as the indeterminate information and inconsistent information can not be handled. For example [24], when we ask about the opinion of an expert about a certain statement, he or she may say that the possibility that the statement is true is 0.5, that the statement is false is 0.6, and the degree that he or she is not sure is 0.2. This issue is beyond the scope of FSs and IFSs. Therefore, some new theories are required.Smarandache coined neutrosophic logic and neutrosophic sets (NSs) in 1995 [25, 26]. A NS is a set where each element of the universe has a degree of truth, indeterminacy, and falsity, respectively, and which lies in ]
0
-
,
1
+
[, the nonstandard unit interval [27]. Obviously, it is the extension to the standard interval [
0,1
] in IFSs. And the uncertainty present here, that is, indeterminacy factor, is independent of truth and falsity values while the incorporated uncertainty is dependent on the degrees of belongingness and nonbelongingness in IFSs [28]. And for the aforementioned example, by means of NSs, it can be expressed as x
(
0.5
,
0.2
,
0.6
).However, without being specified, it is difficult to apply in the real applications. Hence, the single valued neutrosophic set (SVNS) was proposed, which is an instance of NSs [24, 28]. Furthermore, the information energy of SVNSs, correlation and correlation coefficient of SVNSs, and a decision making method by the use of SVNSs were presented [29]. In addition, Ye also introduced the concept of simplified neutrosophic sets (SNSs), which can be described by three real numbers in the real unit interval [
0,1
], and proposed a multicriteria decision making method using aggregation operators for SNSs [30]. Majumdar and Samant introduced a measure of entropy of a SVNS [28].In fact, sometimes the degree of truth, falsity, and indeterminacy of a certain statement can not be defined exactly in the real situations but denoted by several possible interval values. So the interval neutrosophic set (INS) was required, similar to IVIFS. Wang et al. proposed the concept of INS and gave the set-theoretic operators of INS [31]. The operations of INS were discussed in [32]; yet the comparison methods were not seen there. Furthermore, Ye defined the Hamming and Euclidean distances between INSs and proposed the similarity measures between INSs based on the relationship between similarity measures and distances [33]. However, in some cases, the INS operations in [31] might be irrational. For instance, the sum of any element and the maximum value should be equal to the maximum one, while it does not hold with the operations in [31]. In addition, to the best of our knowledge, the existing literatures do not put forward the INS aggregation operators and decision making method, which were vitally important for INSs to be utilized in the real situations in scientific and engineering applications. Therefore, the operations and comparison approach between interval neutrosophic numbers (INNs) and the aggregation operators for INSs are defined in this paper to be used. Thus, a multicriteria decision making method is established based on the proposed operators; an illustrative example is given to demonstrate the application of the proposed method.The rest of the paper is organized as follows. Section2 briefly introduces interval numbers, properties of t-norm and t-conorm, and concepts and operations of NSs, SNSs, and INSs. And the operations and comparison approach for INSs are defined on the basis of the IVIFS theory in Section 3. The INN aggregation operators are given and a decision making method is developed for INSs by means of the INN aggregation operators in Section 4. In Section 5, an illustrative example is presented to illustrate the proposed method and the comparison analysis and discussion are given. Finally, Section 6 concludes the paper.


## 2. Preliminaries

In this section, some basic concepts and definitions related to INSs, including interval numbers,t-norm and t-conorm, and the definitions and operations of NSs, SNSs, and INSs are introduced, which will be utilized in the rest of the paper.


### 2.1. Interval Numbers and Their Operations

Interval numbers and their operations are of utmost importance to explore the operations for INSs. So some definitions and operations of interval numbers are given below.Definition 1 (see [34–37]).
Leta
~
=
[
a
L
,
a
U
]
=
{
x
∣
a
L
≤
x
≤
a
U
}, and then a
~ is called an interval number. In particular, if 0
≤
a
L
≤
x
≤
a
U, then a
~ is reduced to a positive interval number.
Consider any two interval numbersa
~
=
[
a
L
,
a
U
] and b
~
=
[
b
L
,
b
U
], and then their operations are defined as follows:(1)
a
~
=
b
~
⇔
a
L
=
b
L
,
a
U
=
b
U;
(2)
a
~
+
b
~
=
[
a
L
+
b
L
,
a
U
+
b
U
];
(3)
a
~
-
b
~
=
[
a
L
-
b
U
,
a
U
-
b
L
];
(4)
a
~
×
b
~
=
[
min
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}, max
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}
];
(5)
k
a
~
=
[
k
a
L
,
k
a
U
]
,
k
>
0.Definition 2 (see [37]).
Leta
~
=
[
a
L
,
a
U
] and b
~
=
[
b
L
,
b
U
], l
a
~
=
a
~
U
-
a
~
L and l
b
~
=
b
~
U
-
b
~
L, and then the degree of possibility of a
~
≥
b
~ is formulated by
(1)
p
(
a
~
≥
b
~
)
=
max
⁡
{
1
-
max
⁡
(
b
~
U
-
a
~
L
l
a
~
+
l
b
~
,
0
)
,
0
}
.Suppose that there aren interval numbers a
~
i
=
[
a
i
L
,
a
i
U
]
(
i
=
1,2
,
…
,
n
) and each interval number a
~
i is compared to all interval numbers a
~
j
(
j
=
1,2
,
…
,
n
) by using (1), namely,
(2)
p
i
j
=
p
(
a
~
i
≥
a
~
j
)
=
max
⁡
{
1
-
max
⁡
(
a
~
j
U
-
a
~
i
L
l
a
~
i
+
l
a
~
j
,
0
)
,
0
}
.Then a complementary matrix can be constructed as follows:(3)
P
=
[
p
11
p
12
⋯
p
1
n
p
21
p
22
⋯
p
2
n
⋮
p
n
1
p
n
2
⋯
p
n
n
]
,
where p
i
j
≥
0, p
i
j
+
p
j
i
=
1, p
i
i
=
0.5.


### 2.2.t-Norm and t-Conorm

Thet-norm and its dual t-conorm play an important role in the construction of operation rules and averaging operators of INSs. Here, some basic concepts are introduced.Definition 3 (see [38, 39]).
A functionT
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-norm if it satisfies the following conditions:(1)
∀
x
∈
[
0,1
]
,
T
(
1
,
x
)
=
x;
(2)
∀
x
,
y
∈
[
0,1
]
,
T
(
x
,
y
)
=
T
(
y
,
x
);
(3)
∀
x
,
y
,
z
∈
[
0,1
]
,
T
(
x
,
T
(
y
,
z
)
)
=
T
(
T
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then T
(
x
,
y
)
≤
T
(
x
′
,
y
′
).Definition 4 (see [38, 39]).
A functionS
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-conorm if it satisfies the following conditions:(1)
∀
x
∈
[
0,1
]
,
S
(
0
,
x
)
=
x;
(2)
∀
x
,
y
∈
[
0,1
]
,
S
(
x
,
y
)
=
S
(
y
,
x
);
(3)
∀
x
,
y
,
z
∈
[
0,1
]
,
S
(
x
,
S
(
y
,
z
)
)
=
S
(
S
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then S
(
x
,
y
)
≤
S
(
x
′
,
y
′
).Definition 5 (see [38, 39]).
At-norm function T
(
x
,
y
) is called Archimedean t-norm if it is continuous and T
(
x
,
x
)
<
x for all x
∈
(
0,1
). An Archimedean t-norm is called strictly Archimedean t-norm if it is strictly increasing in each variable for x
,
y
∈
(
0,1
). A t-conorm function S
(
x
,
y
) is called Archimedean t-conorm if it is continuous and S
(
x
,
x
)
>
x for all x
∈
(
0,1
). An Archimedean t-conorm is called strictly Archimedean t-conorm if it is strictly increasing in each variable for x
,
y
∈
(
0,1
).It is well known [39, 40] that a strict Archimedean t-norm can be expressed via its additive generator k as T
(
x
,
y
)
=
k
-
1
(
k
(
x
)
+
k
(
y
)
) and similarly applied to its dual t-conorm S
(
x
,
y
)
=
l
-
1
(
l
(
x
)
+
l
(
y
)
) with l
(
t
)
=
k
(
1
-
t
). We observe that an additive generator of a continuous Archimedean t-norm is a strictly decreasing function k
:
[
0,1
]
→
[
0
,
∞
).There are some well-known Archimedeant-conorms and t-norms [41].(1)
Letk
(
t
)
=
-
log
⁡
t, l
(
t
)
=
-
log
⁡
(
1
-
t
), k
-
1
(
t
)
=
e
-
t, and l
-
1
(
t
)
=
1
-
e
-
t. Then algebraic t-conorm and t-norm are obtained:
(4)
S
(
x
,
y
)
=
1
-
(
1
-
x
)
(
1
-
y
)
,
T
(
x
,
y
)
=
x
y
.
(2)
Letk
(
t
)
=
log
⁡
(
(
2
-
t
)
/
t
), l
(
t
)
=
log
⁡
(
(
2
-
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
2
/
(
e
t
+
1
), and l
-
1
(
t
)
=
1
-
(
2
/
(
e
t
+
1
)
). Then Einstein t-conorm and t-norm are obtained:
(5)
S
(
x
,
y
)
=
x
+
y
1
+
x
y
,
T
(
x
,
y
)
=
x
y
1
+
(
1
-
x
)
(
1
-
y
)
.
(3)
Letk
(
t
)
=
log
⁡
(
(
γ
-
(
1
-
γ
)
t
)
/
t
), l
(
t
)
=
log
⁡
(
(
γ
-
(
1
-
γ
)
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
γ
/
(
e
t
+
γ
-
1
), and l
-
1
(
t
)
=
1
-
(
γ
/
(
e
t
+
γ
-
1
)
), γ
>
0. Then Hamacher t-conorm and t-norm are obtained:
(6)
S
(
x
,
y
)
=
x
+
y
-
x
y
-
(
1
-
γ
)
x
y
1
-
(
1
-
γ
)
x
y
,
T
(
x
,
y
)
=
x
y
γ
+
(
1
-
γ
)
(
x
+
y
-
x
y
)
,
γ
>
0
.


### 2.3. Definitions and Operations of NSs and SNSs

Definition 6 (see [31]).
LetX be a space of points (objects), with a generic element in X denoted by x. A NS A in X is characterized by a truth-membership function T
A
(
x
), an indeterminacy-membership function I
A
(
x
), and a falsity-membership function F
A
(
x
).  T
A
(
x
), I
A
(
x
), and F
A
(
x
) are real standard or nonstandard subsets of ]
0
-
,
1
+
[; that is, T
A
(
x
)
:
X
→
]
0
-
,
1
+
[, I
A
(
x
)
:
X
→
]
0
-
,
1
+
[, and F
A
(
x
)
:
X
→
]
0
-
,
1
+
[. There is no restriction on the sum of T
A
(
x
), I
A
(
x
), and F
A
(
x
), so 0
-
≤
sup
⁡
T
A
(
x
)
+
sup
⁡
I
A
(
x
)
+
sup
⁡
F
A
(
x
)
≤
3
+.Definition 7 (see [31]).
A NSA is contained in the other NS B, denoted by A
⊆
B, if and only if inf
⁡
T
A
(
x
)
≤
inf
⁡
T
B
(
x
), sup
⁡
T
A
(
x
)
≤
sup
⁡
T
B
(
x
), inf
⁡
I
A
(
x
)
≤
inf
⁡
I
B
(
x
), sup
⁡
I
A
(
x
)
≤
sup
⁡
I
B
(
x
), inf
⁡
F
A
(
x
)
≤
inf
⁡
F
B
(
x
), and sup
⁡
F
A
(
x
)
≤
sup
⁡
F
B
(
x
) for x
∈
X.Since it is difficult to apply NSs to practical problems, Ye reduced NSs of nonstandard intervals into a kind of SNSs of standard intervals that will preserve the operations of NSs [30].Definition 8 (see [30]).
LetX be a space of points (objects), with a generic element in X denoted by x. A NS A in X is characterized by T
A
(
x
), I
A
(
x
), and F
A
(
x
), which are single subintervals/subsets in the real standard [
0
,
1
]; that is, T
A
(
x
)
:
X
→
[
0,1
], I
A
(
x
)
:
X
→
[
0,1
], and F
A
(
x
)
:
X
→
[
0,1
]. Then, a simplification of A is denoted by
(7)
A
=
{
〈
x
,
T
A
(
x
)
,
I
A
(
x
)
,
F
A
(
x
)
〉
∣
x
∈
X
}
,
which is called a SNS. It is a subclass of NSs.The operational relations of SNSs are also defined in [30].Definition 9 (see [30]).
LetA and B be two SNSs. For any x
∈
X,(1)
A
+
B
=
〈
T
A
(
x
)
+
T
B
(
x
)
-
T
A
(
x
)
·
T
B
(
x
)
,
I
A
(
x
)
+
I
B
(
x
)
-
I
A
(
x
)
·
I
B
(
x
),  F
A
(
x
)
+
F
B
(
x
)
-
F
A
(
x
)
·
F
B
(
x
)
〉,
(2)
A
·
B
=
〈
T
A
(
x
)
·
T
B
(
x
)
,
I
A
(
x
)
·
I
B
(
x
)
,
F
A
(
x
)
·
F
B
(
x
)
〉,
(3)
λ
·
A
=
〈
1
-
(
1
-
T
A
(
x
)
)
λ
,
1
-
(
1
-
I
A
(
x
)
)
λ
,
1
-
(
1
-
F
A
(
x
)
)
λ
〉
,
λ
>
0,
(4)
A
λ
=
〈
T
A
λ
(
x
)
,
I
A
λ
(
x
)
,
F
A
λ
(
x
)
〉
,
λ
>
0.There are some limitations in Definition9.(
1
) In some situations, the operations, such as A
+
B and A
·
B, as given in Definition 9, might be irrational. This will be shown in the example below.For example, let two simplified neutrosophic numbers (SNNs)a
=
〈
0.5,0.5,0.5
〉 and b
=
〈
1,0
,
0
〉. Obviously, b
=
〈
1,0
,
0
〉 is the maximum of SNSs. It is notable that the sum of any number and the maximum number should be equal to the maximum one. However, according to (
1
) in Definition 9, a
+
b
=
〈
1,0.5,0.5
〉
≠
b. Hence, (
1
) does not hold and so do the other equations in Definition 9. It shows that the operations above are incorrect.(
2
) In addition, the similarity measure for SNSs in [30] on the basis of the operations does not satisfy any cases.For instance, let the alternativesa
1
=
〈
0.1,0
,
0
〉, a
2
=
〈
0.9,0
,
0
〉 and the ideal alternative a
*
=
〈
1,0
,
0
〉. According to the decision making method based on the cosine similarity measure for SNSs under the simplified neutrosophic environment in [30], we can obtain that S
1
(
a
1
,
a
*
)
=
1, S
2
(
a
2
,
a
*
)
=
1; that is, the alternative a
1 is equal to the alternative a
2. However, for T
a
2
(
x
)
>
T
a
1
(
x
),   I
a
2
(
x
)
>
I
a
1
(
x
)
, and F
a
2
(
x
)
>
F
a
1
(
x
), it is clear that the alternative a
2 is superior to the alternative a
1.


### 2.4. Definitions and Operations of INSs

Definition 10 (see [31]).
LetX be a space of points (objects) with generic elements in X denoted by X. An INS A in X is characterized by a truth-membership function T
A
(
x
), an indeterminacy-membership function I
A
(
x
), and a falsity-membership function F
A
(
x
). For each point x in X, we have that T
A
(
x
)
=
[
inf
⁡
T
A
(
x
)
,
sup
⁡
T
A
(
x
)
], I
A
(
x
)
=
[
inf
⁡
I
A
(
x
)
,
sup
⁡
I
A
(
x
)
], F
A
(
x
)
=
[
inf
⁡
F
A
(
x
)
,
sup
⁡
F
A
(
x
)
]
⊆
[
0,1
], and 0
≤
sup
⁡
T
A
(
x
)
+
sup
⁡
I
A
(
x
)
+
sup
⁡
F
A
(
x
)
≤
3, x
∈
X. We only consider the subunitary interval of [
0
,
1
]. It is the subclass of a NS. Therefore, all INSs are clearly NSs.Definition 11 (see [31]).
An INSA is contained in the other INS B, A
⊆
B, if and only ifinf
⁡
T
A
(
x
)
≤
inf
⁡
T
B
(
x
), sup
⁡
T
A
(
x
)
≤
sup
⁡
T
B
(
x
), inf
⁡
I
A
(
x
)
≥
inf
⁡
I
B
(
x
), sup
⁡
I
A
(
x
)
≥
sup
⁡
I
B
(
x
),
inf
⁡
F
A
(
x
)
≥
inf
⁡
F
B
(
x
) and sup
⁡
F
A
(
x
)
≥
sup
⁡
F
B
(
x
),
for anyx
∈
X.Definition 12 (see [31]).
Two INSsA and B are equal, written as A
=
B, if and only if A
⊆
B and A
⊇
B.Definition 13 (see [31]).
The addition of two INSsA and B is an INS C, written as C
=
A
+
B, whose truth-membership, indeterminacy-membership, and falsity-membership functions are related to those of A and B byinf
⁡
T
C
=
min
⁡
(
inf
⁡
T
A
+
inf
⁡
T
B
,
1
), sup
⁡
T
C
=
min
⁡
(
sup
⁡
T
A
+
sup
⁡
T
B
,
1
),
inf
⁡
I
C
=
min
⁡
(
inf
⁡
I
A
+
inf
⁡
I
B
,
1
),   sup
⁡
I
C
=
min
⁡
(
sup
⁡
I
A
+
sup
⁡
I
B
,
1
),
inf
⁡
F
C
=
min
⁡
(
inf
⁡
F
A
+
inf
⁡
F
B
,
1
), sup
⁡
F
C
=
min
⁡
(
sup
⁡
F
A
+
sup
⁡
F
B
,
1
),
for allx in X.As to be known, whenB
=
〈
0,1
,
1
〉, it should satisfy A
+
B
=
A and A
·
B
=
B for B being the minimum value of INSs. And when B
=
〈
1,0
,
0
〉, as the largest element of INSs, it should satisfy A
+
B
=
B and A
+
B
=
A. Let B
=
〈
1,0
,
0
〉. That is inf
⁡
T
B
=
sup
⁡
T
B
=
1, inf
⁡
I
B
=
sup
⁡
I
B
=
0, and inf
⁡
F
B
=
sup
⁡
F
B
=
0. According to Definition 13, inf
⁡
T
C
=
1, sup
⁡
T
C
=
1, inf
⁡
I
C
=
inf
⁡
I
A, sup
⁡
I
C
=
sup
⁡
I
A, inf
⁡
F
C
=
inf
⁡
F
A, and sup
⁡
F
C
=
sup
⁡
F
A; that is, A
+
B
=
〈
[
1,1
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉
≠
B, so that Definition 13 does not hold.Definition 14 (see [31]).
The Cartesian product of two INSsA defined on the universe X
1 and B defined on the universe X
2 is an INS C, written as C
=
A
·
B, whose truth-membership, indeterminacy-membership, and falsity-membership functions are related to those of A and B byinf
⁡
T
C
(
x
,
y
)
=
inf
⁡
T
A
(
x
)
+
inf
⁡
T
B
(
y
)
-
inf
⁡
T
A
(
x
)
·
inf
⁡
T
B
(
y
),
sup
⁡
T
C
(
x
,
y
)
=
sup
⁡
T
A
(
x
)
+
sup
⁡
T
B
(
y
)
-
sup
⁡
T
A
(
x
)
·
sup
⁡
T
B
(
y
),
inf
⁡
I
C
(
x
,
y
)
=
inf
⁡
I
A
(
x
)
·
inf
⁡
I
B
(
y
), sup
⁡
I
C
(
x
,
y
)
=
sup
⁡
I
A
(
x
)
·
sup
⁡
I
B
(
y
),
inf
⁡
F
C
(
x
,
y
)
=
inf
⁡
F
A
(
x
)
·
inf
⁡
F
B
(
y
), sup
⁡
F
C
(
x
,
y
)
=
sup
⁡
F
A
(
x
)
·
sup
⁡
F
B
(
y
),
for allx in X
1, y in X
2.Being similar to Definition13, Definition 14 does not hold in some cases. Therefore, new operation rules for INSs should be explored.


## 2.1. Interval Numbers and Their Operations

Interval numbers and their operations are of utmost importance to explore the operations for INSs. So some definitions and operations of interval numbers are given below.Definition 1 (see [34–37]).
Leta
~
=
[
a
L
,
a
U
]
=
{
x
∣
a
L
≤
x
≤
a
U
}, and then a
~ is called an interval number. In particular, if 0
≤
a
L
≤
x
≤
a
U, then a
~ is reduced to a positive interval number.
Consider any two interval numbersa
~
=
[
a
L
,
a
U
] and b
~
=
[
b
L
,
b
U
], and then their operations are defined as follows:(1)
a
~
=
b
~
⇔
a
L
=
b
L
,
a
U
=
b
U;
(2)
a
~
+
b
~
=
[
a
L
+
b
L
,
a
U
+
b
U
];
(3)
a
~
-
b
~
=
[
a
L
-
b
U
,
a
U
-
b
L
];
(4)
a
~
×
b
~
=
[
min
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}, max
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}
];
(5)
k
a
~
=
[
k
a
L
,
k
a
U
]
,
k
>
0.Definition 2 (see [37]).
Leta
~
=
[
a
L
,
a
U
] and b
~
=
[
b
L
,
b
U
], l
a
~
=
a
~
U
-
a
~
L and l
b
~
=
b
~
U
-
b
~
L, and then the degree of possibility of a
~
≥
b
~ is formulated by
(1)
p
(
a
~
≥
b
~
)
=
max
⁡
{
1
-
max
⁡
(
b
~
U
-
a
~
L
l
a
~
+
l
b
~
,
0
)
,
0
}
.Suppose that there aren interval numbers a
~
i
=
[
a
i
L
,
a
i
U
]
(
i
=
1,2
,
…
,
n
) and each interval number a
~
i is compared to all interval numbers a
~
j
(
j
=
1,2
,
…
,
n
) by using (1), namely,
(2)
p
i
j
=
p
(
a
~
i
≥
a
~
j
)
=
max
⁡
{
1
-
max
⁡
(
a
~
j
U
-
a
~
i
L
l
a
~
i
+
l
a
~
j
,
0
)
,
0
}
.Then a complementary matrix can be constructed as follows:(3)
P
=
[
p
11
p
12
⋯
p
1
n
p
21
p
22
⋯
p
2
n
⋮
p
n
1
p
n
2
⋯
p
n
n
]
,
where p
i
j
≥
0, p
i
j
+
p
j
i
=
1, p
i
i
=
0.5.


## 2.2.t-Norm and t-Conorm

Thet-norm and its dual t-conorm play an important role in the construction of operation rules and averaging operators of INSs. Here, some basic concepts are introduced.Definition 3 (see [38, 39]).
A functionT
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-norm if it satisfies the following conditions:(1)
∀
x
∈
[
0,1
]
,
T
(
1
,
x
)
=
x;
(2)
∀
x
,
y
∈
[
0,1
]
,
T
(
x
,
y
)
=
T
(
y
,
x
);
(3)
∀
x
,
y
,
z
∈
[
0,1
]
,
T
(
x
,
T
(
y
,
z
)
)
=
T
(
T
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then T
(
x
,
y
)
≤
T
(
x
′
,
y
′
).Definition 4 (see [38, 39]).
A functionS
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-conorm if it satisfies the following conditions:(1)
∀
x
∈
[
0,1
]
,
S
(
0
,
x
)
=
x;
(2)
∀
x
,
y
∈
[
0,1
]
,
S
(
x
,
y
)
=
S
(
y
,
x
);
(3)
∀
x
,
y
,
z
∈
[
0,1
]
,
S
(
x
,
S
(
y
,
z
)
)
=
S
(
S
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then S
(
x
,
y
)
≤
S
(
x
′
,
y
′
).Definition 5 (see [38, 39]).
At-norm function T
(
x
,
y
) is called Archimedean t-norm if it is continuous and T
(
x
,
x
)
<
x for all x
∈
(
0,1
). An Archimedean t-norm is called strictly Archimedean t-norm if it is strictly increasing in each variable for x
,
y
∈
(
0,1
). A t-conorm function S
(
x
,
y
) is called Archimedean t-conorm if it is continuous and S
(
x
,
x
)
>
x for all x
∈
(
0,1
). An Archimedean t-conorm is called strictly Archimedean t-conorm if it is strictly increasing in each variable for x
,
y
∈
(
0,1
).It is well known [39, 40] that a strict Archimedean t-norm can be expressed via its additive generator k as T
(
x
,
y
)
=
k
-
1
(
k
(
x
)
+
k
(
y
)
) and similarly applied to its dual t-conorm S
(
x
,
y
)
=
l
-
1
(
l
(
x
)
+
l
(
y
)
) with l
(
t
)
=
k
(
1
-
t
). We observe that an additive generator of a continuous Archimedean t-norm is a strictly decreasing function k
:
[
0,1
]
→
[
0
,
∞
).There are some well-known Archimedeant-conorms and t-norms [41].(1)
Letk
(
t
)
=
-
log
⁡
t, l
(
t
)
=
-
log
⁡
(
1
-
t
), k
-
1
(
t
)
=
e
-
t, and l
-
1
(
t
)
=
1
-
e
-
t. Then algebraic t-conorm and t-norm are obtained:
(4)
S
(
x
,
y
)
=
1
-
(
1
-
x
)
(
1
-
y
)
,
T
(
x
,
y
)
=
x
y
.
(2)
Letk
(
t
)
=
log
⁡
(
(
2
-
t
)
/
t
), l
(
t
)
=
log
⁡
(
(
2
-
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
2
/
(
e
t
+
1
), and l
-
1
(
t
)
=
1
-
(
2
/
(
e
t
+
1
)
). Then Einstein t-conorm and t-norm are obtained:
(5)
S
(
x
,
y
)
=
x
+
y
1
+
x
y
,
T
(
x
,
y
)
=
x
y
1
+
(
1
-
x
)
(
1
-
y
)
.
(3)
Letk
(
t
)
=
log
⁡
(
(
γ
-
(
1
-
γ
)
t
)
/
t
), l
(
t
)
=
log
⁡
(
(
γ
-
(
1
-
γ
)
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
γ
/
(
e
t
+
γ
-
1
), and l
-
1
(
t
)
=
1
-
(
γ
/
(
e
t
+
γ
-
1
)
), γ
>
0. Then Hamacher t-conorm and t-norm are obtained:
(6)
S
(
x
,
y
)
=
x
+
y
-
x
y
-
(
1
-
γ
)
x
y
1
-
(
1
-
γ
)
x
y
,
T
(
x
,
y
)
=
x
y
γ
+
(
1
-
γ
)
(
x
+
y
-
x
y
)
,
γ
>
0
.


## 2.3. Definitions and Operations of NSs and SNSs

Definition 6 (see [31]).
LetX be a space of points (objects), with a generic element in X denoted by x. A NS A in X is characterized by a truth-membership function T
A
(
x
), an indeterminacy-membership function I
A
(
x
), and a falsity-membership function F
A
(
x
).  T
A
(
x
), I
A
(
x
), and F
A
(
x
) are real standard or nonstandard subsets of ]
0
-
,
1
+
[; that is, T
A
(
x
)
:
X
→
]
0
-
,
1
+
[, I
A
(
x
)
:
X
→
]
0
-
,
1
+
[, and F
A
(
x
)
:
X
→
]
0
-
,
1
+
[. There is no restriction on the sum of T
A
(
x
), I
A
(
x
), and F
A
(
x
), so 0
-
≤
sup
⁡
T
A
(
x
)
+
sup
⁡
I
A
(
x
)
+
sup
⁡
F
A
(
x
)
≤
3
+.Definition 7 (see [31]).
A NSA is contained in the other NS B, denoted by A
⊆
B, if and only if inf
⁡
T
A
(
x
)
≤
inf
⁡
T
B
(
x
), sup
⁡
T
A
(
x
)
≤
sup
⁡
T
B
(
x
), inf
⁡
I
A
(
x
)
≤
inf
⁡
I
B
(
x
), sup
⁡
I
A
(
x
)
≤
sup
⁡
I
B
(
x
), inf
⁡
F
A
(
x
)
≤
inf
⁡
F
B
(
x
), and sup
⁡
F
A
(
x
)
≤
sup
⁡
F
B
(
x
) for x
∈
X.Since it is difficult to apply NSs to practical problems, Ye reduced NSs of nonstandard intervals into a kind of SNSs of standard intervals that will preserve the operations of NSs [30].Definition 8 (see [30]).
LetX be a space of points (objects), with a generic element in X denoted by x. A NS A in X is characterized by T
A
(
x
), I
A
(
x
), and F
A
(
x
), which are single subintervals/subsets in the real standard [
0
,
1
]; that is, T
A
(
x
)
:
X
→
[
0,1
], I
A
(
x
)
:
X
→
[
0,1
], and F
A
(
x
)
:
X
→
[
0,1
]. Then, a simplification of A is denoted by
(7)
A
=
{
〈
x
,
T
A
(
x
)
,
I
A
(
x
)
,
F
A
(
x
)
〉
∣
x
∈
X
}
,
which is called a SNS. It is a subclass of NSs.The operational relations of SNSs are also defined in [30].Definition 9 (see [30]).
LetA and B be two SNSs. For any x
∈
X,(1)
A
+
B
=
〈
T
A
(
x
)
+
T
B
(
x
)
-
T
A
(
x
)
·
T
B
(
x
)
,
I
A
(
x
)
+
I
B
(
x
)
-
I
A
(
x
)
·
I
B
(
x
),  F
A
(
x
)
+
F
B
(
x
)
-
F
A
(
x
)
·
F
B
(
x
)
〉,
(2)
A
·
B
=
〈
T
A
(
x
)
·
T
B
(
x
)
,
I
A
(
x
)
·
I
B
(
x
)
,
F
A
(
x
)
·
F
B
(
x
)
〉,
(3)
λ
·
A
=
〈
1
-
(
1
-
T
A
(
x
)
)
λ
,
1
-
(
1
-
I
A
(
x
)
)
λ
,
1
-
(
1
-
F
A
(
x
)
)
λ
〉
,
λ
>
0,
(4)
A
λ
=
〈
T
A
λ
(
x
)
,
I
A
λ
(
x
)
,
F
A
λ
(
x
)
〉
,
λ
>
0.There are some limitations in Definition9.(
1
) In some situations, the operations, such as A
+
B and A
·
B, as given in Definition 9, might be irrational. This will be shown in the example below.For example, let two simplified neutrosophic numbers (SNNs)a
=
〈
0.5,0.5,0.5
〉 and b
=
〈
1,0
,
0
〉. Obviously, b
=
〈
1,0
,
0
〉 is the maximum of SNSs. It is notable that the sum of any number and the maximum number should be equal to the maximum one. However, according to (
1
) in Definition 9, a
+
b
=
〈
1,0.5,0.5
〉
≠
b. Hence, (
1
) does not hold and so do the other equations in Definition 9. It shows that the operations above are incorrect.(
2
) In addition, the similarity measure for SNSs in [30] on the basis of the operations does not satisfy any cases.For instance, let the alternativesa
1
=
〈
0.1,0
,
0
〉, a
2
=
〈
0.9,0
,
0
〉 and the ideal alternative a
*
=
〈
1,0
,
0
〉. According to the decision making method based on the cosine similarity measure for SNSs under the simplified neutrosophic environment in [30], we can obtain that S
1
(
a
1
,
a
*
)
=
1, S
2
(
a
2
,
a
*
)
=
1; that is, the alternative a
1 is equal to the alternative a
2. However, for T
a
2
(
x
)
>
T
a
1
(
x
),   I
a
2
(
x
)
>
I
a
1
(
x
)
, and F
a
2
(
x
)
>
F
a
1
(
x
), it is clear that the alternative a
2 is superior to the alternative a
1.


## 2.4. Definitions and Operations of INSs

Definition 10 (see [31]).
LetX be a space of points (objects) with generic elements in X denoted by X. An INS A in X is characterized by a truth-membership function T
A
(
x
), an indeterminacy-membership function I
A
(
x
), and a falsity-membership function F
A
(
x
). For each point x in X, we have that T
A
(
x
)
=
[
inf
⁡
T
A
(
x
)
,
sup
⁡
T
A
(
x
)
], I
A
(
x
)
=
[
inf
⁡
I
A
(
x
)
,
sup
⁡
I
A
(
x
)
], F
A
(
x
)
=
[
inf
⁡
F
A
(
x
)
,
sup
⁡
F
A
(
x
)
]
⊆
[
0,1
], and 0
≤
sup
⁡
T
A
(
x
)
+
sup
⁡
I
A
(
x
)
+
sup
⁡
F
A
(
x
)
≤
3, x
∈
X. We only consider the subunitary interval of [
0
,
1
]. It is the subclass of a NS. Therefore, all INSs are clearly NSs.Definition 11 (see [31]).
An INSA is contained in the other INS B, A
⊆
B, if and only ifinf
⁡
T
A
(
x
)
≤
inf
⁡
T
B
(
x
), sup
⁡
T
A
(
x
)
≤
sup
⁡
T
B
(
x
), inf
⁡
I
A
(
x
)
≥
inf
⁡
I
B
(
x
), sup
⁡
I
A
(
x
)
≥
sup
⁡
I
B
(
x
),
inf
⁡
F
A
(
x
)
≥
inf
⁡
F
B
(
x
) and sup
⁡
F
A
(
x
)
≥
sup
⁡
F
B
(
x
),
for anyx
∈
X.Definition 12 (see [31]).
Two INSsA and B are equal, written as A
=
B, if and only if A
⊆
B and A
⊇
B.Definition 13 (see [31]).
The addition of two INSsA and B is an INS C, written as C
=
A
+
B, whose truth-membership, indeterminacy-membership, and falsity-membership functions are related to those of A and B byinf
⁡
T
C
=
min
⁡
(
inf
⁡
T
A
+
inf
⁡
T
B
,
1
), sup
⁡
T
C
=
min
⁡
(
sup
⁡
T
A
+
sup
⁡
T
B
,
1
),
inf
⁡
I
C
=
min
⁡
(
inf
⁡
I
A
+
inf
⁡
I
B
,
1
),   sup
⁡
I
C
=
min
⁡
(
sup
⁡
I
A
+
sup
⁡
I
B
,
1
),
inf
⁡
F
C
=
min
⁡
(
inf
⁡
F
A
+
inf
⁡
F
B
,
1
), sup
⁡
F
C
=
min
⁡
(
sup
⁡
F
A
+
sup
⁡
F
B
,
1
),
for allx in X.As to be known, whenB
=
〈
0,1
,
1
〉, it should satisfy A
+
B
=
A and A
·
B
=
B for B being the minimum value of INSs. And when B
=
〈
1,0
,
0
〉, as the largest element of INSs, it should satisfy A
+
B
=
B and A
+
B
=
A. Let B
=
〈
1,0
,
0
〉. That is inf
⁡
T
B
=
sup
⁡
T
B
=
1, inf
⁡
I
B
=
sup
⁡
I
B
=
0, and inf
⁡
F
B
=
sup
⁡
F
B
=
0. According to Definition 13, inf
⁡
T
C
=
1, sup
⁡
T
C
=
1, inf
⁡
I
C
=
inf
⁡
I
A, sup
⁡
I
C
=
sup
⁡
I
A, inf
⁡
F
C
=
inf
⁡
F
A, and sup
⁡
F
C
=
sup
⁡
F
A; that is, A
+
B
=
〈
[
1,1
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉
≠
B, so that Definition 13 does not hold.Definition 14 (see [31]).
The Cartesian product of two INSsA defined on the universe X
1 and B defined on the universe X
2 is an INS C, written as C
=
A
·
B, whose truth-membership, indeterminacy-membership, and falsity-membership functions are related to those of A and B byinf
⁡
T
C
(
x
,
y
)
=
inf
⁡
T
A
(
x
)
+
inf
⁡
T
B
(
y
)
-
inf
⁡
T
A
(
x
)
·
inf
⁡
T
B
(
y
),
sup
⁡
T
C
(
x
,
y
)
=
sup
⁡
T
A
(
x
)
+
sup
⁡
T
B
(
y
)
-
sup
⁡
T
A
(
x
)
·
sup
⁡
T
B
(
y
),
inf
⁡
I
C
(
x
,
y
)
=
inf
⁡
I
A
(
x
)
·
inf
⁡
I
B
(
y
), sup
⁡
I
C
(
x
,
y
)
=
sup
⁡
I
A
(
x
)
·
sup
⁡
I
B
(
y
),
inf
⁡
F
C
(
x
,
y
)
=
inf
⁡
F
A
(
x
)
·
inf
⁡
F
B
(
y
), sup
⁡
F
C
(
x
,
y
)
=
sup
⁡
F
A
(
x
)
·
sup
⁡
F
B
(
y
),
for allx in X
1, y in X
2.Being similar to Definition13, Definition 14 does not hold in some cases. Therefore, new operation rules for INSs should be explored.


## 3. Operations and Comparison Approach for INSs

### 3.1. Operations for INSs

Xu defined some operations of interval valued intuitionistic fuzzy numbers [42]. Based on these operations and preliminaries in Section 2, the operations of two INSs can be defined as follows.Definition 15.
Let two INNsA
=
〈
[
inf
⁡
T
A
,
sup
⁡
T
A
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉, B
=
〈
[
inf
⁡
T
B
,
sup
⁡
T
B
]
,
[
inf
⁡
I
B
,
sup
⁡
I
B
]
,
[
inf
⁡
F
B
,
sup
⁡
F
B
]
〉, and λ
>
0. The operations for INNs are defined based on the Archimedean t-conorm and t-norm as below:(1)
(8)
λ
A
=
〈
[
l
-
1
(
λ
l
(
inf
⁡
T
A
)
)
,
l
-
1
(
λ
l
(
sup
⁡
T
A
)
)
]
,
=
hl
[
k
-
1
(
λ
k
(
inf
⁡
I
A
)
)
,
k
-
1
(
λ
k
(
sup
⁡
I
A
)
)
]
,
=
hl
[
k
-
1
(
λ
k
(
inf
⁡
F
A
)
)
,
k
-
1
(
λ
k
(
sup
⁡
F
A
)
)
]
〉
;
(2)
(9)
A
λ
=
〈
[

(
k
-
1
(
λ
k
(
inf
⁡
T
A
)
)
)
,
(
k
-
1
(
λ
k
(
sup
⁡
T
A
)
)
)

]
,
hllllllllll
[
l
-
1
(
λ
l
(
inf
⁡
I
A
)
)
,
l
-
1
(
λ
l
(
sup
⁡
I
A
)
)
]
,
hllllllllll
(
k
-
1
(
λ
k
(
sup
⁡
T
A
)
)
)
[
l
-
1
(
λ
l
(
inf
⁡
F
A
)
)
,
l
-
1
(
λ
l
(
sup
⁡
F
A
)
)
]
〉
;
(3)
(10)
A
+
B
=
〈
[
l
-
1
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
,
h
h
h
h
h
h
l
-
1
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
]
,
hl
[
k
-
1
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
,
hhl
k
-
1
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
]
,
hl
[
k
-
1
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
,
hhl
k
-
1
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
]
〉
;
(4)
(11)
A
·
B
=
〈
[
k
-
1
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
,
k
.
l
k
-
1
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
]
,
kl
[
l
-
1
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
,
kl
l
l
-
1
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
]
,
kl
[
l
-
1
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
,
kll
l
-
1
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
]
〉
.
LetA and B be both INNs. If we assign its generator k a specific form, specific operations for INSs will be obtained. When k
(
x
)
=
-
log
⁡
(
x
), we have(5)
(12)
λ
A
=
〈
[
1
-
(
1
-
inf
⁡
T
A
)
λ
,
1
-
(
1
-
sup
⁡
T
A
)
λ
]
,
llllllk
l
=
[
(
inf
⁡
I
A
)
λ
,
(
sup
⁡
I
A
)
λ
]
,
klllllll
=
[
(
inf
⁡
F
A
)
λ
,
(
sup
⁡
F
A
)
λ
]
〉
;
(6)
(13)
A
λ
=
〈
[
(
inf
⁡
T
A
)
λ
,
(
sup
⁡
T
A
)
λ
]
,
=
llllllk
[
1
-
(
1
-
inf
⁡
I
A
)
λ
,
1
-
(
1
-
sup
⁡
I
A
)
λ
]
,
=
llllllk
[
1
-
(
1
-
inf
⁡
F
A
)
λ
,
1
-
(
1
-
sup
⁡
F
A
)
λ
]
〉
;
(7)
(14)
A
+
B
=
〈
[
inf
⁡
T
A
+
inf
⁡
T
B
-
inf
⁡
T
A
·
inf
⁡
T
B
,
=
hhhhhhh
sup
⁡
T
A
+
sup
⁡
T
B
-
sup
⁡
T
A
·
sup
⁡
T
B
]
,
=
khhhhhl
[
inf
⁡
T
A
·
inf
⁡
I
B
,
sup
⁡
I
A
·
sup
⁡
I
B
]
,
k
=
h
h
h
h
h
[
inf
⁡
F
A
·
inf
⁡
F
B
,
sup
⁡
F
A
·
sup
⁡
F
B
]
〉
;
(8)
(15)
A
·
B
=
〈
[
inf
⁡
T
A
·
inf
⁡
T
B
,
sup
⁡
T
A
·
sup
⁡
T
B
]
,
klllllllll
=
[
inf
⁡
T
A
+
inf
⁡
I
B
-
inf
⁡
T
A
·
inf
⁡
I
B
,
=
khlllllllll
sup
⁡
I
A
+
sup
⁡
I
B
-
sup
⁡
I
A
·
sup
⁡
I
B
]
,
=
lllllllllk
[
inf
⁡
F
A
+
inf
⁡
F
B
-
inf
⁡
F
A
·
inf
⁡
F
B
,
=
k
l
l
l
l
l
l
l
h
sup
⁡
F
A
+
sup
⁡
F
B
-
sup
⁡
F
A
·
sup
⁡
F
B
]
〉
.Theorem 16.
Let three INNsA
=
〈
[
inf
⁡
T
A
,
sup
⁡
T
A
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉, B
=
〈
[
inf
⁡
T
B
,
sup
⁡
T
B
]
,
[
inf
⁡
I
B
,
sup
⁡
I
B
]
,
[
inf
⁡
F
B
,
sup
⁡
F
B
]
〉, C
=
〈
[
inf
⁡
T
C
,
sup
⁡
T
C
]
,
[
inf
⁡
I
C
,
sup
⁡
I
C
]
,
[
inf
⁡
F
C
,
sup
⁡
F
C
]
〉, and then the following equations are true:(1)
A
+
B
=
B
+
A,
(2)
A
·
B
=
B
·
A,
(3)
λ
(
A
+
B
)
=
λ
A
+
λ
B
,
λ
>
0,
(4)
(
A
·
B
)
λ
=
A
λ
+
B
λ
,
λ
>
0,
(5)
λ
1
A
+
λ
2
A
=
(
λ
1
+
λ
2
)
A
,
λ
1
>
0
,
λ
2
>
0,
(6)
A
λ
1
·
A
λ
2
=
A
(
λ
1
+
λ
2
)
,
λ
1
>
0
,
λ
2
>
0,
(7)
(
A
+
B
)
+
C
=
A
+
(
B
+
C
),
(8)
(
A
·
B
)
·
C
=
A
·
(
B
·
C
).Proof.
(
1
), (
2
), (
7
), and (
8
) are obvious; thus we prove the others:(3)
(16)
λ
(
A
+
B
)
=
λ
·
〈
[
l
-
1
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
,
λ
·
lll
λ
l
-
1
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
]
,
λ
·
lll
λ
[
k
-
1
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
,
λ
·
lll
λ
k
-
1
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
]
,
λ
·
ll
λ
[
k
-
1
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
,
λ
·
lll
λ
k
-
1
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
]
〉
=
〈
[
l
-
1
(
λ
l
(
l
-
1
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
)
)
,
λ
l
l
l
l
l
-
1
(
λ
l
(
l
-
1
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
k
(
k
-
1
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
)
)
,
l
l
λ
·
k
-
1
(
λ
k
(
k
-
1
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
k
(
k
-
1
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
)
)
,
λ
l
l
·
k
-
1
(
λ
k
(
k
-
1
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
)
)
]
〉
=
〈
[
l
-
1
(
λ
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
)
,
λ
l
l
l
l
-
1
(
λ
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
)
,
λ
l
l
·
k
-
1
(
λ
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
)
,
λ
l
l
·
k
-
1
(
λ
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
)
]
〉
=
〈
[
l
-
1

(
λ
l
(
inf
⁡
T
A
)
+
λ
l
(
inf
⁡
T
B
)
)
,

λ
l
l
l
-
1

(
λ
l
(
sup
⁡
T
A
)
+
λ
l
(
sup
⁡
T
B
)
)

]
,
λ
l
l
·
[
k
-
1

(
λ
k
(
inf
⁡
I
A
)
+
λ
k
(
inf
⁡
I
B
)
)
,

λ
l
l
·
k
-
1

(
λ
k
(
sup
⁡
I
A
)
+
λ
k
(
sup
⁡
I
B
)
)

]
,
λ
l
l
[
k
-
1

(
λ
k
(
inf
⁡
F
A
)
+
λ
k
(
inf
⁡
F
B
)
)
,

λ
l
l
·
k
-
1

(
λ
k
(
sup
⁡
F
A
)
+
λ
k
(
sup
⁡
F
B
)
)

]
〉
=
λ
A
+
λ
B
(4)
(17)
(
A
·
B
)
λ
=
(
〈
[
k
-
1
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
,
λ
l
l
h
.
k
-
1
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
]
,
λ
l
l
h
.
[
l
-
1
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
,
λ
hllh
l
-
1
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
]
,
λ
l
l
h
.
[
l
-
1
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
,
λ
hllh
l
-
1
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
]
〉
)
λ
=
〈
[
k
-
1
(
λ
k
(
k
-
1
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
)
)
,
λ
l
l
h
k
-
1
(
λ
k
(
k
-
1
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
l
(
l
-
1
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
l
-
1
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
l
(
l
-
1
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
l
-
1
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
)
)
]
〉
=
〈
[
k
-
1
(
λ
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
)
,
λ
l
l
h
k
-
1
(
λ
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
)
,
λ
l
l
h
l
-
1
(
λ
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
)
,
λ
l
l
h
l
-
1
(
λ
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
)
]
〉
=
〈
[
k
-
1
(
λ
k
(
inf
⁡
T
A
)
+
λ
k
(
inf
⁡
T
B
)
)
,
λ
l
l
h
k
-
1
(
λ
k
(
sup
⁡
T
A
)
+
λ
k
(
sup
⁡
T
B
)
)
]
,
λ
l
l
[
l
-
1
(
λ
l
(
inf
⁡
I
A
)
+
λ
l
(
inf
⁡
I
B
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
sup
⁡
I
A
)
+
λ
l
(
sup
⁡
I
B
)
)
]
,
l
l
λ
[
l
-
1
(
λ
l
(
inf
⁡
F
A
)
+
λ
l
(
inf
⁡
F
B
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
sup
⁡
F
A
)
+
λ
l
(
sup
⁡
F
B
)
)
]
〉
=
A
λ
·
B
λ
(5)
(18)
λ
1
A
+
λ
2
A
=
〈
[
l
-
1
(
λ
1
l
(
inf
⁡
T
A
)
)
,
l
-
1
(
λ
1
l
(
sup
⁡
T
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
I
A
)
)
,
k
-
1
(
λ
1
k
(
sup
⁡
I
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
F
A
)
)
,
k
-
1
(
λ
1
k
(
sup
⁡
F
A
)
)
]
〉
⊕
〈
[
l
-
1
(
λ
2
l
(
inf
⁡
T
A
)
)
,
l
-
1
(
λ
2
l
(
sup
⁡
T
A
)
)
]
,
k
k
l
l
λ
[
k
-
1
(
λ
2
k
(
inf
⁡
I
A
)
)
,
k
-
1
(
λ
2
k
(
sup
⁡
I
A
)
)
]
,
k
k
l
l
λ
[
k
-
1
(
λ
2
k
(
inf
⁡
F
A
)
)
,
k
-
1
(
λ
2
k
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
inf
⁡
T
A
)
)
)
+
l
(
l
-
1
(
λ
2
l
(
inf
⁡
T
A
)
)
)
)
,
λ
l
l
h
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
sup
⁡
T
A
)
)
)
+
l
(
l
-
1
(
λ
2
l
(
sup
⁡
T
A
)
)
)
)
]
,
l
l
λ
.
[
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
inf
⁡
I
A
)
)
)
λ
h
k
k
k
hll
+
k
(
k
-
1
(
λ
2
k
(
inf
⁡
I
A
)
)
)
)
,
λ
h
l
l
h
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
sup
⁡
I
A
)
)
)
λ
k
l
l
k
k
k
h
.
+
k
(
k
-
1
(
λ
2
k
(
sup
⁡
I
A
)
)
)
)
]
,
h
l
l
λ
[
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
inf
⁡
F
A
)
)
)
λ
h
k
k
l
l
k
k
h
+
k
(
k
-
1
(
λ
2
k
(
inf
⁡
F
A
)
)
)
)
,
λ
h
l
l
h
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
sup
⁡
F
A
)
)
)
λ
h
k
k
l
l
k
k
h
+
k
(
k
-
1
(
λ
2
k
(
sup
⁡
F
A
)
)
)
)
]
〉
=
〈
[
l
-
1
(
λ
1
l
(
inf
⁡
T
A
)
+
λ
2
l
(
inf
⁡
T
A
)
)
,
λ
l
l
l
h
l
-
1
(
λ
1
l
(
sup
⁡
T
A
)
+
λ
2
l
(
sup
⁡
T
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
I
A
)
+
λ
2
k
(
inf
⁡
I
A
)
)
,
λ
l
l
l
h
k
-
1
(
λ
1
k
(
sup
⁡
I
A
)
+
λ
2
k
(
sup
⁡
I
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
F
A
)
+
λ
2
k
(
inf
⁡
F
A
)
)
,
λ
l
l
l
h
k
-
1
(
λ
1
k
(
sup
⁡
F
A
)
+
λ
2
k
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
l
-
1
(
(
λ
1
+
λ
2
)
l
(
inf
⁡
T
A
)
)
,
λ
l
l
l
h
l
-
1
(
(
λ
1
+
λ
2
)
l
(
sup
⁡
T
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
(
λ
1
+
λ
2
)
k
(
inf
⁡
I
A
)
)
,
λ
l
l
l
h
k
-
1
(
(
λ
1
+
λ
2
)
k
(
sup
⁡
I
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
(
λ
1
+
λ
2
)
k
(
inf
⁡
F
A
)
)
,
λ
l
l
l
h
k
-
1
(
(
λ
1
+
λ
2
)
k
(
sup
⁡
F
A
)
)
]
〉
=
(
λ
1
+
λ
2
)
A
(6)
(19)
A
λ
1
·
A
λ
2
=

〈
[
k
-
1
(
λ
1
k
(
inf
⁡
T
A
)
)
,
k
-
1
(
λ
1
k
(
sup
⁡
T
A
)
)
]
,

λ
h
l
l
h
[
l
-
1
(
λ
1
l
(
inf
⁡
I
A
)
)
,
l
-
1
(
λ
1
l
(
sup
⁡
I
A
)
)
]
,
λ
h
l
l
h
[
l
-
1
(
λ
1
l
(
inf
⁡
F
A
)
)
,
l
-
1
(
λ
1
l
(
sup
⁡
F
A
)
)
]
〉

·
〈
[
k
-
1
(
λ
2
k
(
inf
⁡
T
A
)
)
,
k
-
1
(
λ
2
k
(
sup
⁡
T
A
)
)
]
,

λ
h
l
l
h
[
l
-
1
(
λ
2
l
(
inf
⁡
I
A
)
)
,
l
-
1
(
λ
2
l
(
sup
⁡
I
A
)
)
]
,
λ
h
l
l
h
[
l
-
1
(
λ
2
l
(
inf
⁡
F
A
)
)
,
l
-
1
(
λ
2
l
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
inf
⁡
T
A
)
)
)
λ
h
h
.
h
l
l
h
h
h
.
h

+
k
(
k
-
1
(
λ
2
k
(
inf
⁡
T
A
)
)
)
)
,

λ
h
h
l
l
.
h
+
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
sup
⁡
T
A
)
)
)
λ
h
h
.
l
l
h
h
h
h
h
h

+
k
(
k
-
1
(
λ
2
k
(
sup
⁡
T
A
)
)
)
)
]
,

λ
h
l
l
.
[
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
inf
⁡
I
A
)
)
)
λ
h
.
.
h
h
l
l
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
inf
⁡
I
A
)
)
)
)
,

λ
h
l
l
h
+
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
sup
⁡
I
A
)
)
)
λ
h
.
.
l
l
h
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
sup
⁡
I
A
)
)
)
)
]
,

λ
h
l
l
.
[
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
inf
⁡
F
A
)
)
)
λ
h
h
l
l
h
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
inf
⁡
F
A
)
)
)
)
,

λ
h
l
l
h
+
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
sup
⁡
F
A
)
)
)
λ
h
h
l
l
h
h
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
sup
⁡
F
A
)
)
)
)
]
〉

=
〈
[
k
-
1
(
λ
1
k
(
inf
⁡
T
A
)
+
λ
2
k
(
inf
⁡
T
A
)
)
,
λ
h
h
hll
k
-
1
(
λ
1
k
(
sup
⁡
T
A
)
+
λ
2
k
(
sup
⁡
T
A
)
)
]
,
λ
.
hlll
[
l
-
1
(
λ
1
l
(
inf
⁡
I
A
)
+
λ
2
l
(
inf
⁡
I
A
)
)
,
λ
h
.
hlll
l
-
1
(
λ
1
l
(
sup
⁡
I
A
)
+
λ
2
l
(
sup
⁡
I
A
)
)
]
,
λ
.
hlll
[
l
-
1
(
λ
1
l
(
inf
⁡
F
A
)
+
λ
2
l
(
inf
⁡
F
A
)
)
,
λ
.
h
l
l
l
h
l
-
1
(
λ
1
l
(
sup
⁡
F
A
)
+
λ
2
l
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
k
-
1
(
(
λ
1
+
λ
2
)
k
(
inf
⁡
T
A
)
)
,
λ
h
.
l
l
h
k
-
1
(
(
λ
1
+
λ
2
)
k
(
sup
⁡
T
A
)
)
]
,
λ
.
l
hll
[
l
-
1
(
(
λ
1
+
λ
2
)
l
(
inf
⁡
I
A
)
)
,
λ
h
l
.
h
l
l
l
-
1
(
(
λ
1
+
λ
2
)
l
(
sup
⁡
I
A
)
)
]
,
λ
.
hlll
[
l
-
1
(
(
λ
1
+
λ
2
)
l
(
inf
⁡
F
A
)
)
,
λ
h
.
l
l
l
h
l
-
1
(
(
λ
1
+
λ
2
)
l
(
sup
⁡
F
A
)
)
]
〉
=
A
λ
1
+
λ
2
.Example 17.
Assume thatA
=
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉, B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉, and λ
=
2. When k
(
x
)
=
-
log
⁡
(
x
), then(1)
2
·
A
=
〈
[
0.91,0.96
]
,
[
0,0.01
]
,
[
0.01,0.04
]
〉;
(2)
A
2
=
〈
[
0.49,0.64
]
,
[
0,0.19
]
,
[
0.19,0.36
]
〉;
(3)
A
+
B
=
〈
[
0.82,0.90
]
,
[
0,0.05
]
,
[
0.03,0.08
]
〉;
(4)
A
·
B
=
〈
[
0.28,0.40
]
,
[
0.20,0.37
]
,
[
0.37,0.52
]
〉.INSs are the extension of SVNSs or SNSs. Assume thatinf
⁡
T
A
(
x
)
=
sup
⁡
T
A
(
x
), inf
⁡
I
A
(
x
)
=
sup
⁡
I
A
(
x
), inf
⁡
F
A
(
x
)
=
sup
⁡
F
A
(
x
), inf
⁡
T
B
(
x
)
=
sup
⁡
T
B
(
x
), inf
⁡
I
B
(
x
)
=
sup
⁡
I
B
(
x
), and inf
⁡
F
B
(
x
)
=
sup
⁡
F
B
(
x
), and then the two INSs A
=
〈
T
A
(
x
)
,
I
A
(
x
)
,
F
A
(
x
)
〉 and B
=
〈
T
B
(
x
)
,
I
B
(
x
)
,
F
B
(
x
)
〉 are reduced to SNSs and SVNSs. According to Definition 15 and Theorem 16, the SNS or SVNS operations can be obtained.IVIFSs are an instance of NSs. Letinf
⁡
I
A
=
sup
⁡
I
A
=
0, inf
⁡
I
B
=
sup
⁡
I
B
=
0, sup
⁡
T
A
+
sup
⁡
F
A
≤
1, and sup
⁡
T
B
+
sup
⁡
F
B
≤
1. Then the two INSs A
=
〈
T
A
,
I
A
,
F
A
〉 and B
=
〈
T
B
,
I
B
,
F
B
〉 are reduced to IVIFSs. According to Definition 15, when k
(
x
)
=
-
log
⁡
(
x
), the following equations can be obtained:(1)
A
+
B
=
〈
[
inf
⁡
T
A
+
inf
⁡
T
B
-
inf
⁡
T
A
·
inf
⁡
T
B
,
sup
⁡
T
A
+
sup
⁡
T
B
-
sup
⁡
T
A
·
sup
⁡
T
B
],[
inf
⁡
F
A
·
inf
⁡
F
B
,
sup
⁡
F
A
·
sup
⁡
F
B
]
〉,
(2)
A
·
B
=
〈
[
inf
⁡
T
A
·
inf
⁡
T
B
,
sup
⁡
T
A
·
sup
⁡
T
B
], [
inf
⁡
F
A
+
inf
⁡
F
B
-
inf
⁡
F
A
·
inf
⁡
F
B
,
sup
⁡
F
A
+
sup
⁡
F
B
-
sup
⁡
F
A
·
sup
⁡
F
B
]
〉,
(3)
λ
·
A
=
〈
[
1
-
(
1
-
inf
⁡
T
A
)
λ
,
1
-
(
1
-
sup
⁡
T
A
)
λ
], [
(
inf
⁡
F
A
)
λ
,
(
sup
⁡
F
A
)
λ
]
〉,
(4)
A
λ
=
〈
[
(
inf
⁡
T
A
)
λ
,
(
sup
⁡
T
A
)
λ
]
,
[
1
-
(
1
-
inf
⁡
F
A
)
λ
,
1
-
(
1
-
sup
⁡
F
A
)
λ
]
〉,which coincides with the operations of IVIFSs in [42]. It indicates that the same principles of INSs in Definition 15 also adapt to IVIFSs. In fact, when the indeterminacy factor i is replaced by π
=
1
-
T
-
F, the NS is an IFS.


### 3.2. Comparison Rules

Based on the score function and accuracy function of IVIFSs, the score function, accuracy function, and certainty function of an INNA are defined.Definition 18.
Let the INNA
=
〈
[
inf
⁡
T
A
,
sup
⁡
T
A
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉, and then(1)
s
(
A
)
=
[
inf
⁡
T
A
+
1
-
sup
⁡
I
A
+
1
-
sup
⁡
F
A
,
sup
⁡
T
A
+
1
-
inf
⁡
I
A
+
1
-
inf
⁡
F
A
],
(2)
a
(
A
)
=
[
min
⁡
{
inf
⁡
T
A
-
inf
⁡
F
A
,
sup
⁡
T
A
-
sup
⁡
F
A
}
,
max
⁡
{
inf
⁡
T
A
-
inf
⁡
F
A
,
sup
⁡
T
A
-
sup
⁡
F
A
}
],
(3)
c
(
A
)
=
[
inf
⁡
T
A
,
sup
⁡
T
A
],where s
(
A
), a
(
A
), and c
(
A
) represent the score function, accuracy function, and certainty function of the INN A, respectively.The score function is an important index in ranking INNs. For an INNA, the bigger the truth-membership T
A is, the greater the INS is. And the less the indeterminacy-membership I
A is, the greater the INS is. Similarly, the smaller the false-membership F
A is, the greater the INS is. At the same time, inf
⁡
T
A
(
x
)
,
sup
⁡
T
A
(
x
)
,
inf
⁡
I
A
(
x
)
,
sup
⁡
I
A
(
x
)
,
inf
⁡
F
A
(
x
), sup
⁡
F
A
(
x
)
⊆
[
0,1
], so the score functions(A) is defined as shown above. For the accuracy function, if the difference between truth and falsity is bigger, then the statement is surer. That is, the larger the values of T, I, andF are, the more the accuracy of the INS is. So the accuracy function is given above. As to the certainty function, the value of truth-membership T
A is bigger, and it means more certainty of the INS.Example 19.
Assume thatA
=
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉, and B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉, and then(1)
s
(
A
)
=
[
2.4,2.7
], s
(
B
)
=
[
1.7,2.0
],
(2)
a
(
A
)
=
[
0.6,0.6
], a
(
B
)
=
[
0.1,0.1
],
(3)
c
(
A
)
=
[
0.7,0.8
], c
(
B
)
=
[
0.4,0.5
].On the basis of Definition 18, the method to compare INNs can be defined as follows.Definition 20.
LetA and B be two INNs. The comparison approach can be defined as follows.(1)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
>
0.5, then A is greater than B; that is, A is superior to B, denoted by A
≻
B.
(2)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
=
0.5 and p
(
a
(
A
)
≥
a
(
B
)
)
>
0.5, then A is greater than B; that is, A is superior to B, denoted by A
≻
B.
(3)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
0.5, and p
(
c
(
A
)
≥
c
(
B
)
)
>
0.5, then A is greater than B; that is, A is superior to B, denoted by A
≻
B.
(4)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
0.5, and p
(
c
(
A
)
≥
c
(
B
)
)
=
0.5, then A is equal to B; that is, A is indifferent to B, denoted by A
~
B.Example 21.
LetA and B be two INNs.
(
1
) Assume that A
=
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉 and B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉. Referring to Definition 18, s
(
A
)
=
[
2.4,2.7
], s
(
B
)
=
[
1.7,2.0
], a
(
A
)
=
[
0.6,0.6
], a
(
B
)
=
[
0.1,0.1
], c
(
A
)
=
[
0.7,0.8
], and c
(
B
)
=
[
0.4,0.5
]. According to Definition 20, p
(
s
(
A
)
≥
s
(
B
)
)
=
1
>
0.5. Therefore, A
≻
B.
(
2
) Assuming that A
=
〈
[
0.6,0.7
]
,
[
0.3,0.4
]
,
[
0.4,0.5
]
〉 and B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉, referring to Definition 18, s
(
A
)
=
[
1.7,2.0
], s
(
B
)
=
[
1.7,2.0
], a
(
A
)
=
[
0.2,0.2
], a
(
B
)
=
[
0.1,0.1
], c
(
A
)
=
[
0.6,0.7
], and c
(
B
)
=
[
0.4,0.5
]. According to Definition 20, p
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
1
>
0.5. Therefore, A
≻
B.
(
3
) For two INNs A
=
〈
[
0.6,0.7
]
,
[
0.3,0.4
]
,
[
0.4,0.5
]
〉 and B
=
〈
[
0.4,0.5
]
,
[
0.3,0.4
]
,
[
0.2,0.3
]
〉, referring to Definition 18, s
(
A
)
=
[
1.7,2.0
], s
(
B
)
=
[
1.7,2.0
], a
(
A
)
=
[
0.2,0.2
], a
(
B
)
=
[
0.2,0.2
], c
(
A
)
=
[
0.6,0.7
], and c
(
B
)
=
[
0.4,0.5
]. According to Definition 20, p
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
0.5, and p
(
c
(
A
)
≥
c
(
B
)
)
=
1
>
0.5. Therefore, A
≻
B.


## 3.1. Operations for INSs

Xu defined some operations of interval valued intuitionistic fuzzy numbers [42]. Based on these operations and preliminaries in Section 2, the operations of two INSs can be defined as follows.Definition 15.
Let two INNsA
=
〈
[
inf
⁡
T
A
,
sup
⁡
T
A
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉, B
=
〈
[
inf
⁡
T
B
,
sup
⁡
T
B
]
,
[
inf
⁡
I
B
,
sup
⁡
I
B
]
,
[
inf
⁡
F
B
,
sup
⁡
F
B
]
〉, and λ
>
0. The operations for INNs are defined based on the Archimedean t-conorm and t-norm as below:(1)
(8)
λ
A
=
〈
[
l
-
1
(
λ
l
(
inf
⁡
T
A
)
)
,
l
-
1
(
λ
l
(
sup
⁡
T
A
)
)
]
,
=
hl
[
k
-
1
(
λ
k
(
inf
⁡
I
A
)
)
,
k
-
1
(
λ
k
(
sup
⁡
I
A
)
)
]
,
=
hl
[
k
-
1
(
λ
k
(
inf
⁡
F
A
)
)
,
k
-
1
(
λ
k
(
sup
⁡
F
A
)
)
]
〉
;
(2)
(9)
A
λ
=
〈
[

(
k
-
1
(
λ
k
(
inf
⁡
T
A
)
)
)
,
(
k
-
1
(
λ
k
(
sup
⁡
T
A
)
)
)

]
,
hllllllllll
[
l
-
1
(
λ
l
(
inf
⁡
I
A
)
)
,
l
-
1
(
λ
l
(
sup
⁡
I
A
)
)
]
,
hllllllllll
(
k
-
1
(
λ
k
(
sup
⁡
T
A
)
)
)
[
l
-
1
(
λ
l
(
inf
⁡
F
A
)
)
,
l
-
1
(
λ
l
(
sup
⁡
F
A
)
)
]
〉
;
(3)
(10)
A
+
B
=
〈
[
l
-
1
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
,
h
h
h
h
h
h
l
-
1
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
]
,
hl
[
k
-
1
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
,
hhl
k
-
1
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
]
,
hl
[
k
-
1
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
,
hhl
k
-
1
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
]
〉
;
(4)
(11)
A
·
B
=
〈
[
k
-
1
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
,
k
.
l
k
-
1
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
]
,
kl
[
l
-
1
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
,
kl
l
l
-
1
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
]
,
kl
[
l
-
1
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
,
kll
l
-
1
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
]
〉
.
LetA and B be both INNs. If we assign its generator k a specific form, specific operations for INSs will be obtained. When k
(
x
)
=
-
log
⁡
(
x
), we have(5)
(12)
λ
A
=
〈
[
1
-
(
1
-
inf
⁡
T
A
)
λ
,
1
-
(
1
-
sup
⁡
T
A
)
λ
]
,
llllllk
l
=
[
(
inf
⁡
I
A
)
λ
,
(
sup
⁡
I
A
)
λ
]
,
klllllll
=
[
(
inf
⁡
F
A
)
λ
,
(
sup
⁡
F
A
)
λ
]
〉
;
(6)
(13)
A
λ
=
〈
[
(
inf
⁡
T
A
)
λ
,
(
sup
⁡
T
A
)
λ
]
,
=
llllllk
[
1
-
(
1
-
inf
⁡
I
A
)
λ
,
1
-
(
1
-
sup
⁡
I
A
)
λ
]
,
=
llllllk
[
1
-
(
1
-
inf
⁡
F
A
)
λ
,
1
-
(
1
-
sup
⁡
F
A
)
λ
]
〉
;
(7)
(14)
A
+
B
=
〈
[
inf
⁡
T
A
+
inf
⁡
T
B
-
inf
⁡
T
A
·
inf
⁡
T
B
,
=
hhhhhhh
sup
⁡
T
A
+
sup
⁡
T
B
-
sup
⁡
T
A
·
sup
⁡
T
B
]
,
=
khhhhhl
[
inf
⁡
T
A
·
inf
⁡
I
B
,
sup
⁡
I
A
·
sup
⁡
I
B
]
,
k
=
h
h
h
h
h
[
inf
⁡
F
A
·
inf
⁡
F
B
,
sup
⁡
F
A
·
sup
⁡
F
B
]
〉
;
(8)
(15)
A
·
B
=
〈
[
inf
⁡
T
A
·
inf
⁡
T
B
,
sup
⁡
T
A
·
sup
⁡
T
B
]
,
klllllllll
=
[
inf
⁡
T
A
+
inf
⁡
I
B
-
inf
⁡
T
A
·
inf
⁡
I
B
,
=
khlllllllll
sup
⁡
I
A
+
sup
⁡
I
B
-
sup
⁡
I
A
·
sup
⁡
I
B
]
,
=
lllllllllk
[
inf
⁡
F
A
+
inf
⁡
F
B
-
inf
⁡
F
A
·
inf
⁡
F
B
,
=
k
l
l
l
l
l
l
l
h
sup
⁡
F
A
+
sup
⁡
F
B
-
sup
⁡
F
A
·
sup
⁡
F
B
]
〉
.Theorem 16.
Let three INNsA
=
〈
[
inf
⁡
T
A
,
sup
⁡
T
A
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉, B
=
〈
[
inf
⁡
T
B
,
sup
⁡
T
B
]
,
[
inf
⁡
I
B
,
sup
⁡
I
B
]
,
[
inf
⁡
F
B
,
sup
⁡
F
B
]
〉, C
=
〈
[
inf
⁡
T
C
,
sup
⁡
T
C
]
,
[
inf
⁡
I
C
,
sup
⁡
I
C
]
,
[
inf
⁡
F
C
,
sup
⁡
F
C
]
〉, and then the following equations are true:(1)
A
+
B
=
B
+
A,
(2)
A
·
B
=
B
·
A,
(3)
λ
(
A
+
B
)
=
λ
A
+
λ
B
,
λ
>
0,
(4)
(
A
·
B
)
λ
=
A
λ
+
B
λ
,
λ
>
0,
(5)
λ
1
A
+
λ
2
A
=
(
λ
1
+
λ
2
)
A
,
λ
1
>
0
,
λ
2
>
0,
(6)
A
λ
1
·
A
λ
2
=
A
(
λ
1
+
λ
2
)
,
λ
1
>
0
,
λ
2
>
0,
(7)
(
A
+
B
)
+
C
=
A
+
(
B
+
C
),
(8)
(
A
·
B
)
·
C
=
A
·
(
B
·
C
).Proof.
(
1
), (
2
), (
7
), and (
8
) are obvious; thus we prove the others:(3)
(16)
λ
(
A
+
B
)
=
λ
·
〈
[
l
-
1
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
,
λ
·
lll
λ
l
-
1
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
]
,
λ
·
lll
λ
[
k
-
1
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
,
λ
·
lll
λ
k
-
1
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
]
,
λ
·
ll
λ
[
k
-
1
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
,
λ
·
lll
λ
k
-
1
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
]
〉
=
〈
[
l
-
1
(
λ
l
(
l
-
1
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
)
)
,
λ
l
l
l
l
l
-
1
(
λ
l
(
l
-
1
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
k
(
k
-
1
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
)
)
,
l
l
λ
·
k
-
1
(
λ
k
(
k
-
1
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
k
(
k
-
1
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
)
)
,
λ
l
l
·
k
-
1
(
λ
k
(
k
-
1
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
)
)
]
〉
=
〈
[
l
-
1
(
λ
(
l
(
inf
⁡
T
A
)
+
l
(
inf
⁡
T
B
)
)
)
,
λ
l
l
l
l
-
1
(
λ
(
l
(
sup
⁡
T
A
)
+
l
(
sup
⁡
T
B
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
(
k
(
inf
⁡
I
A
)
+
k
(
inf
⁡
I
B
)
)
)
,
λ
l
l
·
k
-
1
(
λ
(
k
(
sup
⁡
I
A
)
+
k
(
sup
⁡
I
B
)
)
)
]
,
λ
l
l
[
k
-
1
(
λ
(
k
(
inf
⁡
F
A
)
+
k
(
inf
⁡
F
B
)
)
)
,
λ
l
l
·
k
-
1
(
λ
(
k
(
sup
⁡
F
A
)
+
k
(
sup
⁡
F
B
)
)
)
]
〉
=
〈
[
l
-
1

(
λ
l
(
inf
⁡
T
A
)
+
λ
l
(
inf
⁡
T
B
)
)
,

λ
l
l
l
-
1

(
λ
l
(
sup
⁡
T
A
)
+
λ
l
(
sup
⁡
T
B
)
)

]
,
λ
l
l
·
[
k
-
1

(
λ
k
(
inf
⁡
I
A
)
+
λ
k
(
inf
⁡
I
B
)
)
,

λ
l
l
·
k
-
1

(
λ
k
(
sup
⁡
I
A
)
+
λ
k
(
sup
⁡
I
B
)
)

]
,
λ
l
l
[
k
-
1

(
λ
k
(
inf
⁡
F
A
)
+
λ
k
(
inf
⁡
F
B
)
)
,

λ
l
l
·
k
-
1

(
λ
k
(
sup
⁡
F
A
)
+
λ
k
(
sup
⁡
F
B
)
)

]
〉
=
λ
A
+
λ
B
(4)
(17)
(
A
·
B
)
λ
=
(
〈
[
k
-
1
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
,
λ
l
l
h
.
k
-
1
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
]
,
λ
l
l
h
.
[
l
-
1
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
,
λ
hllh
l
-
1
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
]
,
λ
l
l
h
.
[
l
-
1
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
,
λ
hllh
l
-
1
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
]
〉
)
λ
=
〈
[
k
-
1
(
λ
k
(
k
-
1
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
)
)
,
λ
l
l
h
k
-
1
(
λ
k
(
k
-
1
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
l
(
l
-
1
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
l
-
1
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
l
(
l
-
1
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
l
-
1
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
)
)
]
〉
=
〈
[
k
-
1
(
λ
(
k
(
inf
⁡
T
A
)
+
k
(
inf
⁡
T
B
)
)
)
,
λ
l
l
h
k
-
1
(
λ
(
k
(
sup
⁡
T
A
)
+
k
(
sup
⁡
T
B
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
(
l
(
inf
⁡
I
A
)
+
l
(
inf
⁡
I
B
)
)
)
,
λ
l
l
h
l
-
1
(
λ
(
l
(
sup
⁡
I
A
)
+
l
(
sup
⁡
I
B
)
)
)
]
,
λ
l
l
[
l
-
1
(
λ
(
l
(
inf
⁡
F
A
)
+
l
(
inf
⁡
F
B
)
)
)
,
λ
l
l
h
l
-
1
(
λ
(
l
(
sup
⁡
F
A
)
+
l
(
sup
⁡
F
B
)
)
)
]
〉
=
〈
[
k
-
1
(
λ
k
(
inf
⁡
T
A
)
+
λ
k
(
inf
⁡
T
B
)
)
,
λ
l
l
h
k
-
1
(
λ
k
(
sup
⁡
T
A
)
+
λ
k
(
sup
⁡
T
B
)
)
]
,
λ
l
l
[
l
-
1
(
λ
l
(
inf
⁡
I
A
)
+
λ
l
(
inf
⁡
I
B
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
sup
⁡
I
A
)
+
λ
l
(
sup
⁡
I
B
)
)
]
,
l
l
λ
[
l
-
1
(
λ
l
(
inf
⁡
F
A
)
+
λ
l
(
inf
⁡
F
B
)
)
,
λ
l
l
h
l
-
1
(
λ
l
(
sup
⁡
F
A
)
+
λ
l
(
sup
⁡
F
B
)
)
]
〉
=
A
λ
·
B
λ
(5)
(18)
λ
1
A
+
λ
2
A
=
〈
[
l
-
1
(
λ
1
l
(
inf
⁡
T
A
)
)
,
l
-
1
(
λ
1
l
(
sup
⁡
T
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
I
A
)
)
,
k
-
1
(
λ
1
k
(
sup
⁡
I
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
F
A
)
)
,
k
-
1
(
λ
1
k
(
sup
⁡
F
A
)
)
]
〉
⊕
〈
[
l
-
1
(
λ
2
l
(
inf
⁡
T
A
)
)
,
l
-
1
(
λ
2
l
(
sup
⁡
T
A
)
)
]
,
k
k
l
l
λ
[
k
-
1
(
λ
2
k
(
inf
⁡
I
A
)
)
,
k
-
1
(
λ
2
k
(
sup
⁡
I
A
)
)
]
,
k
k
l
l
λ
[
k
-
1
(
λ
2
k
(
inf
⁡
F
A
)
)
,
k
-
1
(
λ
2
k
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
inf
⁡
T
A
)
)
)
+
l
(
l
-
1
(
λ
2
l
(
inf
⁡
T
A
)
)
)
)
,
λ
l
l
h
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
sup
⁡
T
A
)
)
)
+
l
(
l
-
1
(
λ
2
l
(
sup
⁡
T
A
)
)
)
)
]
,
l
l
λ
.
[
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
inf
⁡
I
A
)
)
)
λ
h
k
k
k
hll
+
k
(
k
-
1
(
λ
2
k
(
inf
⁡
I
A
)
)
)
)
,
λ
h
l
l
h
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
sup
⁡
I
A
)
)
)
λ
k
l
l
k
k
k
h
.
+
k
(
k
-
1
(
λ
2
k
(
sup
⁡
I
A
)
)
)
)
]
,
h
l
l
λ
[
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
inf
⁡
F
A
)
)
)
λ
h
k
k
l
l
k
k
h
+
k
(
k
-
1
(
λ
2
k
(
inf
⁡
F
A
)
)
)
)
,
λ
h
l
l
h
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
sup
⁡
F
A
)
)
)
λ
h
k
k
l
l
k
k
h
+
k
(
k
-
1
(
λ
2
k
(
sup
⁡
F
A
)
)
)
)
]
〉
=
〈
[
l
-
1
(
λ
1
l
(
inf
⁡
T
A
)
+
λ
2
l
(
inf
⁡
T
A
)
)
,
λ
l
l
l
h
l
-
1
(
λ
1
l
(
sup
⁡
T
A
)
+
λ
2
l
(
sup
⁡
T
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
I
A
)
+
λ
2
k
(
inf
⁡
I
A
)
)
,
λ
l
l
l
h
k
-
1
(
λ
1
k
(
sup
⁡
I
A
)
+
λ
2
k
(
sup
⁡
I
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
λ
1
k
(
inf
⁡
F
A
)
+
λ
2
k
(
inf
⁡
F
A
)
)
,
λ
l
l
l
h
k
-
1
(
λ
1
k
(
sup
⁡
F
A
)
+
λ
2
k
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
l
-
1
(
(
λ
1
+
λ
2
)
l
(
inf
⁡
T
A
)
)
,
λ
l
l
l
h
l
-
1
(
(
λ
1
+
λ
2
)
l
(
sup
⁡
T
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
(
λ
1
+
λ
2
)
k
(
inf
⁡
I
A
)
)
,
λ
l
l
l
h
k
-
1
(
(
λ
1
+
λ
2
)
k
(
sup
⁡
I
A
)
)
]
,
λ
l
l
l
[
k
-
1
(
(
λ
1
+
λ
2
)
k
(
inf
⁡
F
A
)
)
,
λ
l
l
l
h
k
-
1
(
(
λ
1
+
λ
2
)
k
(
sup
⁡
F
A
)
)
]
〉
=
(
λ
1
+
λ
2
)
A
(6)
(19)
A
λ
1
·
A
λ
2
=

〈
[
k
-
1
(
λ
1
k
(
inf
⁡
T
A
)
)
,
k
-
1
(
λ
1
k
(
sup
⁡
T
A
)
)
]
,

λ
h
l
l
h
[
l
-
1
(
λ
1
l
(
inf
⁡
I
A
)
)
,
l
-
1
(
λ
1
l
(
sup
⁡
I
A
)
)
]
,
λ
h
l
l
h
[
l
-
1
(
λ
1
l
(
inf
⁡
F
A
)
)
,
l
-
1
(
λ
1
l
(
sup
⁡
F
A
)
)
]
〉

·
〈
[
k
-
1
(
λ
2
k
(
inf
⁡
T
A
)
)
,
k
-
1
(
λ
2
k
(
sup
⁡
T
A
)
)
]
,

λ
h
l
l
h
[
l
-
1
(
λ
2
l
(
inf
⁡
I
A
)
)
,
l
-
1
(
λ
2
l
(
sup
⁡
I
A
)
)
]
,
λ
h
l
l
h
[
l
-
1
(
λ
2
l
(
inf
⁡
F
A
)
)
,
l
-
1
(
λ
2
l
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
inf
⁡
T
A
)
)
)
λ
h
h
.
h
l
l
h
h
h
.
h

+
k
(
k
-
1
(
λ
2
k
(
inf
⁡
T
A
)
)
)
)
,

λ
h
h
l
l
.
h
+
k
-
1
(
k
(
k
-
1
(
λ
1
k
(
sup
⁡
T
A
)
)
)
λ
h
h
.
l
l
h
h
h
h
h
h

+
k
(
k
-
1
(
λ
2
k
(
sup
⁡
T
A
)
)
)
)
]
,

λ
h
l
l
.
[
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
inf
⁡
I
A
)
)
)
λ
h
.
.
h
h
l
l
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
inf
⁡
I
A
)
)
)
)
,

λ
h
l
l
h
+
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
sup
⁡
I
A
)
)
)
λ
h
.
.
l
l
h
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
sup
⁡
I
A
)
)
)
)
]
,

λ
h
l
l
.
[
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
inf
⁡
F
A
)
)
)
λ
h
h
l
l
h
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
inf
⁡
F
A
)
)
)
)
,

λ
h
l
l
h
+
l
-
1
(
l
(
l
-
1
(
λ
1
l
(
sup
⁡
F
A
)
)
)
λ
h
h
l
l
h
h
h
h
h
h

+
l
(
l
-
1
(
λ
2
l
(
sup
⁡
F
A
)
)
)
)
]
〉

=
〈
[
k
-
1
(
λ
1
k
(
inf
⁡
T
A
)
+
λ
2
k
(
inf
⁡
T
A
)
)
,
λ
h
h
hll
k
-
1
(
λ
1
k
(
sup
⁡
T
A
)
+
λ
2
k
(
sup
⁡
T
A
)
)
]
,
λ
.
hlll
[
l
-
1
(
λ
1
l
(
inf
⁡
I
A
)
+
λ
2
l
(
inf
⁡
I
A
)
)
,
λ
h
.
hlll
l
-
1
(
λ
1
l
(
sup
⁡
I
A
)
+
λ
2
l
(
sup
⁡
I
A
)
)
]
,
λ
.
hlll
[
l
-
1
(
λ
1
l
(
inf
⁡
F
A
)
+
λ
2
l
(
inf
⁡
F
A
)
)
,
λ
.
h
l
l
l
h
l
-
1
(
λ
1
l
(
sup
⁡
F
A
)
+
λ
2
l
(
sup
⁡
F
A
)
)
]
〉
=
〈
[
k
-
1
(
(
λ
1
+
λ
2
)
k
(
inf
⁡
T
A
)
)
,
λ
h
.
l
l
h
k
-
1
(
(
λ
1
+
λ
2
)
k
(
sup
⁡
T
A
)
)
]
,
λ
.
l
hll
[
l
-
1
(
(
λ
1
+
λ
2
)
l
(
inf
⁡
I
A
)
)
,
λ
h
l
.
h
l
l
l
-
1
(
(
λ
1
+
λ
2
)
l
(
sup
⁡
I
A
)
)
]
,
λ
.
hlll
[
l
-
1
(
(
λ
1
+
λ
2
)
l
(
inf
⁡
F
A
)
)
,
λ
h
.
l
l
l
h
l
-
1
(
(
λ
1
+
λ
2
)
l
(
sup
⁡
F
A
)
)
]
〉
=
A
λ
1
+
λ
2
.Example 17.
Assume thatA
=
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉, B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉, and λ
=
2. When k
(
x
)
=
-
log
⁡
(
x
), then(1)
2
·
A
=
〈
[
0.91,0.96
]
,
[
0,0.01
]
,
[
0.01,0.04
]
〉;
(2)
A
2
=
〈
[
0.49,0.64
]
,
[
0,0.19
]
,
[
0.19,0.36
]
〉;
(3)
A
+
B
=
〈
[
0.82,0.90
]
,
[
0,0.05
]
,
[
0.03,0.08
]
〉;
(4)
A
·
B
=
〈
[
0.28,0.40
]
,
[
0.20,0.37
]
,
[
0.37,0.52
]
〉.INSs are the extension of SVNSs or SNSs. Assume thatinf
⁡
T
A
(
x
)
=
sup
⁡
T
A
(
x
), inf
⁡
I
A
(
x
)
=
sup
⁡
I
A
(
x
), inf
⁡
F
A
(
x
)
=
sup
⁡
F
A
(
x
), inf
⁡
T
B
(
x
)
=
sup
⁡
T
B
(
x
), inf
⁡
I
B
(
x
)
=
sup
⁡
I
B
(
x
), and inf
⁡
F
B
(
x
)
=
sup
⁡
F
B
(
x
), and then the two INSs A
=
〈
T
A
(
x
)
,
I
A
(
x
)
,
F
A
(
x
)
〉 and B
=
〈
T
B
(
x
)
,
I
B
(
x
)
,
F
B
(
x
)
〉 are reduced to SNSs and SVNSs. According to Definition 15 and Theorem 16, the SNS or SVNS operations can be obtained.IVIFSs are an instance of NSs. Letinf
⁡
I
A
=
sup
⁡
I
A
=
0, inf
⁡
I
B
=
sup
⁡
I
B
=
0, sup
⁡
T
A
+
sup
⁡
F
A
≤
1, and sup
⁡
T
B
+
sup
⁡
F
B
≤
1. Then the two INSs A
=
〈
T
A
,
I
A
,
F
A
〉 and B
=
〈
T
B
,
I
B
,
F
B
〉 are reduced to IVIFSs. According to Definition 15, when k
(
x
)
=
-
log
⁡
(
x
), the following equations can be obtained:(1)
A
+
B
=
〈
[
inf
⁡
T
A
+
inf
⁡
T
B
-
inf
⁡
T
A
·
inf
⁡
T
B
,
sup
⁡
T
A
+
sup
⁡
T
B
-
sup
⁡
T
A
·
sup
⁡
T
B
],[
inf
⁡
F
A
·
inf
⁡
F
B
,
sup
⁡
F
A
·
sup
⁡
F
B
]
〉,
(2)
A
·
B
=
〈
[
inf
⁡
T
A
·
inf
⁡
T
B
,
sup
⁡
T
A
·
sup
⁡
T
B
], [
inf
⁡
F
A
+
inf
⁡
F
B
-
inf
⁡
F
A
·
inf
⁡
F
B
,
sup
⁡
F
A
+
sup
⁡
F
B
-
sup
⁡
F
A
·
sup
⁡
F
B
]
〉,
(3)
λ
·
A
=
〈
[
1
-
(
1
-
inf
⁡
T
A
)
λ
,
1
-
(
1
-
sup
⁡
T
A
)
λ
], [
(
inf
⁡
F
A
)
λ
,
(
sup
⁡
F
A
)
λ
]
〉,
(4)
A
λ
=
〈
[
(
inf
⁡
T
A
)
λ
,
(
sup
⁡
T
A
)
λ
]
,
[
1
-
(
1
-
inf
⁡
F
A
)
λ
,
1
-
(
1
-
sup
⁡
F
A
)
λ
]
〉,which coincides with the operations of IVIFSs in [42]. It indicates that the same principles of INSs in Definition 15 also adapt to IVIFSs. In fact, when the indeterminacy factor i is replaced by π
=
1
-
T
-
F, the NS is an IFS.


## 3.2. Comparison Rules

Based on the score function and accuracy function of IVIFSs, the score function, accuracy function, and certainty function of an INNA are defined.Definition 18.
Let the INNA
=
〈
[
inf
⁡
T
A
,
sup
⁡
T
A
]
,
[
inf
⁡
I
A
,
sup
⁡
I
A
]
,
[
inf
⁡
F
A
,
sup
⁡
F
A
]
〉, and then(1)
s
(
A
)
=
[
inf
⁡
T
A
+
1
-
sup
⁡
I
A
+
1
-
sup
⁡
F
A
,
sup
⁡
T
A
+
1
-
inf
⁡
I
A
+
1
-
inf
⁡
F
A
],
(2)
a
(
A
)
=
[
min
⁡
{
inf
⁡
T
A
-
inf
⁡
F
A
,
sup
⁡
T
A
-
sup
⁡
F
A
}
,
max
⁡
{
inf
⁡
T
A
-
inf
⁡
F
A
,
sup
⁡
T
A
-
sup
⁡
F
A
}
],
(3)
c
(
A
)
=
[
inf
⁡
T
A
,
sup
⁡
T
A
],where s
(
A
), a
(
A
), and c
(
A
) represent the score function, accuracy function, and certainty function of the INN A, respectively.The score function is an important index in ranking INNs. For an INNA, the bigger the truth-membership T
A is, the greater the INS is. And the less the indeterminacy-membership I
A is, the greater the INS is. Similarly, the smaller the false-membership F
A is, the greater the INS is. At the same time, inf
⁡
T
A
(
x
)
,
sup
⁡
T
A
(
x
)
,
inf
⁡
I
A
(
x
)
,
sup
⁡
I
A
(
x
)
,
inf
⁡
F
A
(
x
), sup
⁡
F
A
(
x
)
⊆
[
0,1
], so the score functions(A) is defined as shown above. For the accuracy function, if the difference between truth and falsity is bigger, then the statement is surer. That is, the larger the values of T, I, andF are, the more the accuracy of the INS is. So the accuracy function is given above. As to the certainty function, the value of truth-membership T
A is bigger, and it means more certainty of the INS.Example 19.
Assume thatA
=
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉, and B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉, and then(1)
s
(
A
)
=
[
2.4,2.7
], s
(
B
)
=
[
1.7,2.0
],
(2)
a
(
A
)
=
[
0.6,0.6
], a
(
B
)
=
[
0.1,0.1
],
(3)
c
(
A
)
=
[
0.7,0.8
], c
(
B
)
=
[
0.4,0.5
].On the basis of Definition 18, the method to compare INNs can be defined as follows.Definition 20.
LetA and B be two INNs. The comparison approach can be defined as follows.(1)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
>
0.5, then A is greater than B; that is, A is superior to B, denoted by A
≻
B.
(2)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
=
0.5 and p
(
a
(
A
)
≥
a
(
B
)
)
>
0.5, then A is greater than B; that is, A is superior to B, denoted by A
≻
B.
(3)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
0.5, and p
(
c
(
A
)
≥
c
(
B
)
)
>
0.5, then A is greater than B; that is, A is superior to B, denoted by A
≻
B.
(4)
Ifp
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
0.5, and p
(
c
(
A
)
≥
c
(
B
)
)
=
0.5, then A is equal to B; that is, A is indifferent to B, denoted by A
~
B.Example 21.
LetA and B be two INNs.
(
1
) Assume that A
=
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉 and B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉. Referring to Definition 18, s
(
A
)
=
[
2.4,2.7
], s
(
B
)
=
[
1.7,2.0
], a
(
A
)
=
[
0.6,0.6
], a
(
B
)
=
[
0.1,0.1
], c
(
A
)
=
[
0.7,0.8
], and c
(
B
)
=
[
0.4,0.5
]. According to Definition 20, p
(
s
(
A
)
≥
s
(
B
)
)
=
1
>
0.5. Therefore, A
≻
B.
(
2
) Assuming that A
=
〈
[
0.6,0.7
]
,
[
0.3,0.4
]
,
[
0.4,0.5
]
〉 and B
=
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉, referring to Definition 18, s
(
A
)
=
[
1.7,2.0
], s
(
B
)
=
[
1.7,2.0
], a
(
A
)
=
[
0.2,0.2
], a
(
B
)
=
[
0.1,0.1
], c
(
A
)
=
[
0.6,0.7
], and c
(
B
)
=
[
0.4,0.5
]. According to Definition 20, p
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
1
>
0.5. Therefore, A
≻
B.
(
3
) For two INNs A
=
〈
[
0.6,0.7
]
,
[
0.3,0.4
]
,
[
0.4,0.5
]
〉 and B
=
〈
[
0.4,0.5
]
,
[
0.3,0.4
]
,
[
0.2,0.3
]
〉, referring to Definition 18, s
(
A
)
=
[
1.7,2.0
], s
(
B
)
=
[
1.7,2.0
], a
(
A
)
=
[
0.2,0.2
], a
(
B
)
=
[
0.2,0.2
], c
(
A
)
=
[
0.6,0.7
], and c
(
B
)
=
[
0.4,0.5
]. According to Definition 20, p
(
s
(
A
)
≥
s
(
B
)
)
=
0.5, p
(
a
(
A
)
≥
a
(
B
)
)
=
0.5, and p
(
c
(
A
)
≥
c
(
B
)
)
=
1
>
0.5. Therefore, A
≻
B.


## 4. INN Aggregation Operators and Their Applications to Multicriteria Decision Making Problems

In this section, applying the INS operations, we present aggregation operators for INNs and propose a method for multicriteria decision making by means of the aggregation operators.


### 4.1. INN Aggregation Operators

Definition 22.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉 (j
=
1,2
,
…
,
n) be a collection of INNs, and let INNWA
:
IN
N
n
→
INN,
(20)
INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
w
1
A
1
+
w
2
A
2
+
⋯
+
w
n
A
n
=
∑
j
=
1
n
w
j
A
j
;
then INNWA is called the interval neutrosophic number weighted averaging operator of dimension n, where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 23.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉  (j
=
1,2
,
…
,
n) be a collection of INNs, and W
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1; then their aggregated result using the INNWA operator is also an INN, and
(21)
I
N
N
W
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
+
w
2
l
(
inf
⁡
T
A
2
)
⋯
hhhhlh
+
w
n
l
(
inf
⁡
T
A
n
)
)
,
hl
.
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
+
w
2
l
(
sup
⁡
T
A
2
)
⋯
hlhhh
.
+
w
n
l
(
sup
⁡
T
A
n
)
)
]
,
.
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
+
w
2
k
(
inf
⁡
I
A
2
)
⋯
hhlllllhhh
+
w
n
k
(
inf
⁡
I
A
n
)
)
,
hlllll
.
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
+
w
2
k
(
sup
⁡
I
A
2
)
⋯
hhlllllhhh
+
w
n
k
(
sup
⁡
I
A
n
)
)
]
,
.
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
+
w
2
k
(
inf
⁡
F
A
2
)
⋯
hhlllllhhh
+
w
n
k
(
inf
⁡
F
A
n
)
)
,
h
.
lllll
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
+
w
2
k
(
sup
⁡
F
A
2
)
⋯
hhlllhllhh
+
w
n
k
(
sup
⁡
F
A
n
)
)
]
〉
,
where k is the additive generator of Archimedean t-norm that is used in the operations of INSs and l
(
x
)
=
k
(
1
-
x
).
Letk
(
x
)
=
-
log
⁡
(
x
). Then l
(
x
)
=
-
log
⁡
(
1
-
x
), k
-
1
(
x
)
=
e
-
x, and l
-
1
(
x
)
=
1
-
e
-
x. And the aggregated result using the INNWA operator in Theorem 23 can be represented by
(22)
I
N
N
W
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
1
-
∏
i
=
1
n
(
1
-
inf
⁡
T
A
i
)
w
i
,
1
-
∏
i
=
1
n
(
1
-
sup
⁡
T
A
i
)
w
i
]
,
h
h
h
h
l
h
[
∏
i
=
1
n
inf
⁡
I
A
i
w
i
,
∏
i
=
1
n
sup
⁡
I
A
i
w
i
]
,
h
h
h
h
l
h
[
∏
i
=
1
n
inf
⁡
F
A
i
w
i
,
∏
i
=
1
n
sup
⁡
F
A
i
w
i
]
〉
,
where W
=
(
w
1
,
w
2
,
.
.
.
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
∈
[
0,1
] and ∑
j
=
1
n
w
j
=
1.Proof.
By using the mathematical induction onn we have the following.
(
1
) For n
=
2, since
(23)
w
1
A
1
+
w
2
A
2
=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
)
,
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
)
]
,
h
h
h
h
h
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
)
,
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
)
]
,
h
h
h
h
h
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
)
,
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
)
]
〉
⊕
〈
[
l
-
1
(
w
2
l
(
inf
⁡
T
A
2
)
)
,
l
-
1
(
w
2
l
(
sup
⁡
T
A
2
)
)
]
,
jjjjlljj
[
k
-
1
(
w
2
k
(
inf
⁡
I
A
2
)
)
,
k
-
1
(
w
2
k
(
sup
⁡
I
A
2
)
)
]
,
jjlljjjj
[
k
-
1
(
w
2
k
(
inf
⁡
F
A
2
)
)
,
k
-
1
(
w
2
k
(
sup
⁡
F
A
2
)
)
]
〉
=
〈
[
l
-
1
(
l
(
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
)
)
jjhhhkhj

+
l
(
l
-
1
(
w
2
l
(
inf
⁡
T
A
2
)
)
)
)
,

jhhjj
l
-
1
(
l
(
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
)
)
jhhhhhhj

+
l
(
l
-
1
(
w
2
l
(
sup
⁡
T
A
2
)
)
)
)
]
,

lllll
[
k
-
1
(
k
(
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
)
)
jhhlllhllhjj

+
k
(
k
-
1
(
w
2
k
(
inf
⁡
I
A
2
)
)
)
)
,

jhlllllhjj
k
-
1
(
k
(
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
)
)
jhhlllhhllhhhjj

+
k
(
k
-
1
(
w
2
k
(
sup
⁡
I
A
2
)
)
)
)
]
,

lllll
[
k
-
1
(
k
(
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
)
)
jhjlllhhllhj

+
k
(
k
-
1
(
w
2
k
(
inf
⁡
F
A
2
)
)
)
)
,

jjlllllhj
k
-
1
(
k
(
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
)
)
hlllhhhllhhh

+
k
(
k
-
1
(
w
2
k
(
sup
⁡
F
A
2
)
)
)
)
]
〉

=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
+
w
2
l
(
inf
⁡
T
A
2
)
)
,
llh
.
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
+
w
2
l
(
sup
⁡
T
A
2
)
)
]
,
hlll
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
+
w
2
k
(
inf
⁡
I
A
2
)
)
,
.
llllh
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
+
w
2
k
(
sup
⁡
I
A
2
)
)
]
,
hllll
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
+
w
2
k
(
inf
⁡
F
A
2
)
)
,
.
hllll
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
+
w
2
k
(
sup
⁡
F
A
2
)
)
]
〉
,
then
(24)
SNNW
A
w
(
A
1
,
A
2
)
=
w
1
A
1
+
w
2
A
2
=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
+
w
2
l
(
inf
⁡
T
A
2
)
)
,
llh
.
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
+
w
2
l
(
sup
⁡
T
A
2
)
)
]
,
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
+
w
2
k
(
inf
⁡
I
A
2
)
)
,
hlllll
.
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
+
w
2
k
(
sup
⁡
I
A
2
)
)
]
,
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
+
w
2
k
(
inf
⁡
F
A
2
)
)
,
hlllll
.
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
+
w
2
k
(
sup
⁡
F
A
2
)
)
]
〉
.
(
2
) If (21) holds for n
=
k; that is,
(25)
SNNW
A
w
(
A
1
,
A
2
,
…
,
A
k
)
=
〈
[
l
-
1
(
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
)
,
hllh
.
l
l
-
1
(
∑
j
=
1
k
w
j
l
(
sup
⁡
T
A
j
)
)
]
,
hlllll
[
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
I
A
j
)
)
,
hhllll
.
l
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
I
A
j
)
)
]
,
hlllll
[
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
F
A
j
)
)
,
hhllll
.
l
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
F
A
j
)
)
]
〉
,
then, if n
=
k
+
1, we have
(26)
SNNW
A
w
(
A
1
,
A
2
,
…
,
A
k
,
A
k
+
1
)
=
〈
[
l
-
1

(
l
(
l
-
1
(
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
)

hhhhhhhhhh

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
l
(
l
-
1
(
w
k
+
1
l
(
inf
⁡
T
A
k
+
1
)
)
)
)
)
,

hhhhh

l
-
1
(
l
(
l
-
1
(
∑
j
=
1
k
w
j
l
(
sup
⁡
T
A
j
)
)

hhhhhhhlh

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
l
(
l
-
1
(
w
k
+
1
l
(
sup
⁡
T
A
k
+
1
)
)
)
)
)

]
,
hhh
[
k
-
1

(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
I
A
j
)
)

hhhhhhhhhhhh

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
inf
⁡
I
A
k
+
1
)
)
)
)
)
,

hhhhhh

k
-
1
(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
I
A
j
)
)

hhhhhhhhhl

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
sup
⁡
I
A
k
+
1
)
)
)
)
)

]
,
hhh
[
k
-
1
(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
F
A
j
)
)
)
hhhhhhhhh
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
inf
⁡
F
A
k
+
1
)
)
)
)
,
hhhhhhh
k
-
1
(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
F
A
j
)
)
)
hhhhhhhhhhh
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
sup
⁡
F
A
k
+
1
)
)
)
)
]
〉
=
〈
[
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
inf
⁡
T
A
j
)
)
,
hh
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
sup
⁡
T
A
j
)
)
]
,
hlll
[
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
inf
⁡
I
A
j
)
)
,
hh
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
sup
⁡
I
A
j
)
)
]
,
hlh
[
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
inf
⁡
F
A
j
)
)
,
hlh
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
sup
⁡
F
A
j
)
)
]
〉
;that is, (29) holds for n
=
k
+
1. Thus, (29) holds for all n. Then, we have
(27)
SNNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
inf
⁡
T
A
j
)
)
,
h
h
l
h
h
h
h
h
l
-
1
(
∑
j
=
1
n
w
j
l
(
sup
⁡
T
A
j
)
)
]
,
h
l
l
l
l
h
h
h
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
inf
⁡
I
A
j
)
)
,
h
h
l
l
l
l
h
h
h
h
k
-
1
(
∑
j
=
1
n
w
j
k
(
sup
⁡
I
A
j
)
)
]
,
h
h
h
l
l
l
l
h
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
inf
⁡
F
A
j
)
)
,
h
h
h
l
l
h
h
l
l
h
k
-
1
(
∑
j
=
1
n
w
j
k
(
sup
⁡
F
A
j
)
)
]
〉
,
which completes the proof.It is obvious that the INNWG operator has the following properties.(1)
Idempotency: letA
j
(
j
=
1,2
,
…
,
n
) be a collection of INNs. If all A
j
(
j
=
1,2
,
…
,
n
) are equal, that is, A
j
=
A, for all j
∈
{
1,2
,
…
,
n
}, then INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
A.
(2)
Boundedness: assume thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs and A
-
=
〈
min
⁡
j
⁡
T
A
j
(
x
)
,
max
⁡
j
I
A
j
(
x
)
,
max
⁡
j
F
A
j
(
x
)
〉, A
+
=
〈
max
⁡
j
T
A
j
(
x
)
,
min
⁡
j
I
A
j
(
x
)
,
min
⁡
j
F
A
j
(
x
)
〉, for all j
∈
{
1,2
,
…
,
n
}, and then A
-
⊆
INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
A
+.
(3)
Monotonity: assuming thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs, if A
j
⊆
A
j
*, for j
∈
{
1,2
,
…
,
n
}, then INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
INNW
A
w
(
A
1
*
,
A
2
*
,
…
,
A
n
*
).Definition 24.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉 (j
=
1,2
,
…
,
n) be a collection of INNs, and let INNWG
:
IN
N
n
→
INN,
(28)
INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
∏
j
=
1
n
A
j
w
i
;
then INNWG is called an interval neutrosophic number weighted geometric operator of dimension n, where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 25.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉
(
j
=
1,2
,
…
,
n
) be a collection of INNs, and one has the following result by using Definition 15:
(29)
I
N
N
W
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
k
-
1
(
w
1
k
(
inf
⁡
T
A
1
)
+
w
2
k
(
inf
⁡
T
A
2
)
⋯
h
h
h
h
h
h
h
h
h
.
h
+
w
n
k
(
inf
⁡
T
A
n
)
)
,
h
h
h
h
h
h
k
-
1
(
w
1
k
(
sup
⁡
T
A
1
)
+
w
2
k
(
sup
⁡
T
A
2
)
⋯
h
h
h
h
h
h
h
h
h
.
h
+
w
n
k
(
sup
⁡
T
A
n
)
)
]
,
h
h
h
h
h
[
l
-
1
(
w
1
l
(
inf
⁡
I
A
1
)
+
w
2
l
(
inf
⁡
I
A
2
)
⋯
h
h
h
h
h
h
l
h
h
.
h
+
w
n
l
(
inf
⁡
I
A
n
)
)
,
h
h
h
h
h
.
h
l
-
1
(
w
1
l
(
sup
⁡
I
A
1
)
+
w
2
l
(
sup
⁡
I
A
2
)
⋯
h
h
h
.
h
h
h
h
h
h
h
+
w
n
l
(
sup
⁡
I
A
n
)
)
]
,
h
h
h
h
h
[
l
-
1
(
w
1
l
(
inf
⁡
F
A
1
)
+
w
2
l
(
inf
⁡
F
A
2
)
⋯
h
h
h
h
h
h
h
h
h
h
+
w
n
l
(
inf
⁡
F
A
n
)
)
,
h
h
h
h
h
.
h
l
-
1
(
w
1
l
(
sup
⁡
F
A
1
)
+
w
2
l
(
sup
⁡
F
A
2
)
⋯
h
h
h
.
h
h
h
h
h
h
h
+
w
n
l
(
sup
⁡
F
A
n
)
)
]
〉
.
Assume that k
(
x
)
=
-
log
⁡
(
x
), and then l
(
x
)
=
-
log
⁡
(
1
-
x
), k
-
1
(
x
)
=
e
-
x, l
-
1
(
x
)
=
1
-
e
-
x. The aggregated result using the INNWG operator in Theorem 25 can be represented by
(30)
I
N
N
W
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
∏
i
=
1
n
inf
⁡
T
A
i
w
i
,
∏
i
=
1
n
sup
⁡
T
A
i
w
i
]
,
hlh
[
1
-
∏
i
=
1
n
(
1
-
inf
⁡
I
A
i
)
w
i
,
1
-
∏
i
=
1
n
(
1
-
sup
⁡
I
A
i
)
w
i
]
,
hlh
[
1
-
∏
i
=
1
n
(
1
-
inf
⁡
F
A
i
)
w
i
,
1
-
∏
i
=
1
n
(
1
-
sup
⁡
F
A
i
)
w
i
]
〉
,
where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
∈
[
0,1
] and ∑
j
=
1
n
w
j
=
1.Letk
(
x
)
=
log
⁡
(
(
2
-
x
)
/
x
), and then l
(
x
)
=
log
⁡
(
(
1
+
x
)
/
(
1
-
x
)
), k
-
1
(
x
)
=
2
/
(
e
x
+
1
), and l
-
1
(
x
)
=
1
-
(
2
/
(
e
x
+
1
)
). The aggregated result using the INNWG operator in Theorem 25 can be denoted by
(31)
INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
2
∏
i
=
1
n
inf
⁡
T
A
i
w
i
∏
i
=
1
n
(
2
-
inf
⁡
T
A
i
)
w
i
+
∏
i
=
1
n
inf
⁡
T
A
i
w
i
,
h
h
l
h
.
l
2
∏
i
=
1
n
sup
⁡
T
A
i
w
i
∏
i
=
1
n
(
2
-
sup
⁡
T
A
i
)
w
i
+
∏
i
=
1
n
sup
⁡
T
A
i
w
i
]
,
h
l
l
h
[
∏
i
=
1
n
(
1
+
inf
⁡
I
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
inf
⁡
I
A
i
)
w
i
∏
i
=
1
n
(
1
+
inf
⁡
I
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
inf
⁡
I
A
i
)
w
i
,
h
l
l
h
h
.
l
∏
i
=
1
n
(
1
+
sup
⁡
I
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
sup
⁡
I
A
i
)
w
i
∏
i
=
1
n
(
1
+
sup
⁡
I
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
sup
⁡
I
A
i
)
w
i
]
,
h
l
l
h
[
∏
i
=
1
n
(
1
+
inf
⁡
F
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
inf
⁡
F
A
i
)
w
i
∏
i
=
1
n
(
1
+
inf
⁡
F
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
inf
⁡
F
A
i
)
w
i
,
h
h
l
l
h
.
l
∏
i
=
1
n
(
1
+
sup
⁡
F
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
sup
⁡
F
A
i
)
w
i
∏
i
=
1
n
(
1
+
sup
⁡
F
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
sup
⁡
F
A
i
)
w
i
]
〉
,
where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
∈
[
0,1
] and ∑
j
=
1
n
w
j
=
1.Theorem25 also can be proved by the mathematical induction.Similarly, it can be proved that the INNWG operator has the same properties as the INNWA operator.(1)
Idempotency: letA
j
(
j
=
1,2
,
…
,
n
) be a collection of INNs. If all A
j
(
j
=
1,2
,
…
,
n
) are equal, that is, A
j
=
A, for all j
∈
{
1,2
,
…
,
n
}, then INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
A.
(2)
Boundedness: assume thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs and A
-
=
〈
min
⁡
j
T
A
j
(
x
)
,
max
⁡
j
I
A
j
(
x
)
,
max
⁡
j
F
A
j
(
x
)
〉, A
+
=
〈
max
⁡
j
T
A
j
(
x
)
,
min
⁡
j
I
A
j
(
x
)
,
min
⁡
j
F
A
j
(
x
)
〉, for all j
∈
{
1,2
,
…
,
n
}, and then A
-
⊆
INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
A
+.
(3)
Monotonity: assuming thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs, if A
j
⊆
A
j
*, for j
∈
{
1,2
,
…
,
n
}, then INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
INNW
G
w
(
A
1
*
,
A
2
*
,
…
,
A
n
*
).


### 4.2. Multicriteria Decision Making Method Based on the INN Aggregation Operators

Assume that there arem alternatives A
=
{
a
1
,
a
2
,
…,a
m
} and n criteria C
=
{
c
1
,
c
2
,
…,c
n
}, whose criterion weight vector is W
=
(
w
1
,
w
2
,
…
,
w
n
), where w
j
≥
0 (j
=
1,2
,
…
,
n) and ∑
j
=
1
n
w
j
=
1. Let R
=
(
a
i
j
)
m
×
n be the interval neutrosophic decision matrix, where a
i
j
=
〈
T
a
i
j
,
I
a
i
j
,
F
a
i
j
〉 is a criterion value, denoted by an INN, where T
a
i
j indicates the truth-membership function where the alternative a
i satisfies the criterion c
j, I
a
i
j indicates the indeterminacy-membership function where the alternative a
i satisfies the criterion c
j, and F
a
i
j indicates the falsity-membership function where the alternative a
i satisfies the criterion c
j.In the following, a procedure to rank and select the most desirable alternative(s) is given.Step 1.
Utilize the INNWA operator or the INNWG operator to obtain the INNy
i for the alternatives a
i (i
=
1,2
,
…
,
m), that is,
(32)
y
i
=
INNWA
w
(
a
i
1
,
a
i
2
,
…
,
a
i
n
)
or(33)
y
i
=
INNWG
w
(
a
i
1
,
a
i
2
,
…
,
a
i
n
)
.Step 2.
Calculate the score function values
(
y
i
), the accuracy function value a
(
y
i
), and the certainty function value c
(
y
i
) of y
i (i
=
1,2
,
…
,
m) by Definition 18, denoted by the function matrix F:
(34)
F
=
[
s
(
y
1
)
a
(
y
1
)
c
(
y
1
)
s
(
y
2
)
a
(
y
2
)
c
(
y
2
)
⋯
⋯
⋯
s
(
y
m
)
a
(
y
m
)
c
(
y
m
)
]
.Step 3.
Construct the possibility matrixP
s of the score function value s
(
y
i
) as follows, according to Definition 2:
(35)
P
s
=
[
p
s
11
p
s
12
⋯
p
s
1
m
p
s
21
p
s
22
⋯
p
s
2
m
⋮
p
s
m
1
p
s
m
2
⋯
p
s
m
m
]
,
where p
s
i
j denotes the degree of possibility of s
(
y
i
)
>
s
(
y
j
), and it satisfies p
s
i
j
≥
0, p
s
i
j
+
p
s
j
i
=
1, and p
s
i
i
=
0.5. If p
s
i
j
=
0.5
(
i
≠
j
), then calculate the degree of possibility of a
(
y
i
)
>
a
(
y
j
), denoted by p
a
i
j. And if p
a
i
j
=
0.5
(
i
≠
j
), then calculate the degree of possibility of c
(
y
i
)
>
c
(
y
j
), denoted by p
c
i
j.Step 4.
Get the priority of the alternativesa
i (i
=
1,2
,
…
,
m) in accordance with p
s
i
j, p
a
i
j, and p
c
i
j, and choose the best one, referring to Definition 20.


## 4.1. INN Aggregation Operators

Definition 22.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉 (j
=
1,2
,
…
,
n) be a collection of INNs, and let INNWA
:
IN
N
n
→
INN,
(20)
INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
w
1
A
1
+
w
2
A
2
+
⋯
+
w
n
A
n
=
∑
j
=
1
n
w
j
A
j
;
then INNWA is called the interval neutrosophic number weighted averaging operator of dimension n, where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 23.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉  (j
=
1,2
,
…
,
n) be a collection of INNs, and W
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1; then their aggregated result using the INNWA operator is also an INN, and
(21)
I
N
N
W
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
+
w
2
l
(
inf
⁡
T
A
2
)
⋯
hhhhlh
+
w
n
l
(
inf
⁡
T
A
n
)
)
,
hl
.
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
+
w
2
l
(
sup
⁡
T
A
2
)
⋯
hlhhh
.
+
w
n
l
(
sup
⁡
T
A
n
)
)
]
,
.
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
+
w
2
k
(
inf
⁡
I
A
2
)
⋯
hhlllllhhh
+
w
n
k
(
inf
⁡
I
A
n
)
)
,
hlllll
.
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
+
w
2
k
(
sup
⁡
I
A
2
)
⋯
hhlllllhhh
+
w
n
k
(
sup
⁡
I
A
n
)
)
]
,
.
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
+
w
2
k
(
inf
⁡
F
A
2
)
⋯
hhlllllhhh
+
w
n
k
(
inf
⁡
F
A
n
)
)
,
h
.
lllll
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
+
w
2
k
(
sup
⁡
F
A
2
)
⋯
hhlllhllhh
+
w
n
k
(
sup
⁡
F
A
n
)
)
]
〉
,
where k is the additive generator of Archimedean t-norm that is used in the operations of INSs and l
(
x
)
=
k
(
1
-
x
).
Letk
(
x
)
=
-
log
⁡
(
x
). Then l
(
x
)
=
-
log
⁡
(
1
-
x
), k
-
1
(
x
)
=
e
-
x, and l
-
1
(
x
)
=
1
-
e
-
x. And the aggregated result using the INNWA operator in Theorem 23 can be represented by
(22)
I
N
N
W
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
1
-
∏
i
=
1
n
(
1
-
inf
⁡
T
A
i
)
w
i
,
1
-
∏
i
=
1
n
(
1
-
sup
⁡
T
A
i
)
w
i
]
,
h
h
h
h
l
h
[
∏
i
=
1
n
inf
⁡
I
A
i
w
i
,
∏
i
=
1
n
sup
⁡
I
A
i
w
i
]
,
h
h
h
h
l
h
[
∏
i
=
1
n
inf
⁡
F
A
i
w
i
,
∏
i
=
1
n
sup
⁡
F
A
i
w
i
]
〉
,
where W
=
(
w
1
,
w
2
,
.
.
.
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
∈
[
0,1
] and ∑
j
=
1
n
w
j
=
1.Proof.
By using the mathematical induction onn we have the following.
(
1
) For n
=
2, since
(23)
w
1
A
1
+
w
2
A
2
=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
)
,
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
)
]
,
h
h
h
h
h
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
)
,
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
)
]
,
h
h
h
h
h
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
)
,
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
)
]
〉
⊕
〈
[
l
-
1
(
w
2
l
(
inf
⁡
T
A
2
)
)
,
l
-
1
(
w
2
l
(
sup
⁡
T
A
2
)
)
]
,
jjjjlljj
[
k
-
1
(
w
2
k
(
inf
⁡
I
A
2
)
)
,
k
-
1
(
w
2
k
(
sup
⁡
I
A
2
)
)
]
,
jjlljjjj
[
k
-
1
(
w
2
k
(
inf
⁡
F
A
2
)
)
,
k
-
1
(
w
2
k
(
sup
⁡
F
A
2
)
)
]
〉
=
〈
[
l
-
1
(
l
(
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
)
)
jjhhhkhj

+
l
(
l
-
1
(
w
2
l
(
inf
⁡
T
A
2
)
)
)
)
,

jhhjj
l
-
1
(
l
(
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
)
)
jhhhhhhj

+
l
(
l
-
1
(
w
2
l
(
sup
⁡
T
A
2
)
)
)
)
]
,

lllll
[
k
-
1
(
k
(
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
)
)
jhhlllhllhjj

+
k
(
k
-
1
(
w
2
k
(
inf
⁡
I
A
2
)
)
)
)
,

jhlllllhjj
k
-
1
(
k
(
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
)
)
jhhlllhhllhhhjj

+
k
(
k
-
1
(
w
2
k
(
sup
⁡
I
A
2
)
)
)
)
]
,

lllll
[
k
-
1
(
k
(
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
)
)
jhjlllhhllhj

+
k
(
k
-
1
(
w
2
k
(
inf
⁡
F
A
2
)
)
)
)
,

jjlllllhj
k
-
1
(
k
(
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
)
)
hlllhhhllhhh

+
k
(
k
-
1
(
w
2
k
(
sup
⁡
F
A
2
)
)
)
)
]
〉

=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
+
w
2
l
(
inf
⁡
T
A
2
)
)
,
llh
.
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
+
w
2
l
(
sup
⁡
T
A
2
)
)
]
,
hlll
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
+
w
2
k
(
inf
⁡
I
A
2
)
)
,
.
llllh
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
+
w
2
k
(
sup
⁡
I
A
2
)
)
]
,
hllll
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
+
w
2
k
(
inf
⁡
F
A
2
)
)
,
.
hllll
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
+
w
2
k
(
sup
⁡
F
A
2
)
)
]
〉
,
then
(24)
SNNW
A
w
(
A
1
,
A
2
)
=
w
1
A
1
+
w
2
A
2
=
〈
[
l
-
1
(
w
1
l
(
inf
⁡
T
A
1
)
+
w
2
l
(
inf
⁡
T
A
2
)
)
,
llh
.
l
-
1
(
w
1
l
(
sup
⁡
T
A
1
)
+
w
2
l
(
sup
⁡
T
A
2
)
)
]
,
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
I
A
1
)
+
w
2
k
(
inf
⁡
I
A
2
)
)
,
hlllll
.
k
-
1
(
w
1
k
(
sup
⁡
I
A
1
)
+
w
2
k
(
sup
⁡
I
A
2
)
)
]
,
lllll
[
k
-
1
(
w
1
k
(
inf
⁡
F
A
1
)
+
w
2
k
(
inf
⁡
F
A
2
)
)
,
hlllll
.
k
-
1
(
w
1
k
(
sup
⁡
F
A
1
)
+
w
2
k
(
sup
⁡
F
A
2
)
)
]
〉
.
(
2
) If (21) holds for n
=
k; that is,
(25)
SNNW
A
w
(
A
1
,
A
2
,
…
,
A
k
)
=
〈
[
l
-
1
(
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
)
,
hllh
.
l
l
-
1
(
∑
j
=
1
k
w
j
l
(
sup
⁡
T
A
j
)
)
]
,
hlllll
[
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
I
A
j
)
)
,
hhllll
.
l
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
I
A
j
)
)
]
,
hlllll
[
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
F
A
j
)
)
,
hhllll
.
l
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
F
A
j
)
)
]
〉
,
then, if n
=
k
+
1, we have
(26)
SNNW
A
w
(
A
1
,
A
2
,
…
,
A
k
,
A
k
+
1
)
=
〈
[
l
-
1

(
l
(
l
-
1
(
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
)

hhhhhhhhhh

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
l
(
l
-
1
(
w
k
+
1
l
(
inf
⁡
T
A
k
+
1
)
)
)
)
)
,

hhhhh

l
-
1
(
l
(
l
-
1
(
∑
j
=
1
k
w
j
l
(
sup
⁡
T
A
j
)
)

hhhhhhhlh

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
l
(
l
-
1
(
w
k
+
1
l
(
sup
⁡
T
A
k
+
1
)
)
)
)
)

]
,
hhh
[
k
-
1

(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
I
A
j
)
)

hhhhhhhhhhhh

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
inf
⁡
I
A
k
+
1
)
)
)
)
)
,

hhhhhh

k
-
1
(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
I
A
j
)
)

hhhhhhhhhl

∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
sup
⁡
I
A
k
+
1
)
)
)
)
)

]
,
hhh
[
k
-
1
(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
inf
⁡
F
A
j
)
)
)
hhhhhhhhh
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
inf
⁡
F
A
k
+
1
)
)
)
)
,
hhhhhhh
k
-
1
(
k
(
k
-
1
(
∑
j
=
1
k
w
j
k
(
sup
⁡
F
A
j
)
)
)
hhhhhhhhhhh
∑
j
=
1
k
w
j
l
(
inf
⁡
T
A
j
)
+
k
(
k
-
1
(
w
k
+
1
k
(
sup
⁡
F
A
k
+
1
)
)
)
)
]
〉
=
〈
[
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
inf
⁡
T
A
j
)
)
,
hh
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
sup
⁡
T
A
j
)
)
]
,
hlll
[
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
inf
⁡
I
A
j
)
)
,
hh
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
sup
⁡
I
A
j
)
)
]
,
hlh
[
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
inf
⁡
F
A
j
)
)
,
hlh
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
sup
⁡
F
A
j
)
)
]
〉
;that is, (29) holds for n
=
k
+
1. Thus, (29) holds for all n. Then, we have
(27)
SNNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
inf
⁡
T
A
j
)
)
,
h
h
l
h
h
h
h
h
l
-
1
(
∑
j
=
1
n
w
j
l
(
sup
⁡
T
A
j
)
)
]
,
h
l
l
l
l
h
h
h
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
inf
⁡
I
A
j
)
)
,
h
h
l
l
l
l
h
h
h
h
k
-
1
(
∑
j
=
1
n
w
j
k
(
sup
⁡
I
A
j
)
)
]
,
h
h
h
l
l
l
l
h
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
inf
⁡
F
A
j
)
)
,
h
h
h
l
l
h
h
l
l
h
k
-
1
(
∑
j
=
1
n
w
j
k
(
sup
⁡
F
A
j
)
)
]
〉
,
which completes the proof.It is obvious that the INNWG operator has the following properties.(1)
Idempotency: letA
j
(
j
=
1,2
,
…
,
n
) be a collection of INNs. If all A
j
(
j
=
1,2
,
…
,
n
) are equal, that is, A
j
=
A, for all j
∈
{
1,2
,
…
,
n
}, then INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
=
A.
(2)
Boundedness: assume thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs and A
-
=
〈
min
⁡
j
⁡
T
A
j
(
x
)
,
max
⁡
j
I
A
j
(
x
)
,
max
⁡
j
F
A
j
(
x
)
〉, A
+
=
〈
max
⁡
j
T
A
j
(
x
)
,
min
⁡
j
I
A
j
(
x
)
,
min
⁡
j
F
A
j
(
x
)
〉, for all j
∈
{
1,2
,
…
,
n
}, and then A
-
⊆
INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
A
+.
(3)
Monotonity: assuming thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs, if A
j
⊆
A
j
*, for j
∈
{
1,2
,
…
,
n
}, then INNW
A
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
INNW
A
w
(
A
1
*
,
A
2
*
,
…
,
A
n
*
).Definition 24.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉 (j
=
1,2
,
…
,
n) be a collection of INNs, and let INNWG
:
IN
N
n
→
INN,
(28)
INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
∏
j
=
1
n
A
j
w
i
;
then INNWG is called an interval neutrosophic number weighted geometric operator of dimension n, where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 25.
LetA
j
=
〈
T
A
j
,
I
A
j
,
F
A
j
〉
(
j
=
1,2
,
…
,
n
) be a collection of INNs, and one has the following result by using Definition 15:
(29)
I
N
N
W
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
k
-
1
(
w
1
k
(
inf
⁡
T
A
1
)
+
w
2
k
(
inf
⁡
T
A
2
)
⋯
h
h
h
h
h
h
h
h
h
.
h
+
w
n
k
(
inf
⁡
T
A
n
)
)
,
h
h
h
h
h
h
k
-
1
(
w
1
k
(
sup
⁡
T
A
1
)
+
w
2
k
(
sup
⁡
T
A
2
)
⋯
h
h
h
h
h
h
h
h
h
.
h
+
w
n
k
(
sup
⁡
T
A
n
)
)
]
,
h
h
h
h
h
[
l
-
1
(
w
1
l
(
inf
⁡
I
A
1
)
+
w
2
l
(
inf
⁡
I
A
2
)
⋯
h
h
h
h
h
h
l
h
h
.
h
+
w
n
l
(
inf
⁡
I
A
n
)
)
,
h
h
h
h
h
.
h
l
-
1
(
w
1
l
(
sup
⁡
I
A
1
)
+
w
2
l
(
sup
⁡
I
A
2
)
⋯
h
h
h
.
h
h
h
h
h
h
h
+
w
n
l
(
sup
⁡
I
A
n
)
)
]
,
h
h
h
h
h
[
l
-
1
(
w
1
l
(
inf
⁡
F
A
1
)
+
w
2
l
(
inf
⁡
F
A
2
)
⋯
h
h
h
h
h
h
h
h
h
h
+
w
n
l
(
inf
⁡
F
A
n
)
)
,
h
h
h
h
h
.
h
l
-
1
(
w
1
l
(
sup
⁡
F
A
1
)
+
w
2
l
(
sup
⁡
F
A
2
)
⋯
h
h
h
.
h
h
h
h
h
h
h
+
w
n
l
(
sup
⁡
F
A
n
)
)
]
〉
.
Assume that k
(
x
)
=
-
log
⁡
(
x
), and then l
(
x
)
=
-
log
⁡
(
1
-
x
), k
-
1
(
x
)
=
e
-
x, l
-
1
(
x
)
=
1
-
e
-
x. The aggregated result using the INNWG operator in Theorem 25 can be represented by
(30)
I
N
N
W
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
∏
i
=
1
n
inf
⁡
T
A
i
w
i
,
∏
i
=
1
n
sup
⁡
T
A
i
w
i
]
,
hlh
[
1
-
∏
i
=
1
n
(
1
-
inf
⁡
I
A
i
)
w
i
,
1
-
∏
i
=
1
n
(
1
-
sup
⁡
I
A
i
)
w
i
]
,
hlh
[
1
-
∏
i
=
1
n
(
1
-
inf
⁡
F
A
i
)
w
i
,
1
-
∏
i
=
1
n
(
1
-
sup
⁡
F
A
i
)
w
i
]
〉
,
where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
∈
[
0,1
] and ∑
j
=
1
n
w
j
=
1.Letk
(
x
)
=
log
⁡
(
(
2
-
x
)
/
x
), and then l
(
x
)
=
log
⁡
(
(
1
+
x
)
/
(
1
-
x
)
), k
-
1
(
x
)
=
2
/
(
e
x
+
1
), and l
-
1
(
x
)
=
1
-
(
2
/
(
e
x
+
1
)
). The aggregated result using the INNWG operator in Theorem 25 can be denoted by
(31)
INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
〈
[
2
∏
i
=
1
n
inf
⁡
T
A
i
w
i
∏
i
=
1
n
(
2
-
inf
⁡
T
A
i
)
w
i
+
∏
i
=
1
n
inf
⁡
T
A
i
w
i
,
h
h
l
h
.
l
2
∏
i
=
1
n
sup
⁡
T
A
i
w
i
∏
i
=
1
n
(
2
-
sup
⁡
T
A
i
)
w
i
+
∏
i
=
1
n
sup
⁡
T
A
i
w
i
]
,
h
l
l
h
[
∏
i
=
1
n
(
1
+
inf
⁡
I
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
inf
⁡
I
A
i
)
w
i
∏
i
=
1
n
(
1
+
inf
⁡
I
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
inf
⁡
I
A
i
)
w
i
,
h
l
l
h
h
.
l
∏
i
=
1
n
(
1
+
sup
⁡
I
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
sup
⁡
I
A
i
)
w
i
∏
i
=
1
n
(
1
+
sup
⁡
I
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
sup
⁡
I
A
i
)
w
i
]
,
h
l
l
h
[
∏
i
=
1
n
(
1
+
inf
⁡
F
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
inf
⁡
F
A
i
)
w
i
∏
i
=
1
n
(
1
+
inf
⁡
F
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
inf
⁡
F
A
i
)
w
i
,
h
h
l
l
h
.
l
∏
i
=
1
n
(
1
+
sup
⁡
F
A
i
)
w
i
-
∏
i
=
1
n
(
1
-
sup
⁡
F
A
i
)
w
i
∏
i
=
1
n
(
1
+
sup
⁡
F
A
i
)
w
i
+
∏
i
=
1
n
(
1
-
sup
⁡
F
A
i
)
w
i
]
〉
,
where W
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
∈
[
0,1
] and ∑
j
=
1
n
w
j
=
1.Theorem25 also can be proved by the mathematical induction.Similarly, it can be proved that the INNWG operator has the same properties as the INNWA operator.(1)
Idempotency: letA
j
(
j
=
1,2
,
…
,
n
) be a collection of INNs. If all A
j
(
j
=
1,2
,
…
,
n
) are equal, that is, A
j
=
A, for all j
∈
{
1,2
,
…
,
n
}, then INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
=
A.
(2)
Boundedness: assume thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs and A
-
=
〈
min
⁡
j
T
A
j
(
x
)
,
max
⁡
j
I
A
j
(
x
)
,
max
⁡
j
F
A
j
(
x
)
〉, A
+
=
〈
max
⁡
j
T
A
j
(
x
)
,
min
⁡
j
I
A
j
(
x
)
,
min
⁡
j
F
A
j
(
x
)
〉, for all j
∈
{
1,2
,
…
,
n
}, and then A
-
⊆
INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
A
+.
(3)
Monotonity: assuming thatA
j
(
j
=
1,2
,
…
,
n
) is a collection of INNs, if A
j
⊆
A
j
*, for j
∈
{
1,2
,
…
,
n
}, then INNW
G
w
(
A
1
,
A
2
,
…
,
A
n
)
⊆
INNW
G
w
(
A
1
*
,
A
2
*
,
…
,
A
n
*
).


## 4.2. Multicriteria Decision Making Method Based on the INN Aggregation Operators

Assume that there arem alternatives A
=
{
a
1
,
a
2
,
…,a
m
} and n criteria C
=
{
c
1
,
c
2
,
…,c
n
}, whose criterion weight vector is W
=
(
w
1
,
w
2
,
…
,
w
n
), where w
j
≥
0 (j
=
1,2
,
…
,
n) and ∑
j
=
1
n
w
j
=
1. Let R
=
(
a
i
j
)
m
×
n be the interval neutrosophic decision matrix, where a
i
j
=
〈
T
a
i
j
,
I
a
i
j
,
F
a
i
j
〉 is a criterion value, denoted by an INN, where T
a
i
j indicates the truth-membership function where the alternative a
i satisfies the criterion c
j, I
a
i
j indicates the indeterminacy-membership function where the alternative a
i satisfies the criterion c
j, and F
a
i
j indicates the falsity-membership function where the alternative a
i satisfies the criterion c
j.In the following, a procedure to rank and select the most desirable alternative(s) is given.Step 1.
Utilize the INNWA operator or the INNWG operator to obtain the INNy
i for the alternatives a
i (i
=
1,2
,
…
,
m), that is,
(32)
y
i
=
INNWA
w
(
a
i
1
,
a
i
2
,
…
,
a
i
n
)
or(33)
y
i
=
INNWG
w
(
a
i
1
,
a
i
2
,
…
,
a
i
n
)
.Step 2.
Calculate the score function values
(
y
i
), the accuracy function value a
(
y
i
), and the certainty function value c
(
y
i
) of y
i (i
=
1,2
,
…
,
m) by Definition 18, denoted by the function matrix F:
(34)
F
=
[
s
(
y
1
)
a
(
y
1
)
c
(
y
1
)
s
(
y
2
)
a
(
y
2
)
c
(
y
2
)
⋯
⋯
⋯
s
(
y
m
)
a
(
y
m
)
c
(
y
m
)
]
.Step 3.
Construct the possibility matrixP
s of the score function value s
(
y
i
) as follows, according to Definition 2:
(35)
P
s
=
[
p
s
11
p
s
12
⋯
p
s
1
m
p
s
21
p
s
22
⋯
p
s
2
m
⋮
p
s
m
1
p
s
m
2
⋯
p
s
m
m
]
,
where p
s
i
j denotes the degree of possibility of s
(
y
i
)
>
s
(
y
j
), and it satisfies p
s
i
j
≥
0, p
s
i
j
+
p
s
j
i
=
1, and p
s
i
i
=
0.5. If p
s
i
j
=
0.5
(
i
≠
j
), then calculate the degree of possibility of a
(
y
i
)
>
a
(
y
j
), denoted by p
a
i
j. And if p
a
i
j
=
0.5
(
i
≠
j
), then calculate the degree of possibility of c
(
y
i
)
>
c
(
y
j
), denoted by p
c
i
j.Step 4.
Get the priority of the alternativesa
i (i
=
1,2
,
…
,
m) in accordance with p
s
i
j, p
a
i
j, and p
c
i
j, and choose the best one, referring to Definition 20.


## 5. Illustrative Example

In this section, an example for the multicriteria decision making problem of alternatives is used as the demonstration of the application of the proposed decision making method, as well as the effectiveness of the proposed method.Let us consider the decision making problem adapted from [33]. There is an investment company, which wants to invest a sum of money in the best option. There is a panel with four possible alternatives to invest the money: (
1
)
A
1 is a car company; (
2
)
A
2 is a food company; (
3
)
A
3 is a computer company; (
4
)
A
4 is an arms company. The investment company must make a decision according to the following three criteria: (
1
)
C
1 is the risk analysis; (
2
)
C
2 is the growth analysis; (
3
)
C
3 is the environmental impact analysis, where C
1 and C
2 are benefit criteria and C
3 is a cost criterion. The weight vector of the criteria is given by W
=
(
0.35,0.25,0.4
). The four possible alternatives are to be evaluated under the above three criteria by the form of INNs, as shown in the following interval neutrosophic decision matrix D:(36)
D
=
[
〈
[
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.7,0.9
]
,
[
0.2,0.3
]
,
[
0.4,0.5
]
〉
〈
[
0.6,0.7
]
,
[
0.1,0.2
]
,
[
0.2,0.3
]
〉
〈
[
0.6,0.7
]
,
[
0.1,0.2
]
,
[
0.2,0.3
]
〉
〈
[
0.3,0.6
]
,
[
0.3,0.5
]
,
[
0.8,0.9
]
〉
〈
[
0.3,0.6
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉
〈
[
0.5,0.6
]
,
[
0.2,0.3
]
,
[
0.3,0.4
]
〉
〈
[
0.4,0.5
]
,
[
0.2,0.4
]
,
[
0.7,0.9
]
〉
〈
[
0.7,0.8
]
,
[
0.0,0.1
]
,
[
0.1,0.2
]
〉
〈
[
0.6,0.7
]
,
[
0.1,0.2
]
,
[
0.1,0.3
]
〉
〈
[
0.6,0.7
]
,
[
0.3,0.4
]
,
[
0.8,0.9
]
〉
]
.


### 5.1. Procedures of Decision Making Based on INSs

Step 1.
Utilize the INNWA operator or the INNWG operator to obtain the INNs. The aggregation results based on the INNWA operator and the INNWG operator are different, and they are calculated separately. Here, letk
(
x
)
=
-
log
⁡
x, which means that the operations for INNs are based on algebraic t-conorm and t-norm.
By using the INNWA operator, the alternatives matrixA
WA can be obtained:
(37)
A
W
A
=
[
〈
[
0.5453,0.7516
]
,
[
0.1682,0.3000
]
,
[
0.3041,0.4373
]
〉
〈
[
0.4996,0.6634
]
,
[
0.1552,0.2885
]
,
[
0.3482,0.4656
]
〉
〈
[
0.3950,0.5627
]
,
[
0.2000,0.3366
]
,
[
0.4210,0.5533
]
〉
〈
[
0.6383,0.7397
]
,
[
0.0000,0.2071
]
,
[
0.2297,0.4040
]
〉
]
.
With the INNWG operator, the alternatives matrix A
WG is shown as follows:
(38)
A
W
G
=
[
〈
[
0.5004,0.6620
]
,
[
0.1761,0.3000
]
,
[
0.3195,0.4422
]
〉
〈
[
0.4547,0.6581
]
,
[
0.1861,0.3371
]
,
[
0.5405,0.6786
]
〉
〈
[
0.3824,0.5578
]
,
[
0.2000,0.3419
]
,
[
0.5012,0.7070
]
〉
〈
[
0.6333,0.7335
]
,
[
0.1555,0.2570
]
,
[
0.5069,0.6632
]
〉
]
.Step 2.
Calculate the score function value, accuracy function value, and certainty function value.
To the alternatives matrixA
WA, by using Definition 18, the function matrix of A
WA can be obtained:
(39)
F
W
A
=
[
[
1.8080,2.2793
]
[
0.2412,0.3143
]
[
0.5453,0.7516
]
[
1.7455,2.1600
]
[
0.1514,0.1978
]
[
0.4996,0.6634
]
[
1.5051,1.9417
]
[
-
0.0260,0.0094
]
[
0.3950,0.5627
]
[
2.0272,2.5100
]
[
0.3357,0.4086
]
[
0.6383,0.7397
]
]
.
To the alternatives matrix A
WG, by using Definition 20, the function matrix of A
WG is shown as follows:
(40)
F
W
G
=
[
[
1.7582,2.1664
]
[
0.1809,0.2198
]
[
0.5004,0.6620
]
[
1.4390,1.9315
]
[
-
0.0858
,
-
0.0205
]
[
0.4547,0.6581
]
[
1.3335,1.8566
]
[
-
0.1492
,
-
0.1188
]
[
0.3824,0.5578
]
[
1.7131,2.0711
]
[
0.0703,0.1264
]
[
0.6333,0.7335
]
]
.Step 3.
Construct the possibility matrix. Each interval number is compared to all interval numbers. Referring to Definition2, the possibility matrix of the score function value s
(
y
i
) can be obtained. For F
W
A,
(41)
P
s
_
W
A
=
[
0.5
0.6498
0.8527
0.2642
0.3974
0.5
0.7695
0.1480
0.1473
0.2305
0.5
0
0.7358
0.8520
1
0.5
]
.
And, for F
W
G,
(42)
p
s
_
W
G
=
[
0.5
0.8076
0.8943
0.5916
0.1924
0.5
0.5888
0.2568
0.1057
0.4112
0.5
0.1629
0.4084
0.7432
0.8371
0.5
]
.
It is obvious that p
s
i
j
≠
0.5
(
i
≠
j
), so there is no need to compute p
a
i
j and p
c
i
j.Step 4.
Get the priority of the alternatives and choose the best one.
According to Definition20 and results in Step 3, for A
WA, we have A
1
≻
A
2, A
1
≻
A
3, A
2
≻
A
3, A
4
≻
A
1, and A
4
≻
A
2. Therefore, the ranking of the four alternatives is A
4, A
1, A
2, and A
3. Obviously, A
4 is the best alternative.
Similarly, forA
WG, we have A
1
≻
A
2, A
1
≻
A
3, A
1
≻
A
4, A
2
≻
A
3, A
4
≻
A
2, and A
4
≻
A
3. Therefore, the ranking of the four alternatives is A
1, A
4, A
2, and A
3. Obviously, A
1 is the best alternative.
Whenk
(
x
)
=
log
⁡
(
(
2
-
x
)
/
x
), for A
WA, the ranking of the four alternatives is still A
4, A
1, A
2, and A
3, as well as the ranking A
1, A
4, A
2, and A
3 for A
WG.


### 5.2. Comparison Analysis and Discussion

In order to validate the feasibility of the proposed decision making method based on the INN aggregation operators, a comparison analysis will be conducted. In Section5.1, the same example adapted from [33] for the multicriteria decision making problem is demonstrated based on the INN aggregation operators. This analysis will be based on the same illustrative example.There is no consensus on the best way to sequence INNs. Ye proposed the similarity measures between INSs based on the relationship between similarity measures and distances and utilized the similarity measures between each alternative and the ideal alternative to establish a multicriteria decision making method for INSs in [33]. By contrast, we present the aggregation operators for INNs and put forward a method for multicriteria decision making by means of the aggregation operators.With the same example, [33] gave two rankings of the four alternatives with different similarity measures. The first one is A
4, A
2, A
3, and A
1. The second one is A
2, A
4, A
3, and A
1. Unlike the results in [33], we obtained the ranking sequences as A
4, A
1, A
2, A
3 and A
1, A
4, A
2, and A
3. Obviously, the results in [33] conflict with ours in this paper. And the difference mainly lies in the position of A
1.Here, for convenience, the decision matrixD in Section 5 is denoted by
(43)
D
=
[
a
11
a
12
a
13
a
21
a
22
a
23
a
31
a
32
a
33
a
41
a
42
a
43
]
.
Certainly, the alternatives A
1 can be obtained by the decision vector (
a
11
a
12
a
13
) with the associated weight vector W
=
(
0.35,0.25,0.4
). Firstly, consider A
1 and A
3. As can be seen from the decision matrix D, the truth-membership, the indeterminacy-membership, and the falsity-membership satisfies
(44)
I
a
11
=
I
a
31
,
F
a
11
=
F
a
31
.
And, with Definition 2, p
(
T
a
11
>
T
a
31
)
=
0.5, so T
a
11
=
T
a
31. Therefore, a
11
=
a
31. Similarly, it can obtained that a
13
=
a
33 significantly. And by Definitions 18 and 20, a
12
<
a
32 with a bit difference; that is, a
12 is close to a
32, so that, with the weighted vector W
=
(
0.35,0.25,0.4
), A
1
≻
A
3. Thus there is a conflict of sequences of A
1 and A
3 in [33].Similarly, it is obvious thata
21
<
a
41, a
22
<
a
42, and a
23
<
a
43, so that with the associated weight vector W
=
(
0.35,0.25,0.4
), A
1
≺
A
4, which is not coordinated with the ranking of A
2, A
4, A
3, and A
1 in [33], while the sequences of A
1, A
2 and A
1, A
3 obtained by the method in this paper are consistent with the realities. Here are the reasons for this. The difference between INSs is distorted. In the similarity measures in [33], the distances between INSs are calculated firstly and the difference was amplified in the results because of criteria weights. This causes the distortion of similarity between an alternative and the ideal alternative. In addition, the ranking of all alternatives was determined by the similarity, so that the degree of distortion can not be reduced. However, the difference between INSs in the method proposed in this paper was reserved to the final calculation. Combining the factors above, the final result produced by the method proposed in this paper is more precise and reliable than the result produced in [33].


## 5.1. Procedures of Decision Making Based on INSs

Step 1.
Utilize the INNWA operator or the INNWG operator to obtain the INNs. The aggregation results based on the INNWA operator and the INNWG operator are different, and they are calculated separately. Here, letk
(
x
)
=
-
log
⁡
x, which means that the operations for INNs are based on algebraic t-conorm and t-norm.
By using the INNWA operator, the alternatives matrixA
WA can be obtained:
(37)
A
W
A
=
[
〈
[
0.5453,0.7516
]
,
[
0.1682,0.3000
]
,
[
0.3041,0.4373
]
〉
〈
[
0.4996,0.6634
]
,
[
0.1552,0.2885
]
,
[
0.3482,0.4656
]
〉
〈
[
0.3950,0.5627
]
,
[
0.2000,0.3366
]
,
[
0.4210,0.5533
]
〉
〈
[
0.6383,0.7397
]
,
[
0.0000,0.2071
]
,
[
0.2297,0.4040
]
〉
]
.
With the INNWG operator, the alternatives matrix A
WG is shown as follows:
(38)
A
W
G
=
[
〈
[
0.5004,0.6620
]
,
[
0.1761,0.3000
]
,
[
0.3195,0.4422
]
〉
〈
[
0.4547,0.6581
]
,
[
0.1861,0.3371
]
,
[
0.5405,0.6786
]
〉
〈
[
0.3824,0.5578
]
,
[
0.2000,0.3419
]
,
[
0.5012,0.7070
]
〉
〈
[
0.6333,0.7335
]
,
[
0.1555,0.2570
]
,
[
0.5069,0.6632
]
〉
]
.Step 2.
Calculate the score function value, accuracy function value, and certainty function value.
To the alternatives matrixA
WA, by using Definition 18, the function matrix of A
WA can be obtained:
(39)
F
W
A
=
[
[
1.8080,2.2793
]
[
0.2412,0.3143
]
[
0.5453,0.7516
]
[
1.7455,2.1600
]
[
0.1514,0.1978
]
[
0.4996,0.6634
]
[
1.5051,1.9417
]
[
-
0.0260,0.0094
]
[
0.3950,0.5627
]
[
2.0272,2.5100
]
[
0.3357,0.4086
]
[
0.6383,0.7397
]
]
.
To the alternatives matrix A
WG, by using Definition 20, the function matrix of A
WG is shown as follows:
(40)
F
W
G
=
[
[
1.7582,2.1664
]
[
0.1809,0.2198
]
[
0.5004,0.6620
]
[
1.4390,1.9315
]
[
-
0.0858
,
-
0.0205
]
[
0.4547,0.6581
]
[
1.3335,1.8566
]
[
-
0.1492
,
-
0.1188
]
[
0.3824,0.5578
]
[
1.7131,2.0711
]
[
0.0703,0.1264
]
[
0.6333,0.7335
]
]
.Step 3.
Construct the possibility matrix. Each interval number is compared to all interval numbers. Referring to Definition2, the possibility matrix of the score function value s
(
y
i
) can be obtained. For F
W
A,
(41)
P
s
_
W
A
=
[
0.5
0.6498
0.8527
0.2642
0.3974
0.5
0.7695
0.1480
0.1473
0.2305
0.5
0
0.7358
0.8520
1
0.5
]
.
And, for F
W
G,
(42)
p
s
_
W
G
=
[
0.5
0.8076
0.8943
0.5916
0.1924
0.5
0.5888
0.2568
0.1057
0.4112
0.5
0.1629
0.4084
0.7432
0.8371
0.5
]
.
It is obvious that p
s
i
j
≠
0.5
(
i
≠
j
), so there is no need to compute p
a
i
j and p
c
i
j.Step 4.
Get the priority of the alternatives and choose the best one.
According to Definition20 and results in Step 3, for A
WA, we have A
1
≻
A
2, A
1
≻
A
3, A
2
≻
A
3, A
4
≻
A
1, and A
4
≻
A
2. Therefore, the ranking of the four alternatives is A
4, A
1, A
2, and A
3. Obviously, A
4 is the best alternative.
Similarly, forA
WG, we have A
1
≻
A
2, A
1
≻
A
3, A
1
≻
A
4, A
2
≻
A
3, A
4
≻
A
2, and A
4
≻
A
3. Therefore, the ranking of the four alternatives is A
1, A
4, A
2, and A
3. Obviously, A
1 is the best alternative.
Whenk
(
x
)
=
log
⁡
(
(
2
-
x
)
/
x
), for A
WA, the ranking of the four alternatives is still A
4, A
1, A
2, and A
3, as well as the ranking A
1, A
4, A
2, and A
3 for A
WG.


## 5.2. Comparison Analysis and Discussion

In order to validate the feasibility of the proposed decision making method based on the INN aggregation operators, a comparison analysis will be conducted. In Section5.1, the same example adapted from [33] for the multicriteria decision making problem is demonstrated based on the INN aggregation operators. This analysis will be based on the same illustrative example.There is no consensus on the best way to sequence INNs. Ye proposed the similarity measures between INSs based on the relationship between similarity measures and distances and utilized the similarity measures between each alternative and the ideal alternative to establish a multicriteria decision making method for INSs in [33]. By contrast, we present the aggregation operators for INNs and put forward a method for multicriteria decision making by means of the aggregation operators.With the same example, [33] gave two rankings of the four alternatives with different similarity measures. The first one is A
4, A
2, A
3, and A
1. The second one is A
2, A
4, A
3, and A
1. Unlike the results in [33], we obtained the ranking sequences as A
4, A
1, A
2, A
3 and A
1, A
4, A
2, and A
3. Obviously, the results in [33] conflict with ours in this paper. And the difference mainly lies in the position of A
1.Here, for convenience, the decision matrixD in Section 5 is denoted by
(43)
D
=
[
a
11
a
12
a
13
a
21
a
22
a
23
a
31
a
32
a
33
a
41
a
42
a
43
]
.
Certainly, the alternatives A
1 can be obtained by the decision vector (
a
11
a
12
a
13
) with the associated weight vector W
=
(
0.35,0.25,0.4
). Firstly, consider A
1 and A
3. As can be seen from the decision matrix D, the truth-membership, the indeterminacy-membership, and the falsity-membership satisfies
(44)
I
a
11
=
I
a
31
,
F
a
11
=
F
a
31
.
And, with Definition 2, p
(
T
a
11
>
T
a
31
)
=
0.5, so T
a
11
=
T
a
31. Therefore, a
11
=
a
31. Similarly, it can obtained that a
13
=
a
33 significantly. And by Definitions 18 and 20, a
12
<
a
32 with a bit difference; that is, a
12 is close to a
32, so that, with the weighted vector W
=
(
0.35,0.25,0.4
), A
1
≻
A
3. Thus there is a conflict of sequences of A
1 and A
3 in [33].Similarly, it is obvious thata
21
<
a
41, a
22
<
a
42, and a
23
<
a
43, so that with the associated weight vector W
=
(
0.35,0.25,0.4
), A
1
≺
A
4, which is not coordinated with the ranking of A
2, A
4, A
3, and A
1 in [33], while the sequences of A
1, A
2 and A
1, A
3 obtained by the method in this paper are consistent with the realities. Here are the reasons for this. The difference between INSs is distorted. In the similarity measures in [33], the distances between INSs are calculated firstly and the difference was amplified in the results because of criteria weights. This causes the distortion of similarity between an alternative and the ideal alternative. In addition, the ranking of all alternatives was determined by the similarity, so that the degree of distortion can not be reduced. However, the difference between INSs in the method proposed in this paper was reserved to the final calculation. Combining the factors above, the final result produced by the method proposed in this paper is more precise and reliable than the result produced in [33].


## 6. Conclusion

INSs can be applied in addressing problems with uncertain, imprecise, incomplete, and inconsistent information existing in real scientific and engineering applications. However, as a new branch of NSs, there is no enough research about INSs. In particular, the existing literatures do not put forward the aggregation operators and multicriteria decision making method for INSs. Based on the related research achievements in IVIFSs, we defined the operations of INSs. And the approach to compare INNs was proposed. In addition, the aggregation operators of INNWA and INNWG were given. Thus, a multicriteria decision making method is established based on the proposed operators. Utilizing the comparison approach, the ranking of all alternatives can be determined and the best one can be easily identified as well. The illustrative example demonstrates the application of the proposed decision making method. Although there is no consensus on the best way to sequence INNs, compared to the multicriteria decision making method for INSs in [33], the illustrative example shows that the final result produced by the method proposed in this paper is more precise and reliable than the result produced in [33]. In this way, the method proposed in this paper can provide a reliable basis for INSs.



---

*Source: 645953-2014-02-17.xml*