Multi-Attribute Decision-Support System Based On Aggregations of Interval-Valued Complex Neutrosophic Hypersoft Set

Hindawi
Applied Computational Intelligence and So Computing

Volume 2021, Article ID 4368770, 28 pages
https://doi.org/10.1155/2021/4368770
Research Article
Multi-Attribute Decision-Support System Based on
Aggregations of Interval-Valued Complex Neutrosophic
Hypersoft Set
Atiqe Ur Rahman ,1 Muhammad Saeed ,1 Muhammad Arshad ,1 and Salwa El-Morsy 2,3
1
Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan
2
Basic Science Department, Nile Higher Institute for Engineering and Technology, Mansoura 35511, Egypt
3
Department of Mathematics, College of Science and Arts, Qassim University, Al-Badaya, 51452, Saudi Arabia
Correspondence should be addressed to Muhammad Saeed; muhammad.saeed@umt.edu.pk
Received 12 September 2021; Revised 3 November 2021; Accepted 21 November 2021; Published 25 December 2021
Academic Editor: Shyi-Ming Chen
Copyright © 2021 Atiqe Ur Rahman et al. This is an open access article distributed under the Creative Commons Attribution
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is
properly cited.
Hypersoft set is an emerging field of study that is meant to address the insufficiency and the limitation of existing soft-set-like
models regarding the consideration and the entitlement of multi-argument approximate function. This type of function maps the
multi-subparametric tuples to the power set of the universe. It focuses on the partitioning of each attribute into its attribute-valued
set that is missing in existing soft-set-like structures. This study aims to introduce novel concepts of complex intuitionistic fuzzy
set and complex neutrosophic set under the hypersoft set environment with interval-valued settings. Two novel structures, that is,
interval-valued complex intuitionistic hypersoft set (IV-CIFHS-set) and interval-valued complex neutrosophic hypersoft set (IV-
CNHS-set), are developed via employing theoretic, axiomatic, graphical, and algorithmic approaches. After conceptual char-
acterization of essential elementary notions of these structures, decision-support systems are presented with the proposal of
algorithms to assist the decision-making process. The proposed algorithms are validated with the help of real-world applications.
A comprehensive inter-cum-intra comparison of proposed structures is discussed with the existing relevant models, and their
generalization is elaborated under certain evaluating features.
1. Introduction to emulate the available information more precisely and

rationally. As far as the consideration of the degree of in-
The traditional logic (i.e., Boolean logic) is not always determinacy was concerned, both F.Sets and IF.Set were
pertinent in real-world scenarios, where the available data is inadequate for such kind of grade, so neutrosophic sets
vague or imprecise. To deal with such kinds of situations, a (N.Sets) were initiated by Smarandache [3] to cope with such
particular class of sets known as fuzzy sets (F.Sets) that were shortcoming. N.Sets are more capable to maintain impre-
proposed by Zadeh [1] is considered appropriate. In these ciseness in the contents of information and may facilitate
sets, every member of the universe is specified by a mem- approximate reasoning behavior diligently. Although the
bership grade in a unit closed interval. However, to tackle descriptive capability of N.Sets is higher than that of the
scenarios having more complexity and uncertainty, it was traditional F.Sets and IF.Sets due to their additional presence
observed that the concept of F.Sets is not sufficient, and of nonmembership and indeterminant graded functions;
therefore, these concepts were expanded with few exten- however, they have fairly higher computational complexity
sions. Intuitionistic fuzzy sets (IF.Sets) by Atanassov [2] was over F.Sets and IF.Sets.
one of such major developments. Due to the consideration of The models such as F.Sets, IF.Sets, and N.Sets depicted
nonmembership grade, IF.Sets are more effective in tackling some sort of limitation regarding the validation for some
with the vagueness of data. Moreover, IF.Sets are proficient parameterization tools. To address this scarcity, Molodtsov
2 Applied Computational Intelligence and Soft Computing
[4] characterized soft sets (S.Sets) as a new mathematical optimal selection of a mobile with the help of suitable
parameterized model. In S.Sets, every parameter in a set of parameters in the case of soft set and suitable sub-
parameters maps to power set of the universe of discourse parametric values in the case of hypersoft set). It has
while defining single-argument approximate function. The made the decision-making process more flexible and
researchers [5–11] studied the basic properties, elementary reliable. Also, it not only fulfills the requirements of
set theoretic operations, relations, and functions of S.Sets existing soft set-like literature for multi-argument
with illustrative numerical examples. To hybridize the approximate functions but also supports the deci-
characteristics of F.Sets, IF.Sets, and N.Sets with S.Sets, fuzzy sion-makers to make decisions with the deep
soft sets (FS.Sets) [12, 13], intuitionistic fuzzy soft sets inspection.
(IFS.Sets) [14, 15], and neutrosophic soft sets (NS.Sets) [16] (4) Although the models IV-CNSS [36] and IV-CFSS
were conceptualized. Although there are many researchers [37, 41] have been developed to tackle the scenarios
who contributed a lot towards the expansion and extension with periodic and interval type data under soft set-
of these hybridized structures with the interval-valued set- environment, these are inadequate to deal sub-
ting, the contributions of researchers [17–21] are more attribute values in the form of disjoint sets as a
prominent relevant to these models. They not only discussed collective domain of multi-argument approximate
the fundamentals of interval-valued fuzzy soft-set-like function.
models but also employed certain techniques for their ap-
(5) Inspiring from the above literature in general and
plications in different situations.
from [36, 37, 41] in specific, this study aims to
In certain real-world scenarios, the classification of at-
characterize novel structures of IV-CIFHS-set and
tributes into subattributive values in the form of sets is
IV-CNHS-set that not only generalize the existing
necessary. The existing concept of S.Sets is not sufficient and
relevant models but also address their limitations.
incompatible with such scenarios so Smarandache [22]
introduced the concept of hypersoft sets (HS.Sets) to address
the insufficiency of S.Sets and to cope with the situations
with multi-argument approximate function. The rudiments 1.2. Main Contributions. The following are the possible
and elementary axioms of HS.Sets have been discussed in objectives of this study:
[23] and elaborated with numerical examples. Rahman et al. (1) The existing relevant models, that is, [34–42], are
[24–30] investigated the hybridized properties of HS.Sets made adequate with the entitlement of multi-argu-
under the environments of complex set, convexity and ment approximate function through development of
concavity, parameterization, and bijection. They employed IV-CIFHS-set and IV-CNHS-set
decision-making algorithmic approaches to solve real-world (2) The scenarios where parameters are further parti-
problems. Saeed et al. [31–33] developed the theories of tioned into subparametric values in the form of sets
neutrosophic hypersoft mappings and complex multi-fuzzy are tackled by using IV-CIFHS-set and IV-CNHS-set
hypersoft sets with applications in decision-making and
clinical diagnosis. (3) Some essential rudiments, that is, properties, ele-
mentary laws, and set theoretic operations of IV-
CIFHS-set and IV-CNHS-set, are characterized
1.1. Research Gap and Motivation. The following points (4) Two algorithms based on IV-CIFHS-set and IV-
depict the need and motivation behind the proposed study: CNHS-set are proposed to deal with daily-life de-
cision-making problems having periodic and inter-
(1) Many researchers discussed the hybridized struc-
val type data/information
tures of a complex set with fuzzy set, intuitionistic
fuzzy set, and neutrosophic set under soft set en- (5) The proposed study is compared with some existing
vironments. The literature review of the most rele- relevant models by considering some important
vant models [34–42] is presented in Table 1. evaluating indicators so that the advantageous aspect
of the proposed study may be depicted
(2) It is vivid that these structures consider only one set
of parameters and use the single-argument ap- (6) The generalization and particular cases of proposed
proximate function. They depict some kind of in- models are discussed with the pictorial depiction
sufficiency to tackle the scenarios (recruitment (7) The advantages and future directions of the proposed
process, product selection, medical diagnosis, etc.) study are presented
where further classification of parameters into their
subparametric values in the form of disjoint sets is
necessary for deep learning and observation in de- 1.3. Paper Organization. The organization of the remaining
cision-support systems. paper is given in Figure 2.
(3) Along these lines, another construction requests its
place in writing for tending to such obstacle, so the 1.4. Notations and Abbreviations. Some abbreviations and
hypersoft set is conceptualized to handle such sit- notations are used throughout the paper. Their full names
uations (Figure 1 depicts the vivid comparison of soft are given in Table 2 to facilitate the readers for proper
set model and hypersoft set model. It presents the understanding of the concept.
Applied Computational Intelligence and Soft Computing 3
Table 1: Literature review on complex fuzzy-set-like models under soft set.

Domain of approximate
Authors Structure Range setting
function
Ali et al. [34] Complex intuitionistic fuzzy soft set Set of parameters Complex intuitionistic fuzzy set
Al-Quran et al. [35] Complex neutrosophic soft expert set Soft expert set Complex neutrosophic set
Interval-valued complex neutrosophic Interval-valued complex
Al-Sharqi et al. [36] Set of parameters
soft set neutrosophic set
Fan et al. [37] Interval-valued complex fuzzy soft set Set of parameters Interval-valued complex fuzzy set
Khan et al. [38] Complex intuitionistic fuzzy soft set Set of parameters Complex intuitionistic fuzzy set
Kumar et al. [39] Complex intuitionistic fuzzy soft set Set of parameters Complex intuitionistic fuzzy set
Smarandache et al. [40] Complex neutrosophic soft set Set of parameters Complex neutrosophic set
Selvachandran et al. [41] Interval-valued complex fuzzy soft set Set of parameters Interval-valued complex fuzzy set
Thirunavukarasu et al.
Complex fuzzy soft set Set of parameters Complex fuzzy set
[42]
Soft Set Model Hypersoft Set Model
RAM {32, 64}
ROM {4, 8} H
A U
(Cartesian product)
• RAM (GB) Battery Power {3400, 4000}
• ROM (GB)
Approximate function Appropriate Selection
• Battery Power (mAh) Five kind of Mobiles
F: A ----> P (U) of Mobile
• Camera (pixel) Camera Pixel {8, 16}
• Screen Size (inch)
Screen Size {5.7, 5.9}

U
Five kinds
of Mobiles
Multi-argument
Most appropriate Approximate Function
Selection of Mobile
F: H -----> P (U)
Figure 1: Comparison of soft set and hypersoft set.
2. Preliminaries Buckley [44–46] and Zhang et al. [47] presented fuzzy

complex sets and numbers in a different way. Amplitude
In this section, some fundamental definitions from literature terms and P-terms in the form of fuzzy sets are discussed in
are presented for the vivid understanding of the proposed [43, 48].
study.
Definition 3 (see [4]). Let E be set of parameters; then soft
Definition 1 (see [1]). Let U be a fuzzy set over Z that can be set S0 over Z is given by
written as U � 􏼈(], αU (]))|] ∈ Z􏼉 such that
S0 � 􏽮􏼐δ, ζ S0 (δ)􏼑: δ ∈ E1 􏽯, (3)
αU : Z ⟶ [0, 1], (1)
where ζ S0 : E1 ⟶ P(Z) and E1 is subset of E.
where αU (]) is the membership degree of ] ∈ U.
Definition 4 (see [13]). The fuzzy soft set ΩE1 on Z is given

Definition 2 (see [43]). A complex fuzzy set F C can be by
written as follows:
ΩE1 � 􏽮􏼐δ, ωE1 (δ)􏼑: δ ∈ E1 , ωE1 (δ) ∈ F (Z)􏽯, (4)
F C � 􏽮􏼐δ, ηF C (δ)􏼑: δ ∈ Z􏽯 � 􏽮􏼐δ, kF C (δ)eiλF C (δ) 􏼑: δ ∈ Z􏽯,
(2) where ωE1 : E1 ⟶ F(Z), where ωE1 (δ) � ∅ for δ ∉ E1 and
where M-function of F C is ηF C (δ) with kF C (δ)√∈��

