Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets

Broumi, Said; Sundareswaran, Raman; Shanmugapriya, Marayanagaraj; Singh, Prem Kumar; Voskoglou, Michael; Talea, Mohamed

doi:10.3390/math11183817

Open AccessArticle

Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets

¹

Laboratory of Information Processing, Faculty of Science Ben M’Sik, University of Hassan II, Casablanca 20000, Morocco

²

Regional Center for the Professions of Education and Training (C.R.M.E.F), Casablanca 20340, Morocco

³

Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Chennai 603110, India

⁴

Department of Computer Science and Engineering, Gandhi Institute of Technology and Management, Visakhapatnam 530045, India

⁵

School of Engineering, University of Peloponnese, 26334 Patras, Greece

^*

Author to whom correspondence should be addressed.

Mathematics 2023, 11(18), 3817; https://doi.org/10.3390/math11183817

Submission received: 14 July 2023 / Revised: 14 August 2023 / Accepted: 25 August 2023 / Published: 5 September 2023

(This article belongs to the Special Issue Advances and Applications of Soft Computing)

Download

Browse Figures

Versions Notes

Abstract

:

The Neutrosophic Set

(N_{s e t})

represents the uncertainty in data with fuzzy attributes beyond true and false values independently. The problem arises when the summation of true

(T r)

, false

(F a)

, and indeterminacy

(I n)

values crosses the membership value of one, that is,

T r + I n + F a < 1

. It becomes more crucial during decision-making processes like medical diagnoses or any data sets where

T r + I n + F a < 1

. To achieve this goal, the

F N_{s e t}

is recently introduced. This study employs the Interval-Valued Fermatean Neutrosophic Set (

I V F N_{s e t}

) as its chosen framework to address instances of partial ignorance within the domains of truth, falsehood, or uncertainty. This selection stands out due to its unique approach to managing such complexities within multi-decision processes when compared to alternative methodologies. Furthermore, the proposed method reduces the propensity for information loss often encountered in other techniques. IVFNS excels at preserving intricate relationships between variables even when dealing with incomplete or vague information. In the present work, we introduce the

I V F N_{s e t}

, which deals with partial ignorance in true, false, or uncertain regions independently for multi-decision processes. The

I V F N_{s e t}

contains the interval-valued

{T r}_{m e m b e r s h i p}

value,

{I n}_{m e m b e r s h i p}

value, and

{F a}_{m e m b e r s h i p}

for knowledge representation. The algebraic properties and set theory between the interval-valued

F N_{s e t}

have also been presented with an illustrative example.

Keywords:

Fermatean neutrosophic sets; interval-valued Fermatean neutrosophic sets; faculty performance evaluation; multicriteria decision analysis

MSC:

03E72; 05C72; 90B50

1. Introduction

The acronyms given in the following Table 1 are used throughout the entire manuscript. For the computation of linguistic words like tall or young, Zadeh proposed FS in 1965 [1].

F_{s e t}

are used to represent the acceptance and rejection of fuzzy attributes by membership values that lie in [0, 1].

T h e N_{s e t}

helps to represent the hesitant part with the independent values of

{T r}_{m e m b e r s h i p}

,

{I m}_{m e m b e r s h i p}

, and

{F a}_{m e m b e r s h i p}

such that

{}^{-}0 < {T r}_{m e m b e r s h i p} + {I m}_{m e m b e r s h i p} + {F a}_{m e m b e r s h i p} < 3^{+}

[2]. Later, interval-valued membership sets were introduced, which dealt with the ignorance of partial data about the membership values [3,4]. Yager [5,6,7] coined a new kind of

F_{s e t}

called the

P F_{s e t}

as an extension of the

{I F}_{s e t}

. It has many practical applications in MCDM [8,9]. It is based on the Fermatean fuzzy set [10], which was recently hybridized with the

N_{s e t}

[11,12,13] and Fermatean fuzzy graph [14]. Rani and Mishra [15] studied the

I V F F_{s e t}

. The

I V F F_{s e t}

[16,17] is used in several fields for the DM process because of its extensive properties [18,19].

The

N_{s e t}

theory is introduced by Smarandache [2] as an extension of the

I F_{s e t}

theory to deal with indeterminacy. Wang [4] defined the

I V S N_{s e t}

in 2010 as an extension of interval fuzzy sets [20]. Zhang et al. [21] applied the concept of Interval neutrosophic sets in multicriteria decision-making problems. Wang, T [22] introduced a projection model with unknown weight information within an interval neutrosophic environment and applied it to software quality-in-use evaluation. Another class of the

N_{s e t}

is the

I V N P_{s e t}

with the dependent interval-valued Pythagorean component, proposed by Stephy and Helen [13]. Clearly, it is a generalization of the

I V P N_{s e t}

and can handle more information than the

I V N_{s e t}

. Motivated by the

F F_{s e t}

Jansi [11] defined the

F N_{s e t}

and provided its various properties. Jeevaraj [16] introduced the concept of the

I V F F_{s e t}

s and derived mathematical operations on the class of the

I V F F_{s e t}

. Score functions in the

I V F F_{s e t}

are introduced and their properties are studied. Recently, PalaniKumar and Iampan [17] proposed the concept of the spherical

I V F F_{s o f t s e t}

. Liu et al. [18] discussed Fermatean fuzzy linguistic term sets, their basic operational laws, and aggregate functions. Broumi et al. [19] proposed the

I V F N_{g r a p h}

and presented some basic operational laws. He also [23] introduced the

F N_{g r a p h}

and

R F N_{g r a p h}

,

S F N_{g r a p h}

, and

F_{n u m b e r}

product graphs.

For DM problems in the Neutrosophic context, the value of times squared of the sum of the

T r, I m, a n d F a

degrees does not exceed two. To deal with this issue, Sweety and Jansi introduced the

F N_{s e t}

[11]. Also, the

F N_{s e t}

is a generalization of the

P N_{s e t}

and it is characterized by the condition that the cubes of their sum of their

{T r}_{m e m b e r s h i p}

,

{F a}_{m e m b e r s h i p}

, and

{I m}_{m e m b e r s h i p}

degrees do not exceed them twice. Motivated by the above literature, we develop the idea of the

I V F N_{s e t}

and its algebraic operations. The major findings of the present article are as follows:

To establish and study the $I V F N_{s e t}$ and its algebraic operations.
To introduce the accuracy and score functions $(A F a n d S F)$ of the $I V F N_{n u m b e r}$ .
To illustrate the applications of the $I V F N_{s e t}$ .

Section 1 includes an introductory part; Section 2 deals with the basic algebraic operations related to the

I V F N_{s e t}

; Section 3 defines the

A F a n d S F

of the

I V F N_{s e t};

and Section 4 discusses the application of the

I V F N_{s e t}

and delivers recommendations for future research.

2. Prerequisites

In this section, we briefly introduce the necessary basic definitions and preliminary results.

A

F_{s e t}

[1] A on

A

is of the form:

A_{P F S}

=

\{〈k, μ_{A} (k)〉 | k \in A\}

where

μ_{A} (k) : A \to [0, 1]

. A

P F S

[5,6,7] A on

A

is of the form:

A_{P F S}

=

{〈 k, {T r}_{A} (k), {F a}_{A} (k) 〉 | k \in A}

, where

{T r}_{A} (k) : A \to [0, 1]

denotes the membership degree

(m d)

and

{F a}_{A} (k) : A \to [0, 1]

denotes the

n o n - m d, \forall k \in A

to the set

A_{P F S}

, respectively, such that

0 \leq {({T r}_{A} (k))}^{2} + {({F a}_{A} (k))}^{2} \leq

1. Corresponding to its

m f,

the indeterminacy degree is given by

ϕ_{A} (k) = \sqrt{1 - {T r}_{A} {(k)}^{2} - {F a}_{A} {(k)}^{2}}

,

\forall k \in A

. A

F F_{s e t}

[11] A on

A

is of the form as

A_{F F S}

=

\{〈k, {T r}_{A} (k), {F a}_{A} (k)〉 | k \in A\}

where

{T r}_{A} (k) : A \to [0, 1]

represents the

m d

, and

{F a}_{A} (k) : A \to [0, 1]

represents the

n o n - m d, \forall k \in A

to the set A, respectively, such that

0 \leq {({T r}_{A} (k))}^{3} + {({F a}_{A} (k))}^{3} \leq

1. Corresponding to its

f,

the indeterminacy degree is given by

π_{A} (k) = \sqrt{1 - {T r}_{A} {(k)}^{3} - {F a}_{A} {(k)}^{3}}

,

\forall k \in A .

A

N_{s e t}

[2] A on

A

is defined by its truth

({T r}_{A} (k))

, indeterminacy

({I m}_{A} (k))

and falsity membership function

({F a}_{A} (k))

such that

0^{-} \leq {T r}_{A} (k) + {I m}_{A} (k) + {F a}_{A} (k) \leq 3^{+}

for all

k \in A,

whose all the subset of

[0^{-}, 1^{+}] .

In the following, Figure 1 depicted the graphical visualization between the Intuitionistic, Pythagorean, and Fermatean Fuzzy sets.

The

S V N_{s e t}

[3] A on

A

is is of the form:

A_{S V N S}

=

\{〈k, {T r}_{A} (k), {I m}_{A} (k), {F a}_{A} (k)〉 | k \in A\}

, where

{T r}_{A} (k) : A \to [0, 1]

represents the

m d

,

{I m}_{A} (k) : A \to [0, 1]

represents the

i n d e t e r m i n a c y - m d,

and

{F a}_{A} (k) : A \to [0, 1]

represents the

n o n - m d, \forall k \in A

to the setA, respectively, with

0 \leq {T r}_{A} (k) + {I m}_{A} (k) + {F a}_{A} (k) \leq

3. The

P N_{s e t}

[8] is defined as,

0 \leq {({T r}_{A} (k))}^{2}

+

{({I m}_{A} (k))}^{2} \leq

1 and

0 \leq {({F a}_{A} (k))}^{2} \leq

1 then

0 \leq {({T r}_{A} (k))}^{2}

+

{({I m}_{A} (k))}^{2}

+

{({F a}_{A} (k))}^{2} \leq

2. Sweety et al. [11] introduced the

F N_{s e t}

as:

0 \leq {({T r}_{A} (k))}^{3}

+

{({I m}_{A} (k))}^{3} \leq

1 and

0 \leq {({F a}_{A} (k))}^{3} \leq

1 then

0 \leq k \in A

to the set A, with

{({T r}_{A} (k))}^{3}

+

{({I m}_{A} (k))}^{3}

+

{({F a}_{A} (k))}^{3} \leq

2

\forall k \in A

. An

I V F_{s e t}

[19] set

\tilde{A}

on

A

is a function

\tilde{A} : A \to I n t ([0, 1])

and the set of all

I V F_{s e t}

on

A

is denoted by

k (A)

. Suppose that

\tilde{A} \in k (A), \forall k \in A, μ_{\tilde{A}} (k) = [μ_{\tilde{A}}^{-} (k)

,

μ_{\tilde{A}}^{+} (k)]

is the

m d

of an element

k

to

\tilde{A}

,

μ_{\tilde{A}}^{-} (k)

,

μ_{\tilde{A}}^{+} (k)

are the least and greatest bounds of

m d k

to

\tilde{A}

, where

0 \leq μ_{\tilde{A}}^{-} (k) \leq μ_{\tilde{A}}^{+} (k) \leq 1

. The

I V P F S

[10] A on

A

is of the form as:

A_{I V N P_{s e t}}

=

\{〈k, [{T r}_{A}^{-} (k), {T m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), F_{A}^{+} (k)]〉 : k \in A\}

where

0 \leq {T r}_{A}^{-} (k) \leq {T r}_{A}^{+} (k) \leq 1

,

0 \leq {F a}_{A}^{-} (k) \leq {F a}_{A}^{+} (k) \leq 1

and

0 \leq {({T r}_{A}^{+} (k))}^{2} + {({F a}_{A}^{+} (k))}^{2} \leq 1, \forall k \in A

.

I V F F_{s e t}

[13] A on

A

of the form as:

A_{I V N P_{s e t}}

=