� 1] as
[0, ωE1 (δ) � 􏼚ηωE (δ)(v)/v: v ∈ Z, ηωE (δ)(v) ∈ I􏼛 (5)
A-term and λF C (δ) ∈ (0, 2π] as P-term and i � −1. 1 1
Some fundamental definitions are presented from existing literature

in Section 2
Theory of Inteval-Valued Complex Intuitionistic Fuzzy Hypersoft set is

developed and decision-support system is constructed with the help
of its aggregation in Section 3
Theory of Inteval-Valued Complex Neutrosophic Hypersoft set is

developed and decision-support system is constructed with the help
of its aggregation in Section 4
A comparison of proposed structures is presented with some existing

relevant models in Section 5
The advantages and generalization of the proposed structures are

discussed in Section 6
The paper is summarized with future directions in Conclusion Section.
Figure 2: Organization of paper.
Table 2: Notations and abbreviations.

Notation Used for Notation Used for
Z Universe of discourse P(Z) Power set of Z
F(Z) Collection of fuzzy sets IF(Z) Collection of intuitionistic fuzzy sets
N(Z) Collection of neutrosophic sets C(Z) Collection of complex fuzzy sets
CInt (Z) Collection of complex intuitionistic fuzzy sets CNeu (U) Collection of complex neutrosophic sets
A-term Amplitude term M-function Membership function
NM-function Nonmembership function ID-function Indeterminacy function
P-term Phase term CIV (Z) Collection of interval-valued complex fuzzy sets
is a fuzzy set over Z. Here, ωE1 is the approximate function Ψ: A ⟶ CInt (Z),
of ΩE1 , where ωE1 (δ) is a fuzzy set known as δ-element of (8)
ΩE1 . If ωE1 (δ) � ∅, then (δ, ωE1 (δ)) ∉ ΩE1 . Ψ(a) � ∅ if a ∉ A,
Definition 5 (see [42]). A complex fuzzy soft set ξ E1 over Z is is a complex intuitionistic fuzzy approximate function of ξ A
given by and Ψ(a) � 〈ΨT (a), ΨF (a)〉.
ΨT (a) � pT eiθT and ΨF (a) � pF eiθF are complex-valued
ξ E1 � 􏽮􏼐δ, χ E1 (δ)􏼑: δ ∈ E1 , χ E1 (δ) ∈ C(Z)􏽯, (6) M-function and complex-valued NM-function of ξ A , re-
spectively, and all are lying within unit circle in the complex
where χ E1 : E1 ⟶ C(Z), where χE1 (δ) � ∅ for δ ∉ E1 is the plane such that pT , pF ∈ [0, 1] with
complex fuzzy approximate function of ξ E1 , where χ E1 (δ) is 0 ≤ pT + pF ≤ 1(or 0 ≤ |pT + pF | ≤ 1) and θT , θF ∈ (0, 2π].
called δ-member of ξ E1 for all δ ∈ E1 . Set operations of The value Ψ(a) is called a-member of ξ A � (Ψ, A)∀a ∈ A.
complex fuzzy set and complex fuzzy soft set have been
described in [42, 47], respectively.
Definition 7 (see [40]). Let E be a set of attributes with A⊆E.
Definition 6 (see [39]). Let E be a set of attributes with A⊆E. Then complex neutrosophic soft set ξ A � (Ψ, A) over Z is
Then complex intuitionistic fuzzy soft set ξ A � (Ψ, A) over defined as follows:
Z is defined as follows:
ξ A � 􏼈(a, Ψ(a)): a ∈ A, Ψ(a) ∈ CNeu (U)􏼉, (9)
ξ A � 􏼈(a, Ψ(a)): a ∈ A, Ψ(a) ∈ CInt (Z)􏼉, (7)
where where
Ψ: A ⟶ CNeu (Z), Ψ: W ⟶ CIV (Z),

(10) (14)
Ψ(a) � ∅ if a ∉ A, Ψ ω􏼁 � ∅ if ω ∉ W,
is an interval-valued
← complex
→ fuzzy ← approximate function
→ of
is a complex neutrosophic approximate function of ξ A and ←
←
ΩW → and Ψ(ω) � (Ψ(ω), Ψ (ω)). Ψ(ω) � r eiθ and Ψ (ω) �

Ψ(a) � 〈ΨT (a), ΨI (a), ΨF (a)〉. → iθ
r e are lower and upper bounds of the M-function of ΩW ,
ΨT (a) � pT eiθT , ΨI (a) � pI eiθI , and ΨF (a) � pF eiθF are
respectively, and its value Ψ(ω) is called ω-member of IV-
complex-valued truth M-function, complex-valued inde-
CFHS ∀ ω ∈ W.
terminacy M-function, and complex-valued falsity
M-function of ξ A , respectively, and all are lying within unit
circle in the complex plane such that pT , pI , pF ∈ [0, 1] with 3. Interval-Valued Complex Intuitionistic Fuzzy
0− ≤ pT + pI + pF ≤ 3+ (or 0 ≤ |pT + pI + pF | ≤ 3) and Hypersoft Set (IV-CIFHS-Set)
θT , θI , θF ∈ (0, 2π]. The value Ψ(a) is called a-member of
Consider the daily-life scenario of the clinical study to diagnose
ξ A � (Ψ, A)∀a ∈ A.
heart diseases in patients, doctors (decision-makers) usually
prefer chest pain type, resting blood pressure, serum choles-
Definition 8 (see [22]). (Hs , D) is known as a hypersoft set terol, and so on as diagnostic parameters. After keen analysis, it
over Z, if Hs : D ⟶ P(Z) where D is the Cartesian is vivid that these parameters are required to be further par-
product of finite number of disjoint sets titioning into their subparametric values, that is, chest pain type
Hs1 , Hs2 , Hs3 , . . . , Hsn with n distinct attributes (typical angina, atypical angina, etc.), resting blood pressure
hs1 , hs2 , hs3 , . . . , hsn , respectively. (110 mmHg, 150 mmHg, 180 mmHg, etc.), and serum cho-
lesterol (210 mg/dl, 320 mg/dl, 430 mg/dl, etc.). Patients are
advised to visit medical laboratories for test reports regarding
Definition 9 (see [22]). Fuzzy hypersoft set, intuitionistic
indicated parameters. As the efficiency of medical instruments
fuzzy hypersoft set, and neutrosophic hypersoft set are
in laboratories varies that leads to different observations (data)
hypersoft sets defined over fuzzy universe, intuitionistic
for each patient. This may be categorized in the form of the set
fuzzy universe, and neutrosophic universe, respectively.
having a range of data from the minimum value (lower
bounds) to the maximum (upper bounds) that is treated as
The fundamental properties and set theoretic operations
interval data. Sometimes test reports have repeated values
of hypersoft set are discussed in [23].
corresponding to these prescribed parameters. This can be of
either lab-to-lab basis or day-to-day basis. Such type of data is
Definition 10 (see [24]). The complex fuzzy hypersoft set treated as periodic data. The existing fuzzy set-like literature has
CFHS− set ξ D over Z is given by no suitable model to deal with (i) subattribute values in the
form of disjoint sets, (ii) interval-type data, and (iii) periodic
ξ D � 􏼈 δ, χ δ􏼁􏼁: δ ∈ D, χ δ􏼁 ∈ C(Z)􏼉, (11) nature of data collectively. In order to meet the demand of
literature, the models IV-CIFHS-set and IV-CNHS-set are
where L1 , L2 , L3 , . . . , Ln are disjoint sets having n distinct being characterized. Case (i) is addressed by considering multi-
attributes l1 , l2 , l3 , . . . , ln for n ≥ 1, D � L1 × L2 × argument approximate function that considers the Cartesian
⌣
L3 × · · · × Ln , and χ(x) be a CF− set over Z for all product of attribute-valued disjoint sets as its domain and then
δ � (d1 , d2 , d3 , . . . , dn ) ∈ D. maps it to power set of the initial universe (collection of
intuitionistic fuzzy sets or neutrosophic sets). Case (ii) is
χ: D ⟶ C(Z), tackled by considering lower and upper limits of reported
(12)
χ δ􏼁 � ∅ if δ ∉ D, intervals, and case (iii) is dealt with the introduction of am-
plitude and phase terms in the Argand plane.
is a complex fuzzy approximate function of ξ G and χ(δ) is Now we develop the theory of complex intuitionistic
δ − member of CFHS− set ∀ δ ∈ D. fuzzy hypersoft set with interval settings in the remaining
part of this section.
Definition 11 (see [30]). Let W1 , W2 , W3 , . . . , Wn are dis-
Definition 12. Let M1 , M2 , M3 , . . . , Mn are disjoint sets
joint sets having attribute values of n distinct attributes
having n distinct attributes m1 , m2 , m3 , . . . , mn , respectively,
w1 , w2 , w3 , . . . , wn , respectively, for n ≥ 1, W � W1 × W2 ×
for n ≥ 1, M � M1 × M2 × M3 × · · · × Mn and Λ(λ) be an
W3 × · · · × Wn and Ψ(ω) be an interval-valued complex
IV-CIFS over Z for all λ � (b1 , b2 , b3 , . . . , bn ) ∈ M. Then
fuzzy set over Z for all ω � (b1 , b2 , b3 , . . . , bn ) ∈ W. Then
interval-valued complex intuitionistic fuzzy hypersoft set
interval-valued complex fuzzy hypersoft set (IV-CFHS-set)
(IV-CIFHS-set), denoted by ΩM � (Λ, M), over Z is de-
ΩW � (Ψ, W) over Z is defined as follows:
fined as follows:
ΩW � 􏼈 ω, Ψ ω􏼁􏼁: ω ∈ W, Ψ ω􏼁 ∈ CIV (Z)􏼉 (13) ΩM � 􏼈 λ, Λ λ􏼁􏼁: λ ∈ M, Λ λ􏼁 ∈ CIV (Z)􏼉, (15)
where where
Λ: M ⟶ CIV (Z), respectively, and its value Λ(λ) is called λ-member of

(16) IV-CIFHS-set for all values of λ ∈ M
Λ λ􏼁 � ∅ if λ ∉ M,
Note: The collection of all IV-CIFHS-sets is denoted by
is a IV←− CIF →approximate ← →function of ΩM and ⊎ .
IVCIFHS
Λ(λ) � 〈[Λ1 (λ), Λ 1 (λ)], [Λ2 (λ), Λ 2 (λ)]〉 with the
following:
Example 1. Consider M � 􏼈e1 , e2 , e3 , . . . , e8 􏼉 with interval-
← ←
←
→ → →
(i) Λ1 (λ) � c ei θ and Λ 1 (λ) � c ei θ are lower and valued complex intuitionistic fuzzy sets
upper bounds of the M-function of ΩM , respectively ΛM (e1 ), ΛM (e2 ), . . . , ΛM (e8 ) given by
← ← iθ
←
→ → →
(ii) Λ2 (λ) � c e and Λ 2 (λ) � c ei θ are lower and
upper bounds of the NM-function of ΩM ,
⎪
⎧
⎪
⎪ ([0.4, 0.5], [0.3, 0.4])ei([0.3,0.5],[0.3,0.4])π ([0.1, 0.7], [0.2, 0.2])ei([0.3,0.5],[0.1,0.3])π ⎫
⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t2 ⎪
⎪
⎨ ⎬
ΛM e1 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.3, 0.3], [0.3, 0.5])ei([0.1,0.8],[0.1,0.1])π ([0.3, 0.4], [0.2, 0.5])ei([0.2,0.6],[0.2,0.3])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.3, 0.6], [0.2, 0.3])ei([0.1,0.7],[0.1,0.2])π ([0.3, 0.4], [0.1, 0.2])ei([0.2,0.6],[0.1,0.3])π ⎫
⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t2 ⎪
⎪
⎨ ⎬
ΛM e2 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.2, 0.5], [0.3, 0.4])ei([0.1,0.5],[0.3,0.4])π ([0.4, 0.5], [0.1, 0.4])ei([0.2,0.5],[0.2,0.3])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎧
⎪
⎪
⎪ ([0.4, 0.5], [0.2, 0.3])ei([0.2,0.6],[0.1,0.2])π ([0.1, 0.8], [0.1, 0.1])ei([0.2,0.3],[0.2,0.5])π ⎫
⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t2 ⎪
⎪
⎨ ⎬
ΛM e3 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.1, 0.4], [0.1, 0.2])ei([0.2,0.5],[0.3,0.4])π ([0.2, 0.6], [0.1, 0.3])ei([0.1,0.5],[0.3,0.4])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎧
⎪
⎪
⎪ ([0.2, 0.3], [0.3, 0.6])ei([0.1,0.7],[0.2,0.2])π ([0.2, 0.4], [0.2, 0.3])ei([0.1,0.5],[0.2,0.4])π ⎫
⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t 2 ⎪
⎪
⎨ ⎬
ΛM e4 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.4, 0.5], [0.3, 0.4])ei([0.1,0.4],[0.4,0.5])π ([0.4, 0.5], [0.2, 0.4])ei([0.2,0.5],[0.1,0.3])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
(17)
⎧
⎪
⎪
⎪ ([0.1, 0.2], [0.4, 0.5])ei([0.4,0.5],[0.1,0.3])π ([0.2, 0.2], [0.2, 0.7])ei([0.1,0.4],[0.3,0.5])π ⎫
⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t 2 ⎪
⎪
⎨ ⎬
ΛM e5 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.2, 0.6], [0.1, 0.3])ei([0.1,0.2],[0.2,0.3])π ([0.3, 0.5], [0.2, 0.3])ei([0.3,0.4],[0.2,0.3])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.4, 0.5], [0.1, 0.4])ei([0.2,0.3],[0.3,0.6])π ([0.1, 0.3], [0.4, 0.4])ei([0.2,0.5],[0.2,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t 2 ⎪
⎪
⎨ ⎬
ΛM e6 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.2, 0.7], [0.1, 0.2])e i([0.1,0.8],[0.1,0.1])π
([0.2, 0.5], [0.2, 0.5])e i([0.1,0.6],[0.2,0.3])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.2, 0.4], [0.1, 0.2])ei([0.2,0.3],[0.1,0.6])π ([0.1, 0.3], [0.3, 0.5])ei([0.2,0.3],[0.2,0.6])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t 2 ⎪
⎪
⎨ ⎬
ΛM e7 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.1, 0.5], [0.3, 0.4])e i([0.1,0.6],[0.2,0.3])π
([0.4, 0.5], [0.3, 0.4])e i([0.2,0.5],[0.1,0.2])π ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎧
⎪
⎪
⎪ ([0.3, 0.3], [0.1, 0.4])ei([0.4,0.5],[0.3,0.4])π ([0.2, 0.3], [0.2, 0.6])ei([0.3,0.6],[0.1,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t 2 ⎪
⎪
⎨ ⎬
ΛM e8 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.4,0.5],[0.3,0.4])π ⎪
⎪
⎪ ([0.1, 0.2], [0.4, 0.5])e i([0.3,0.5],[0.3,0.4])π
([0.2, 0.5], [0.1, 0.4])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
and then IV-CIFHS-set ΩM is written by
⎪
⎧
⎪ ⎪
⎧ ([0.4, 0.5], [0.3, 0.4])ei([0.3,0.5],[0.3,0.4])π ([0.1, 0.7], [0.2, 0.2])ei([0.3,0.5],[0.1,0.3])π ⎫ ⎪ ⎪
⎫
⎪
⎪ ⎪
⎪ ⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜
⎜ ⎪
⎪ , ,⎪⎪
⎪ ⎟
⎞
⎟
⎟
⎪
⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t1 t 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎨ ⎪
⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e , ⎟
⎟
⎟ , ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 1 ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪ ⎜ ⎪ ⎪ ⎟
⎪
⎪
⎪
⎜
⎜
⎝ ⎪ ⎪
⎪ ([0.3, 0.3], [0.3, 0.5])e i([0.1,0.8],[0.1,0.1])π
([0.3, 0.4], [0.2, 0.5])e i([0.2,0.6],[0.2,0.3])π ⎪
⎪
⎪ ⎠ ⎪
⎟
⎟ ⎪
⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ t3 t4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.3, 0.6], [0.2, 0.3])e i([0.1,0.7],[0.1,0.2])π
([0.3, 0.4], [0.1, 0.2])e i([0.2,0.6],[0.1,0.3])π
⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ 1 2 ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎨ ⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e , ⎟
⎟
⎟ , ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 2 ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎝ ⎪
⎪ i([0.1,0.5],[0.3,0.4])π i([0.2,0.5],[0.2,0.3])π ⎪
⎪ ⎟
⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ ([0.2, 0.5], [0.3, 0.4])e ([0.4, 0.5], [0.1, 0.4])e ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ , ⎭ ⎪
⎪
⎪
⎪ t t ⎪
⎪
⎪
⎪ 3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.2,0.6],[0.1,0.2])π i([0.2,0.3],[0.2,0.5])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.4, 0.5], [0.2, 0.3])e ([0.1, 0.8], [0.1, 0.1])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t1 t2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎨ ⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ e , ⎟
⎟ , ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 3 ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎝ ⎪ ⎪ ([0.1, 0.4], [0.1, 0.2])e i([0.2,0.5],[0.3,0.4])π
([0.2, 0.6], [0.1, 0.3])e i([0.1,0.5],[0.3,0.4])π ⎪
⎪ ⎠ ⎪
⎟
⎟ ⎪
⎪
⎪ ⎪
⎪ ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ , ⎭ ⎪
⎪
⎪
⎪ t 3 t4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.1,0.7],[0.2,0.2])π i([0.1,0.5],[0.2,0.4])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.2, 0.3], [0.3, 0.6])e ([0.2, 0.4], [0.2, 0.3])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ 1 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎨ ⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e , ⎟
⎟
⎟ , ⎪
⎪
⎪
⎪ ⎜
⎜ 4 ⎪
⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪ ⎜
⎜
⎝ ⎪ i([0.1,0.4],[0.4,0.5])π i([0.2,0.5],[0.1,0.3])π ⎪⎟ ⎟
⎠ ⎪
⎪
⎪ ⎪ ([0.4, 0.5], ([0.3, 0.4]))e ([0.4, 0.5], [0.2, 0.4])e ⎪ ⎪
⎪
⎪
⎪
⎪
⎩ , ⎪ ⎪
⎪
⎭ ⎪
⎪
⎪
⎪ t3 t4 ⎪
⎪
⎪
⎨ ⎪
⎬
ΩM �⎪ ⎪ . (18)
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧ ([0.1, 0.2], [0.4, 0.5])e i([0.4,0.5],[0.1,0.3])π
([0.2, 0.2], [0.2, 0.7])e i(([0.1,0.4]),[0.3,0.5])π
⎪
⎫ ⎪
⎪
⎪
⎪ ⎪
⎪ ⎪
⎪⎟ ⎪
⎪
⎪⎜
⎪ ⎛
⎜ ⎪
⎪ , ,⎪⎪ ⎞
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t1 t2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜
⎜ ⎪
⎨ ⎪
⎬⎟⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ e , ⎟
⎟ , ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 5 ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ i([0.1,0.2],[0.2,0.3])π i([0.3,0.4],[0.2,0.3])π ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎝ ⎪
⎪ ([0.2, 0.6], [0.1, 0.3])e ([0.3, 0.5], [0.2, 0.3])e ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ t t ⎪
⎪
⎪
⎪ 3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.4, 0.5], t[0.1, 0.4])e i([0.2,0.3],[0.3,0.6)π
([0.1, 0.3], t[0.4, 0.4])e i([0.2,0.5],t[0.2,0.3])π
⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜ ⎪
⎪ , , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪
⎪ ⎛
⎜
⎜ ⎪ ⎪ ⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎪ t 1 t 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎨ ⎪
⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ e , ⎟
⎟
⎟ , ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 6 ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ ⎪
⎪ ⎪
⎪⎟⎟⎪
⎟
⎟ ⎪
⎪⎜
⎪ ⎜
⎝ ⎪ i([0.1,0.8],[0.1,0.1])π i([0.1,0.6],t[0.2,0.3])π ⎪
⎪ ⎟
⎠ ⎪
⎪
⎪
⎪ ⎪ ([0.2, 0.7], t[0.1, 0.2])e ([0.2, 0.5], t[0.2, 0.5])e ⎪ ⎪
⎪
⎪
⎪
⎪
⎩ , ⎭ ⎪
⎪ ⎪
⎪
⎪
⎪
⎪ t3 t4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧ i([0.2,0.3],[0.1,0.6])π i([0.2,0.3],[0.2,0.6])π
⎪
⎫ ⎪
⎪
⎪
⎪ ⎪
⎪ ([0.2, 0.4], [0.1, 0.2])e ([0.1, 0.3], [0.3, 0.5])e ⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜ ⎪
⎪ , ,⎪ ⎪ ⎟
⎞
⎟ ⎪
⎪
⎪ ⎜
⎪ ⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎨
1 2 ⎪
⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜⎜
⎜
⎜ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ e7 , ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ i([0.1,0.6],[0.2,0.3])π i([0.2,0.5],[0.1,0.2])π ⎪⎟ ⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎝ ⎪
⎪ ([0.1, 0.5], [0.3, 0.4])e ([0.4, 0.5], [0.3, 0.4])e ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ t t ⎪
⎪
⎪
⎪ 3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧ ([0.3, 0.3], [0.1, 0.4])e i([0.4,0.5],[0.3,0.4])π
([0.2, 0.3], [0.2, 0.6])e i([0.3,0.6],[0.1,0.3])π
⎪
⎫ ⎪
⎪
⎪
⎪ ⎛ ⎪
⎪ ⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ , , ⎪
⎪ ⎟
⎞
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟ ⎪
⎟
⎟ ⎪
⎪ ⎜
⎪ ⎜ ⎨
⎜ ⎪ 1 2 ⎪
⎬ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜⎜
⎜ e ,
8 ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜ ⎪
⎜
⎜ ⎪ ⎪⎟
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ i([0.3,0.5],[0.3,0.4])π i([0.4,0.5],[0.3,0.4])π ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪ ⎜
⎪ ⎝ ⎪ ⎪ ([0.1, 0.2], [0.4, 0.5])e ([0.2, 0.5], [0.1, 0.4])e ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎭ ⎪
⎪ ⎪
⎩ t3 t4 ⎭
Definition 13. Let ΩM1 � (Λ1 , M1 ) and ΩM2 � (Λ2 , M2 ) be Definition 16. For two IV-CIFHS-sets (Λ1 , M1 ) and
two IV-CIFHS-sets over the same universe. The set ΩM1 � (Λ2 , M2 ) over the same universe Z, the following definitions
(Λ1 , M1 ) is a subset of ΩM2 � (Λ2 , M2 ), if hold:
(i) M1 ⊆M2 (i) An IV-CIFHS-set (Λ1 , M1 ) is a homogeneous IV-
← ⌣ ← ⌣
⌣
(ii) ∀x ∈→ M1 , Λ1→
⌣
(x)⊆Λ2 (x)
⌣
implies Λ1 (x)⊆Λ2 CIFHS-set, symbolized by (Λ1 , M1 )Hom if Λ1 (x) is
⌣
⌣ ⌣ ⌣
(x), Λ 1 (x)⊆ Λ 2 (x), that is, homogeneous CIF-set ∀x ∈ M1
←
← ⌣ ← ⌣ → ⌣ → ⌣ ⌣ (ii) An IV-CIFHS-set (Λ1 , M1 ) is a completely ho-
c M1 (x) ≤ c M
← →2 (x ), c (x
→1 ⌣
M ) ≤ c M 2
(x ), θ M1 (x) ≤
⌣ ⌣ mogeneous IV-CIFHS-set, symbolized by
θ M2 (x), and θ M1 (x) ≤ θ M2 (x), ⌣
(Λ1 , M1 )CHom if Λ1 (x) is homogeneous with
where amplitude and P-terms of each Λi , i � 1, 2 are ⌣
Λ1 (y)∀x, y ∈ M1
given below:
← ⌣
←
⌣ ← ⌣ (iii) An IV-CIFHS-set (Λ1 , M1 ) is a completely ho-
θ M1 (x))
(c M1 (x), ← for Λ ⌣
← ⌣ ⌣ ←1 (x
⌣
) mogeneous IV-CIFHS-set with (Λ2 , M2 ) if Λ1 (x) is
θ M1 (x))
(c M1 (x), ← for Λ ⌣ ⌣
← ⌣ ⌣ ← 1 ⌣)
(x a homogeneous with Λ2 (x)∀(x) ∈ M1 􏽑 M2
θ M2 (x))
(c M2 (x), ← for Λ
←2 (x )
← ⌣ ⌣ ⌣
(c M2 (x), θ M2 (x)) for Λ2 (x)
3.1. Set Operations and Laws on IV-CIFHS-Set. In this sec-
Definition 14. Two IV-CIFHS-sets ΩM1 � (Λ1 , M1 ) and tion, some basic set theoretic operations and laws are dis-
ΩM2 � (Λ2 , M2 ) over the same universe are equal if cussed on IV-CIFHS-set.
(i) (Λ1 , M1 )⊆(Λ2 , M2 ) Definition 17. The complement of IV-CIFHS-set (Λ, M),
(ii) (Λ2 , M2 )⊆(Λ1 , M1 ) denoted by (Λ, M)c , is given by
⌣ ⌣ ⌣ ⌣
(Λ, M)c � 􏽮􏼐x, (Λ(x))c 􏼑: x∈ M, (Λ(x))c ∈ CIV (Z)􏽯,
Definition 15. Let (Λ, M) be an IV-CIFHS-set over Z. Then (19)
⌣
(i) It is a null IV-CIFHS-set, symbolized by (Λ, M)Φ if where the M-function (Λ(x))c has the A-term given by
⌣ ← ⌣ c ← ⌣ → ⌣ → ⌣
for all values of x ∈ M, the A-term of the M-function (c M (x)) � 1 −←c M (x)( c M (x←))c � 1 − c M (x) and
→ P-term
← ⌣ → ⌣ ⌣ c ⌣ ⌣
is given by c M (x) �← c M (x) � →0, ⌣whereas the given→ by (θ M (x)) � 2π − θ M (x) and ( θ M (x))c �
⌣ ⌣
P-terms of is given by θ M (x) � θ M (x) � 0π 2π − θ M (x).
(ii) It is an absolute IV-CIFHS-set, symbolized by
⌣
(Λ, M)Δ ; if for all values of x ∈ M, the A-terms of Proposition 1. Let (Λ, M) be an IV-CIFHS-set over Z. Then
← ⌣ → ⌣
the M-function is given by c M (x) � c M (x) � 1, ((Λ, M)c )c � (Λ, M).
whereas
← → the⌣ P-terms is given by ⌣
⌣ Proof. As Λ(x) ∈ CIV (Z), so in terms of its A- and P-terms,
θ M (x) � θ M (x) � 2π.
(Λ, M) can be expressed as follows:
← ⌣
→ ⌣
→ ⌣
(Λ, M) � 􏼨􏼠x, 􏼠 c M (x)eiθ M (x) , c M (x)ei θ G (x) 􏼡􏼡: x ∈ M􏼩.
⌣ ← ⌣ ⌣
(20)
Now
⎧
⎪ c
→ ⌣ c ⎪
⎫
⎨ ⌣ c i􏼒 θ D (x)􏼓 ⎞ ⎬
c ←
⌣
c ⌣ ⎜
⎛ ⎜
⌣ ⎛ ← ⌣ i􏼐 θ M (x)􏼑 → ⎟ ⎟ ⌣
(Λ, M) (x) � ⎪⎝x, ⎝􏼒 c M (x)􏼓 e , 􏼐 c M (x)􏼑 e ⎠⎞⎠: x ∈ M⎪,
⎩ ⎭
⎪
⎧ c
→ ⌣ ⎪
⎫
c
⎨⎜ ← c
􏼐
← ⌣
􏼑 → c i􏼒2π− θ D (x)􏼓 ⎬
c ⌣
(Λ, M) (x) � ⎪⎝
⌣ ⎜
⎛ x, ⎝ ⌣
⎛􏼒1 − c (x)􏼓 e i 2π− θ M (x ) ⌣
, 􏼐1 − c M (x)􏼑 e ⎞⎟
⎟
⎠ ⎠ ⌣
⎞: x ∈ M⎪,
M
⎩ ⎭
⎪
⎧ c
→ ⌣ ⎪
⎫
c
⎨⎜⌣ ⎜ c i􏼒2π− θ G ((x))􏼓 ⎟ ⎬

c ←
⌣
c c ⎛
⎝ ⎛
⎝ ← ⌣ i􏼐2π− θ M ((x))􏼑 → ⌣ ⎞⎞
⎠ ⎟ ⌣
⎠: (x (21)
(χ, D) 􏼁 � ⎪ x, 􏼒1 − c M (x)􏼓 e , 􏼐1 − c M ((x))􏼑 e ) ∈ M⎪,
⎩ ⎭
⎪
⎧ → ⌣ ⎪
⎫
⎨⎜⌣ ⎜ ←
← ⌣
i􏼐2π−􏼐2π− θ M (x)􏼑􏼑 → ⌣ i􏼒2π−􏼒2π− θ G (x)􏼓􏼓 ⎬
c c ⎛
⎝ ⎛
⎝ ⌣
(Λ, M) 􏼁 � ⎪ x, 􏼒1 − 􏼒1 − c M (x)􏼓􏼓e , 􏼐1 − 􏼐1 − c M (x)􏼑􏼑e ⎟
⎞
⎠⎞⎟ ⌣
⎠: x ∈ M⎪,
⎩ ⎭
← ⌣
→
c c ⌣ ← ⌣ i θ M (x) → ⌣ i θ G (x⌣) ⌣
(Λ, M) 􏼁 � 􏼨􏼠x, 􏼠 c M (x)e , c M (x)e 􏼡􏼡: x∈ M􏼩.
From equations (20) and (21), we have Definition 18. For two IV-CIFHS-set (Λ1 , M1 ) and
((Λ, M)c )c � (Λ, M). □ (Λ2 , M2 ), the intersection (Λ1 , M1 ) 􏽑(Λ2 , M2 ) over the
same universe Z is the IV-CIFHS-set (Λ3 , M3 ), where
⌣
Proposition 2. Let (Λ, M) be an IV-CIFHS-set over Z. Then M3 � M1 ∐M2 , and for all x ∈ M3 ,
(i) ((Λ, M)Φ )c � (Λ, M)Δ
(ii) ((Λ, M)Δ )c � (Λ, M)Φ
←
⎪
⎧
⎪ ← ⌣ ⌣
⎪
⎪ c M1 (x)ei θ M1 (x) , � ∈ M1 M 2 ,
if x
⎪
⎪
← ⌣ ⎪
⎨ ← ⌣
← ⌣ i θ M (x
Λ3 (x) � ⎪ c M2 (x )e 2 ) , � ∈ M2 M 1 ,
if x
⎪
⎪
⎪
⎪ ← ⌣ ←
⎪
⎪ ← ⌣ ← ⌣
⌣
i min􏽨 θ M1 (x), θ M2 (x)􏽩
⎩ min􏼔 c M (x ), c M (x ) 􏼕e , � ∈ M1 􏽙 M2 ,
if x
1 2
→ ⌣ (22)
⎪
⎧
⎪ → ⌣ i θ M (x ) ⌣
⎪
⎪ c M (x )e 1 , if x∈ M1 M2 ,
⎪
⎪ 1
⎪
⎪ →
→ ⌣ ⎨→ ⌣ i θ M (x⌣
) ⌣
Λ 3 (x) � ⎪ c M (x )e 2 , if x∈ M2 M1 ,
⎪
⎪ 2
⎪
⎪ → ⌣ → ⌣
⎪
⎪ i min􏼔 θ M1 (x), θ M2 (x)􏼕
⎪
⎩ min􏽨→ ⌣ → ⌣ ⌣
c M1 (x), c M2 (x)􏽩e if x∈ M1 􏽙 M2 .
Definition 19. For two IV-CIFHS-set (Λ1 , M1 ) and Definition 20. The union (Λ1 , M1 )∐(Λ2 , M2 ) of two IV-
(Λ2 , M2 ), the difference is defined as follows: CIFHS-set (Λ1 , M1 ) and (Λ2 , M2 ) over the same universe Z
c is the IV-CIFHS-set (Λ3 , M3 ), where M3 � M1 ∐M2 , and
Λ1 , M1 􏼁∖ Λ2 , M2 􏼁 � Λ1 , M1 􏼁 􏽙 Λ2 , M2 􏼁 . (23) ⌣
for all x ∈ M3 ,
←
⎪
⎧
⎪ ← ⌣ ⌣
⌣
⎪
⎪ c M1 (x)eiθ M1 (x) , if (x) ∈ M1 \M2 ,
⎪
⎪
← ⌣ ⎪
⎨← ←
⌣
⌣ iθ M (x ⌣
Λ3 (x) � ⎪ c M2 (x )e 2 ) , if (x) ∈ M2 \M1 ,
⎪
⎪
⎪
⎪ ← ←
⎪
⎪ ← ⌣ ← ⌣
⌣ ⌣
i max􏽨 θ M1 (x), θ M2 (x)􏽩 ⌣
⎩ max􏼔 c M (x ), c M2 (x)􏼕e , if (x) ∈ M1 􏽙 M2 ,
1
→ ⌣ (24)
⎧
⎪
⎪ → ⌣ i θ M (x ) ⌣
⎪
⎪ c M (x )e 1 , if x∈ M1 M2 ,
⎪
⎪ 1
⎪
→ ⌣ ⎪ ⎨ → ⌣
Λ 3 (x) � ⎪ →
c M2 (x)ei θ M2 (x) ,
⌣ ⌣
if x∈ M2 M1 ,
⎪
⎪
⎪
⎪ → ⌣ → ⌣
⎪
⎪ i max􏼔 θ M1 (x), θ M2 (x)􏼕
⎪
⎩ → ⌣ → ⌣ ⌣
max􏽨 c M1 (x) c M2 (x)􏽩e , if x∈ M1 􏽙 M2 .
Proposition 3. Let (Λ, M) be an IV-CIFHS-set over Z. Then In Table 3, η1χD (x) and η2χD (x) are M-function and NM-
the following results hold true: function of χD , respectively, with interval-valued intui-
(i) (Λ, M)∐(Λ, M)Φ � (Λ, M) tionistic fuzzy values. If αij � (η1χ (x⌣ ) (]i ), η2χ (x⌣ ) (]i )), for
D j D j
(ii) (Λ, M)∐(Λ, M)Δ � (Λ, M)Δ i � Nm r