\{〈k, [{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉 : \forall k \in A\}

where

0 \leq {T r}_{A}^{-} (k) \leq {T r}_{A}^{+} (k) \leq 1

,

0 \leq {F a}_{A}^{-} (k) \leq {F a}_{A}^{+} (k) \leq 1

and

0 \leq {({T r}_{A}^{+} (k))}^{3} + {({F a}_{A}^{+} (k))}^{3} \leq 1, \forall k \in A

. A

I V N_{s e t}

[24]

A

for every point

x \in A

,

{T r}_{A} (k), {I m}_{A} (p), {F a}_{A} (k) \subseteq [0, 1]

.

A_{{I V N}_{s e t}} = \{〈[{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉 : \forall k \in A\}

with 0

\leq {T r}_{A}^{+} (k)

+

{I r}_{A}^{+} (k)

+

{F a}_{A}^{+} (k) \leq

3. An

I V N P_{s e t}

[25] A on

A

is of the form as

A_{I V N P_{s e t}} = \{〈[{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉 : \forall k \in A\}

where

{T r}_{A}^{-} (k), {T r}_{A}^{+} : A \to [0, 1]

represents the least and greatest bounds of truth

m d

,

{I m}_{A}^{-} (k), {I m}_{A}^{+} (k) : A \to [0, 1]

represents the least and greatest bounds of

i n d e t e r m i n a c y m d,

and

{F a}_{A}^{-} (k), {F a}_{A}^{+} (k) : A \to [0, 1]

represents the least and greatest bounds of

f a l s i t y m d, \forall k \in A

to the set

A

, with

0 \leq {[\frac{{T r}_{A}^{-} (k) + {T r}_{A}^{+} (k)}{2}]}^{2}

+

{[\frac{{I m}_{A}^{-} (k) + {I m}_{A}^{+} (k)}{2}]}^{2}

+

{[\frac{{F a}_{A}^{-} (k) + {F a}_{A}^{+} (k))}{2}]}^{2} \leq

2. In Zhang et al. [21], the operators of set-theoretic on the

{I N}_{s e t}

are defined as follows:

The

I V N_{s e t}

is contained in another

I V N_{s e t} B_{{I V N}_{s e t}}

,

A_{{I V N}_{s e t}} \subseteq B_{{I V N}_{s e t}}

,

{\Leftrightarrow T r}_{A}^{-} (k) \leq {T r}_{B}^{-} (k)

,

{T r}_{A}^{+} (k) \leq {T r}_{B}^{+} (k)

;

{I m}_{A}^{-} (k) \geq {I m}_{B}^{-} (k), {I m}_{A}^{+} (k) \geq {I m}_{B}^{+} (k); {F a}_{A}^{-} (k) \geq {F a}_{B}^{-} (k), {F a}_{A}^{+} (k) \geq {F a}_{B}^{+} (k), \forall k \in A

.

Two

I V N_{s e t}

,

A_{{I V N}_{s e t}} = B_{{I V N}_{s e t}} \Leftrightarrow A_{{I V N}_{s e t}} \subseteq B_{{I V N}_{s e t}} a n d B_{{I V N}_{s e t}} \subseteq A_{{I V N}_{s e t}}

,

That is,

{T r}_{A}^{-} (k) = T_{r B}^{-} (k), {T r}_{A}^{+} (k) = {T r}_{B}^{+} (k); {F a}_{A}^{-} (k) = {F a}_{B}^{-} (k), {F a}_{A}^{+} (k) \geq {F a}_{B}^{+} (k), {I m}_{A}^{-} (k) = {I m}_{B}^{-} (k), {I m}_{A}^{+} (k) = {I m}_{B}^{+} (k), for all k \in A .

The

I V N_{s e t}

A is empty

{\Leftrightarrow T r}_{A}^{-} (k) = {T r}_{A}^{+} (k) = 0

,

{F a}_{A}^{-} (k) = {F a}_{A}^{+} (k) = 1

and

{I m}_{A}^{-} (k) = {I m}_{A}^{+} (k) = 0

, for all

k \in A

.

A

complement of the

I N V_{s e t}

is

A_{{I V N}_{s e t}^{C}} = \{\begin{matrix} p, [{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], \\ [1 - {I m}_{A}^{+} (k), 1 - {I m}_{A}^{-} (k)], \\ [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)] \end{matrix}\}, k \in A

A_{I V N_{s e t}} \cap B_{I V N_{s e t}},

defined as follows:

A_{I V N_{s e t}} \cap B_{I V N_{s e t}} = \{〈\begin{matrix} p, [{T r}_{A}^{-} (k) \land {T r}_{B}^{-} (k), {T r}_{A}^{+} (k) \land {T r}_{B}^{+} (k)], \\ [{I m}_{A}^{-} (k) \lor {I m}_{B}^{-} (k), {I m}_{A}^{+} (k) \lor {I m}_{B}^{+} (k)], \\ [{F a}_{A}^{-} (k) \lor {F a}_{B}^{-} (k), {F a}_{A}^{+} (k) \lor {F a}_{B}^{+} (k)] \end{matrix}〉\}, k \in A

A_{{I V N}_{s e t}} \cup B_{{I V N}_{s e t}},

defined as follows:

A_{I V N_{s e t}} \cup B_{I V N_{s e t}} = \{〈\begin{matrix} k, [{T r}_{A}^{-} (k) \lor {T r}_{B}^{-} (k), {T r}_{A}^{+} (k) \lor {T r}_{B}^{+} (k)], \\ [{I m}_{A}^{-} (k) \land {I m}_{B}^{-} (k), {I m}_{A}^{+} (k) \land {I m}_{B}^{+} (k)] \\ [{F a}_{A}^{-} (k) \land {F a}_{B}^{-} (k), {F a}_{A}^{+} (k) \land {F a}_{B}^{+} (k)] \end{matrix}〉\}, k \in A .

The difference between two

I V N_{s e t} A

and

I V N_{s e t} B

is the

I V N_{s e t} A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}},

defined as A

⊖

B = < [

{T r}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{-}, {T r}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{+}

], [

{I m}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{-}, {I m}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{+}

],

{[F a}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{-}, {F a}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{+}

]> where

\begin{matrix} {T r}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{L} = \max ({T r}_{A}^{-} (k), {T r}_{B}^{-} (k)), {T r}_{A_{{I V N}_{s e t}} ⊖ B_{{I V N}_{s e t}}}^{+} = m a x ({T r}_{A}^{+} (k), {T r}_{B}^{+} (k)) \\ {I m}_{A_{{I V N}_{s e t}} ⊖_{2} B_{{I V N}_{s e t}}}^{L} = \max ({I m}_{A}^{+} (k), 1 - {I m}_{B}^{+} (k)), {I m}_{A_{{I V N}_{s e t}} ⊖_{2} B_{{I V N}_{s e t}}}^{U} = \max ({I m}_{A}^{+} (k), 1 - {I m}_{B}^{-} (k)) \\ {F a}_{A_{{I V N}_{s e t}} ⊖_{2} B_{{I V N}_{s e t}}}^{L} = m a x ({F a}_{A}^{-} (k), {T r}_{B}^{-} (k)), {F a}_{A_{{I V N}_{s e t}} ⊖_{2} B_{{I V N}_{s e t}}}^{U} = m a x ({F a}_{A}^{+} (k), {T r}_{B}^{+} (k)) \end{matrix}

The scalar division of the

I V N_{s e t}

A is

A_{{I V N}_{s e t}} /

a, defined as follows:

A_{{I V N}_{s e t}} / a = = \{〈\begin{matrix} k, [m a x ({T r}_{A}^{-} (k) / a, 1), m a x ({T r}_{A}^{+} (k) / a, 1)], \\ [m i n ({I m}_{A}^{-} (k) / a, 1), m i n ({I m}_{A}^{+} (k) / a, 1)], \\ [m i n ({F a}_{A}^{-} (k) / a, 1), m i n ({F a}_{A}^{+} (k) / a, 1)] \end{matrix}〉\}, k \in A, a \in R^{+}

A_{{I V N}_{s e t}} . a

, defined as follows:

A_{{I V N}_{s e t}} . a = \{〈\begin{matrix} p, [m a x ({T r}_{A}^{-} (k) . a, 1), m a x ({T r}_{A}^{+} (k) . a, 1)], \\ [m i n ({I m}_{A}^{-} (k) . a, 1), m i n (I m (k) . a, 1)] \\ [m i n ({F a}_{A}^{-} (k) . a, 1), m i n ({F a}_{A}^{+} (k) . a, 1)] \end{matrix}〉\}, k \in A, a \in R^{+} .

3. Interval-Valued Fermatean Neutrosophic Sets $(I V F N_{s e t})$

The concept of the

I V F N_{s e t}, I V F N_{u m b e r}

, and their basic properties are introduced in this section.

Definition 1.

The

I V F N_{s e t} A

on

A

is of the form

A = \{〈[{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉 | k \in A\}

where

{T r}_{A} (p) = {T r}_{A}^{-} (k), {T r}_{A}^{+} (k) : A \to [0, 1]

represents the least and greatest bounds of

t r u t h m d

,

{I m}_{A} (k) = [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)] : A \to [0, 1]

represents the least and greatest bounds of

i n d e t e r m i n a c y m d,

and

{F a}_{A} (k) = [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)] : A \to [0, 1]

represents the least and greatest bounds of

f a l s i t y m d, \forall k \in A

to the set

A

, respectively, with

0 \leq {({T r}_{A} (k))}^{3}

+

{({F a}_{A} (k))}^{3} \leq 1

and

0 \leq {({I m}_{A} (k))}^{3} \leq 1

,

0 \leq {({T r}_{A} (k))}^{3}

+

{({F a}_{A} (k))}^{3}

+

{({I m}_{A} (k))}^{3} \leq 2

means

0 \leq {({T r}_{A} (k))}^{3}

+

{({F a}_{A} (k))}^{3}

+

{({I m}_{A} (k))}^{3} \leq

2

\forall k \in A .

In the following, Figure 2 depicted the Geometric representation of the

I V N_{s e t}, I V P N_{s e t}, a n d I V F N_{s e t}

.

Definition 2.

For an

I V F N_{n u m b e r} α = ([{T r}_{α}^{A -}, {T r}_{α}^{A +}], [{I m}_{α}^{A -}, {I m}_{α}^{A +}], [{F a}_{α}^{A -}, {F a}_{α}^{A +}]),

which satisfies

{({T r}_{α}^{+ A})}^{3} + {({I m}_{α}^{+ A})}^{3} + {({F a}_{α}^{+ A})}^{3} \leq 2

. Consider

α = ([{T r}_{α}^{A -}, {T r}_{α}^{A +}], [{I m}_{α}^{A -}, {I m}_{α}^{A +}], [{F a}_{α}^{A -}, {F a}_{α}^{A +}]) = ([a, b], [c, d], [e, f]) i s a I V F N_{n u m b e r} .

Remark 1.

The

I V F N_{s e t}

is an extension of

t h e I V F F_{s e t} . T h e I V F N_{n u m b e r}

occupies more space than the

I V F F_{n u m b e r}, I V I F_{n u m b e r,} a n d I V P F_{n u m b e r}

. There is no doubt that the

I V F N_{s e t}

is the more appropriate tool for finding the best alternative in complex MCDM uncertainty problems rather than the

I V F F_{s e t}, I V P F_{s e t,}

and

I V I F_{s e t} .

Definition 3.

Let

K

and

L

be two

I V F N_{s e t}

on

A,

defined by:

K = \{〈k, {T r}_{K} (k), {I m}_{K} (k), {F a}_{K} (k)〉 | k \in A\} L = \{〈k, {T r}_{L} (k), {I m}_{L} (k), {F a}_{L} (k)〉 | k \in A\}

where

{T r}_{K} (k) = [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)], {I m}_{K} (k) = [{I m}_{K}^{-} (k), {I m}_{K}^{+} (k)], {F a}_{K} (k) = {[F a}_{K}^{-} (k), {F a}_{K}^{+} (k)]

and

{T r}_{L} (k) = [{T r}_{L}^{-} (k), {T r}_{L}^{+} (k)], {I m}_{L} (k) = [{I m}_{L}^{-} (k), {I m}_{L}^{+} (k)], {F a}_{L} (k) = {[F a}_{L}^{-} (k), {F a}_{L}^{+} (k)] .

Then for all

k \in A

$K$ is contained in $L$ if and only if ${T r}_{K}^{-} (k) \leq {T r}_{L}^{-} (k)$

${T r}_{K}^{-} (k) \leq {T r}_{L}^{-} (k), {T r}_{K}^{+} (k) \leq {T r}_{L}^{+} (k), {I m}_{K}^{-} (k) \geq {I m}_{L}^{-} (k), {I m}_{K}^{+} (k) \geq {I m}_{L}^{+} (k), {F a}_{K}^{-} (k) \geq {F a}_{L}^{-} (k), {F a}_{K}^{+} (k) \geq {F a}_{L}^{+} (k)$
The union of $K$ and $L$ is the $I V F N_{s e t} D$ , defined by

$D = K \cup L = \{〈k, {T r}_{D} (k), {I m}_{D} (k), {F a}_{D} (k)〉 | k \in A\} where {T r}_{D} (k) = [{T r}_{D}^{-} (k), {T r}_{D}^{+} (k)], {I m}_{D} (k) = [{I m}_{D}^{-} (k), {I m}_{D}^{+} (k)], {F a}_{D} (k) = {[F a}_{D}^{-} (k), {F a}_{D}^{+} (k)] and {I m}_{D}^{-} (k) = \max ({I m}_{K}^{-} (k), {I m}_{L}^{-} (k)), {I m}_{D}^{+} (k) = \max ({I m}_{K}^{+} (k), {I m}_{L}^{+} (k)), {I m}_{D}^{-} (k) = \min ({I m}_{K}^{-} (k), {I m}_{L}^{-} (k)), {I m}_{D}^{+} (k) = \min ({I m}_{K}^{+} (k), {I m}_{L}^{+} (k)), {F a}_{D}^{-} (k) = \min ({F a}_{K}^{-} (k), {F a}_{L}^{-} (k)), {F a}_{D}^{+} (k) = \min ({F a}_{K}^{+} (k), {F a}_{L}^{+} (k)) .$

or simply we can write,

$K \cap L = \{k, [m a x ({T r}_{K}^{-} (k), {T r}_{L}^{-} (k)), m a x ({T r}_{K}^{+} (k), {T r}_{L}^{+} (k))], [m i n ({I m}_{K}^{-} (k), {I m}_{L}^{-} (k)), m i n ({I m}_{K}^{+} (k), {I m}_{L}^{+} (k))], [m i n ({F a}_{K}^{-} (k), {F a}_{L}^{-} (k)), m i n ({F a}_{K}^{+} (k), {F a}_{L}^{+} (k))]| , k \in A\}$
The intersection of $K$ and $L$ is the $I V F N_{s e t} D$ , defined by

$D = K \cap L = \{〈k, {T r}_{D} (k), {I m}_{D} (k), {F a}_{D} (k)〉 | k \in A\} {T r}_{D} (k) = [{T r}_{D}^{-} (k), {T r}_{D}^{+} (k)], {I m}_{D} (k) = [{I m}_{D}^{-} (k), {I m}_{D}^{+} (k)], {F a}_{D} (k) = {[F a}_{D}^{-} (k), {F a}_{D}^{+} (k)] and {T r}_{D}^{-} (k) = \min ({T r}_{K}^{-} (k), {T r}_{L}^{-} (k)), {T r}_{D}^{+} (k) = \min ({T r}_{K}^{+} (k), {T r}_{L}^{+} (k)), {I m}_{D}^{-} (k) = \max ({I m}_{K}^{-} (k), {I m}_{L}^{-} (k)), {I m}_{D}^{+} (k) = \max ({I m}_{K}^{+} (k), {I m}_{L}^{+} (k)), {F a}_{D}^{-} (k) = \max ({F a}_{K}^{-} (k), {F a}_{L}^{-} (k)), {F a}_{D}^{+} (k) = \max ({F a}_{K}^{+} (k), {F a}_{L}^{+} (k)) .$

or simply we can write.

$\begin{matrix} K \cap L = \{k, [m i n ({T r}_{K}^{-} (k), {T r}_{L}^{-} (k)), m i n ({T r}_{K}^{+} (k), {T r}_{L}^{+} (k))], \\ [m a x ({I m}_{K}^{-} (k), {I m}_{L}^{-} (k)), m a x ({I m}_{K}^{+} (k), {I m}_{L}^{+} (k))], \\ [m a x ({F a}_{K}^{-} (k), {F a}_{L}^{-} (k)), m a x ({F a}_{K}^{+} (k), {F a}_{L}^{+} (k))]| , k \in A\} \end{matrix}$
The complement of $K$ is the $I V F N_{s e t} K^{c}$ , defined by

$K^{c} = \{〈k, {T r}_{K^{c}} (k), {I m}_{K^{c}} (k), {F a}_{K^{c}} (k)〉 | k \in A\} where \begin{matrix} {T r}_{K^{c}} (k) = {F a}_{K} (k) = [{F a}_{K}^{-} (k), {F a}_{K}^{+} (k)] \\ {I m}_{K^{c}}^{-} (k) = 1 - {I m}_{K}^{+} (k), {I m}_{K^{c}}^{+} (k) = 1 - {I m}_{K}^{-} (k) \\ {F a}_{K^{c}} (k) = {T r}_{K} (k) = [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)] \end{matrix}$

or simply we can write.

$K^{c} = \{〈k, [{F a}_{K}^{-} (k), {F a}_{K}^{+} (k)], [1 - {I m}_{K}^{+} (k), 1 - {I m}_{K}^{-} (k)], [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)]〉 | k \in A\} .$

Definition 4.

The

I V F N_{s e t}

is known as an absolute

I V F N_{s e t}

, denoted by

1_{A}

,

\Leftrightarrow

its membership values are defined as

\begin{matrix} [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)] = [1, 1]; \\ [{I m}_{K}^{-} (k), {I m}_{K}^{+} (k)] = [0, 0] \\ [{F a}_{K}^{-} (k), {F a}_{K}^{+} (k)] = [0, 0] . \end{matrix}

Definition 5.

The empty

I V F N_{s e t}

is denoted by

0_{A}

, if its membership values are defined as

\begin{matrix} [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)] = [0, 0]; \\ [{I m}_{K}^{-} (k), {I m}_{K}^{+} (k)] = [1, 1] \\ [{F a}_{K}^{-} (k), {F a}_{K}^{+} (k)] = [0, 0] . \end{matrix};

Example 1.

Consider two

I V F N_{s e t},

defined over

A

as

K = \{\begin{matrix} 〈p_{1}, [0.85, 0.90], [0.80, 0.85], [0.80, 0.90]〉, 〈p_{2}, [0.85, 0.85], [0.80, 0.80], [0.80, 0.90]〉, \\ 〈p_{3}, [0.90, 0.95], [0.83, 0.86], [0.82, 0.81]〉 \end{matrix}\} L = \{\begin{matrix} 〈p_{1}, [0.80, 0.90], [0.80, 0.80], [0.80, 0.90]〉, 〈p_{2}, [0.81, 0.85], [0.82, 0.82], [0.84, 0.91]〉, \\ 〈p_{3}, [0.92, 0.95], [0.85, 0.87], [0.83, 0.85]〉 \end{matrix}\}

then

K \cap L = \{\begin{matrix} 〈p_{1}, [0.80, 0.90], [0.80, 0.85], [0.80, 0.90]〉, 〈p_{2}, [0.81, 0.85], [0.82, 0.82], [0.84, 0.91]〉, \\ 〈p_{3}, [0.90, 0.95], [0.85, 0.87], [0.83, 0.85]〉 \end{matrix}\} K \cup L = \{\begin{matrix} 〈p_{1}, [0.85, 0.90], [0.80, 0.80], [0.80, 0.90]〉, 〈p_{2}, [0.85, 0.85], [0.80, 0.80], [0.80, 0.90]〉, \\ 〈p_{3}, [0.92, 0.95], [0.83, 0.86], [0.82, 0.81]〉 \end{matrix}\} K^{c} = \{\begin{matrix} 〈p_{1}, [0.80, 0.90], [0.15, 0.20], [0.85, 0.90]〉, 〈p_{2}, [0.80, 0.90], [0.20, 0.20], [0.85, 0.85]〉, \\ 〈p_{3}, [0.82, 0.81], [0.14, 0.17], [0.83, 0.86]〉 \end{matrix}\}

Theorem 1.

For any

I V F N_{s e t}, K

is defined on the absolute

I V F N_{s e t} A

.

$\begin{matrix} K \cup 0_{A} = K \\ K \cap 1_{A} = K \end{matrix}\}$ (Identity Law)
$\begin{matrix} K \cap 0_{A} = 0_{A} \\ K \cup 1_{A} = 1_{A} \end{matrix}\}$ (Domination Law)

Proof.

(i): Let $K$ and $0_{A}$ be two $I V F N_{s e t}$ on $A$ , defined by

$K = \{〈k, [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)], [{I m}_{K}^{-} (k), {I m}_{K}^{+} (k)], [{F a}_{K}^{-} (k), {F a}_{K}^{+} (k)]〉 | k \in A\}$

$0_{A}$ , is defined as follows: $0_{A}$ = $\{〈k, [0, 0], [1, 1], [1, 1]〉 | k \in A\}$
So, $K \cup 0_{A}$ = $\{k, [m a x ({T r}_{K}^{-} (k), 0), m a x ({T r}_{K}^{+} (k), 0)]$ ,

$[m i n ({I m}_{K}^{-} (k), 1), m i n ({I m}_{K}^{+} (k), 1)], [\min ({F a}_{K}^{-} (k), 1), m i n ({F a}_{K}^{+} (k), 1)]| k \in A\}$

Therefore, $K \cup 0_{A}$ = $\{〈k, [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)], [{I m}_{K}^{-} (k), {I m}_{K}^{+} (k)], [{F a}_{K}^{-} (k), {F a}_{K}^{+} (k)]〉 | k \in A\}$

$K \cup 0_{A} = K$

In a similar way, we can prove $K \cap 1_{A} = K$
(ii): Let $K$ and $0_{A}$ be two $I V F N_{s e t}$ on $A,$ defined by