1 and j � N1 , then IV-CIFHS-set ξ D is uniquely
characterized by the following matrix:
(iii) (Λ, M) 􏽑 (Λ, M)Φ � (Λ, M)Φ
(iv) (Λ, M) 􏽑 (Λ, M)Δ � (Λ, M) α11 α12 · · · α1r
⎡⎢⎢⎢ ⎤⎥⎥
(v) (Λ, M)Φ ∐(Λ, M)Δ � (Λ, M)Δ ⎢⎢⎢ α21 α22 · · · α2r ⎥⎥⎥⎥
􏽨αij 􏽩 � ⎢⎢⎢⎢⎢ ⎥⎥⎥, (25)
(vi) (Λ, M)Φ 􏽑 (Λ, M)Δ � (Λ, M)Φ ⎢⎢⎢ ⋮
⎣ ⋮ ⋱ ⋮ ⎥⎥⎥⎥⎦
αm1 αm2 · · · αmr
Proposition 4. Let (Λ1 , M1 ), (Λ2 , M2 ), and (Λ3 , M3 ) are
three IV-CIFHS-sets over the same universe Z. Then the which is called an m × r IV-CIFHS-set matrix.
following commutative and associative laws hold true:
Definition 22. If ξ D ∈ ⊎ , then cardinal set of ξ D is
(i) (Λ1 , M1 ) 􏽑(Λ2 , M2 ) � (Λ2 , M2 ) 􏽑(Λ1 , M1 ) IVCIFHS
defined as follows:
(ii) (Λ1 , M1 )∐(Λ2 , M2 ) � (Λ2 , M2 )∐(Λ1 , M1 ) ⌣ ⌣
⎪􏼒η1 (x
⎧ 2 ⎪
⎫
(iii) (Λ1 , M1 ) 􏽑((Λ2 , M2 ) 􏽑(Λ3 , M3 )) � �� ⎪ ⎨ ‖ξD ‖ ), η‖ξD ‖ (x)􏼓 ⌣ ⎪
⎬
��ξ D �� : x ∈ D , (26)
((Λ1 , M1 ) 􏽑(Λ2 , M2 )) 􏽑(Λ3 , M3 ) ⎪
⎪ ⌣
x ⎪
⎪
⎩ ⎭
(iv) (Λ1 , M1 )∐((Λ2 , M2 )∐(Λ3 , M3 )) �
((Λ1 , M1 )∐(Λ2 , M2 ))∐(Λ3 , M3 ) where η1‖ξD ‖ : D ⟶ [0, 1] is an M-function of ‖ξ D ‖ with
⌣ ⌣
η1‖ξD ‖ (x) � |χ D (x)|/|Z| and η2‖ξD ‖ : D ⟶ [0, 1] is an NM-
⌣ ⌣
Proposition 5. Let (Λ1 , M1 ) and (Λ2 , M2 ) are two IV- function of ‖ξ D ‖ with η2‖ξD ‖ (x) � |χ D (x)|/|Z|. Both have
CIFHS-sets over the same universe Z. Then the following De interval-valued intuitionistic fuzzy values. Note that
Morgans’s laws hold true: ‖Civcifhss (Z)‖ is the collection of all cardinal sets of IV-
CIFHS-sets and ‖Civcifhss (Z)‖⊆IVIF(D).
(i) ((Λ1 , M1 ) 􏽑(Λ2 , M2 ))c � (Λ1 , M1 )c ∐(Λ2 , M2 )c
(ii) ((Λ1 , M1 )∐(Λ2 , M2 ))c � (Λ1 , M1 )c 􏽑 (Λ2 , M2 )c Definition 23. Let ξ D ∈ Civcifhss (Z) and ‖ξ D ‖ ∈ ‖Civcifhss
(Z)‖. Consider E as in Definition 12, the representation of
‖ξ D ‖ can be seen in Table 4.
3.2. Aggregation of Interval-Valued Complex Intuitionistic ⌣ ⌣
If α1j � (η1‖ξD ‖ (xj ), η2‖ξD ‖ (xj )), for j � Nr1 , then the car-
Fuzzy Hypersoft Set. In this section, we define an aggrega-
dinal set ‖ξ D ‖ is represented by the following matrix:
tion operator on IV-CIFHS-set that produces an aggregate
fuzzy set from an IV-CIFHS-set and its cardinal set. The 􏽨αij 􏽩1×r � 􏼂 α11 α12 · · · α1r 􏼃, (27)
approximate functions of an IV-CIFHS-set are fuzzy. Here,
D, E, ξ D and ⊎ will be in accordance with Definition 12. which is called the cardinal matrix of ‖ξ D ‖.
IVCIFHS
Definition 21. Let ξ D ∈ ⊎IVCIFHS . Assume that Definition 24. Let ξ D ∈ Civcifhss (Z) and ‖ξ D ‖ ∈ ‖Civcifhss
Z � 􏼈]1 , ]2 , . . . , ]m 􏼉 and E � 􏼈L1 , L2 , . . . , Ln 􏼉 with L1 � (Z)‖. Then IV-CIFHS-aggregation operator is defined as
􏼈e11 , e12 , . . . , e1n 􏼉, L2 � 􏼈e21 , e22 , . . . , e2n 􏼉, . . . , Ln � 􏼈en1 , follows:
⌣ ⌣
en2 , . . . , enn } and D � L1 × L2 × · · · × Ln � 􏽮x1 , x2 , . . . , xn ,
⌣ 􏽺􏽽􏽼􏽻 ��
⌣ ⌣ ⌣
ξ D � Aivcifhss 􏼐��ξ D ��, ξ D 􏼑, (28)
. . . , xnn � xr }, each xi is n-tuple element of D and
|D| � r � nn ; the representation of ξ D can be seen in Table 3. where
Table 3: Tabular representation of ξ D .

⌣ ⌣ ⌣
ξD x1 x2 ... xr
]1 (η1χ (x⌣ ) (]1 ), η2χ (x⌣ ) (]1 )) (η1χ (x⌣ ) (]1 ), η2χ (x⌣ ) (]1 )) ··· (η1χ (x⌣ ) (]1 ), η2χ (x⌣ ) (]1 ))
D 1 D 1 D 2 D 2 D r D r
]1 (η1χ (x⌣ ) (]2 ), η2χ (x⌣ ) (]2 )) (η1χ (x⌣ ) (]2 ), η2χ (x⌣ ) (]2 )) ··· (η1χ (x⌣ ) (]2 ), η2χ (x⌣ ) (]2 ))
D 1 D 1 D 2 D 2 D r D r
⋮ ⋮ ⋮ ⋱ ⋮
]1 (η1χ ⌣ (]m ), η2χ ⌣ (]m )) (η1χ ⌣ (]m ), η2χ ⌣ (]m )) ··· (η1χ ⌣ (]m ), η2χ ⌣ (]m ))
D (x1 ) D (x1 ) D (x2 ) D (x2 ) D (xr ) D (xr )
Table 4: Tabular representation of ‖ξD ‖.

D x
�1 x
�2 ··· x
�r
⌣ ⌣ ⌣ ⌣ ⌣ ⌣
η‖ξD ‖ (η1‖ξD ‖ (x1 ), η2‖ξD ‖ (x1 )) (η1‖ξD ‖ (x2 ), η2‖ξD ‖ (x2 )) ··· (η1‖ξD ‖ (xr ), η2‖ξD ‖ (xr ))
��
Aivcifhss : ��Civcifhss (Z)�� × Civcifhss (Z) ⟶ F(Z), (29) α11
⎡⎢⎢⎢ ⎤⎥
􏽺􏽽􏽼􏽻 ⎢⎢⎢ α ⎥⎥⎥⎥⎥
⎢ 21 ⎥ ⎥⎥⎥,
where ξ D is called the aggregate fuzzy set of IV-CIFHS- 􏼂αi1 􏼃m×1 � ⎢⎢⎢⎢ (33)
⎢⎢⎢ ⋮ ⎥⎥⎥⎥
set ξ D . ⎣ ⎦
Its M-function is given as follows: αm1
􏽺􏽽􏽼􏽻
η􏽺􏽽􏽼􏽻: Z ⟶ [0, 1], (30) which is called the aggregate matrix of ξ D over Z.
ξD
with 3.3. Applications of Interval-Valued Complex Intuitionistic

Fuzzy Hypersoft Set. In this section, an algorithm is pre-
1 ⌣ sented to solve the problems in decision-making by having
η􏽺􏽽􏽼􏽻(]) � 􏽘 ηCard(ξD )(x)ηCard(χD )(]). (31)
ξD |D| ⌣ under consideration the concept of aggregations defined in
x∈D
the previous section. An example is demonstrated to explain
the proposed algorithm. It is necessary to determine an
􏽺􏽽􏽼􏽻 aggregate fuzzy set of IV-CIFHS-set for choosing the best
Definition 25. Let ξ D ∈ Civcifhss (Z) and ξ D be its􏽺􏽽􏽼􏽻 aggregate
option (parameter) from the given set (set of choices/al-
fuzzy set. Assume that Z � 􏼈]1 , ]2 , . . . , ]m 􏼉, then ξ D can be
ternatives). The following algorithm is proposed based on
presented as follows:
the definitions given in Subsection 3.2 that may help make
ξD ⋮ η􏽺􏽽􏽼􏽻 optimal decision.
⎢
⎡
⎢
⎢ ξD ⎤⎥⎥⎥ Now, Algorithm 1 is explained with the help of the
⎢
⎢
⎢ ⎥⎥⎥
⎢ ⎥ following example.
⎢
⎢
⎢
⎢
⎢ ...... ⋮ . . . . . . ⎥⎥⎥⎥⎥
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ ]1 ⋮ η􏽺􏽽􏽼􏽻 ]1 􏼁 ⎥⎥⎥⎥ Example 2. Suppose a businessman wants to buy a share
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ ξD ⎥⎥⎥ from the share market. There are four same kinds of share
⎢
⎢
⎢ ⎥⎥⎥. (32)
⎢
⎢ that form the set, Z � 􏼈s1 , s2 , s3 , s4 􏼉. The expert committee
⎢
⎢
⎢
⎢ ]2 ⋮ η􏽺􏽽􏽼􏽻 ]2 􏼁 ⎥⎥⎥⎥⎥
⎢
⎢
⎢ ξD ⎥⎥⎥ considers a set of attributes, E � 􏼈e1 , e2 , e3 􏼉. For i � 1, 2, 3, the
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥ attributes ei stand for “current trend of company perfor-
⎢
⎢
⎢ ⋮ ⋮ ⋮ ⎥⎥⎥
⎢
⎢ ⎥⎥⎥ mance,” “particular company’s stock price for last one year,”
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎣ ⎦ and “Home country inflation rate,” respectively. Corre-
]m ⋮ η􏽺􏽽􏽼􏽻 ]m 􏼁 sponding to each attribute, the sets of attribute values are
ξD
L1 � 􏼈e11 , e12 􏼉, L2 � 􏼈e21 􏼉, and L3 � 􏼈e31 , e32 􏼉. Then the set
􏽺􏽽􏽼􏽻 D � L1 × L2 × L3 � 􏼈δ1 , δ2 , δ3 , δ4 􏼉, where each δi is a
If αi1 � η􏽺􏽽􏽼􏽻(]i ) for i � Nm
1 , then ξ D is represented by the
ξD three-tuple. IV-CIFHS-sets χD (δ1 ), χ D (δ2 ), χ D (δ3 ), χ D (δ4 )
following matrix: are defined as follows:
⊳ Start
⊳ Input Stage:
———–1. Consider Z as the universe of discourse
———–2. Consider E as a set of n parameters
———–3. Classify n parameters into disjoint parametric-valued sets L1 , L2 , L3 , . . . , Ln
⊳ Construction Stage:
———–4. D � L1 × L2 × L3 × · · · × Ln
———–5. Construct IV-CIFHS-set ξ D over Z in accordance with Definition 12
⊳ Computation Stage:
———–6. Compute ‖ξ D ‖ for A-term and P-term separately by using Definition 22
􏽺􏽽􏽼􏽻
———–7. Compute ξ D for A-term and P-term separately with the help of Definition 24
———–8. Compute η􏽺􏽽􏽼􏽻(]) by using Definition 24
⊳ Output Stage: ξD
———–9. Find the best option by the max modulus of η􏽺􏽽􏽼􏽻(]) with the help of Definition 25
⊳ End ξD
ALGORITHM 1: Decision-support algorithm based on aggregations of an IV-CIFHS-set
⎪
⎧
⎪
⎪ ([0.4, 0.5], [0.3, 0.4])ei([0.1,0.4],[0.3,0.5])π ([0.2, 0.3], [0.2, 0.6])ei([0.2,0.3],[0.3,0.5])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s 1 s 2 ⎪
⎪
⎨ ⎬
χD δ1 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
⎪
i([0.1,0.4],[0.1,0.2])π ⎪
⎪
⎪ i([0.3,0.4],[0.1,0.3])π
⎪
⎪ ([0.1, 0.4], [0.4, 0.5])e
⎪
⎩ ,
([0.4, 0.5], [0.2, 0.4])e ⎪
⎪
⎭
s3 s4
⎧
⎪
⎪
⎪ ([0.1, 0.2], [0.2, 0.7])ei([0.2,0.4],[0.3,0.5])π ([0.1, 0.6], [0.2, 0.3])ei([0.4,0.5],[0.2,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s 1 s 2 ⎪
⎪
⎨ ⎬
χD δ2 􏼁 � ⎪ ⎪ .
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.2,0.2],[0.1,0.5])π i([0.1,0.3],[0.3,0.6])π ⎪
⎪
⎪ ([0.2, 0.3], [0.1, 0.6])e
⎪
⎩ ,
([0.2, 0.4], [0.3, 0.4])e ⎪
⎪
⎭
s3 s4
(34)
⎪
⎧
⎪ ([0.2, 0.3], [0.2, 0.5])ei([0.1,0.4],[0.4,0.5])π ([0.2, 0.4], [0.1, 0.3])ei([0.3,0.6],[0.2,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ,⎪
⎪
⎪
⎪
⎪ s 1 s 2 ⎪
⎪
⎨ ⎬
χD δ3 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.2,0.5],[0.2,0.4])π ⎪
⎪
⎪ ([0.2, 0.4], [0.1, 0.3])e i([0.2,0.5],[0.1,0.2])π
([0.3, 0.3], [0.2, 0.6])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
s3 s4
⎧
⎪
⎪
⎪ ([0.3, 0.5], [0.3, 0.4])ei([0.4,0.5],[0.3,0.4])π ([0.1, 0.3], [0.3, 0.5])ei([0.4,0.4],[0.3,0.5])π ⎪ ⎪
⎫
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s 1 s 2 ⎪
⎪
⎨ ⎬
χD δ4 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.3,0.5],[0.2,0.3])π ⎪
⎪
⎪ ([0.1, 0.4], [0.3, 0.5])e i([0.3,0.5],[0.1,0.2])π
([0.4, 0.5], [0.2, 0.4])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
s3 s4
Step 1. IV-CIFHS-set ξ D is written as follows:

⎪
⎧
⎪
⎪ ⎪
⎧
⎪
⎪ ([0.4, 0.5], [0.3, 0.4])ei([0.1,0.4],[0.3,0.5])π ([0.2, 0.3], [0.2, 0.6])ei([0.2,0.3],[0.3,0.5])π ⎫ ⎪
⎪
⎪
⎪
⎫
⎪
⎪
⎪
⎪ ⎜
⎛
⎜ ⎪
⎪ , , ⎪
⎪ ⎟
⎞
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎪ s s ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎨
1 2 ⎪
⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ δ 1 , ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪ ⎜
⎜ ⎪ ⎪ ⎟
⎟ ⎪
⎪⎜
⎪
⎪
⎜
⎝ ⎪ ⎪
⎪ ([0.1, 0.4], [0.4, 0.5])e i([0.3,0.4],[0.1,0.3])π
([0.4, 0.5], [0.2, 0.4])e i([0.1,0.4],[0.1,0.2])π ⎪
⎪
⎪ ⎠⎪
⎟
⎟ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎪
⎪ 3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧ ([0.1, 0.2], [0.2, 0.7])e i([0.2,0.4],[0.3,0.5])π
([0.1, 0.6], [0.2, 0.3])e i([0.4,0.5],[0.2,0.3])π
⎪
⎫ ⎪
⎪
⎪
⎪ ⎪
⎪ ⎪
⎪ ⎪
⎪
⎪
⎪ ⎛
⎜
⎜ ⎪
⎪ , ⎪
⎪ ⎞
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ s 1 s 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎨ ⎪
⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ δ 2 , ⎪ ⎪ ⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ i([0.2,0.2],[0.1,0.5])π i([0.1,0.3],[0.3,0.6])π ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎝ ⎪ ⎪ ([0.2, 0.3], [0.1, 0.6])e ([0.2, 0.4], [0.3, 0.4])e ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎪
⎨ 3 4 ⎪
⎬
ξD � ⎪
⎪ ⎪.
⎪
(35)
⎪
⎪ i([0.1,0.4],[0.4,0.5])π i([0.3,0.6],[0.2,0.3])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.2, 0.3], [0.2, 0.5])e ([0.2, 0.4], [0.1, 0.3])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ s s ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎨ ⎪
⎪ 1 2 ⎪
⎪ ⎟⎪
⎟ ⎪
⎪
⎪ ⎜
⎜ ⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ δ3 , ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎝ ⎪
⎪ ([0.2, 0.4], [0.1, 0.3])e i([0.2,0.5],[0.1,0.2])π
([0.3, 0.3], [0.2, 0.6])e i([0.2,0.5],[0.2,0.4])π ⎪
⎪ ⎟
⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ , ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ ⎭ ⎪
⎪
⎪
⎪ s3 s4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.4,0.5],[0.3,0.4])π i([0.4,0.4],[0.3,0.5])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.3, 0.5], [0.3, 0.4])e ([0.1, 0.3], [0.3, 0.5])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪
⎪ s s ⎪⎟
⎪ ⎟ ⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ 1 2 ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎨ ⎬ ⎟⎪
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ δ 4, ⎪
⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎪ ⎪
⎪ ⎪
⎪⎟⎟⎪
⎟ ⎪
⎪
⎪ ⎝ ⎪ ([0.1, 0.4], [0.3, 0.5])e i([0.3,0.5],[0.1,0.2])π
([0.4, 0.5], [0.2, 0.4])e i([0.3,0.5],[0.2,0.3])π ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ , ⎪
⎪ ⎪
⎪
⎩ ⎩ ⎭ ⎭
s3 s4
Step 2. The cardinal is computed as follows:
⎪
⎧ ([0.275, 0.425], [0.275, 0.475]) ([0.150, 0.375], [0.200, 0.500]) ⎪
⎫
⎪
⎪ , ⎪
⎪
⎪
⎪ δ1 δ2 ⎪
⎪
�� ⎪
⎨ ⎪
⎬
��ξ D ��(Amplitude Term) � ,
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪ ([0.225, 0.350], [0.150, 0.425]), ([0.225, 0.425], [0.275, 0.450])
⎪
⎩
⎪
⎪
⎭
δ3 δ4
(36)
⎪
⎧ ([0.175, 0.375], [0.200, 0.375]) ([0.225, 0.350], [0.225, 0.475]) ⎪
⎫
⎪
⎪ , ⎪
⎪
⎪
⎪ δ1 δ2 ⎪
⎪
�� ⎪
⎨ ⎪
⎬
��ξ D ��(Phase Term) � .
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.200, 0.500], [0.225, 0.350]) ([0.350, 0.475], [0.225, 0.350]) ⎪
⎪
⎩ , ⎭
δ3 δ4
􏽺􏽽􏽼􏽻
Step 3. The set ξ D can be determined as follows:
m11 m12 m13 m14 [0.275, 0.425], [0.275, 0.475]

⎢
⎡
⎢
⎢ ⎥⎥⎤⎥⎡⎢⎢⎢ ⎤⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥⎢⎢⎢ ⎥⎥⎥
􏽺􏽽􏽼􏽻 ⎢
⎢
⎢ m m m m ⎥
⎥
⎥ ⎢
⎢
⎢ [0.150, 0.375], [0.200, 0.500] ⎥⎥⎥
1⎢ 21 22 23 24 ⎥⎥⎥⎢⎢⎢ ⎥⎥⎥
ξ D (Apmlitude Term) � ⎢
⎢
⎢
⎢ ⎥
⎥⎥⎥⎢⎢⎢ ⎢ ⎥⎥⎥, (37)
4⎢
⎢
⎢
⎢ m m m m ⎥
⎥
⎥ ⎢
⎢
⎢ [0.225, 0.350], [0.150, 0.425]
⎥⎥⎥
⎥⎥⎥
⎢
⎢
⎢ 31 32 33 34 ⎥ ⎥⎥⎥⎢⎢⎢⎢
⎢
⎣ ⎦⎣ ⎥⎥⎦
m41 m42 m43 m44 [0.225, 0.425], [0.275, 0.450]
where
m11 � [0.4, 0.5], [0.3, 0.4], m12 � [0.1, 0.2], [0.2, 0.7], m13 � [0.2, 0.3], [0.2, 0.5], m14 � [0.3, 0.5], [0.3, 0.4],
m21 � [0.2, 0.3], [0.2, 0.6], m22 � [0.1, 0.6], [0.2, 0.3], m23 � [0.2, 0.4], [0.1, 0.3], m24 � [0.1, 0.3], [0.3, 0.5],
m31 � [0.1, 0.4], [0.4, 0.5], m32 � [0.2, 0.3], [0.1, 0.6], m33 � [0.2, 0.4], [0.1, 0.3], m34 � [0.1, 0.4], [0.3, 0.5],
m41 � [0.4, 0.5], [0.2, 0.4], m42 � [0.2, 0.4], [0.3, 0.4], m43 � [0.3, 0.3], [0.2, 0.6], m44 � [0.4, 0.5], [0.2, 0.4]
(38)
0.2 0.0 0.1 0.2 0.150 0.020000
⎢
⎡ ⎤⎥⎥⎥⎡ ⎢ ⎥⎥⎤⎥ ⎢ ⎡ ⎥⎥⎤⎥
⎢
⎢
⎢
⎢ ⎥⎥⎥⎢ ⎢
⎢
⎢ ⎥⎥⎥ ⎢ ⎢
⎢
⎢ ⎥⎥
⎢
⎢
1⎢
⎢
⎢ 0.1 0.4 0.3 0.0 ⎥⎥⎥⎢ ⎢
⎢
⎢ 0.175 ⎥⎥⎥⎥ ⎢ ⎢
⎢
⎢
⎢ 0.036250 ⎥⎥⎥⎥⎥
⎢ ⎥
⎥⎥⎥⎢ ⎢ ⎥⎥⎥ ⎢ ⎥⎥⎥
� ⎢
⎢
⎢ ⎥⎥⎥⎢ ⎢
⎢
⎢ ⎥⎥⎥ � ⎢
⎢
⎢
⎢ ⎥⎥⎥.
4⎢
⎢
⎢
⎢ 0.0 0.2 0.3 0.1 ⎥
⎥ ⎢
⎢
⎢ 0.200 ⎥
⎥
⎥
⎢
⎢
⎢
⎢ 0.027500 ⎥⎥⎥
⎢
⎢ ⎥ ⎢
⎥⎥⎥⎢ ⎥ ⎢
⎥⎥⎥ ⎢ ⎥⎥⎥
⎢
⎢
⎣ ⎦⎢
⎢
⎣ ⎦ ⎢
⎢
⎣ ⎥⎦
0.3 0.1 0.1 0.3 0.150 0.031875
􏽺􏽽􏽼􏽻
ξ D (PhaseTerm) �
[0.1, 0.4], [0.3, 0.5] [0.2, 0.4], [0.3, 0.5] [0.1, 0.4], [0.4, 0.5] [0.4, 0.5], [0.3, 0.4] [0.175, 0.375], [0.200, 0.375]
⎢
⎡
⎢
⎢ ⎤⎥⎥⎥⎢⎢⎡⎢ ⎥⎥⎤⎥
⎢
⎢
⎢ ⎥⎥⎥⎢⎢⎢ ⎥⎥⎥
⎢ [0.2, 0.3], [0.3, 0.5] [0.4, 0.5], [0.2, 0.3] [0.3, 0.6], [0.2, 0.3] [0.4, 0.4], [0.3, 0.5] ⎥⎥⎥⎥⎥⎢⎢⎢⎢⎢ [0.225, 0.350], [0.225, 0.475] ⎥⎥⎥⎥⎥
⎢
1⎢
⎢
⎢
⎢
⎢ ⎥⎥⎥⎢⎢⎢ ⎥⎥⎥
4⎢
⎢
⎢
⎢
⎢
⎥⎥⎥⎢⎢⎢
[0.3, 0.4], [0.1, 0.3] [0.2, 0.2], [0.1, 0.5] [0.2, 0.5], [0.1, 0.2] [0.3, 0.5], [0.1, 0.2] ⎥⎥⎥⎢⎢⎢ [0.200, 0.500], [0.225, 0.350] ⎥⎥⎥⎥⎥
⎥ ⎢
⎥⎥
⎢
⎢
⎢
⎢
⎣ ⎥ ⎢
⎥⎦⎢⎣ ⎥⎥⎦
[0.1, 0.4], [0.1, 0.2] [0.1, 0.3], [0.3, 0.6] [0.2, 0.5], [0.2, 0.4] [0.3, 0.5], [0.2, 0.3] [0.350, 0.475], [0.225, 0.350]
0.1 0.1 0.0 0.2 0.175 0.020000

⎢
⎡
⎢
⎢ ⎤⎥⎥⎥⎡ ⎢
⎢
⎢ ⎤⎥⎥⎥ ⎡ ⎢
⎢
⎢ ⎤⎥⎥⎥
⎢
⎢
⎢ ⎥
⎥⎥⎥⎢ ⎢
⎢ ⎥
⎥⎥⎥ ⎢ ⎢
⎢ ⎥⎥⎥
⎢
⎢ 0.0 0.3 0.4 0.1 ⎥
⎥ ⎢
⎢
⎢ 0.125 ⎥
⎥ ⎢
⎢
⎢ 0.043125 ⎥⎥⎥
1⎢
⎢ ⎥
⎥⎥⎥⎢ ⎢ ⎥
⎥⎥⎥ ⎢ ⎢ ⎥⎥⎥
� ⎢
⎢
⎢
⎢
⎢ ⎥
⎥
⎢
⎢
⎢
⎢ ⎥
⎥ � ⎢
⎢
⎢
⎢ ⎥⎥⎥,
4⎢
⎢ ⎥
⎥⎥⎥⎢⎢
⎢ ⎥
⎥⎥⎥ ⎢ ⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ 0.3 0.1 0.4 0.4 ⎥ ⎢
⎢ 0.275 ⎥
⎥ ⎢
⎢
⎢ 0.068750 ⎥⎥⎥
⎢
⎢ ⎥ ⎢
⎥⎦⎢ ⎥⎥⎦ ⎢⎢ ⎥⎥⎦
⎣ ⎣ ⎣
0.3 0.0 0.3 0.3 0.250 0.052500
􏽺􏽽􏽼􏽻 0.020000ei0.020000π 0.036250ei0.043125π 0.027500ei0.068750π 0.031875ei0.052500π

ξD �􏼨 , , , 􏼩.
s1 s2 s3 s4
(39)
Consider the modulus value max(η􏽺􏽽􏽼􏽻)�

of
ξD s3 , 0.00749999154/s4 }� 0.02124999361/s1 . This means that
max􏼈0.02124999361/s1 , 0.01624997922/s2 , 0.0131496449/ s1 may be recommended for suitable investment.
4. Interval-Valued Complex Neutrosophic which

← is a→ IV − CN←approximate
→ function
← →ΩM and Λ(λ) �
of
Hypersoft Set (IV-CNHS-Set) 〈[Λ1 (λ), Λ 1 (λ)], [Λ2 (λ), Λ 2 (λ)], [Λ3 (λ), Λ 3 (λ)]〉 with
lower and upper bounds of membership, nonmembership,
The basic theory of the IV-CNHS-set is developed in this and indeterminacy function are given below, respectively:
section. ← ←
←
→ → →
(i) (Λ1 (λ) � c eiθ , Λ 1 (λ) � c ei θ ) for the M-function
of ΩM
Definition 27. Let M1 , M2 , M3 , . . . , Mn are disjoint sets of n ← ←
←
→ → →
distinct attributes m1 , m2 , m3 , . . . , mn , respectively, for (ii) (Λ2 (λ) � c eiθ , Λ 2 (λ) � c ei θ ) for the NM-func-
n ≥ 1, M � M1 × M2 × M3 × . . . × Mn and Λ(λ) be an IV- tion of ΩM ←
← ← → → →
CNFS over Z for all λ � (b1 , b2 , b3 , . . . , bn ) ∈ M. Then, in- (iii) (Λ3 (λ) � c eiθ , Λ 3 (λ) � c ei θ ) for the ID-function
terval-valued complex neutrosophic hypersoft set (IV- of ΩM and its value Λ(λ) is called λ-member of IV-
CNHS-set), denoted by ΩM � (Λ, M), over Z is given as CNHS-set ∀ λ ∈ M
follows: Note: The collection of all IV-CNHS-sets is denoted
ΩM � 􏼈 λ, Λ λ􏼁􏼁: λ ∈ M, Λ λ􏼁 ∈ CIV (Z)􏼉, (40) by ⊎ .
IVCNHS
where
Example 3. Consider M � 􏼈e1 , e2 , e3 , . . . , e8 􏼉 with IV-
Λ: M ⟶ CIV (Z),
(41) CNHS-sets ΛM (e1 ), ΛM (e2 ), . . . , ΛM (e8 ) that are defined as
Λ λ􏼁 � ∅ if λ ∉ M, follows:
⎪
⎧
⎪
⎪ ([0.1, 0.2], [0.1, 0.4], [0.2, 0.3])ei([0.1,0.2],[0.3,0.4],[0.3,0.3])π ([0.1, 0.3], [0.2, 0.4], [0.2, 0.2])ei([0.1,0.2][0.3,0.4],[0.1,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t 2 ⎪
⎪
⎨ ⎬
ΛM e1 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.2,0.2],[0.2,0.4],[0.2,0.3])π ⎪
⎪
⎪ ([0.1, 0.2], [0.3, 0.3], [0.3, 0.4])e i([0.1,0.1],[0.4,0.5],[0.3,0.3])π
([0.1, 0.2], [0.3, 0.4], [0.2, 0.3])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.2, 0.3], [0.3, 0.3], [0.1, 0.3])ei([0.1,0.2],[0.1,0.5],[0.1,0.2])π ([0.3, 0.4], [0.3, 0.4], [0.1, 0.1])ei([0.1,0.2],[0.2,0.4],[0.2,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t 1 t 2 ⎪
⎪
⎨ ⎬
ΛM e2 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.1,0.3],[0.2,0.2],[0.2,0.3])π ⎪
⎪
⎪ ([0.2, 0.3], [0.2, 0.4], [0.2, 0.3])e i([0.1,0.2],[0.1,0.4],[0.3,0.3])π
([0.1, 0.1], [0.4, 0.4], [0.3, 0.4])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.1, 0.3], [0.2, 0.4], [0.2, 0.2])ei([0.1,0.2],[0.2,0.3],[0.3,0.4])π ([0.1, 0.3], [0.1, 0.2], [0.3, 0.4])ei([0.1,0.2],[0.2,0.3],[0.2,0.4])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t2 ⎪
⎪
⎨ ⎬
ΛM e3 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.2,0.3],[0.1,0.2],[0.3,0.4])π ⎪
⎪
⎪ ([0.1, 0.1], [0.1, 0.4], [0.1, 0.2])e i([0.1,0.2],[0.2,0.4],[0.3,0.3])π
([0.1, 0.3], [0.2, 0.3], [0.1, 0.3])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.1, 0.2], [0.2, 0.3], [0.1, 0.4])ei([0.1,0.2],[0.1,0.3],[0.2,0.2])π ([0.1, 0.3], [0.2, 0.4], [0.1, 0.2])ei([0.1,0.2],[0.1,0.3],[0.2,0.4])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t2 ⎪
⎪
⎨ ⎬
ΛM e4 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.1,0.3],[0.2,0.2],[0.1,0.3])π ⎪
⎪
⎪ ([0.4, 0.4], [0.1, 0.2], [0.1, 0.1])e i([0.1,0.2],[0.1,0.4],[0.2,0.3])π
([0.1, 0.1], [0.2, 0.3], [0.2, 0.4])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
⎪
⎧
⎪
⎪ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.2])ei([0.1,0.3],[0.2,0.3],[0.1,0.3])π ([0.1, 0.2], [0.2, 0.2], [0.2, 0.5])ei([0.1,0.1],[0.1,0.4],[0.3,0.4])π ⎫ ⎪
⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ t1 t2 ⎪
⎪
⎨ ⎬
ΛM e5 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.1,0.2],[0.3,0.4],[0.1,0.3])π ⎪
⎪
⎪ ([0.1, 0.2], [0.2, 0.6], [0.1, 0.1])e i([0.1,0.1],[0.1,0.2],[0.2,0.3])π
([0.1, 0.3], [0.3, 0.4], [0.1, 0.2])e ⎪
⎪
⎪
⎪ , ⎪
⎪
⎩ ⎭
t3 t4
Table 5: Tabular representation of ξ D .

⌣ ⌣ ⌣
ξD x1 x2 ... xr
η1χ (x⌣ ) (]1 ), η1χ (x⌣ ) (]1 ), η1χ (x⌣ ) (]1 ),

⎜
⎛
⎜
⎜ 2
D 1
⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2
D 2
⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2
D r
⎟
⎞
⎟
⎟
]1 ⎜ ⎟ ⎜ ⎟ ⎜ ⎟
⎝ ηχD (x⌣1 ) (]1 ), ⎟
⎜
⎜ ⎟
⎠ ⎝ ηχD (x⌣2 ) (]1 ), ⎟
⎜
⎜ ⎟
⎠ ··· ⎝ ηχD (x⌣r ) (]1 ), ⎟
⎜
⎜ ⎟
⎠
3 3 3
ηχ (x⌣ ) (]1 ) ηχ (x⌣ ) (]1 ) ηχ (x⌣ ) (]1 )
D 1 D 2 D r
η1χ (x⌣ ) (]2 ), η1χ (x⌣ ) (]2 ), η1χ (x⌣ ) (]2 ),

⎜
⎛
⎜
⎜ 2
D 1
⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2
D 2
⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2
D r
⎟
⎞
⎟
⎟
]2 ⎜ ⎟ ⎜ ⎟ ⎜ ⎟
⎝ ηχD (x⌣1 ) (]2 ), ⎟
⎜
⎜ ⎟
⎠ ⎝ ηχD (x⌣2 ) (]2 ), ⎟
⎜
⎜ ⎟
⎠ ··· ⎝ ηχD (x⌣r ) (]2 ), ⎟
⎜
⎜ ⎟
⎠
3 3 3
ηχ (x⌣ ) (]2 ) ηχ (x⌣ ) (]2 ) ηχ (x⌣ ) (]2 )
D 1 D 2 D r
⋮ ⋮ ⋮ ⋱ ⋮
η1χ (x⌣ ) (]m ), η1χ (x⌣ ) (]m ), η1χ (x⌣ ) (]m ),

⎜
⎛
⎜
⎜ 2
D 1
⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2
D 2
⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2
D r
⎟
⎞
⎟
⎟
]m ⎜ ⎟ ⎜ ⎟ ⎜ ⎟
⎝ ηχD (x⌣1 ) (]m ), ⎟
⎜
⎜ ⎟
⎠ ⎝ ηχD (x⌣2 ) (]m ), ⎟
⎜
⎜ ⎟
⎠ ··· ⎝ ηχD (x⌣r ) (]m ), ⎟
⎜
⎜ ⎟
⎠
3 3 3
ηχ (x⌣ ) (]m ) ηχ (x⌣ ) (]m ) ηχ (x⌣ ) (]m )
D 1 D 2 D r
⎪
⎧
⎪ ([0.2, 0.2], [0.3, 0.4], [0.1, 0.2])ei([0.1,0.2],[0.2,0.3],[0.3,0.4])π ([0.1, 0.1], [0.1, 0.3], [0.4, 0.4])ei([0.1,0.1],[0.2,0.5],[0.2,0.3])π ⎫ ⎪
⎪
⎪ , ,⎪
⎪
⎪
⎪
⎨ t1 t2 ⎪
⎬
ΛM e6 􏼁 � ⎪ ⎪,
⎪
⎪ i([0.1,0.2],[0.1,0.6],[0.1,0.1])π i([0.1,0.2],[0.1,0.6],[0.1,0.1])π ⎪
⎪
⎪
⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])e ([0.1, 0.1], [0.2, 0.5], [0.2, 0.3])e ⎪
⎪
⎩ , ⎭
t3 t4
⎪
⎧
⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])ei([0.1,0,1],[0.2,0.3],[0.1,0.5])π ([0.1, 0.2], [0.1, 0.3], [0.3, 0.4])ei([0.1,0.2],[0.2,0.2],[0.2,0.5])π ⎫ ⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎨ t1 t 2
⎪
⎬
ΛM e7 􏼁 � ⎪ ⎪ ,
⎪
⎪ i([0.1,0.2],[0.1,0.3],[0.2,0.4])π i([0.1,0.1],[0.2,0.5],[0.1,0.2])π ⎪
⎪
⎪
⎪ ([0.1, 0.2], [0.1, 0.3], [0.3, 0.4])e ([0.1, 0.2], [0.4, 0.5], [0.1, 0.2])e ⎪
⎪
⎩ , ⎭
t3 t4
(42)
⎪
⎧
⎪ ([0.1, 0.2], [0.3, 0.3], [0.1, 0.4])ei([0.1.0.2],[0.4,0.5],[0.1,0.2])π ([0.1, 0.2], [0.2, 0.3], [0.2, 0.4])ei([0.1,0.2],[0.1,0.2],[0.1,0.3])π ⎫ ⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎨ t 1 t2
⎪
⎬
ΛM e8 􏼁 � ⎪ ⎪ .
⎪
⎪ i([0.1,0.2],[0.1,0.3],[0.3,0.4])π i([0.1,0.3],[0.4,0.5],[0.1,0.1])π ⎪
⎪
⎪
⎪ ([0.1, 0.1][0.1, 0.2], [0.4, 0.5])e ([0.1, 0.2], [0.2, 0.3], [0.1, 0.4])e ⎪
⎪
⎩ , ⎭
t3 t4
(43)
Then IV-CNHS-set ΩM is written by

ΩW �
⎪
⎧
⎪
⎪ ⎪
⎧
⎪
⎪ ([0.1, 0.2], [0.1, 0.4], [0.2, 0.3])ei([0.1,0.2],[0.3,0.4],[0.3,0.3])π ([0.1, 0.3], [0.2, 0.4], [0.2, 0.2])ei([0.1,0.2][0.3,0.4],[0.1,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎫
⎪
⎪
⎪
⎪ ⎜
⎛
⎜
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎨
1 2 ⎪
⎬ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e 1 , ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪
⎪ i([0.1,0.1],[0.4,0.5],[0.3,0.3])π i([0.2,0.2],[0.2,0.4],[0.2,0.3])π ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎝ ⎪ ⎪ ([0.1, 0.2], [0.3, 0.3], [0.3, 0.4])e ([0.1, 0.2], [0.3, 0.4], [0.2, 0.3])e ⎪
⎪ ⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ t t ⎪
⎪
⎪
⎪ 3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.2, 0.3], [0.3, 0.3], [0.1, 0.3])e i([0.1,0.2],[0.1,0.5],[0.1,0.2])π
([0.3, 0.4], [0.3, 0.4], [0.1, 0.1])e i([0.1,0.2],[0.2,0.4],[0.2,0.3])π ⎫⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , ⎪
⎪ ⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪ ⎪ ⎞
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ t 1 t 2 ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎨ ⎪
⎬ ⎟
⎟ ⎪
⎪⎜
⎪
⎜
⎜e , ⎟⎪
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ 2 ⎪ ⎪ ⎟
⎟⎪
⎟ ⎪
⎪
⎪⎜⎜ ⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪ ⎜ ⎪ ⎪
⎪
⎪
⎪ ⎝ ⎪
⎜ ⎪
⎪ ([0.2, 0.3], [0.2, 0.4], [0.2, 0.3])ei([0.1,0.2],[0.1,0.4],[0.3,0.3])π ([0.1, 0.1], [0.4, 0.4], [0.3, 0.4])ei([0.1,0.3],[0.2,0.2],[0.2,0.3])π ⎪ ⎪
⎪ ⎠⎪
⎟
⎟ ⎪
⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ t t ⎪
⎪
⎪
⎪
3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.1,0.2],[0.2,0.3],[0.3,0.4])π i([0.1,0.2],[0.2,0.3],[0.2,0.4])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.1, 0.3], [0.2, 0.4], [0.2, 0.2])e ([0.1, 0.3], [0.1, 0.2], [0.3, 0.4])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ 1 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎨ ⎬ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e , ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪ 3 ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ i([0.2,0.3],[0.1,0.2],[0.3,0.4])π ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎝ ⎪
⎪ ([0.1, 0.1], [0.1, 0.4], [0.1, 0.2])e i([0.1,0.2],[0.2,0.4],[0.3,0.3])π
([0.1, 0.3], [0.2, 0.3], [0.1, 0.3])e ⎪
⎪ ⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ , ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ ⎭ ⎪
⎪
⎪
⎪ t 3 t 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧ i([0.1,0.2],[0.1,0.3],[0.2,0.2])π i([0.1,0.2],[0.1,0.3],[0.2,0.4])π ⎫⎪ ⎪
⎪
⎪
⎪ ⎪
⎪ ([0.1, 0.2], [0.2, 0.3], [0.1, 0.4])e ([0.1, 0.3], [0.2, 0.4], [0.1, 0.2])e ⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ t t ⎪⎟
⎪ ⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎨
1 2 ⎪
⎬⎟⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e 4 , ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎪
⎪ i([0.1,0.2],[0.1,0.4],[0.2,0.3])π i([0.1,0.3],[0.2,0.2],[0.1,0.3])π ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎝ ⎪
⎪ ([0.4, 0.4], [0.1, 0.2], [0.1, 0.1])e ([0.1, 0.1], [0.2, 0.3], [0.2, 0.4])e ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎪
⎪ t3 t4 ⎪
⎪
⎪
⎨ ⎪
⎬
⎪ ⎪ . (44)
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.2])e i([0.1,0.3],[0.2,0.3],[0.1,0.3])π
([0.1, 0.2], [0.2, 0.2], [0.2, 0.5])e i([0.1,0.1],[0.1,0.4],[0.3,0.4])π ⎫⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪ t1 t2 ⎪ ⎟
⎟ ⎪
⎪⎜
⎪ ⎜ ⎨
⎜ ⎪ ⎪
⎬ ⎟⎪
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ e5 , ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎝ ⎪
⎪ ([0.1, 0.2], [0.2, 0.6], [0.1, 0.1])e i([0.1,0.1],[0.1,0.2],[0.2,0.3])π
([0.1, 0.3], [0.3, 0.4], [0.1, 0.2])e i([0.1,0.2],[0.3,0.4],[0.1,0.3])π ⎪
⎪ ⎟
⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ , ⎭ ⎪
⎪
⎪
⎪ t 3 t 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.1,0.2],[0.2,0.3],[0.3,0.4])π i([0.1,0.1],[0.2,0.5],[0.2,0.3])π ⎫ ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.2, 0.2], [0.3, 0.4], [0.1, 0.2])e ([0.1, 0.1], [0.1, 0.3], [0.4, 0.4])e ⎪
⎪ ⎪
⎪
⎪⎛
⎪ ⎜
⎜ ⎪
⎪ , , ⎪
⎪ ⎟
⎞
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ t t ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ 1 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎨ ⎬⎟⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ e ,
6 ⎪
⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪
⎝ ⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])e i([0.1,0.2],[0.1,0.6],[0.1,0.1])π
([0.1, 0.1], [0.2, 0.5], [0.2, 0.3])e i([0.1,0.2],[0.1,0.6],[0.1,0.1])π ⎪
⎪ ⎟
⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ , ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ ⎭ ⎪
⎪
⎪
⎪ t3 t4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])e
⎧ i([0.1,0,1],[0.2,0.3],[0.1,0.5])π i([0.1,0.2],[0.2,0.2],[0.2,0.5])π ⎪ ⎪
⎫ ⎪
⎪
⎪ ⎪
⎪ ([0.1, 0.2], [0.1, 0.3], [0.3, 0.4])e ⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎪ ⎪
⎪ t t ⎪
⎪ ⎟⎪
⎟ ⎪
⎪
⎪ ⎜ 1 2 ⎪ ⎟
⎟ ⎪
⎪
⎪ ⎜
⎜ ⎨ ⎬ ⎟⎪
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜
⎜ e 7 , ⎪ ⎪
⎟
⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ i([0.1,0.2],[0.1,0.3],[0.2,0.4])π i([0.1,0.1],[0.2,0.5],[0.1,0.2])π ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜ ⎪
⎝ ⎪ ([0.1, 0.2], [0.1, 0.3], [0.3, 0.4])e ([0.1, 0.2], [0.4, 0.5], [0.1, 0.2])e ⎪
⎪ ⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎭ ⎪
⎪ ⎪
⎪
⎪ t t ⎪
⎪
⎪
⎪ 3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])e i([0.1,0,1],[0.2,0.3],[0.1,0.5])π
([0.1, 0.2], [0.1, 0.3], [0.3, 0.4])e i([0.1,0.2],[0.2,0.2],[0.2,0.5])π ⎫⎪
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛ ⎪
⎪ , ⎪
⎪ ⎟
⎞ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪
⎪ ⎪
⎪⎟⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ t 1 t 2 ⎪ ⎟
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎨ ⎪
⎬ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ e , ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 8 ⎪ ⎪ ⎟
⎟⎪
⎟ ⎪
⎪
⎪⎜⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ i([0.1,0.2],[0.1,0.3],[0.2,0.4])π i([0.1,0.1],[0.2,0.5],[0.1,0.2])π ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪ ⎝ ⎪
⎪ ([0.1, 0.2], [0.1, 0.3], [0.3, 0.4])e ([0.1, 0.2], [0.4, 0.5], [0.1, 0.2])e ⎪
⎪ ⎠ ⎪
⎪
⎪
⎪ ⎪
⎩ , ⎪
⎭ ⎪
⎪
⎩ t3 t4 ⎭
Definition 28. Let ΩM1 � (Λ1 , M1 ) and ΩM2 � (Λ2 , M2 ) be Definition 31. For two IV-CNHS-sets (Λ1 , M1 ) and
two IV-CNHS-set over the same Z. The set ΩM1 � (Λ1 , M1 ) (Λ2 , M2 ) over the same universe Z, the following definitions
is said to be the subset of ΩM2 � (Λ2 , M2 ), if hold:
(i) M1 ⊆M2 (i) A IV-CNHS-set (Λ1 , M1 ) is a homogeneous IV-
← ⌣ ←
⌣
(ii) ∀x ∈→ M1 , Λ1→
⌣
(x)⊆Λ2 (x)
⌣
implies Λ1 (x)⊆Λ2 CNHS-set, represented by (Λ1 , M1 )Hom if and only
⌣ ⌣
⌣ ⌣ ⌣
(x), Λ 1 (x)⊆ Λ 2 (x), that is, if Λ1 (x) is a homogeneous IV-CNHS-set ∀x ∈ M1
← ⌣ ← (ii) A IV-CNHS-set (Λ1 , M1 ) is a completely homo-
c M1 (x) ≤ c M2 ← ←
⌣ → ⌣ → ⌣ ⌣ ⌣ geneous IV-CNHS-set, represented by
(x
→ ), c⌣M1 (x→) ≤ c⌣M2 (x), θ M1 (x) ≤ θ M2 (x) and ⌣
(Λ1 , M1 )CHom if and only if Λ1 (x) is a homoge-
θ M1 (x) ≤ θ M2 (x), ⌣
neous with Λ1 (y) ∀x, y ∈ M1
where A- and P-terms of each Λi , i � 1, 2 are given
below: (iii) A IV-CNHS-set (Λ1 , M1 ) is a completely homo-
← ⌣
←
⌣ ← ⌣ geneous IV-CNHS-set with (Λ2 , M2 ) if and only if
(c M1 (x), θ→ ⌣
M1 (x)) for Λ←1 (x) Λ1 (x) is a homogeneous with
→ ⌣ ⌣ ⌣ ⌣ ⌣
θ M1 (x)) for Λ
( c M1 (x), → ←1 (x ) Λ2 (x)∀x ∈ M1 􏽑 M2
→ ⌣ ⌣ ⌣
θ M2 (x)) for Λ
( c M2 (x), → ← ⌣)
2 (x
→ ⌣ ⌣
( c M2 (x), θ M2 (x)) for Λ2 (x)
4.1. Set Theoretic Operations and Laws on IV-CNHS-Set.
Definition 29. Two IV-CNHS-set ΩM1 � (Λ1 , M1 ) and Some basic set operations and laws are discussed on IV-
ΩM2 � (Λ2 , M2 ) over the same Z, are said to be equal if CNHS-set in this section.
(i) (Λ1 , M1 )⊆(Λ2 , M2 ) Definition 32. The complement of IV-CNHS-set (Λ, M),
(ii) (Λ2 , M2 )⊆(Λ1 , M1 ) denoted by (Λ, M)c , is stated as follows:
⌣ ⌣ ⌣ ⌣
(Λ, M)c � 􏽮􏼐x, (Λ(x))c 􏼑: x∈ M, (Λ(x))c ∈ CIV (Z)􏽯,
Definition 30. Let (Λ, M) be a IV-CNHS-set over Z. Then (45)
⌣ c
(i) (Λ, M) is called a null IV-CNHS-set, presented by where the A- and P-terms of the M-function (Λ(x)) are
⌣ ← ⌣ ← ⌣ → ⌣ c →
(Λ, M)Φ ; if for all values of x ∈ M, the A-term of the given by (c M (x))c � 1 −←c M (x) and ( c M
←((x))) � 1− c M
← ⌣ → ⌣ ⌣ ⌣ c ⌣
M-function←is given → by c M (x) � c M (x) � 0 and →) ⌣ and → (θ
(x M (x)) � 2π − θ M (x) and
⌣ ⌣ ⌣
P-term by θ M (x) � θ M (x) � 0π ( θ M (x))c � 2π − θ M (x), respectively.
(ii) (Λ, M) is called an absolute IV-CNHS-set, repre-
⌣
sented by (Λ, M)Δ ; if ∀x ∈ M, the A-term of the Proposition 6. Let (Λ, M) be a IV-CNHS-set over Z. Then
M-function is given by →
← ⌣ → ⌣
c M (x) � c M (x) � 1 ((Λ, M)c )c � (Λ, M).
←
⌣ ⌣
whereas P-term by θ M (x) � θ M (x) � 2π ⌣
Proof. Since Λ(x) ∈ CIV (Z), therefore, in terms of its A-
and P-terms, (Λ, M) can be written as follows:
← ⌣
→ ⌣
→ ⌣
(Λ, M) � 􏼨􏼠x, 􏼠 c M (x)ei θ M (x) , c M (x)ei θ D (x) 􏼡􏼡: x ∈ M􏼩.
⌣ ← ⌣ ⌣
(46)
Now,
⎧
⎪ c
→ ⌣ c ⎪
⎫
⎨ ⌣ c i􏼒 θ D (x)􏼓 ⎞ ⎬
c ←
⌣
c ⌣ ⎜
⎛ ⎜
⌣ ⎛ ← ⌣ i􏼐 θ M (x)􏼑 → ⎟ ⎟ ⌣
(Λ, M) (x) � ⎪⎝x, ⎝􏼒 c M (x)􏼓 e , 􏼐 c M (x)􏼑 e ⎠⎞⎠: x ∈ M ⎪,
⎩ ⎭
⎪
⎧ c
→ ⌣ ⎪
⎫
c
⎨⎜ ← c
􏼐
← ⌣
􏼑 → c i􏼒2π− θ D (x)􏼓 ⎬
c ⌣
(Λ, M) (x) � ⎪⎝
⌣ ⎜
⎛x, ⎝ ⌣
⎛􏼒1 − c (x)􏼓 ei 2π− θ M (x ) ⌣
, 􏼐1 − c M (x)􏼑 e ⎞⎟
⎟
⎠ ⎠ ⌣
⎞: x ∈ M⎪,
M
⎩ ⎭
⎪
⎧ c
→ ⌣ ⎪
⎫
c
⎨⎜⌣ ⎜ → ⌣ c i􏼒2π− θ D (x)􏼓 ⎟ ⎬

c ←
⌣
c c ⎛
⎝ ⎛
⎝ ← ⌣ i􏼐2π− θ M (x)􏼑 ⎞⎞
⎠ ⎟ ⌣
⎠: x (47)
(ψ, G) 􏼁 � ⎪ x, 􏼒1 − c M (x)􏼓 e , 􏼐1 − c M (x)􏼑 e ∈ M⎪,
⎩ ⎭
⎪
⎧ → ⌣ ⎪
⎫
⎨⎜⌣ ⎜ ←
← ⌣
i􏼐2π−􏼐2π− θ M (x)􏼑􏼑 → ⌣ i􏼒2π−􏼒2π− θ D (x)􏼓􏼓 ⎬
c c ⎛
⎝ ⎛
⎝ ⌣
(Λ, M) 􏼁 � ⎪ x, 􏼒1 − 􏼒1 − c M (x)􏼓􏼓e , 􏼐1 − 􏼐1 − c M (x)􏼑􏼑e ⎟
⎞
⎠⎞⎟ ⌣
⎠: x ∈ M⎪,
⎩ ⎭
← ⌣
→ ⌣
c c ⌣ ← ⌣ → ⌣ θ D (x) ⌣
(Λ, M) 􏼁 � 􏼨􏼠x, 􏼠 c M (x)eiθ M (x) , c M (x)ei 􏼡􏼡: x∈ M􏼩.
From equations (46) and (47), we have Definition 33. For two IV-CNHS-set (Λ1 , M1 ) and
((Λ, M)c )c � (Λ, M). □ (Λ2 , M2 ), the intersection (Λ1 , M1 ) 􏽑(Λ2 , M2 ) over the
same universe Z is the IV-CNHS-set (Λ3 , M3 ), where
⌣
Proposition 7. Let (Λ, M) be a IV-CNHS-set over Z. Then M3 � M1 ∐M2 , and for all x ∈ M3 ,
(i) ((Λ, M)Φ )c � (Λ, M)Δ
(ii) ((Λ, M)Δ )c � (Λ, M)Φ
←
⎪
⎧
⎪ ← ⌣ ⌣
⌣
⎪
⎪ c M1 (x)ei θ M1 (x) , if x∈ M1 \M2 ,
⎪
⎪
← ⌣ ⎪
⎨ ← ⌣
← ⌣ i θ M (x ⌣
Λ3 (x) � ⎪ c M2 (x )e 2 ) , if x∈ M2 M1 ,
⎪
⎪
⎪
⎪ ← ⌣ ←
⎪
⎪ ← ⌣ ← ⌣
⌣
i min􏽨 θ M1 (x),θ M2 (x)􏽩 ⌣
⎩ min􏼔 c M (x ), c M (x ) 􏼕e , if x∈ M1 􏽙 M2 ,
1 2
→ ⌣ (48)
⎪
⎧
⎪ → ⌣ i θ M (x ) ⌣
⎪
⎪ c M (x )e 1 , if x∈ M1 \M2 ,
⎪
⎪ 1
⎪
→ ⌣ ⎪ ⎨ → ⌣
Λ 3 (x) � ⎪ →
c M2 (x)ei θ M2 (x) ,
⌣ ⌣
if x∈ M2 M1 ,
⎪
⎪
⎪
⎪ → ⌣ → ⌣
⎪
⎪ i min􏼔 θ M1 (x), θ M2 (x)􏼕
⎪
⎩ min􏽨→ ⌣ → ⌣ ⌣
c M1 (x), c M2 (x)􏽩e , if x∈ M1 􏽙 M2 .
Definition 34. The difference between two IV-CNHS-set Definition 35. For two IV-CNHS-set (Λ1 , M1 ) and
(Λ1 , M1 ) and (Λ2 , M2 ) is defined as follows: (Λ2 , M2 ), the union (Λ1 , M1 )∐(Λ2 , M2 ) over the same
c universe Z is the IV-CNHS-set (Λ3 , M3 ), where
Λ1 , M1 􏼁∖ Λ2 , M2 􏼁 � Λ1 , M1 􏼁 􏽙 Λ2 , M2 􏼁 . (49) ⌣
M3 � M1 ∐M2 , and for all x ∈ M3 ,
←
⎪
⎧
⎪ ← ⌣ ⌣
⌣
⎪
⎪ c M1 (x)eiθ M1 (x) , if x∈ M1 M2 ,
⎪
⎪
← ⌣ ⎪
⎨← ←
⌣
⌣ iθ M (x ⌣
Λ3 (x) � ⎪ c M2 (x )e 2 ) , if x∈ M2 M1 ,
⎪
⎪
⎪
⎪ ← ←
⎪
⎪ ← ⌣ ← ⌣
⌣ ⌣
i max􏽨 θ M1 (x), θ M2 (x)􏽩 ⌣
⎩ max􏼔 c M (x ), c M2 (x)􏼕e , if x∈ M1 􏽙 M2 ,
1
→ ⌣ (50)
⎧
⎪
⎪ → ⌣ i θ M (x ) ⌣
⎪
⎪ c M (x )e 1 , if x∈ M1 M2 ,
⎪
⎪ 1
⎪
→ ⌣ ⎪ ⎨ → ⌣
Λ 3 (x) � ⎪ →
c M2 (x)ei θ M2 (x) ,
⌣ ⌣
if x∈ M2 M1 ,
⎪
⎪
⎪
⎪ → ⌣ → ⌣
⎪
⎪ i max􏼔 θ M1 (x), θ M2 (x)􏼕
⎪
⎩ → ⌣ → ⌣ ⌣
max􏽨 c M1 (x), c M2 (x)􏽩e , if x∈ M1 􏽙 M2 .
􏼌􏼌 ⌣ 􏼌􏼌􏼌
⌣ ⌣ ⌣
􏼌􏼌χ (x )􏼌
1 2 3 D (53)
Note: Propositions 3–5 are also valid for SV-NHS-sets. η‖ξD ‖ (x), η‖ξD ‖ (x), η‖ξD ‖ (x) � ,
|Z|
4.2. Aggregation of Interval-Valued Complex Neutrosophic respectively. These have interval-valued neutrosophic values.
Hypersoft Set. In this part of the paper, aggregation oper- Note that ‖Civcnhss (Z)‖ is the collection of all cardinal sets of
ations and their decisive system for IV-CNHS-set are IV-CNHS-sets and ‖Civcnhss (Z)‖⊆IVN(D).
established that results an aggregate fuzzy set from a CNHS-
set and its cardinal set and has fuzzy-like nature. The terms Definition 38. Let ξ D ∈ Civcnhss (Z) and ‖ξ D ‖ ∈ ‖Civcnhss
D, E, ξ D and ⊎ are in accordance with Definition 27. (Z)‖. Consider E as in Definition 27; the tabular repre-
IVCNHS
sentation of ‖ξ D ‖ can be seen in Table 6.
⌣ ⌣ ⌣
Definition 36. Let ξ D ∈ ⊎IVCNHS . Assume that If α1j � (η1‖ξD ‖ (xj ), η2‖ξD ‖ (xj ), η3‖ξD ‖ (xj )), for j � Nr1 .
Z � 􏼈]1 , ]2 , . . . , ]m 􏼉 and E � 􏼈L1 , L2 , . . . , Ln 􏼉 with L1 � then the cardinal set ‖ξ D ‖ is represented by the following
􏼈e11 , e12 , . . . , e1n 􏼉, L2 � 􏼈e21 , e22 , . . . , e2n 􏼉, . . . , Ln � matrix:
⌣ ⌣
􏼈en1 , en2 , . . . , enn 􏼉 and D � L1 × L2 × · · · × Ln � 􏽮x1 , x2 , 􏽨αij 􏽩1×r � 􏼂 α11 α12 · · · α1r 􏼃, (54)
⌣ ⌣ ⌣ ⌣
. . . , xn , . . . , xnn � xr }, each xi is n-tuple element of D and
|D| � r � nn ; the representation of ξ D can be seen in Table 5. which is called the cardinal matrix of ‖ξ D ‖.
In Table 5, η1χD (x) , η2χD (x) , and η2χD (x) are M-function, ID-
function, and NM-function of χ D , respectively, with inter- Definition 39. Let ξ D ∈ Civcnhss (Z) and ‖ξ D ‖ ∈ ‖Civcnhss
val-valued neutrosophic values. If αij � (η1χ (x⌣ ) (]i ), (Z)‖. Then IV-CNHS-aggregation operator is defined as
D j
η2χ (] ), η3χ (] )), for i � Nm r follows:

⌣
(x ) i
⌣
(x ) i 1 and j � N1 , then IV- 􏽺􏽽􏽼􏽻
D j D j ��
CNHS-set ξ D is uniquely characterized by the following ξ D � Aivcifhss 􏼐��ξ D �,
� ξ D 􏼑, (55)
matrix:
where
α11 α12 · · · α1r ��
⎢
⎡
⎢
⎢
⎢
⎥⎥⎤⎥
⎥⎥⎥ Aivcnhss : ��Civcnhss (Z)�� × Civcifhss (Z) ⟶ F(Z), (56)
⎢
⎢ α α · · · α ⎥⎥⎥,
􏽨αij 􏽩 � ⎢
⎢ 21 22 2r 􏽺􏽽􏽼􏽻
⎢
⎢
⎢ ⎥⎥⎥ (51)
⎢
⎢
⎢ ⋮ ⋮ ⋱ ⋮ ⎥⎥⎦ where ξ D is called the aggregate fuzzy set of IV-CNHS-set
⎣ ξD .
αm1 αm2 · · · αmr Its M-function is given as follows:
Which is called an m × r IV-CNHS-set matrix.
η􏽺􏽽􏽼􏽻: Z ⟶ [0, 1], (57)
ξD
Definition 37. If ξ D ∈ ⊎ , then cardinal set of ξ D is
IVCNHS with
defined as follows:
⎪􏼒η1 (x
⎧ ⌣ 2 ⌣ 3 ⌣ ⎪
⎫ 1 ⌣
�� ⎪ ⎨ ‖ξD ‖ ), η‖ξD ‖ (x), η‖ξD ‖ (x)􏼓 ⌣ ⎪
⎬ η􏽺􏽽􏽼􏽻(]) � 􏽘 ηCard(ξD )(x)ηCard(χD )(]). (58)
��ξ D �� : x ∈ D , ξD |D| ⌣
⎪ ⌣ ⎪ x∈D
⎪
⎩ x ⎪
⎭
(52) 􏽺􏽽􏽼􏽻
Definition 40. Let ξ D ∈ Civcnhss (Z) and ξ D be its􏽺􏽽􏽼􏽻 aggregate
where η1‖ξD ‖ , η2‖ξD ‖ , η3‖ξD ‖ : D ⟶ [0, 1] are M-function, ID- fuzzy set. Assume that Z � 􏼈]1 , ]2 , . . . , ]m 􏼉, then ξ D can be
function, and NM-function of ‖ξ D ‖ with presented as follows:
Table 6: Tabular representation of ‖ξD ‖.

⌣ ⌣ ⌣
D x1 x2 ··· xr
⌣ ⌣ ⌣
η1‖ξD ‖ (x1 ), η1‖ξD ‖ (x2 ), η1‖ξD ‖ (xr ),
⎜
⎛
⎜
⎜ 2 ⌣ ⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2 ⌣ ⎟
⎞
⎟
⎟ ⎜
⎛
⎜
⎜ 2 ⌣ ⎟
⎞
⎟
⎟
η‖ξD ‖ ⎜
⎝ η‖ξD ‖ (x1 ), ⎟
⎜ ⎟
⎠ ⎜
⎝ η‖ξD ‖ (x2 ), ⎟
⎜ ⎟
⎠ ··· ⎜
⎝ η‖ξD ‖ (xr ), ⎟
⎜ ⎟
⎠
3 ⌣ 3 ⌣ 3 ⌣
η‖ξD ‖ (x1 ), η‖ξD ‖ (x2 ), η‖ξD ‖ (xr ),
􏽺􏽽􏽼􏽻
ξD ⋮ η􏽺􏽽􏽼􏽻 which is called the aggregate matrix of ξ D over Z.
⎢
⎡
⎢
⎢ ξD
⎤⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ ⋮
...... ......⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
⎢ ⎥ 4.3. Applications of Interval-Valued Complex Neutrosophic
⎢
⎢
⎢
⎢
⎢ ]1 ⋮ η􏽺􏽽􏽼􏽻 ]1 􏼁 ⎥⎥⎥⎥⎥
⎢
⎢ ξD ⎥⎥⎥ Hypersoft Set. Now considering the definitions stated in
⎢
⎢
⎢ ⎥⎥⎥. (59)
⎢
⎢ Subsection 4.2, an algorithm is presented in this segment of
⎢
⎢
⎢ ]2 ⋮ η􏽺􏽽􏽼􏽻 ]2 􏼁 ⎥⎥⎥⎥⎥ the paper to assist the decision-support system, and the
⎢
⎢
⎢ ξD ⎥
⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢ presented algorithm will be validated with the help of an
⎢
⎢
⎢ ⋮ ⋮ ⋮ ⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥ example from a daily-life scenario.
⎣ ⎦
]m ⋮ η􏽺􏽽􏽼􏽻 ]m 􏼁 Now, Algorithm 2 is explained with the help of the
ξD following example.
􏽺􏽽􏽼􏽻
If αi1 � η􏽺􏽽􏽼􏽻(]i ) for i � Nm
1 , then ξ D is represented by the
ξD
following matrix: Example 4. Considering the problem statement stated in
Example 2, we construct IV-CNHS-sets ψ D (δ1 ), ψ D (δ2 ) and
α11 ψ D (δ3 ), ψ D (δ4 ) that are defined as follows:
⎢
⎡
⎢
⎢ ⎤⎥⎥⎥
⎢
⎢
⎢ α21 ⎥⎥⎥
􏼂αi1 􏼃m×1 � ⎢
⎢ ⎥⎥⎥, (60)
⎢
⎢
⎢ ⎥⎥⎥
⎢ ⎥⎥⎦
⎣ ⋮
⎢
⎢
αm1
⎪
⎧
⎪ ([0.4, 0.5], [0.1, 0.2], [0.1, 0.2])ei([0.1,0.2],[0.1,0.4],[0.3,0.3])π ([0.1, 0.1], [0.2, 0.3], [0.3, 0.4])ei([0.1,0.3],[0.2,0.3],[0.3,0.3])π ⎫ ⎪
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎨ 1 2 ⎬
ψD δ1 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.1,0.2],[0.1,0.4],[0.1,0.2])π ⎪
⎪
⎪ ([0.1, 0.2], [0.1, 0.4], [0.2, 0.2])e i([0.3,0.4],[0.3,0.4],[0.1,0.2])π
([0.1, 0.2], [0.4, 0.5], [0.2, 0.2])e ⎪
⎪
⎪
⎩ , ⎪
⎭
s3 s4
i([0.1,0.2],[0.2,0.4][0.2,0.2])π i([0.1,0.2],[0.4,0.5],[0.2,0.2])π
⎪
⎧
⎪ ([0.1, 0.2], [0.3, 0.5], [0.2, 0.2])e ([0.1, 0.2], [0.1, 0.5], [0.1, 0.2])e ⎪
⎫
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎨ 1 2 ⎬
ψD δ2 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.2,0.3],[0.1,0.3],[0.3,0.3])π ⎪
⎪ i([0.3,0.4],[0.2,0.3],[0.1,0.2])π ⎪
⎪ ([0.1, 0.1], [0.2, 0.3], [0.1, 0.5])e
⎪
⎩ ,
([0.1, 0.2], [0.2, 0.4], [0.3, 0.3])e ⎪
⎪
⎭
s3 s4
i((0.1,0.2),[0.1,0.4],[0.2,0.3])π i([0.2,0.3],[0.3,0.4],[0.2,0.2])π
⎪
⎧
⎪ ([0.3, 0.4], [0.2, 0.3], [0.1, 0.2])e ([0.1, 0.2], [0.2, 0.3], [0.1, 0.3])e ⎪
⎫
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎨ 1 2 ⎬
ψD δ3 􏼁 � ⎪ ⎪ ,
⎪
⎪ ⎪
i([0.1,0.2],[0.2,0.5],[0.2,0.2])π ⎪
⎪ i([0.3,0.3],[0.2,0.3],[0.1,0.2])π ⎪
⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])e
⎪
⎩ ,
([0.1, 0.2], [0.3, 0.3], [0.2, 0.3])e ⎪
⎪
⎭
s3 s4
i([0.1,0.2],[0.4,0.5],[0.2,0.2])π i([0.1,0.2],[0.1,0.4],[0.2,0.3])π
⎪
⎧
⎪ ([0.1, 0.3], [0.3, 0.4], [0.1, 0.2])e ([0.4, 0.5], [0.1, 0.3], [0.1, 0.1])e ⎪
⎫
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎨ 1 2 ⎬
ψD δ4 􏼁 � ⎪ ⎪ .
⎪
⎪ ⎪
i([0.1,0.2],[0.2,0.4],[0.2,0.3])π ⎪
⎪
⎪ ([0.1, 0.1], [0.1, 0.4], [0.1, 0.2])e i([0.2,0.3],[0.3,0.3],[0.3,0.3])π
([0.1, 0.2], [0.4, 0.5], [0.2, 0.2])e ⎪
⎪
⎪
⎩ , ⎪
⎭
s3 s4
(61)
⊳ Start
⊳ Input Stage:
———–1. Consider Z as the universe of discourse
———–2. Consider E as a set of n parameters
———–3. Classify n parameters into disjoint parametric-valued sets L1 , L2 , L3 , . . . , Ln
⊳ Construction Stage:
———–4. D � L1 × L2 × L3 × · · · × Ln
———–5. Construct IV-CNHS-set χD over Z, in accordance with Definition 27
⊳ Computation Stage:
———–6. Compute ‖ξ D ‖ for A-term and P-term separately by using Definition 37
􏽺􏽽􏽼􏽻
———–7. Compute ξ D for A-term and P-term separately with the help of Definition 39
———–8. Compute η􏽺􏽽􏽼􏽻 (]) by using Definition 39
⊳ Output Stage: ξD
———–9. Find the best option by the max modulus of η􏽺􏽽􏽼􏽻 (]) with the help of Definition 40
⊳ End ξD
ALGORITHM 2: Decision-support algorithm based on aggregations of IV-CNHS-set.
Step 1: IV-CNH-set χ D is written as follows:
χD �
⎪
⎧
⎪
⎪ ⎪
⎧
⎪
⎪ ([0.4, 0.5], [0.1, 0.2], [0.1, 0.2])ei([0.1,0.2],[0.1,0.4],[0.3,0.3])π ([0.1, 0.1], [0.2, 0.3], [0.3, 0.4])ei([0.1,0.3],[0.2,0.3],[0.3,0.3])π ⎫ ⎪
⎪
⎪
⎪
⎫
⎪
⎪
⎪
⎪ ⎜
⎛
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ s s ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ ⎪ ⎨
1 2 ⎪
⎬⎟⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜ δ1 , ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪ ⎜
⎜ ⎪ ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪ ⎜
⎜
⎝ ⎪ ⎪ i([0.3,0.4],[0.3,0.4],[0.1,0.2])π i([0.1,0.2],[0.1,0.4],[0.1,0.2])π ⎪
⎪ ⎟
⎟
⎠ ⎪
⎪
⎪
⎪ ⎪
⎪ ([0.1, 0.2], [0.1, 0.4], [0.2, 0.2])e ([0.1, 0.2], [0.4, 0.5], [0.2, 0.2])e ⎪
⎪ ⎪
⎪
⎪
⎪ ⎩ , ⎭ ⎪
⎪
⎪
⎪ s s ⎪
⎪
⎪
⎪
3 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.1,0.2],[0.2,0.4],[0.2,0.2])π i([0.1,0.2],[0.4,0.5],[0.2,0.2])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.1, 0.2], [0.3, 0.5], [0.2, 0.2])e ([0.1, 0.2], [0.1, 0.5], [0.1, 0.2])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎛
⎜ ⎪
⎪ , ⎪
⎪ ⎞
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎪ s1 s2 ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎨ ⎬⎟⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ δ , ⎟
⎟ ⎪
⎪
⎪ ⎜
⎜ 2 ⎪ ⎪ ⎟
⎟ ⎪
⎪
⎪⎜
⎪
⎜
⎜ ⎪
⎪
⎪
⎪
⎪
⎪ ⎟⎪
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎝ ⎪ ⎪ i([0.3,0.4],[0.2,0.3],[0.1,0.2])π i([0.2,0.3],[0.1,0.3],[0.3,0.3])π ⎪
⎪ ⎟
⎠⎪
⎟ ⎪
⎪ ⎪ ([0.1, 0.1], [0.2, 0.3], [0.1, 0.5])e ([0.1, 0.2], [0.2, 0.4], [0.3, 0.3])e ⎪ ⎪
⎪
⎪
⎪
⎪
⎩ , ⎭ ⎪
⎪ ⎪
⎪
⎪
⎪ s3 s 4 ⎪
⎪
⎨ ⎬
⎪ ⎪ .
⎪ ⎪
⎪
⎪ i([0.1,0.2],[0.1,0.4],[0.2,0.3])π i([0.2,0.3],[0.3,0.4],[0.2,0.2])π ⎪ ⎪ ⎪
⎪
⎪
⎪
⎪
⎧
⎪ ([0.3, 0.4], [0.2, 0.3], [0.1, 0.2])e
⎪ ([0.1, 0.2], [0.2, 0.3], [0.1, 0.3])e ⎪ ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ s1 s2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎨ ⎪
⎬⎟⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ δ ,
3 ⎪ ⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪ ⎜
⎜ ⎪ ⎪ ⎟
⎟ ⎪
⎪
⎪ ⎜
⎪⎝ ⎪ ⎪
⎪ ([0.1, 0.2], [0.2, 0.4], [0.1, 0.3])e i([0.3,0.3],[0.2,0.3],[0.1,0.2])π
([0.1, 0.2], [0.3, 0.3], [0.2, 0.3])e i([0.1,0.2],[0.2,0.5],[0.2,0.2])π
⎪⎠ ⎪
⎪
⎪ ⎟ ⎪
⎪
⎪
⎪
⎪
⎪
⎩ , ⎭ ⎪
⎪ ⎪
⎪
⎪
⎪ s3 s 4 ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ ⎪
⎪
⎪
⎪ i([0.1,0.2],[0.4,0.5],[0.2,0.2])π i([0.1,0.2],[0.1,0.4],[0.2,0.3])π ⎪
⎪
⎪
⎪ ⎪
⎧
⎪ ([0.1, 0.3], [0.3, 0.4], [0.1, 0.2])e ([0.4, 0.5], [0.1, 0.3], [0.1, 0.1])e ⎪
⎫
⎪ ⎪
⎪
⎪
⎪ ⎜
⎛
⎜ ⎪
⎪ , ⎪
⎪ ⎟
⎞
⎟ ⎪
⎪
⎪
⎪⎜⎜
⎜ ⎪
⎪ s s ⎪
⎪ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎪
⎪ 1 2 ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜ ⎨ ⎬ ⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ δ , ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎜
⎜ 4 ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪⎜
⎪ ⎜
⎜ ⎪
⎪ ⎪
⎪ ⎟
⎟
⎟ ⎪
⎪
⎪
⎪ ⎜
⎝ ⎪
⎪ ([0.1, 0.1], [0.1, 0.4], [0.1, 0.2])e i([0.2,0.3],[0.3,0.3],[0.3,0.3])π
([0.1, 0.2], [0.4, 0.5], [0.2, 0.2])e i([0.1,0.2],[0.2,0.4],[0.2,0.3])π ⎪
⎪ ⎟
⎠ ⎪
⎪
⎪ ⎪
⎪ ⎪
⎪ ⎪
⎪
⎩ ⎩ , ⎭ ⎪ ⎭
s3 s4
(62)
Step 2: the cardinal is computed as follows:

‖χ D ‖(Amplitude Term) �
⎪
⎧
⎪ ([0.175, 0.250], [0.200, 0.350], [0.200, 0.250]) ([0.100, 0.175], [0.200, 0.425], [0.175, 0.300]) ⎪
⎫
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ δ1 δ2 ⎪
⎪
⎨ ⎬
⎪ ⎪ . (63)
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.150, 0.250], [0.225, 0.325], [0.125, 0.275]) ([0.175, 0.275], [0.225, 0.400], [0.125, 0.175]) ⎪
⎪
⎪
⎩ , ⎪
⎭
δ3 δ4
‖χ D ‖(Phase Term) �
⎪
⎧
⎪ ([0.150, 0.275], [0.175, 0.375], [0.200, 0.250]) ([0.175, 0.275], [0.225, 0.375], [0.200, 0.225]) ⎪
⎫
⎪
⎪
⎪ , ⎪
⎪
⎪
⎪ δ1 δ2 ⎪
⎪
⎨ ⎬
⎪ ⎪ . (64)
⎪
⎪ ⎪
⎪
⎪
⎪ ([0.175, 0.250], [0.200, 0.400], [0.175, 0.225]) ([0.125, 0.225], [0.250, 0.425], [0.225, 0.275]) ⎪
⎪
⎪
⎩ , ⎪
⎭
δ3 δ4
􏽺􏽽􏽼􏽻 􏽺􏽽􏽼􏽻
Step 3: the set χ D can be determined as follows: χ D (Apmlitude Term) �
[0.4, 0.5], [0.1, 0.2], [0.1, 0.2] [0.1, 0.2], [0.3, 0.5], [0.2, 0.2] [0.3, 0.4], [0.2, 0.3], [0.1, 0.2] [0.1, 0.3], [0.3, 0.4], [0.1, 0.2]
⎡⎢⎢⎢ ⎤⎥⎥⎥
⎢⎢⎢ ⎥
⎢⎢⎢ [0.1, 0.1], [0.2, 0.3], [0.3, 0.4] [0.1, 0.2], [0.1, 0.5], [0.1, 0.2] [0.1, 0.2], [0.2, 0.3], [0.1, 0.3] [0.4, 0.5], [0.1, 0.3], [0.1, 0.1] ⎥⎥⎥⎥⎥
1 ⎢⎢⎢ ⎥⎥⎥
⎢⎢⎢ ⎥⎥
4 ⎢⎢ [0.1, 0.2], [0.1, 0.4], [0.2, 0.2] [0.1, 0.1], [0.2, 0.3], [0.1, 0.5] [0.1, 0.2], [0.2, 0.4], [0.1, 0.3] [0.1, 0.1], [0.1, 0.4], [0.1, 0.2] ⎥⎥⎥⎥⎥
⎢
⎢⎢⎢ ⎥⎥⎥
⎢⎣ ⎥⎦
[0.1, 0.2], [0.4, 0.5], [0.2, 0.2] [0.1, 0.2], [0.2, 0.4], [0.3, 0.3] [0.1, 0.2], [0.3, 0.3], [0.2, 0.3] [0.1, 0.2], [0.4, 0.5], [0.2, 0.2]
[0.175, 0.250], [0.200, 0.350], [0.200, 0.250]

⎡⎢⎢⎢ ⎤⎥⎥⎥
⎢⎢⎢ ⎥
⎢⎢⎢ [0.100, 0.175], [0.200, 0.425], [0.175, 0.300] ⎥⎥⎥⎥⎥
⎢⎢⎢ ⎥⎥⎥
× ⎢⎢⎢ ⎥⎥
⎢⎢⎢⎢ [0.150, 0.250], [0.225, 0.325], [0.125, 0.275] ⎥⎥⎥⎥⎥
⎢⎢⎢ ⎥⎥⎥
⎣ ⎦
[0.175, 0.275], [0.225, 0.400], [0.125, 0.175]
0.3 0.3 0.1 0.1 0.150 0.030625

⎡⎢⎢⎢ ⎤⎥⎥⎥⎡⎢⎢⎢ ⎤⎥⎥⎥ ⎡⎢⎢⎢ ⎤⎥⎥⎥
⎢⎢⎢ ⎥⎢ ⎥ ⎢ ⎥
⎢⎢⎢ 0.4 0.0 0.1 0.3 ⎥⎥⎥⎥⎥⎢⎢⎢⎢⎢ 0.200 ⎥⎥⎥⎥⎥ ⎢⎢⎢⎢⎢ 0.023125 ⎥⎥⎥⎥⎥
1 ⎢⎢⎢ ⎥⎥⎥⎢⎢⎢ ⎥⎥⎥ ⎢⎢⎢ ⎥⎥⎥
� ⎢⎢⎢ ⎥⎥⎢⎢ ⎥⎥ � ⎢⎢ ⎥⎥.
4 ⎢⎢⎢ 0.1 0.2 0.1 0.1 ⎥⎥⎥⎥⎥⎢⎢⎢⎢ 0.100 ⎥⎥⎥⎥ ⎢⎢⎢⎢ 0.018125 ⎥⎥⎥⎥
⎢⎢⎢ ⎢
⎥⎥⎥⎢⎢⎢ ⎥ ⎢
⎥⎥⎥ ⎢⎢⎢ ⎥⎥⎥
⎢⎣ ⎦⎢⎣ ⎥⎦ ⎢⎣ ⎥⎥⎦
0.4 0.3 0.3 0.4 0.075 0.045000
(65)
􏽺􏽽􏽼􏽻
χD (Phase Term) �
[0.1, 0.2], [0.1, 0.4], [0.3, 0.3] [0.1, 0.2], [0.2, 0.4], [0.2, 0.2] [0.1, 0.2], [0.1, 0.4], [0.2, 0.3] [0.1, 0.2], [0.4, 0.5], [0.2, 0.2]
⎢
⎡
⎢
⎢ ⎤⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ [0.1, 0.3], [0.2, 0.3], [0.3, 0.3] [0.1, 0.2], [0.4, 0.5], [0.2, 0.2] [0.2, 0.3], [0.3, 0.4], [0.2, 0.2] [0.1, 0.2], [0.1, 0.4], [0.2, 0.3] ⎥⎥⎥
1⎢
⎢ ⎥⎥⎥
⎢
⎢ ⎥⎥⎥
4⎢
⎢
⎢
⎢
⎢ [0.3, 0.4], [0.3, 0.4], [0.1, 0.2] [0.3, 0.4], [0.2, 0.3], [0.1, 0.2] [0.3, 0.3], [0.2, 0.3], [0.1, 0.2] [0.2, 0.3], [0.3, 0.3], [0.3, 0.3]
⎥⎥⎥
⎥⎥⎥
⎢
⎢
⎢
⎢
⎣ ⎥⎥⎦
[0.1, 0.2], [0.1, 0.4], [0.1, 0.2] [0.2, 0.3], [0.1, 0.3], [0.3, 0.3] [0.1, 0.2], [0.2, 0.5], [0.2, 0.2] [0.1, 0.2], [0.2, 0.4], [0.2, 0.3]
[0.150, 0.275], [0.175, 0.375], [0.200, 0.250]

⎢
⎡
⎢
⎢ ⎤⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢ [0.175, 0.275], [0.225, 0.375], [0.200, 0.225] ⎥⎥⎥
⎢
⎢
⎢ ⎥⎥⎥
×⎢
⎢
⎢ ⎥⎥⎥
⎢
⎢
⎢
⎢
⎢ [0.175, 0.250], [0.200, 0.400], [0.175, 0.225] ⎥⎥⎥⎥⎥
⎢
⎢
⎣ ⎥⎥⎦
[0.125, 0.225], [0.250, 0.425], [0.225, 0.275]
0.2 0.2 0.1 0.4 0.100 0.048125

⎢
⎡
⎢
⎢ ⎤⎥⎥⎥⎡⎢⎢⎢ ⎤⎥⎥⎥ ⎡⎢⎢⎢ ⎤⎥⎥⎥
⎢
⎢ ⎥
⎥ ⎢
⎢ ⎥
⎥ ⎢
⎢ ⎥⎥
⎢
⎢
1⎢
⎢ 0.2 0.4 0.2 0.1 ⎥⎥⎥⎢⎢⎢ 0.300 ⎥⎥⎥ ⎢⎢⎢ 0.047500 ⎥⎥⎥⎥⎥
⎥
⎥ ⎢
⎢ ⎥
⎥ ⎢
⎢
⎢
⎢ ⎥
⎥⎥⎥⎢⎢⎢ ⎢ ⎥
⎥⎥⎥ � ⎢⎢⎢ ⎢ ⎥⎥⎥
� ⎢
⎢
⎢ ⎥⎥⎥⎢⎢⎢ ⎥⎥⎥ ⎢⎢⎢ ⎥⎥⎥
4⎢
⎢
⎢
⎢ 0.0 0.1 0.0 0.3 ⎥
⎥ ⎢
⎢ 0.125 ⎥
⎥ ⎢
⎢ 0.026250 ⎥⎥⎥
⎢
⎢
⎢ ⎥ ⎢
⎥⎥⎥⎢⎢⎢ ⎥ ⎢
⎥⎥⎥ ⎢⎢⎢ ⎥⎥⎥
⎢
⎣ ⎦⎣ ⎦ ⎣ ⎥⎦
0.0 0.1 0.2 0.2 0.250 0.026250
􏽺􏽽􏽼􏽻 0.030625ei0.048135π 0.023125ei0.047500π 0.018125ei0.026250π 0.045000ei0.026250π

χD � 􏼨 , , , 􏼩.
s1 s2 s3 s4
(66)
Consider the modulus value of max(η􏽺􏽽􏽼􏽻)� max proposed structure with the above relevant existing struc-
ξD tures in Table 7 and 8.
􏼈0.08562297237/s1 , 0.08312368641/s2 , 0.0812493106/s3 ,
0.0793734965/s4 }� 0.08562297237/s1 . This means that s1 6. Discussion
may be recommended for suitable investment.
In this section, we show that our proposed structure IV-
CNHS-set is a more generalized and flexible structure as
5. Comparison Analysis
compared to existing relevant models in the sense that
In literature, various decision-making algorithmic ap- the existing relevant models [24, 34, 36–42] are its
proaches have already been discussed by [24, 34, 36–42] that particular cases by omitting one or more features among
are based on hybridized structures of complex set with fuzzy MD (membership degree), NMG (nonmembership de-
set, intuitionistic fuzzy set, and neutrosophic set under soft gree), ID (indeterminacy degree), SAAF (single argu-
set environments. Decision-making is badly affected due to ment approximate function), MAAF (multiargument
the omission of some features with a key role. For example, approximate function), PND (periodic nature of data),
in stock-exchange share market-based scenario, it is in- and IVD (interval-valued data). Figure 3 presents the
sufficient to consider “current trend of company perfor- pictorial version of this generalization of our proposed
mance,” “particular company’s stock price for last one year,” structure.
and “home country inflation rate” as only attributes because
these indicators may have different values, so it is much
6.1. Merits of Proposed Study. In this subsection, some merits
appropriate to further classify these parameters into their
of the proposed study are highlighted, which are given
disjoint attributive sets as we have done in Example 3.22. The
below:
above-mentioned existing decision-making models are in-
sufficient either for interval-valued data or for multi-argu- (i) The introduced approach took the significance of
ment approximate function, but in the proposed model, the the idea of IV-CIFHS-set and IV-CNHS-set to deal
inadequacies of these models have been addressed. The with current decision-making issues. The presented
consideration of multi-argument approximate function will idea enables the researchers to deal with the real-
make the decision-making process more reliable and world scenario where the periodicity of data in the
trustworthy. We present a comparison analysis of our form of intervals is involved; along these lines, this
Table 7: Comparison of proposed structures with some existing relevant structures.

Approx.
Authors Structure Remarks
Func.
Insufficient for interval-valued data, degree of indeterminacy, and further partitioning of
Ali et al. [34] CIFSS SAAF
attributes into attribute-valued disjoint sets
IV-
Al-Sharqi et al. [36] SAAF Inadequacy for further partitioning of attributes into attribute-valued disjoint sets
CNSS
Inadequacy for the degree of nonmembership, degree of indeterminacy, and further
Fan et al. [37] IV-CFSS SAAF
partitioning of attributes into attribute-valued disjoint sets
Khan et al. [38] CIFSS SAAF
Kumar et al. [39] CIFSS SAAF
Smarandache et al. Insufficient for interval-valued data and further partitioning of attributes into attribute-
CNSS SAAF
[40] valued disjoint sets
Table 8: Comparison of proposed structures with some existing relevant structures.