$K = \{〈k, [{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)], {[I m}_{K}^{-} (k), {I m}_{K}^{+} (k)], [{[F a}_{K}^{-} (k), {F a}_{K}^{+} (k)〉 | k \in A\}$

$0_{A},$ is defined as follows: $0_{A}$ = $\{〈k, [0, 0], [1, 1], [1, 1]〉 | k \in A\}$
So, $K \cap 0_{A}$ = $\{k, [m i n ({T r}_{K}^{-} (k), 0), m i n ({T r}_{K}^{+} (k), 0)]$ ,

$[m a x ({I m}_{K}^{-} (k), 1), m a x ({I m}_{K}^{+} (k), 1)], [m a x ({F a}_{K}^{-} (k), 1), m a x ({F a}_{K}^{+} (k), 1)]| k \in A\}$

Therefore, $K \cap 0_{A}$ = $\{〈k, [0, 0], [1, 1], [1, 1]〉 | k \in A\}$

$K \cap 0_{A} = 0_{A}$

In the similar way, we can prove $K \cup 1_{A} = 1_{A}$

□

Definition 6.

Suppose

K = \{〈[{T r}_{K}^{-} (k), {T r}_{K}^{+} (k)], [{I m}_{K}^{-} (k), {I m}_{K}^{+} (k)], [{[F a}_{K}^{-} (k), {F a}_{K}^{+} (k)]〉 : k \in A\}

and

L = \{〈[{T r}_{L}^{-} (k), {T r}_{L}^{+} (k)], [{I m}_{L}^{-} (k), {I m}_{L}^{+} (k)], {[F a}_{L}^{-} (k), {F a}_{L}^{+} (k)]〉 : k \in A\}

be two

I V F N_{s e t}

, then

A_{{I V F N}_{s e t}} + B_{{I V F N}_{s e t}} = \{〈\begin{matrix} k_{1} + k_{2}, [{T r}_{K}^{-} (k) + {T r}_{L}^{-} (k) - {T r}_{K}^{-} (k) {T r}_{L}^{-} (k), {T r}_{K}^{+} (k) + {T r}_{L}^{-} (k) - {T r}_{K}^{+} (k) {T r}_{L}^{+} (k)], \\ [{I m}_{K}^{-} (k) {I m}_{L}^{-} (k), {I m}_{K}^{+} (k) {I m}_{L}^{+} (k)], \\ [{F a}_{K}^{-} (k) {F a}_{L}^{-} (k), {F a}_{K}^{+} (k) {F a}_{L}^{+} (k)] \end{matrix}〉\}, k \in A A_{{I V F N}_{s e t}} \cdot B_{{I V F N}_{s e t}} = \{〈\begin{matrix} k_{1} k_{2}, [{T r}_{K}^{-} (k) {T r}_{L}^{-} (k), {T r}_{K}^{+} (k) {T r}_{L}^{+} (k)], \\ [{I m}_{K}^{-} (k) + {I m}_{L}^{-} (k) - {I m}_{K}^{-} (k) {I m}_{L}^{-} (k), {I m}_{K}^{+} (k) + {I m}_{L}^{+} (k) - {I m}_{K}^{+} (k) {I m}_{L}^{+} (k)], \\ [{F a}_{K}^{-} (k) + {F a}_{L}^{-} (k) - {F a}_{K}^{-} (k) {F a}_{L}^{-} (k), {F a}_{K}^{+} (k) + {F a}_{L}^{+} (k) - {F a}_{K}^{+} (k) {F a}_{L}^{+} (k)] \end{matrix}〉\}, k \in A

Definition 7.

Let

α = ([{T r}_{α}^{A -}, {T r}_{α}^{A +}], [{I m}_{α}^{A -}, {I m}_{α}^{A +}], [{F a}_{α}^{A -}, {F a}_{α}^{A +}]), α_{1} = ([{T r}_{α_{1}}^{A -}, T_{α_{1}}^{A +}], [{I m}_{α_{1}}^{A -}, I_{α_{1}}^{A +}], [{F a}_{α_{1}}^{A -}, {F a}_{α_{1}}^{A +}])

and

α_{2} = ([{T r}_{α_{2}}^{A -}, {T r}_{α_{2}}^{A +}], [{I m}_{α_{2}}^{A -}, {I m}_{α_{2}}^{A +}], [{F a}_{α_{2}}^{A -}, {F a}_{α_{2}}^{A +}])

be three

I V F N_{n u m b e r}

. Then

(i): $α_{1} = α_{2}$ if and only if ${T r}_{α_{1}}^{A -} = {T r}_{α_{2}}^{A -}, {I m}_{α_{1}}^{A -} = {I m}_{α_{2}}^{A -}, {F a}_{α_{1}}^{A -} = {F a}_{α_{2}}^{A -}$
(ii): $α_{1} ≺ α_{2}$ if and only if
(iii): ${T r}_{α_{1}}^{A -} \leq {T r}_{α_{2}}^{A -}, {{T r}_{α_{1}}^{A +} \leq {T r}_{α_{2}}^{A +}; I m}_{α_{1}}^{A -} \geq {I m}_{α_{2}}^{A -}, {{I m}_{α_{1}}^{A -} \geq {I m}_{α_{2}}^{A -}; F a}_{α_{1}}^{A -} \geq {F a}_{α_{2}}^{A -}; {F a}_{α_{2}}^{A +} \geq {F a}_{α_{2}}^{A +}$
(iv): $α_{1} ⨁ α_{2} = [\begin{matrix} \sqrt[3]{{({T r}_{α_{1}}^{A -})}^{3} + {({T r}_{α_{2}}^{A -})}^{3} - {({T r}_{α_{1}}^{A -})}^{3} . {({T r}_{α_{2}}^{A -})}^{3},} \sqrt[3]{{({T r}_{α_{1}}^{A +})}^{3} + {({T r}_{α_{2}}^{A +})}^{3} - {({T r}_{α_{1}}^{A +})}^{3} . {({T r}_{α_{2}}^{A +})}^{3}}, \\ [{I m}_{α_{1}}^{A -} {I m}_{α_{2}}^{A -}, {I m}_{α_{1}}^{A +} {I m}_{α_{2}}^{A +}], [{F a}_{α_{1}}^{A -} {F a}_{α_{2}}^{A -}, {F a}_{α_{1}}^{A +} {F a}_{α_{2}}^{A +}] \end{matrix}]$
(v): $α_{1} ⨂ α_{2} = [\begin{matrix} [{T r}_{α_{1}}^{A -} . {T r}_{α_{2}}^{A -}, {T r}_{α_{1}}^{A +} . {T r}_{α_{2}}^{A +}] \\ [\sqrt[3]{{({I m}_{α_{1}}^{A -})}^{3} + {({I m}_{α_{2}}^{A -})}^{3} - {({I m}_{α_{1}}^{A -})}^{3} . {({I m}_{α_{2}}^{A -})}^{3},} \sqrt[3]{{({I m}_{α_{1}}^{A +})}^{3} + {({I m}_{α_{2}}^{A +})}^{3} - {({I m}_{α_{1}}^{A +})}^{3} . {({I m}_{α_{2}}^{A +})}^{3}}] \\ [\sqrt[3]{{({F a}_{α_{1}}^{A -})}^{3} + {({F a}_{α_{2}}^{A -})}^{3} - {({F a}_{α_{1}}^{A -})}^{3} . {({F a}_{α_{2}}^{A -})}^{3},} \sqrt[3]{{({F a}_{α_{1}}^{A +})}^{3} + {({F a}_{α_{2}}^{A +})}^{3} - {({F a}_{α_{1}}^{A +})}^{3} . {({F a}_{α_{2}}^{A +})}^{3}}] \end{matrix}]$
(vi): $k α = ([\sqrt[3]{1 - (1 - {({{(T r}_{α}^{A -})}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({{(T r}_{α}^{A +})}^{3})}^{k})}], [{({I m}_{α}^{A -})}^{k}, {({I m}_{α}^{A +})}^{k}], [{({F a}_{α}^{A -})}^{k}, {({F a}_{α}^{A +})}^{k}])$
(vii): $α^{k} = ([{({T r}_{α}^{A -})}^{k}, {({T r}_{α}^{A +})}^{k}], [\sqrt[3]{1 - (1 - {({{(I m}_{α}^{A -})}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({{(I m}_{α}^{A +})}^{3})}^{k})}], [\sqrt[3]{1 - (1 - {({({F a}_{α_{1}}^{A -})}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({({F a}_{α_{2}}^{A -})}^{3})}^{k})}]) .$

Remark 2.

If $α = ([a, b], [c, d], [e, f]) = ([1, 1], [0, 0], [0, 0]) a n d k > 0$ then,

$\begin{matrix} k α = ([\sqrt[3]{1 - (1 - {(a^{3})}^{k}),} \sqrt[3]{1 - (1 - {(b^{3})}^{k})}], [{(c)}^{k}, {(d)}^{k}], [{(e)}^{k}, {(f)}^{k}]) = ([1, 1], [0, 0], [0, 0]) α^{k} \\ = ([{(a)}^{k}, {(b)}^{k}], [\sqrt[3]{1 - (1 - {({c)}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({d)}^{3})}^{k})}], [\sqrt[3]{1 - (1 - {({(e)}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({(f)}^{3})}^{k})}]) \\ = ([1, 1], [0, 0], [0, 0]) \end{matrix}$
If $α = ([a, b], [c, d], [e, f]) = ([0, 0], [1, 1], [1, 1]) a n d k > 0$ then,

$\begin{matrix} k α = ([\sqrt[3]{1 - (1 - {(a^{3})}^{k}),} \sqrt[3]{1 - (1 - {(b^{3})}^{k})}], [{(c)}^{k}, {(d)}^{k}], [{(e)}^{k}, {(f)}^{k}]) = ([0, 0], [1, 1], [1, 1]) α^{k} \\ = ([{(a)}^{k}, {(b)}^{k}], [\sqrt[3]{1 - (1 - {({c)}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({d)}^{3})}^{k})}], [\sqrt[3]{1 - (1 - {({(e)}^{3})}^{k}),} \sqrt[3]{1 - (1 - {({(f)}^{3})}^{k})}]) \\ = ([0, 0], [1, 1], [1, 1]) \end{matrix}$
If $k = 1$ then $k α = α; α^{k} = α$

Definition 8.

Consider

α_{j} = ([{T r}_{α_{j}}^{A -}, {T r}_{α_{j}}^{A +}], [{I m}_{α_{j}}^{A -}, {I m}_{α_{j}}^{A +}], [{F a}_{α_{j}}^{A -}, {F a}_{α_{j}}^{A +}])

is a set of the

I V F N_{n u m b e r}

where

j = 1, 2, \dots, r

. Then, the

I V F N W_{a v e r a g e}

operator is as follows:

I V F N W A (α_{1}, α_{2}, . . α_{r}) = ⊝_{j = 1}^{r} w_{j} α_{j} where w_{j} is weight value with w_{j} \in [0, 1] and \sum_{j = 1}^{r} w_{j} = 1 I V F N W A (α_{1}, α_{2}, . . α_{r}) = [{(1 - \prod_{j = 1}^{r} {(1 - {({T r}_{α_{j}}^{A -})}^{3})}^{w_{j}})}^{\frac{1}{3}}, {(1 - \prod_{j = 1}^{r} {(1 - {({T r}_{α_{j}}^{A +})}^{3})}^{w_{j}})}^{\frac{1}{3}}], [\prod_{j = 1}^{r} {({I m}_{α_{j}}^{A -})}^{w_{j}}, \prod_{j = 1}^{r} {({I m}_{α_{j}}^{A +})}^{w_{j}}], [\prod_{j = 1}^{r} {({F a}_{α_{j}}^{A -})}^{w_{j}}, \prod_{j = 1}^{r} {({F a}_{α_{j}}^{A +})}^{w_{j}}]

Definition 9.

Consider

α_{j} = ([{T r}_{α_{j}}^{A -}, {T r}_{α_{j}}^{A +}], [{I m}_{α_{j}}^{A -}, {I m}_{α_{j}}^{A +}], [{F a}_{α_{j}}^{A -}, {F a}_{α_{j}}^{A +}])

is a set of

t h e I V F N_{n u m b e r}

where

j = 1, 2, \dots, r

. Then, the

I V F N W_{g r a p h}

operator is as follows:

I V F N W G (α_{1}, α_{2}, . . α_{r}) = ⊝_{j = 1}^{r} α_{j}^{w_{j}}

where

w_{j}

is weight value with

w_{j} \in [0, 1]

and

\sum_{j = 1}^{r} w_{j} = 1

I V F N W_{g r a p h} (α_{1}, α_{2}, . . α_{r}) = ([\prod_{j = 1}^{r} {({T r}_{α_{j}}^{A -})}^{w_{j}}, \prod_{j = 1}^{r} {({T r}_{α_{j}}^{A +})}^{w_{j}}], [{(1 - \prod_{j = 1}^{r} {(1 - {({I m}_{α_{j}}^{A -})}^{3})}^{w_{j}})}^{\frac{1}{3}}, {(1 - \prod_{j = 1}^{r} {(1 - {({I m}_{α_{j}}^{A +})}^{3})}^{w_{j}})}^{\frac{1}{3}}], [{(1 - \prod_{j = 1}^{r} {(1 - {({F a}_{α_{j}}^{A -})}^{3})}^{w_{j}})}^{\frac{1}{3}}, {(1 - \prod_{j = 1}^{r} {(1 - {({F a}_{α_{j}}^{A +})}^{3})}^{w_{j}})}^{\frac{1}{3}}])

4. Score and Accuracy Function for the $I V F N_{n u m b e r}$

Finding the solutions to Multi-Criteria Decision-Making (MCDM) problems in an uncertainty situation is a challenging task in today’s world. In real-time situations, the membership values of

T r

,

F a

and

I n

for a certain problem cannot be an exact value but are defined by possible interval values. So, researchers introduced the

I V F_{s e t}, I V I F_{s e t} a n d I V N_{s e t}

. There are many studies available in the literature about grouping operators and determination methods in Table 2. In the Decision-Making (DM) process, one can find the best alternative among a set of feasible ones by using MCDM techniques. HWang and Yoon [26] introduced TOPSIS, which is another well-known MCDM approach to finding the best alternative. To date, the

I F_{s e t}, I V I F_{s e t}, a n d I V N_{s e t}

are widely used in DM problems. Additionally, the

S N_{s e t} a n d I V N_{s e t}

are extensions of the

N_{s e t}

.

Singh et al. [24] defined score and accuracy functions using

N_{s e t}

to solve problems in MCDM for ranking the

S V N_{s e t} a n d I V N_{s e t} .

Definition 10.

Score functions of the

S V N_{s e t .}

Let

A = \{〈k, [{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉|, k \in A}

. That is,

\tilde{A} = ([a, b], [c, d], [e, f])

be an

I N_{n u m b e r}

. The Score function (SF) of the

S V N_{s e t}

is interpreted as

S (α) = \frac{2 + a + b - 2 c - 2 d - e - f}{4},

where

S (α) \in [0, 1]

(Şahin and Nancy [33,34,35])

S (α) = \frac{4 + (a + b - 2 c - 2 d - e - f) (4 - a - b - e - f)}{8}

where

S (α) \in [0, 1]

(Singh et al. [2])

S (α) = (2 + a + b - 2 c - 2 d - e - f) (2 (4 - a - b - c - d)),

where

S (α) \in [0, 1] a n d a + b + c + d \neq 4 a s 0 \leq a \leq b \leq 1, 0 \leq c \leq d \leq 1

.

H (α) = \frac{(a + b - d (1 - b) - c (1 - a) - f (1 - c) - e (1 - d)}{2},

H (α) \in [0, 1]

(Sahin [34]).

Definition 11.

An Accuracy functions of the

S V N_{s e t .}

Let

A = {〈 k, {T r}_{A} (k), {I m}_{A} (k), {F a}_{A} (k) 〉 | k \in A}

be the

S V N_{s e t}

. For convenience, the

N_{s e t} A = 〈 a, b, c 〉

, (

Ş a h i n a n d N a n c y

[34,35] is defined as

S (α) = \frac{1 + a - 2 b - c}{2}, S (α) \in [0, 1]

S (α) = \frac{1 + (a - 2 b - c) (2 - a - c)}{2}, S (α) \in [0, 1]

The Accuracy function (AF) of

S V N_{s e t}

f (Nancy and Şahin [34,35]) is interpreted as

H (α) = a - b (1 - a) - c (1 - b), H (α) \in [0, 1] H (α) = a - 2 b - c, H (α) \in [0, 1] .

Definition 12.

Score and accuracy functions of the

I V P F_{s e t}

and

I V P F_{n u m b e r} .

Score function of the

P F_{s e t} A

on

S

is given by Zhang et al. [21], who introduced the (SF) as

S (α) = {({T r}_{A})}^{2} - {F a}_{A}

, where

α = ({T r}_{A}, {F a}_{A})

and

S (α) \in [- 1, 1]

. The AF is

(α) = {({T r}_{A})}^{2} + {({F a}_{A})}^{2}

, where

H (α) \in [0, 1] .

Score and Accuracy functions of the

I V P F_{s e t}

S (α) = 〈[a, b], [c, d]〉 w h e r e [a, b] \subseteq [0, 1], [c, d] \subseteq [0, 1] a n d b^{2} + d^{2} \leq 1 .

The score function of the

I V P F_{n u m b e r}

is

S (α) = \frac{{a^{2} + b^{2} - c^{2} - d}^{2}}{2}

, where

S (α) \in [- 1, 1]

The accuracy function for the

I V P F_{n u m b e r}

is

(α) = \frac{{a^{2} + b^{2} + c^{2} + d}^{2}}{2}

, where

H (α) \in [0, 1]

. Garg [31] observed that the above SF and AF for the

I V P F_{n u m b e r}

are suitable for certain cases; for example,

α_{1} = 〈 [0, 0.5], [0.1, 0.7] 〉 a n d α_{2} = 〈 [0.3, 0.4], [0.5, 0.5] 〉

are the two

I V P F_{s e t}

, then we obtain,

S (α_{1}) = S (α_{2}) = - 0.1250 a n d H (α_{1})) = H (α_{2}) = 0.3750 .

Hence, he proposed an improved score function as follows:

L (α) = \frac{(a^{2} - c^{2}) (1 + (\sqrt{(1 - a^{2} - c^{2})})) + (b^{2} - d^{2}) (1 + (\sqrt{(1 - b^{2} - d^{2})}))}{2},

where

L (α) \in [- 1, 1]

Based on the improved score function, he gave the following comparison law for the DM process by the

I V P F_{n u m b e r}

if

L (α) < L (β), t h e n α < β

,

L (α) > L (β), t h e n α > β, L (α) = L (β), t h e n α = β .

He also verified this with the above two examples,

L (α_{1}) = - 0.1912 a n d L (α_{2}) = - 0.2246, t h e a l t e r n a t i v e α_{1} i s b e t t e r t h a n α_{2} a n d L (α_{1}) = - 0.3368 a n d L (α_{2}) = - 0.3233, t h e a l t e r n a t i v e α_{2} i s b e t t e r t h a n α_{1} .

Definition 13.

Score and accuracy functions of the

F F_{s e t}

and

I V F F_{n u m b e r}

. Senapati and Yager [10] proposed the

F F_{s e t}

in 2019. They have also compared it to other kinds of

F_{s e t} .

Complement operator and set of operations for the

F F_{s e t}

were found. They defined SF and AF for the

F F_{s e t}

ranking and applied it to the DM problem. Score function of the

F F_{s e t}

is

S (α) = {({T r}_{A})}^{3} - {({F a}_{A})}^{3}

where

α = ({T r}_{A}, {F a}_{A}) a n d S (α) \in [- 1, 1]

. The accuracy function of the

F F_{s e t}

is

H (α) = {({T r}_{A})}^{3} + {({F a}_{A})}^{3}

where

H (α) \in [0, 1] .

Senapati and Yager [10] explained the SF and values lie between [−1,1]. Later, Laxminarayan Sahoo [36] observed that

S F (F) \in [- 1, 1]

and the function are positive when

S F (F) \in [0, 1]

and negative when

S F (F) \in [- 1, 0)

. To score functions when score values lie in the interval between 0 and 1, he has also introduced the following formulae.

(Type 1) S_{1 F} (\tilde{F}) = \frac{1 + {T r}_{A}^{3} - {F a}_{A}^{3}}{2} (Type 2) S_{2 F} (\tilde{F}) = \frac{1 + 2 {T r}_{A}^{3} - {F a}_{A}^{3}}{3} (Type 3) S_{3 F} (\tilde{F}) = \frac{(1 + {T r}_{A}^{3} - {F a}_{A}^{3}) (| {T r}_{A} - {F a}_{A} |)}{2}

Rani et al. [15] introduced the following:

The score function of the

I V F F_{n u m b e r} λ = ⟨[a, b], [c, d]⟩

where

[a, b] \subseteq [0, 1], [c, d] \subseteq [0, 1] a n d b^{3} + d^{3} \leq 1 . S (α) = \frac{a^{3} + b^{3} - c^{3} - d^{3}}{2}

where

S (α) \in [- 1, 1]

The accuracy function for the

I V F F_{n u m b e r}

is

H (α) = \frac{a^{3} + b^{3} + c^{3} + d^{3}}{2}

where

H (α) \in [0, 1]

Jeevaraj [16] introduced a new score function for comparing such types of

I V F F_{n u m b e r},

as follows:

S (α) = \frac{- a^{3} + b^{3} + c^{3} - d^{3}}{2} where S (α) \in [- 0.5, 0.5]

The accuracy function for the

I V F F_{n u m b e r}

is

H (α) = \frac{- a^{3} + b^{3} - c^{3} + d^{3}}{2} w h e r e H (α) \in [- 0.5, 0.5]

Rani et al. [15] introduced a new score function for comparing such types of

I V F F_{n u m b e r,}

as follows:

S (α) = \frac{(a^{3} - c^{3}) (1 + \sqrt{(1 - a^{3} - c^{3})}) + (b^{3} - d^{3}) (1 + \sqrt{(1 - b^{3} - d^{3})})}{2}, w h e r e S (α) \in [- 1, 1] .

Definition 14.

Proposed Score Functions of the

I V F N_{s e t}

(

I V F N_{s e t}

)}

〈[{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉 = α = 〈[a, b], [c, d], [e, f]〉 w h e r e [a, b] \subseteq [0, 1], [c, d] \subseteq [0, 1], [e, f] \subseteq [0, 1] a n d b^{3} + d^{3} + f^{3} \leq 1 .

The score functions of the

I V F N_{s e t}

S_{1} (α) = \frac{(a^{3} + b^{3} - c^{3} - d^{3} - e^{3} - f^{3})}{2} w h e r e S_{1} (α) \in [- 1, 1] S_{2} (α) = \frac{(a^{3} + b^{3} + c^{3} + d^{3} + e^{3} + f^{3})}{2} w h e r e S_{2} (α) \in [0, 1] S_{3} (α) = \frac{4 + (a^{3} + b^{3} - 2 c^{3} - 2 d^{3} - e^{3} - f^{3}) (4 - a^{3} - b^{3} - c^{3} - d^{3} - e^{3} - f^{3})}{8} w h e r e S_{3} (α) \in [0, 1]

For maximum property,

〈[0, 0], [0, 0], [1, 1]〉

and minimum property,

〈[1, 1], [0, 0], [0, 0 .]〉

See in Table 3.

5. Applications of Interval-Valued Fermatean Neutrosophic Numbers

MCDM techniques are used to solve real-world problems in the context of uncertainty. There are two famous methods that help determine the solution to MCDM problems. The Analytical Hierarchy Process (AHP) is one of these two methods that can be used to analyze such problems by branching techniques to identify the best solution through the weight of the criterion. TOPSIS is another of the most popular MCDM models that helps select the best solutions. But in the AHP model, the number of criteria does not give clear information, whereas TOPSIS determines the ranking based on several criteria. In this technique, ideal values are either positive or negative based on the shortest and farthest distances.

In this section, we study the lecturer evaluation along with the

I V F N_{s e t}

. This study presents a ranking of the six different lecturers who work at one of the leading institutions in Tamil Nadu based on weighted performance evaluation criteria.

Anh Duc Do et al. [37] divided the criteria for evaluating the efficiency and talent of lecturers in an educational institution into four main groups: self-evaluation, manager valuation, peer evaluation, and student-based evaluation (Wu et al. [38]), as shown in the below Figure 3.

It is noted that the above-listed criteria may differ with respect to the infrastructure, level of students, salary given to the faculty, and workload of each institution. So, we have modified the above list of criteria and sub-criteria. We follow the following criteria structure for the lecturer evaluation in Figure 4 and Table 4:

Using the TOPSIS method, the solution of the MCDM problem concludes the relationship between the shortest distance from the positive ideal solution and the farthest distance from the negative ideal solution. The ideal classical TOPSIS method can be presented using the following five levels:

Level 1: Construct the DM matrix

(C = {[c_{i j}]}_{m \times n}) .

Level 2: Find the Normalized DM

(R = {[r_{i j}]}_{m \times n})

.

Level 3: Find the

+ v e

and

- v e

ideal solutions (PIS and NIS).

Level 4: Calculate the separation measures for both ideal solutions.

Level 5: Finalize the best alternative.

Any educational institution needs to evaluate the quality of the faculty members in the four different positions

A = (A_{1}, A_{2}, A_{3}, A_{4})

according to four criteria: self-evaluation

{(C}_{1})

, managerevaluation

{(C}_{2})

, peer evaluation

(C_{3}),

and student-based evaluation

{(C}_{4})

. In every appraisal of the institution, we must measure the quality and quantity of the work performed by different designations of the faculty members. This is mandatory for the gradual growth of the institution. Based on the past five years of data in an educational institution, we construct a decision matrix in terms of the Interval-valued Fermatean Neutrosophic values. Since measuring the faculty’s strength is not based on an exact single value and these values fail under the uncertainty environment, we use

I V F F_{s e t} .

The past five years data was obtained through a questionnaire prepared and circulated among all faculty members at a leading education institute in south India.

Level 1: For a multiple attribute decision-making problem, let

C = (C_{1}, C_{2}, C_{3}, C_{4})

be a discrete set of alternatives.

A = (A_{1}, A_{2}, A_{3}, A_{4})

be the set of attributes.

W = {(w_{1}, w_{2}, w_{3}, w_{4})}^{T}

be the weighting vector of the attributes, and

\sum_{j = 1}^{4} w_{j = 1}

where

ω = {(0.30, 0.30, 0.20)}^{T}

be unknown.

In Level 1, the construct decision matrix,

C = {[c_{i j}]}_{m \times n}

is the decision matrix, where

〈[{T r}_{A}^{-} (k), {T r}_{A}^{+} (k)], [{I m}_{A}^{-} (k), {I m}_{A}^{+} (k)], [{F a}_{A}^{-} (k), {F a}_{A}^{+} (k)]〉

and is in the form of the

I V F F_{s e t}

.

See in Table 5.

That is, the DM matrix

C = (\begin{matrix} ([0.85, 0.90], [0.85, 0.85], [0.80, 0.80]) & ([0.85, 0.85], [0.85, 0.87], [0.83, 0.85]) & ([0.81, 0.91], [0.86, 0.89], [0.82, 0.86]) & ([0.87, 0.92], [0.85, 0.85], [0.80, 0.80]) \\ ([0.85, 0.91], [0.85, 0.86], [0.80, 0.84]) & ([0.82, 0.90], [0.80, 0.85], [0.80, 0.80]) & ([0.85, 0.92], [0.85, 0.85], [0.80, 0.83]) & ([0.85, 0.91], [0.80, 0.85], [0.81, 0.85]) \\ ([0.85, 0.93], [0.85, 0.87], [0.80, 0.81]) & ([0.85, 0.91], [0.81, 0.85], [0.80, 0.80]) & ([0.85, 0.91], [0.85, 0.87], [0.80, 0.82]) & ([0.80, 0.90], [0.85, 0.85], [0.80, 0.80]) \\ ([0.85, 0.94], [0.85, 0.88], [0.80, 0.82]) & ([0.85, 0.92], [0.82, 0.85], [0.80, 0.80]) & ([0.82, 0.92], [0.85, 0.85], [0.82, 0.82]) & ([0.80, 0.94], [0.83, 0.85], [0.80, 0.80]) \end{matrix})

The numbers

([0.85, 0.90], [0.85, 0.85], [0.80, 0.80])

, corresponding to

A_{1}

and

C_{1}

, represent that the degree of

A_{1}

supports

C_{1},

which lies in [

0.85, 0.90

], but the degree of

A_{1}

does not support

C_{1}

, which lies in

[0.85, 0.85]

. Also, the degree of

A_{1}

neutral to

C_{1},

which lies in

[0.80, 0.80]

. All other degrees of alternativehave the same meaning.

In general, benefit and cost fall into these two categories. Normalize these values into a dimensionless matrix through which criteria can be compared easily. The construction of a Normalized Decision Matrix (NDM) is obtained at the next level by using the rule below:

R = {[r_{i j}]}_{m \times n} is the NDM, where R = \{\begin{matrix} d_{i j}, i f c r i t e r i o n C_{i j} i s o f t h e b e n e f i t t y p e \\ \bar{d_{i j}}, i f c r i t e r i o n C_{i j} i s o f t h e c o s t t y p e \end{matrix} \bar{d_{i j}} = 〈[F_{A}^{-} (p), F_{A}^{+} (p)], [{1 - I}_{A}^{-} (p), 1 - I_{A}^{+} (p)], [T_{A}^{-} (p), T_{A}^{+} (p)]〉

Level 2: As the criteria of

C_{2}

and

C_{4}

are the cost criteria and

C_{1}

and

C_{3}

are the benefit criteria, the NFM-DM of R is given by

R = (\begin{matrix} ([0.85, 0.90], [0.85, 0.85], [0.80, 0.80]) & ([0.83, 0.85], [0.15, 0.13], [0.85, 0.85]) & ([0.81, 0.91], [0.86, 0.89], [0.82, 0.86]) & ([0.80, 0.80], [0.15, 0.15], [0.87, 0.92]) \\ ([0.85, 0.91], [0.85, 0.86], [0.80, 0.84]) & ([0.80, 0.80], [0.20, 0.15], [0.82, 0.90]) & ([0.85, 0.92], [0.85, 0.85], [0.80, 0.83]) & ([0.81, 0.85], [0.20, 0.15], [0.85, 0.91]) \\ ([0.85, 0.93], [0.85, 0.87], [0.80, 0.81]) & ([0.80, 0.80], [0.19, 0.15], [0.85, 0.91]) & ([0.85, 0.91], [0.85, 0.87], [0.80, 0.82]) & ([0.80, 0.80], [0.15, 0.15], [0.80, 0.90]) \\ ([0.85, 0.94], [0.85, 0.88], [0.80, 0.82]) & ([0.80, 0.90], [0.18, 0.15], [0.85, 0.92]) & ([0.82, 0.92], [0.85, 0.85], [0.82, 0.82]) & ([0.80, 0.80], [0.17, 0.15], [0.80, 0.94]) \end{matrix})

Level 3: Converting R into their collective score matrix—using

S_{3} (α)

M = (\begin{matrix} 0.3919 & 0.4892 & 0.4397 & 0.4183 \\ 0.4224 & 0.4412 & 0.4208 & 0.4548 \\ 0.4280 & 0.4273 & 0.4170 & 0.4505 \\ 0.4458 & 0.4665 & 0.4056 & 0.4319 \end{matrix})

Level 4: In this level, ideal solutions consist of selecting the best values for each attribute from all alternatives.

Generally, the values of

l^{+}

are complements of

l^{-}

and vice versa. The degree of

l^{+}

to 1 and 0 is fixed, but the decision-maker may vary it. Hence, we consider

I V F N P I_{s e t} l^{+} a n d I V F N N I_{s e t} l^{-}

as follows:

l^{+} = 〈[\max (a_{i j}), \max (b_{i j})]; [\min (c_{i j}), \min (d_{i j})]; [\min (e_{i j}), \min (f_{i j})]〉 l^{-} = 〈[\min (a_{i j}), \min (b_{i j})]; [\max (c_{i j}), \max (d_{i j})]; [\max (e_{i j}), \max (f_{i j})]〉 among all attributes .

The PIS and NIS of two alternatives are found as

l^{+} = {〈[0.85, 0.94]; [0.82, 0.85]; [0.80, 0.80]〉, 〈[0.85, 0.92]; [0.80, 0.85]; [0.80, 0.80]〉, 〈[0.85, 0.92]; [0.85, 0.85]; [0.80, 0.82]〉, 〈[0.87, 0.94]; [0.80, 0.85]; [0.80, 0.80]〉} l^{-} = {〈[0.85, 0.90]; [0.85, 0.88]; [0.80, 0.84]〉, 〈[0.82, 0.85]; [0.85, 0.87]; [0.83, 0.85]〉, 〈[0.81, 0.91]; [0.86, 0.89]; [0.83, 0.86]〉, 〈[0.80, 0.90]; [0.85, 0.85]; [0.81, 0.85]〉 S_{3} (l^{+}) = (\begin{matrix} 0.4127 & 0.3537 & 0.4161 & 0.4194 \end{matrix}) S_{3} (l^{-}) = (\begin{matrix} 0.4245 & 0.3593 & 0.4459 & 0.3863 \end{matrix})

The distance between

A_{i}

and the ideal solution is calculated in level 5

\begin{matrix} M_{i}^{+} = \sum_{j = 1}^{n} d (A_{i j}, A_{j}^{+}) = \sqrt{\sum_{j = 1}^{n} {[w_{j} {(S_{3} (l^{+}) - S_{3} (r_{i j}))}^{2}]}^{2}} \\ M_{i}^{-} = \sum_{j = 1}^{n} d (A_{i j}, A_{j}^{-}) = \sqrt{\sum_{j = 1}^{n} {[w_{j} {(S_{3} (r_{i j}) - S_{3} (l^{-}))}^{2}]}^{2}} \end{matrix}

Level 5: To compute the closeness coefficient (CC):

C C_{K} = \frac{M_{K}^{-}}{M_{K}^{-} + M_{K}^{+}}, K = 1, 2, 3, 4

See in Table 6.

Level 6: Based on the values of

C_{i}

, we rank the alternatives and select the best alternative(s). Therefore, the final and optimized ranking of the four major alternatives is

A_{4} ≻ A_{3} ≻ A_{2} ≻ A_{1}

, and thus, the best alternative is

A_{4}

.

6. Results and Discussion

In this approach, we describe a combination of quantitative assessment and multi-criteria decision-making models to evaluate lecturers’ performances from various perspectives: self-assessment, peer assessment, managerial assessment, and student-based evaluation. This approach aims to overcome the challenge of differentiating between lecturers’ potential capacities and their actual teaching effectiveness. In our article, we have introduced a new variant of the

N_{s e t}

called Interval-Valued Fermatean Neutrosophic Set

(I V F N_{s e t}) .

This new variant specifically deals with situations where there is partial ignorance, leading to uncertainty about whether something is true, false, or exists in an uncertain region. This concept is applied independently to a multi-decision process. This study expands upon the concept of Fermatean Neutrosophic Set

(F N_{s e t})

, presenting an extension in the form of the

I V F N_{s e t}

. The article highlights the algebraic properties and set theoretical aspects of the

I V F N_{s e t}

, likely discussing how this new variant handles and represents partial ignorance in more detail. This research appears to be addressing a crucial challenge in education by proposing an innovative approach that considers various assessment perspectives and handles uncertainty effectively through the

I V F N_{s e t}

. The presented results highlight the practical application and effectiveness of our methodology in making informed decisions about lecturers’ performances.

Faculty evaluation is a crucial component of higher education institutions and plays a significant role in shaping educational goals and national development strategies. Evaluating faculty performance is essential for maintaining teaching competency, promoting scientific research, and creating a conducive learning environment. The importance of evaluating faculty performance in terms of teaching competency as a tool for decision-making, including employment and dismissal in this assessment, is seen as a means to ensure the quality of education and contribute to the overall development of the country’s education system. Higher educational institutions should function as scientific research centers and encourage faculty to engage in research activities. This dual role of teaching and research contributes to the institution’s credibility and the advancement of knowledge. Faculty evaluation is seen as a way to create an equal environment that fosters cooperative strategies among faculty members and nurtures the learning spirit of each student. This suggests that a well-structured evaluation system can positively impact the overall educational atmosphere. Assessing faculty performance provides a comprehensive perspective on the institution’s achievements, including improving learning outcomes, identifying and nurturing young talents, and indirectly contributing to the country’s wealth. Such assessments also establish the institution’s reputation at both global and local levels. The evaluation process involves various complex factors such as personal interests, development strategies, and fairness in assessment. It is acknowledged that fair and accurate assessment is challenging and requires a multi-dimensional approach, including input from principals/managers, students, and peer reviews. The absence of appropriate standards and tools can lead to inaccuracies and subjectivity in evaluating faculty competence. We suggest that a well-rounded, multi-dimensional assessment process can enhance faculty knowledge, teaching capabilities, and professional development. As a whole, the multifaceted nature of faculty evaluation, its significance in the educational landscape, and the challenges associated with implementing a fair and effective assessment system place an emphasis on considering local context, fostering research, and promoting a cooperative learning environment. This underscores the holistic approach required to evaluate and enhance faculty performance in higher education institutions.

The criteria and methods used in a Multi-Criteria Decision-Making (MCDM) process assess the performance and relative importance of lecturers. We have mentioned two popular MCDM models—the Analytical Hierarchy Process (AHP) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS)—that are commonly used to handle such assessments. The assessment process involves evaluating lecturers based on standards related to research capacity, teaching capacity, and service activities. These criteria are likely important aspects in determining the overall performance of lecturers. MCDM involves making decisions based on multiple criteria that might be conflicting or competing. It is a way to handle complex decision scenarios that cannot be addressed using single criteria. AHP is a widely used MCDM method that breaks down complex problems into a hierarchical structure of criteria and sub-criteria. It allows assigning weights to these criteria based on their relative importance and then comparing alternatives based on these weighted criteria. AHP is particularly useful for dealing with structured problems and hierarchical decision contexts. The application of Neutrosophic Sets and related concepts in the context of lecturer evaluation uses Multi-Criteria Decision-Making (MCDM) techniques. Smarandache [2] introduced the concept of a Neutrosophic Set, which is characterized by three membership degrees: truth membership (T), indeterminacy membership (I), and falsity membership (F). These membership degrees are defined within the real standard or nonstandard unit interval. This concept allows for dealing with uncertainty and imprecision in various domains, including education. Neutrosophic Sets can be applied to educational problems when dealing with ranges that fall within the defined interval. This approach can help address issues related to imprecision and uncertainty in educational contexts. Wang et al. [3] introduced the concepts of a single-valued Neutrosophic Set and an interval-valued Neutrosophic Set. The interval-valued Neutrosophic Set extends the concept of the Neutrosophic Set by incorporating interval values for the membership degrees. This approach has been used in various fields, including decision-making sciences, social sciences, and the humanities, to handle problems involving vague, indeterminate, and inconsistent information. Ye [31] introduced the interval Neutrosophic Linguistic Set, which involves new aggregation operators for interval Neutrosophic linguistic information. This concept contributes to handling uncertain linguistic information. Broumi et al. [39] extended the TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) method to accommodate uncertain linguistic information within interval Neutrosophic Sets. This extension allows for decision-making when dealing with complex and uncertain data. The passage highlights that there is a lack of research integrating hierarchical TOPSIS with interval Fermatean Neutrosophic Sets, especially in the context of lecturer evaluation. This integration could address the limitations of traditional approaches to evaluating lecturers, which often face complexity and uncertainty. The study presented in the passage focuses on evaluating lecturers using MCDM models. The goal is to combine the hierarchical Neutrosophic TOPSIS technique, and the interval-valued complex set in a Neutrosophic environment to improve lecturer evaluation. The application of Neutrosophic Sets and related concepts to address the challenges of uncertainty and imprecision in lecturer evaluation uses MCDM techniques. By combining these innovative approaches, this study aims to provide a more effective and robust framework for assessing and ranking lecturers’ performances.

Comparing with other models: The following table lists the results of the comparison. The proposed method and the classic TOPSIS method can solve problems in uncertain environments. However, the TOPSIS and AHP techniques have some disadvantages in terms of calculation methods and results. Moreover, the extent of the interval-valued Neutrosophic TOPSIS does not consider the capacity of each lecturer in the specific time period.

Method	Ranking
Interval neutrosophic TOPSIS (Chi and Liu [40]). Chi, P., and Liu, P. (2013). An extended TOPSIS method for the multiple attribute decision making problems based on interval neutrosophic set. Neutrosophic Sets and Systems, 1, 1–8.	$A_{2} > A_{3} > A_{5} > A_{1} > A_{4}$
AHP (Saaty [41]) Saaty, T. L. (1980). The analytic hierarchy process. New York, NY: McGraw-Hill Inc, 17–34.	$A_{3} > A_{2} > A_{5} > A_{4} > A_{1}$
TOPSIS (Hwang and Yoon [26]) Hwang, C.-L., and Yoon, K. (1981). Multiple Attribute Decision Making: Methods and Applications A State-of-the-Art Survey. Berlin Heidelberg: Springer-Verlag.	$A_{3} > A_{2} > A_{5} > A_{4} > A_{1}$
Interval complex Neutrosophic set (Anh Duc Doet al. [36]) Anh Duc Doa, Minh Tam Pham, Thi Hang Dinh, The Chi Ngo, Quoc Dat Luue, Ngoc Thach Phamf, Dieu Linh Hag, and Hong Nhat Vuong, Evaluation of lecturers’ performance using a novel hierarchical multi-criteria model based on an interval complex Neutrosophic set, Decision Science Letters 9 (2020) 119–14.	$A_{1} > A_{3} > A_{2} > A_{5} > A_{4}$
The present work evaluates the quality of the faculty members in the four different positions $A = (A_{1}, A_{2}, A_{3}, A_{4}$ ) according to four criteria, namely self-evaluation ${(C}_{1})$ , managerevaluation ${(C}_{2})$ , peer evaluation $(C_{3})$ , and student-based evaluation ${(C}_{4})$ .	$A_{4} ≻ A_{3} ≻ A_{2} ≻ A_{1}$

7. Conclusions

In this article, our study developed a comprehensive assessment methodology using a hierarchical structure and a hierarchical TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) approach, incorporating interval-valued complex Neutrosophic Sets for evaluating lecturer capability. The goals of this study seem to include addressing the potential competition between lecturers that can arise from such evaluations and ensuring fairness and transparency in the process. This study’s methodology is designed to handle the complexity of assessment and decision-making in education and management systems. The hierarchical approach is then compared with other related methods to highlight its advantages and practicality. The results indicate that the proposed approach is effective and not limited to just lecturer evaluation; it can potentially be applied to other decision-making problems as well. However, as mentioned, there are certain limitations to this study. Unfortunately, you have not specified what those limitations are. Nonetheless, you also mentioned that future work is proposed to enhance the accuracy of lecturer evaluation. This improvement could be valuable for supporting real-world, dynamic decision-making in educational contexts. In summary, this study appears to contribute a novel approach to lecturer evaluation using a hierarchical structure and TOPSIS methodology, with an emphasis on fairness and transparency. The results suggest its efficiency and broader applicability, though there are acknowledged limitations that may guide future research.

This paper introduces the concept of the

I V F N_{s e t}

and its algebraic properties with an example. Also, we introduce a new set of score functions for the

I V F N_{s e t}

and use these functions to evaluate the lectures’ performances that were studied.

8. Further Study

To define interval-valued Fermatean Neutrosophic Numbers.
To study the interval-valued Triangular Fermatean Neutrosophic Linear Programming Problem.
To study the interval-valued Fermatean trapezoidal and Fermatean triangular Neutrosophic numbers.

Author Contributions

Conceptualization, R.S. and M.S.; methodology, R.S.; validation, R.S., M.S., and S.B.; formal analysis, S.B. and M.T.; investigation, S.B. and M.V.; writing—original draft preparation, R.S.; writing—review and editing, S.B. and M.V; visualization, P.K.S. All authors have read and agreed to the published version of the manuscript.

Funding

There is no funding for this paper.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank the anonymous reviewers for their valuable comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
Smarandache, F. Neutrosophic set—A generalization of the intuitionistic fuzzy set. Int. J. Pure Appl. Math. 2005, 24, 287–297. [Google Scholar] [CrossRef]
Wang, H.; Smarandache, F.; Sunderraman, R.; Zhang, Y.Q. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
Wang, H.; Smarandache, F.; Sunderraman, R.; Zhang, Y.Q. Interval neutrosophic sets and logic: Theory and applications in computing: Theory and applications in computing. Infin. Study 2005, 5, 21–38. [Google Scholar]
Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, Edmonton, AB, Canada, 24–28 June 2013. [Google Scholar]
Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision-making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
Yager, R.R. Pythagorean membership grades in multi-criteria decision-making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
Jansi, R.; Mohana, K.; Smarandache, F. Correlation Measure for Pythagorean Neutrosophic Sets with T and F as Dependent Neutrosophic Components. Neutrosophic Sets Syst. 2019, 30, 16. [Google Scholar]
Garg, H. A novel accuracy function under interval-valued Pythagorean fuzzy environment for solving multicriteria decision making problem. J. Intell. Fuzzy Syst. 2016, 31, 529–540. [Google Scholar] [CrossRef]
Senapati, T.; Yager, R. Fermatean Fuzzy Sets. J. Ambient Intell. Humaniz. Comput. 2019, 11, 663–674. [Google Scholar] [CrossRef]
Sweety, C.A.C.; Jansi, R. Fermatean Neutrosophic Sets. Int. J. Adv. Res. Comput. Commun. Eng. 2021, 10, 24–27. [Google Scholar]
Peng, X.; Yang, Y. Fundamental Properties of Interval-Valued Pythagorean Fuzzy Aggregation Operators. Int. J. Intell. Syst. 2016, 31, 444–487. [Google Scholar] [CrossRef]
Stephen, S.; Helen, M. Interval-valued Neutrosophic Pythagorean Sets and their Application in decision-making using IVNP-TOPSIS. Int. J. Innov. Res. Sci. Eng. Technol. (IJIRSET) 2021, 10, 114571–114578. [Google Scholar]
Thamizhendhi, G.; Kiruthica, C.; Suresh, S. Fematean fuzzy hypergraph. J. Hunan Univ. Nat. Sci. 2021, 48, 2333–2340. [Google Scholar]
Rani, P.; Mishra, A.R. Interval-valued fermatean fuzzy sets with multi-criteria weighted aggregated sum product assessment-based decision analysis framework. Neural Comput. Appl. 2022, 34, 8051–8067. [Google Scholar] [CrossRef] [PubMed]
Jeevaraj, S. Ordering of interval-valued Fermatean fuzzy sets and its applications. Expert Syst. Appl. 2021, 185, 115613. [Google Scholar] [CrossRef]
Palanikumar, M.; Iampan, A. Spherical Fermatean Interval Valued Fuzzy Soft Set Based on Multi Criteria Group decision-making. ICIC Int. 2022, 18, 607–619. [Google Scholar]
Liu, D.; Liu, Y.; Chen, X. Fermatean fuzzy linguistic set and its application in multicriteria decision making. Int. J. Intell. Syst. 2018, 34, 878–894. [Google Scholar] [CrossRef]
Broumi, S.; Sundareswaran, R.; Shanmugapriya, M.; Nordo, G.; Talea, M.; Bakali, A.; Smarandache, F. Interval-Valued Fermatean Neutrosophic Graphs, Decision-Making: Applications in Management and Engineering; SCImago Journal Rank: Belgrade, Serbia, 2022. [Google Scholar]
Gorzałczany, M.B. A method of inference in approximate reasoning based on interval-valued fuzzy sets. Fuzzy Sets Syst. 1987, 21, 1–17. [Google Scholar] [CrossRef]
Zhang, H.Y.; Wang, J.Q.; Chen, X.H. Interval neutrosophic sets and their application in multicriteria decision-making problems. Sci. World J. 2014, 15, 645953. [Google Scholar] [CrossRef]
Wang, T. The Projection Model with Unknown Weight Information under Interval Neutrosophic Environment and Its Application to Software Quality-in-Use Evaluation. Math. Probl. Eng. 2020, 2020, 7279420. [Google Scholar] [CrossRef]
Broumi, S.; Sundareswaran, R.; Shanmugapriya, M.; Bakali, A.; Talea, M. Theory and Applications of Fermatean Neutrosophic Graphs. Neutrosophic Sets Syst. 2022, 50, 248–286. [Google Scholar]
Singh, A.; Bhat, S.A. A novel score and accuracy function for neutrosophic sets and their real-world applications to multi-criteria decision-making process. Neutrosophic Sets Syst. 2021, 41, 168–197. [Google Scholar]
Garg, H. A novel correlation coefficient between pythagorean fuzzy sets and its applications to decision-making processes. Int. J. Intell. Syst. 2016, 31, 1234–1253. [Google Scholar] [CrossRef]
Hwang, C.L.; Yoon, K. Multiple Attribute Decision-Making; Springer: Berlin, Germany, 1981. [Google Scholar]
Nayagam, V.L.G.; Jeevaraj, S.; Sivaraman, G. Complete Ranking of Intuitionistic Fuzzy Numbers. Fuzzy Inf. Eng. 2008, 8, 1971–1974. [Google Scholar] [CrossRef]
Nayagam, V.L.G.; Jeevaraj, S.; Dhanasekaran, P. An intuitionistic fuzzy multi-criteria decision-making method based on non-hesitance score for interval-valued intuitionistic fuzzy sets. Soft Comput. 2018, 21, 7077–7082. [Google Scholar] [CrossRef]
Xu, Z.S. Method for aggregating interval-valued intuitionistic fuzzy information and their application to decision-making. Control. Decis. 2007, 22, 1179–1187. [Google Scholar]
Liu, Y.; Xie, N. Amelioration operators of fuzzy number intuitionistic fuzzy geometric and their application to Multi-criteria decision-making. In Proceedings of the 2009 Chinese Control and Decision Conference, Guilin, China, 17–19 June 2009; pp. 6172–6176. [Google Scholar] [CrossRef]
Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar] [CrossRef]
Ye, J. Multicriteria decision-making method using the correlation coefficient under single-value neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–439. [Google Scholar] [CrossRef]
Garg, H. Generalized intuitionistic fuzzy multiplicative interactive geometric operators and their application to multiple criteria decision-making. Int. J. Machine Learn. Cybern. 2016, 7, 1075–1092. [Google Scholar] [CrossRef]
Sahin, R. Multi-criteria neutrosophic decision-making method based on score and accuracy functions under neutrosophic environment. arXiv 2014, arXiv:1412.5202. [Google Scholar]
Garg, H. An Improved Score Function for Ranking Neutrosophic Sets and Its Application to Decision-Making Process. Int. J. Uncertain. Quantif. 2016, 6, 377–385. [Google Scholar] [CrossRef]
Sahoo, L. Similarity measures for Fermatean fuzzy sets and its applications in group decision-making. Decis. Sci. Lett. 2022, 11, 167–180. [Google Scholar]
Do, A.D.; Pham, M.T.; Dinh, T.H.; Ngo, T.C.; Luu, Q.D.; Pham, N.T.; Ha, D.L.; Vuong, H.N. Evaluation of lecturers’ performance using a novel hierarchical multi-criteria model based on an interval complex Neutrosophic set. Decis. Sci. Lett. 2020, 119–144. [Google Scholar] [CrossRef]
Wu, H.-Y.; Chen, J.-K.; Chen, I.-S.; Zhuo, H.-H. Ranking universities based on performance evaluation by a hybrid MCDM model. Measurement 2012, 45, 856–880. [Google Scholar] [CrossRef]
Broumi, S.; Ye, J.; Smarandache, F. An Extended TOPSIS Method for Multiple Attribute Decision Making based on Interval Neutrosophic Uncertain Linguistic Variables. Neutrosophic Sets Syst. 2015, 8, 22–31. [Google Scholar]
Chi, P.; Liu, P. An Extended TOPSIS Method for the Multiple Attribute Decision Making Problems Based on Interval Neutrosophic Set. Neutrosophic Sets Syst. 2013, 1, 63–70. [Google Scholar]
Saaty, T.L. The Analytic Hierarchy Process; McGraw-Hill: New York, NY, USA, 1980. [Google Scholar]

Figure 1. A graphical visualization of the Intuitionistic, Pythagorean, and Fermatean Fuzzy sets.

Figure 2. Geometric representation of the

I V N_{s e t}, I V P N_{s e t}, a n d I V F N_{s e t}

.

Figure 2. Geometric representation of the

I V N_{s e t}, I V P N_{s e t}, a n d I V F N_{s e t}

.

Figure 3. Lecturer evaluation—criteria.

Figure 4. Modified criteria used in lecturer evaluation.

Table 1. Acronyms.

Abbreviations	Full Phrase
Fuzzy Set	FS
Intuitionistic Fuzzy Set	IFS
Neutrosophic Set	NS
Interval valued Pythagorean neutrosophic sets	IVPNS
Interval-valued Fermatean neutrosophic set	IVFNS
Interval valued neutrosophic sets	IVNS
Pythagorean Fuzzy Set	PFS
Fermatean Fuzzy set	FFS
Interval-valued Fermatean Fuzzy numbers.	IVFFN
Interval-valued Fermatean Fuzzy sets	IVFFS
Hesitant Fermatean fuzzy sets	HFFS
Interval valued hesitant Fermatean fuzzy sets	IVHFFS
Multi-Criteria decision-making	MCDM
Technique for Order of Preference by Similarity to Ideal Solution	TOPSIS
Interval-valued Fermatean fuzzy TOPSIS	IVFFTOPSIS
Single valued neutrosophic set	SVNS
Fermatean neutrosophic graph	$F N_{g r a p h}$

Table 2. Literature Survey.

Authors	Topic	Year
Nayagam et al. [27,28]	Ranking method on the $I V I F_{s e t} .$	2007 and 2008
Xu, Liu, and Xie [29,30]	Weighted SF and AF to rank the $I V I F_{s e t .}$	2007 and 2009
Ye [31]	Novel AF for ranking the different alternatives under the $I F_{s e t} a n d I V I F_{s e t} .$	2009
Yager [6]	Aggregation operators in the Pythagorean environment.	2013
Ye [32]	Correlation coefficient under $S V N_{s e t}$ .	2013
Yager [7]	$P F_{s e t}$ .	2014
Garg [9]	AF for the $I V P F_{s e t}$ .	2016
Garg [25]	$I P F W_{a v e r a g e} a n d I P F W_{g r a p h}$ operators in the DM problem in the $I V P F_{s e t}$ environment.	2016
Garg [25]	Correlation coefficient between the $P F_{s e t} .$	2016

Table 3. Values of score functions for different membership values.

a	b	c	d	e	f	$S_{1}$	$S_{2}$	$S_{3}$
0.8	0.85	0.85	0.8	0.9	0.92	−0.753833	0.46999225	0.420965198
0.8	0.85	0.85	0.85	0.9	0.91	−0.792348	0.47961825	0.442667238
0.8	0.8	0.85	0.85	0.9	0.95	−0.8953125	0.479828125	0.439103631
0.8	0.85	0.82	0.85	0.9	0.91	−0.7609695	0.471773625	0.4243537
0.8	0.85	0.85	0.85	0.85	0.91	−0.7349105	0.465258875	0.406265978
0.85	0.9	0.8	0.8	0.8	0.85	−0.4545625	0.449421875	0.397060871

Table 4. Criteria and sub-criteria—Lecturer evaluation framework.

Name and Number Criteria	Description
Scientific publication ( $C_{11}$ )	Faculty research publication in reputed journals is an important factor in the academic community in developing countries. The proportionality of the number of published articles in the last two years with the total in a year is measured by this criterion.
Supervising research scholars ( $C_{12}$ )	Guiding the scholar is an essential criterion for the evaluation of a lecturer in any academic institution. Scholars expect their supervisors to be more efficient people and should have updated knowledge to perform their research activities. The number of scholars under a lecturer is also one of the key factors for this criterion. If the supervisor needs the minimum time to publish an article with their scholars, this reflects the capability of the lecturer.
Serve Journal reviewer ( $C_{13})$	Becoming a peer reviewer in an indexed journal is one of the most important steps to reaching academic success as a lecturer. This will happen only when a lecturer has more knowledge in their research field. Lecturers’ feedback about the submitted articles, suggestions to improve the article, and recommendations to the editors of the journal about the status of the articles.
Lecturing activities $(C_{21})$	It represents the number of hours a lecturer has spent teaching the subject to their students according to the allotted slot. In general, at the institutions, the duration of each lecture is about 50 mins to 1h. The number of publications can be considered with lecture time.
Language of instruction $(C_{22})$	This criterion measures the use of the lecturer’s non-native language.
Lecturing attitude $(C_{23})$	Lecturing attitude includes coming to class late, canceling classes without a reason, etc.
Cooperation in research (internally funded) projects $(C_{31})$	Under this criterion, the lecturer gives importance to maintaining research records and involvement to reduce the time spent complementing the projects while also exchanging their knowledge.
Teamwork in scientific and teaching activities $(C_{32})$	This criterion includes the lecturer’s contribution in various fields and the number of resources to increase the count of research publications as a team. Inter-department research publications contribute more to the institutional ranking system.
Participation in institutional meetings and events $(C_{33})$	Organizing institutional events like convocation, college day, scholarship day, and sports day will be successful only when lecturers build good relationships with their co-workers and students.
The content of the lessons ( $C_{41}$ )	The teaching and learning process involves the quality of the teaching materials given, and lecturers should elaborate on real-world problems during their lectures.
Student–Lecturer ( $C_{42}$ )	A healthy relationship between Lecturer–student includes the expectation that the lecturer should share their experience and knowledge among all the students without any special treatment or discrimination. Lecturers should maintain a decent relationship with their students and respect the decorum of their institution.
Motivating the students ( $C_{43}$ )	Each lecturer acts as a mentor for at least a small group of students. Lecturers should advise the students regarding internal problems like the interactions of each student with their classmates, family issues, and disciplinary actions.

Table 5. Criteria and alternatives with interval-valued Fermatean Neutrosophic values.

Alternatives\ Criteria	$A_{1}$	$A_{2}$	$A_{3}$	$A_{4}$
$C_{1}$	([0.85, 0.90], [0.85, 0.85], [0.80, 0.80])	([0.85, 0.85], [0.85, 0.87], [0.83, 0.85])	([0.81, 0.91], [0.86, 0.89], [0.82, 0.86])	([0.87, 0.92], [0.85, 0.85], [0.80, 0.80])
$C_{2}$	([0.85, 0.91], [0.85, 0.86], [0.80, 0.84])	([0.82, 0.90], [0.80, 0.85], [0.80, 0.80])	([0.85, 0.92], [0.85, 0.85], [0.80, 0.83])	([0.85, 0.91], [0.80, 0.85], [0.81, 0.85])
$C_{3}$	([0.85, 0.93], [0.85, 0.87], [0.80, 0.81])	([0.85, 0.91], [0.81, 0.85], [0.80, 0.80])	([0.85, 0.91], [0.85, 0.87], [0.80, 0.82])	([0.80, 0.90], [0.85, 0.85], [0.80, 0.80])
$C_{4}$	([0.85, 0.94], [0.85, 0.88], [0.80, 0.82])	([0.85, 0.92], [0.82, 0.85], [0.80, 0.80])	([0.82, 0.92], [0.85, 0.85], [0.82, 0.82])	([0.80, 0.94], [0.83, 0.85], [0.80, 0.80])

Table 6. Closeness coefficient for each alternative.

$B_{i}$	$M_{i}^{+}$	$M_{i}^{-}$	$C C_{i}$
$A_{1}$	0.0055	0.0051	0.4793
$A_{2}$	0.0023	0.0022	0.4902
$A_{3}$	0.0016	0.0071	0.8134
$A_{4}$	0.0038	0.0597	0.9396

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

Share and Cite

MDPI and ACS Style

Broumi, S.; Sundareswaran, R.; Shanmugapriya, M.; Singh, P.K.; Voskoglou, M.; Talea, M. Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets. Mathematics 2023, 11, 3817. https://doi.org/10.3390/math11183817

AMA Style

Broumi S, Sundareswaran R, Shanmugapriya M, Singh PK, Voskoglou M, Talea M. Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets. Mathematics. 2023; 11(18):3817. https://doi.org/10.3390/math11183817

Chicago/Turabian Style

Broumi, Said, Raman Sundareswaran, Marayanagaraj Shanmugapriya, Prem Kumar Singh, Michael Voskoglou, and Mohamed Talea. 2023. "Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets" Mathematics 11, no. 18: 3817. https://doi.org/10.3390/math11183817

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

Article Menu

Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets

Abstract

1. Introduction

2. Prerequisites

3. Interval-Valued Fermatean Neutrosophic Sets $(I V F N_{s e t})$

4. Score and Accuracy Function for the $I V F N_{n u m b e r}$

5. Applications of Interval-Valued Fermatean Neutrosophic Numbers

6. Results and Discussion

7. Conclusions

8. Further Study

Author Contributions

Funding

Data Availability Statement

Acknowledgments

Conflicts of Interest

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI

Article Menu

Faculty Performance Evaluation through Multi-Criteria Decision Analysis Using Interval-Valued Fermatean Neutrosophic Sets

Abstract

1. Introduction

2. Prerequisites

3. Interval-Valued Fermatean Neutrosophic Sets ( I V F N s e t )

4. Score and Accuracy Function for the I V F N n u m b e r

5. Applications of Interval-Valued Fermatean Neutrosophic Numbers

6. Results and Discussion

7. Conclusions

8. Further Study

Author Contributions

Funding

Data Availability Statement

Acknowledgments

Conflicts of Interest

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI

3. Interval-Valued Fermatean Neutrosophic Sets $(I V F N_{s e t})$

4. Score and Accuracy Function for the $I V F N_{n u m b e r}$