Approx.
Authors Structure Remarks
Func.
Selvachandran et al. Insufficient for the degree of nonmembership, degree of indeterminacy, and further
IV-CFSS SAAF
[41] partitioning of attributes into attribute-valued disjoint sets
Thirunavukarasu et al. Insufficient for interval-valued data, degree of nonmembership, degree of
CFSS SAAF
[42] indeterminacy, and further partitioning of attributes into attribute-valued disjoint sets
Insufficient for interval-valued data, degree of nonmembership, and degree of
Rahman et al. [24] CFHSS MAAF
indeterminacy
Rahman et al. [24] CIFHSS MAAF Insufficient for interval-valued data and degree of indeterminacy
Rahman et al. [24] CNHSS MAAF Insufficient for interval-valued data
IV-
Rahman et al. [30] MAAF Insufficient for the degree of nonmembership and degree of indeterminacy
CFHSS
IV-
Proposed structure 1 MAAF It has limitations regarding the consideration of degree of indeterminacy
CIFHSS
IV-
Proposed structure 2 MAAF Addresses the limitations and shortcomings of the above structures
CNHSS
IV-CNHS-set
IV-CIFHS-set IV-CFHS-set CFHS-set CIFHS-set CNHS-set
IFHS-set FHS-set HS-set CHS-set NHS-set
FS-set S-set
Figure 3: Generalization of the proposed structure.

Table 9: Comparison with existing models under appropriate features.

Authors Structure MD NMD ID SAAF MAAF PND IVD
Ali et al. [34] CIFSS √ √ × √ × √ ×
Al-Sharqi et al. [36] IV-CNSS √ √ √ √ × √ √
Fan et al. [37] IV-CFSS √ × × √ × √ √
Khan et al. [38] CIFSS √ √ × √ × √ ×
Kumar et al. [39] CIFSS √ √ × √ × √ ×
Smarandache et al. [40] CNSS √ √ √ √ × √ ×
Selvachandran et al. [41] IV-CFSS √ × × √ × √ √
Thirunavukarasu et al. [42] CFSS √ × × √ × √ ×
Rahman et al. [24] CFHSS √ × × √ √ √ ×
Rahman et al. [24] CIFHSS √ √ × √ √ √ ×
Rahman et al. [24] CNHSS √ √ √ √ √ √ ×
Rahman et al. [30] IV-CFHSS √ × × √ √ √ √
Proposed structure 1 IV-CIFHSS √ √ × √ √ √ √
Proposed structure 2 IV-CNHSS √ √ √ √ √ √ √
association has tremendous potential in the genuine (4) Two decision-making algorithms are proposed that
depiction inside the space of computational are based on aggregation operators of IV-CIFHS-set
incursions. and IV-CNHS-set. These are explained with the help
(ii) As the proposed structure emphasizes on an in- of daily-life problems.
depth study of attributes (i.e., further partitioning of (5) The proposed structures along with their decision-
attributes) rather than focusing on attributes support systems are compared with some existing
merely, therefore, it makes the decision-making relevant literature.
process better, flexible, and more reliable. (6) Authors have carved out a conceptual framework for
(iii) It covers the characteristics and properties of the a generalized model, that is, IV-CNHS-set to deal
existing relevant structures, that is, IV-CFHS-set, with decision-making real-life problems by consid-
CFHS-set, CIFHS-set, CNHS-set, IV-CFSS-set, IV- ering hypothetical data. The authors are committed
CIFSS-set, IV-CNSS-set, CFSS-set, CIFSS-set, to discussing some case studies based on IV-CNHS-
CNSS-set, and so on, so it is not unreasonable to call set by using real data.
it the generalized form of all these structures. (7) Furthermore, it may also be extended to develop
The advantage of the proposed study can easily be judged hybridized structures with expert sets, possibility
from Tables 7–9. The comparison is evaluated on the basis of fuzzy-set-like models, and fuzzy-set-like parame-
two different aspects as follows: terized family and introduce algebraic structures.
(1) Main features discussed in the study (see Tables 7

and 8) Data Availability
(2) Features such as MD, NMG, ID, SAAF, MAAF, No data were used to support the findings of the study.
PND, and IVD (see Table 9)
7. Conclusion Conflicts of Interest

The authors declare that they have no conflicts of interest.
The key features of this work can be summarized as follows:
(1) The novel notion of IV-CIFHS-set and IV-CNHS-set
are characterized, and some of their elementary References
properties, that is, subset, null set, equal set, absolute
[1] L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8,
set, homogeneous set, and complete homogeneous
no. 3, pp. 338–353, 1965.
set are discussed with illustrated numerical [2] K. T. Atanassov, “Intuitionistic fuzzy sets,” Fuzzy Sets and
examples. Systems, vol. 20, no. 1, pp. 87–96, 1986.
(2) The set theoretic operations of IV-CIFHS-set and IV- [3] F. Smarandache, Neutrosophy, Neutrosophic Probability, Set,
CNHS-set, that is, complement, difference, union, and Logic, Analytic Synthesis and Synthetic Analysis, Amer-
and intersection, are characterized with the help of ican Research Press, Rehoboth, USA, 1998.
elaborated examples. Their fundamental laws and [4] D. Molodtsov, “Soft set theory-First results,” Computers &
properties are also discussed. Mathematics with Applications, vol. 37, no. 4-5, pp. 19–31,
1999.
(3) Aggregation operators, that is, aggregate matrix, [5] M. I. Ali, F. Feng, X. Liu, W. K. Min, and M. Shabir, “On some
cardinal set, cardinal matrix, and aggregate fuzzy set, new operations in soft set theory,” Computers & Mathematics
of IV-CIFHS-set and IV-CNHS-set are developed. with Applications, vol. 57, no. 9, pp. 1547–1553, 2009.
[6] K. V. Babitha and J. J. Sunil, “Soft set relations and functions,” set theory,” Neutrosophic Sets and Systems, vol. 41, pp. 1–14,
Computers & Mathematics with Applications, vol. 60, no. 7, 2021.
pp. 1840–1849, 2010. [27] A. U. Rahman, M. Saeed, and S. Zahid, “Application in de-
[7] K. V. Babitha and J. J. Sunil, “Transitive closures and orderings cision making based on fuzzy parameterized hypersoft set
on soft sets,” Computers & Mathematics with Applications, theory,” Asia Mathematika, vol. 5, no. 1, pp. 19–27, 2021.
vol. 62, no. 5, pp. 2235–2239, 2011. [28] A. U. Rahman, M. Saeed, and A. Hafeez, “Theory of bijective
[8] F. Li, “Notes on soft set operations,” ARPN Journal of systems hypersoft set with application in decision making,” Punjab
and softwares, vol. 20, pp. 205–208, 2011. University Journal of Mathematics, vol. 53, no. 7, pp. 511–526,
[9] P. K. Maji, R. Biswas, and A. R. Roy, “Soft set theory,” 2021.
Computers & Mathematics with Applications, vol. 45, no. 4-5, [29] A. Ur Rahman, M. Saeed, S. Alodhaibi, and H. Abd El-Wahed
pp. 555–562, 2003. Khalifa, “Decision making algorithmic approaches based on
[10] D. Pei and D. Miao, “From soft set to information system,” parameterization of neutrosophic set under hypersoft set
IEEE, vol. 2, pp. 617–621, 2005. environment with fuzzy, intuitionistic fuzzy and neutrosophic
[11] A. Sezgin and A. O. Atagün, “On operations of soft sets,” settings,” Computer Modeling in Engineering & Sciences,
Computers & Mathematics with Applications, vol. 61, no. 5, vol. 128, no. 2, pp. 743–777, 2021.
pp. 1457–1467, 2011. [30] A. U. Rahman, M. Saeed, F. Smarandache, A. Khalid,
[12] N. Çaman, S. Enginolu, and F. Çitak, “Fuzzy soft set theory M. R. Ahmad, and S. Ayaz, “Decision-making application
and its applications,” Iranian Journal of Fuzzy System, vol. 8, based on aggregations of complex fuzzy hypersoft set and
no. 3, pp. 137–147, 2011. development of interval-valued complex fuzzy hypersoft
[13] P. K. Maji, R. Biswas, and A. R. Roy, “Fuzzy soft sets,” Journal set,” Neutrosophic Sets and Systems, vol. 46, pp. 300–317,
of Fuzzy Mathematics, vol. 9, no. 3, pp. 589–602, 2001. 2021.
[14] N. Karataş, N. Man, and S. Karataş, “Intuitionistic fuzzy soft [31] M. Saeed, M. Ahsan, M. H. Saeed, A. Mehmood, and
set theory and its decision making,” Journal of Intelligent & T. Abdeljawad, “An application of neutrosophic hypersoft
Fuzzy Systems, vol. 24, no. 4, pp. 829–836, 2013. mapping to diagnose hepatitis and propose appropriate
[15] P. K. Maji, R. Biswas, and A. R. Roy, “Intuitionistic fuzzy soft treatment,” IEEE Access, vol. 9, pp. 70455–70471, 2021.
sets,” Journal of Fuzzy Mathematics, vol. 9, no. 3, pp. 677–692, [32] M. Saeed, M. Ahsan, and T. Abdeljawad, “A development of
2001. complex multi-fuzzy hypersoft set with application in MCDM
[16] P. K. Maji, “Neutrosophic soft set,” Annals of Fuzzy Math- based on entropy and similarity measure,” IEEE Access, vol. 9,
ematics and Informatics, vol. 5, no. 1, pp. 2287–2623, 2013. pp. 60026–60042, 2021.
[17] S. Broumi, I. Deli, and F. Smarandache, “Neutrosophic Pa- [33] M. Saeed, M. Ahsan, A. Ur Rahman, M. H. Saeed, and
rametrized Soft Set Theory and its Decision Making,” Inter- A. Mehmood, “An application of neutrosophic hypersoft
national Frontier Science Letters, vol. 1, pp. 1–10, 2014. mapping to diagnose brain tumor and propose appropriate
[18] B. Chetia and P. Das, “An application of interval-valued fuzzy treatment,” Journal of Intelligent & Fuzzy Systems, vol. 41,
soft Sets in Medical Diagnosis,” International Journal of no. 1, pp. 1677–1699, 2021.
Contemporary Mathematical Sciences, vol. 5, no. 38, [34] Z. Ali, T. Mahmood, M. Aslam, and R. Chinram, “Another
pp. 1887–1894, 2010. view of complex intuitionistic fuzzy soft sets based on pri-
[19] I. Deli, “Interval-valued neutrosophic soft sets and its decision oritized aggregation operators and their applications to
making,” International Journal of Machine Learning and multiattribute decision making,” Mathematics, vol. 9, no. 16,
Cybernetics, vol. 8, no. 2, pp. 665–676, 2017. p. 1922, 2021.
[20] Y. Jiang, Y. Tang, Q. Chen, H. Liu, and J. Tang, “Interval- [35] A. Al-Quran and N. Hassan, “The complex neutrosophic soft
valued intuitionistic fuzzy soft sets and their properties,” expert set and its application in decision making,” Journal of
Computers & Mathematics with Applications, vol. 60, no. 3, Intelligent & Fuzzy Systems, vol. 34, no. 1, pp. 569–582, 2018.
pp. 906–918, 2010. [36] F. Al-Sharqi, A. Al-Quran, and S. Broumi, “Interval-valued
[21] A. Khalid and M. Abbas, “Distance measures and operations complex neutrosophic soft set and its applications in decision-
in intuitionistic and interval-valued intuitionistic fuzzy soft making,” Neutrosophic Sets and Systems, vol. 40, pp. 149–168,
set theory,” International Journal of Fuzzy Systems, vol. 17, 2021.
no. 3, pp. 490–497, 2015. [37] J.-P. Fan, R. Cheng, and M.-Q. Wu, “Extended EDAS methods
[22] F. Smarandache, “Extension of soft set of hypersoft set, and for multi-criteria group decision-making based on IV-
then to plithogenic hypersoft set,” Neutrosophic Sets and CFSWAA and IV-CFSWGA operators with interval-valued
Systems, vol. 22, pp. 168–170, 2018. complex fuzzy soft information,” IEEE Access, vol. 7,
[23] M. Saeed, A. U. Rahman, M. Ahsan, and F. Smarandache, “An pp. 105546–105561, 2019.
inclusive study on fundamentals of hypersoft set,” in Theory [38] M. Khan, “Representation of intuitionistic fuzzy soft set using
and Application of Hypersoft Set, pp. 1–23, Pons Publication complex number,” Journal of Applied Mathematics & Infor-
House, Brussel, Belgium, 2021. matics, vol. 35, no. 3, pp. 331–347, 2017.
[24] A. U. Rahman, M. Saeed, F. Smarandache, and M. R. Ahmad, [39] T. Kumar and R. K. Bajaj, “On complex intuitionistic fuzzy
“Development of hybrids of hypersoft set with complex fuzzy soft sets with distance measures and entropies,” Journal of
set, complex intuitionistic fuzzy set and complex neu- Mathematics, vol. 2014, pp. 1–12, 2014.
trosophic set,” Neutrosophic Sets and Systems, vol. 38, [40] F. Smarandache, S. Broumi, A. Bakali, M. Talea, M. Ali, and
pp. 335–354, 2020. G. Selvachandran, “Complex neutrosophic soft set,” in Pro-
[25] A. U. Rahman, M. Saeed, and F. Smarandache, “Convex and ceedings of the 2017 FUZZ-IEEE Conference on Fuzzy Systems,
concave hypersoft sets with some properties,” Neutrosophic Naples, Italy, July 2017.
Sets and Systems, vol. 38, pp. 497–508, 2020. [41] G. Selvachandran and P. K. Singh, “Interval-valued complex
[26] A. U. Rahman, M. Saeed, and A. Dhital, “Decision making fuzzy soft set and its application,” International Journal for
application based on neutrosophic parameterized hypersoft Uncertainty Quantification, vol. 8, no. 2, pp. 101–117, 2018.
[42] P. Thirunavukarasu, R. Suresh, and V. Ashokkumar, “Theory

of complex fuzzy soft set and its applications,” International
Journal of Innovative Science and Research Technology, vol. 3,
no. 10, pp. 13–18, 2017.
[43] D. Ramot, R. Milo, M. Friedman, and A. Kandel, “Complex
fuzzy sets,” IEEE Transactions on Fuzzy Systems, vol. 10, no. 2,
Article ID 171186, 2002.
[44] J. J. Buckley, “Fuzzy complex numbers,” Fuzzy Sets and
Systems, vol. 33, no. 3, pp. 333–345, 1989.
[45] J. J. Buckley and Y. Qu, “Fuzzy complex analysis I: Differ-
entiation,” Fuzzy Sets and Systems, vol. 41, no. 3, pp. 269–284,
1991.
[46] J. J. Buckley, “Fuzzy complex analysis II: Integration,” Fuzzy
Sets and Systems, vol. 49, no. 2, pp. 171–179, 1992.
[47] G. Zhang, T. S. Dillon, K.-Y. Cai, J. Ma, and J. Lu, “Operation
properties and δ-equalities of complex fuzzy setsδ-equalities
of complex fuzzy sets,” International Journal of Approximate
Reasoning, vol. 50, no. 8, pp. 1227–1249, 2009.
[48] D. Ramot, M. Friedman, G. Langholz, and A. Kandel,
“Complex fuzzy logic,” IEEE Transactions on Fuzzy Systems,
vol. 11, no. 4, Article ID 450461, 2003.

Multi-Attribute Decision-Support System Based On Aggregations of Interval-Valued Complex Neutrosophic Hypersoft Set

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Multi-Attribute Decision-Support System Based On Aggregations of Interval-Valued Complex Neutrosophic Hypersoft Set

Uploaded by

Copyright:

Available Formats

Hindawi

Applied Computational Intelligence and So Computing

Correspondence should be addressed to Muhammad Saeed; muhammad.saeed@umt.edu.pk

Academic Editor: Shyi-Ming Chen

1. Introduction to emulate the available information more precisely and

Table 1: Literature review on complex fuzzy-set-like models under soft set.

Soft Set Model Hypersoft Set Model

RAM {32, 64}

• Screen Size (inch)

Screen Size {5.7, 5.9}

Figure 1: Comparison of soft set and hypersoft set.

2. Preliminaries Buckley [44–46] and Zhang et al. [47] presented fuzzy

Deﬁnition 4 (see [13]). The fuzzy soft set ΩE1 on Z is given

where M-function of F C is ηF C (δ) with kF C (δ)√∈��

Some fundamental deﬁnitions are presented from existing literature

Theory of Inteval-Valued Complex Intuitionistic Fuzzy Hypersoft set is

Theory of Inteval-Valued Complex Neutrosophic Hypersoft set is

A comparison of proposed structures is presented with some existing

The advantages and generalization of the proposed structures are

The paper is summarized with future directions in Conclusion Section.

Figure 2: Organization of paper.

Table 2: Notations and abbreviations.

Ψ: A ⟶ CNeu (Z), Ψ: W ⟶ CIV (Z),

ΩW → and Ψ(ω) � (Ψ(ω), Ψ (ω)). Ψ(ω) � r eiθ and Ψ (ω) �

Λ: M ⟶ CIV (Z), respectively, and its value Λ(λ) is called λ-member of

and then IV-CIFHS-set ΩM is written by

⎨⎜⌣ ⎜ c i􏼒2π− θ G ((x))􏼓 ⎟ ⎬

(ii) (Λ, M)∐(Λ, M)Δ � (Λ, M)Δ i � Nm r

Table 3: Tabular representation of ξ D .

Table 4: Tabular representation of ‖ξD ‖.

with 3.3. Applications of Interval-Valued Complex Intuitionistic

ALGORITHM 1: Decision-support algorithm based on aggregations of an IV-CIFHS-set

Step 1. IV-CIFHS-set ξ D is written as follows:

Step 2. The cardinal is computed as follows:

m11 m12 m13 m14 [0.275, 0.425], [0.275, 0.475]

0.1 0.1 0.0 0.2 0.175 0.020000

􏽺􏽽􏽼􏽻 0.020000ei0.020000π 0.036250ei0.043125π 0.027500ei0.068750π 0.031875ei0.052500π

Consider the modulus value max(η􏽺􏽽􏽼􏽻)�

4. Interval-Valued Complex Neutrosophic which

Table 5: Tabular representation of ξ D .

η1χ (x⌣ ) (]1 ), η1χ (x⌣ ) (]1 ), η1χ (x⌣ ) (]1 ),

η1χ (x⌣ ) (]2 ), η1χ (x⌣ ) (]2 ), η1χ (x⌣ ) (]2 ),

η1χ (x⌣ ) (]m ), η1χ (x⌣ ) (]m ), η1χ (x⌣ ) (]m ),

Then IV-CNHS-set ΩM is written by

⎨⎜⌣ ⎜ → ⌣ c i􏼒2π− θ D (x)􏼓 ⎟ ⎬

η2χ (] ), η3χ (] )), for i � Nm r follows:

Table 6: Tabular representation of ‖ξD ‖.

ALGORITHM 2: Decision-support algorithm based on aggregations of IV-CNHS-set.

Step 1: IV-CNH-set χ D is written as follows:

Step 2: the cardinal is computed as follows:

[0.175, 0.250], [0.200, 0.350], [0.200, 0.250]

0.3 0.3 0.1 0.1 0.150 0.030625

[0.150, 0.275], [0.175, 0.375], [0.200, 0.250]

0.2 0.2 0.1 0.4 0.100 0.048125

􏽺􏽽􏽼􏽻 0.030625ei0.048135π 0.023125ei0.047500π 0.018125ei0.026250π 0.045000ei0.026250π

Table 7: Comparison of proposed structures with some existing relevant structures.

Table 8: Comparison of proposed structures with some existing relevant structures.

IV-CIFHS-set IV-CFHS-set CFHS-set CIFHS-set CNHS-set

IFHS-set FHS-set HS-set CHS-set NHS-set

Figure 3: Generalization of the proposed structure.

Table 9: Comparison with existing models under appropriate features.

(1) Main features discussed in the study (see Tables 7

7. Conclusion Conflicts of Interest