Next Article in Journal
An Introduction to κ-Deformed Symmetries, Phase Spaces and Field Theory
Next Article in Special Issue
Interval Valued T-Spherical Fuzzy Information Aggregation Based on Dombi t-Norm and Dombi t-Conorm for Multi-Attribute Decision Making Problems
Previous Article in Journal
Einstein–Gauss–Bonnet Gravity with Nonlinear Electrodynamics: Entropy, Energy Emission, Quasinormal Modes and Deflection Angle
Previous Article in Special Issue
Interval Valued T-Spherical Fuzzy Soft Average Aggregation Operators and Their Applications in Multiple-Criteria Decision Making
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linear Diophantine Fuzzy Relations and Their Algebraic Properties with Decision Making

1
Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan
2
Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan
3
Department of Mathematics, College of Sciences, King Khalid University, Abha 61413, Saudi Arabia
4
Algebra and Applications Research Unit, Division of Computational Science, Faculty of Science, Prince of Songkla University, Hat Yai, Songkhla 90110, Thailand
*
Author to whom correspondence should be addressed.
Symmetry 2021, 13(6), 945; https://doi.org/10.3390/sym13060945
Submission received: 20 April 2021 / Revised: 15 May 2021 / Accepted: 19 May 2021 / Published: 26 May 2021
(This article belongs to the Special Issue Uncertain Multi-Criteria Optimization Problems II)

Abstract

:
Binary relations are most important in various fields of pure and applied sciences. The concept of linear Diophantine fuzzy sets (LDFSs) proposed by Riaz and Hashmi is a novel mathematical approach to model vagueness and uncertainty in decision-making problems. In LDFS theory, the use of reference or control parameters corresponding to membership and non-membership grades makes it most accommodating towards modeling uncertainties in real-life problems. The main purpose of this paper is to establish a robust fusion of binary relations and LDFSs, and to introduce the concept of linear Diophantine fuzzy relation (LDF-relation) by making the use of reference parameters corresponding to the membership and non-membership fuzzy relations. The novel concept of LDF-relation is more flexible to discuss the symmetry between two or more objects that is superior to the prevailing notion of intuitionistic fuzzy relation (IF-relation). Certain basic operations are defined to investigate some significant results which are very useful in solving real-life problems. Based on these operations and their related results, it is analyzed that the collection of all LDF-relations gives rise to some algebraic structures such as semi-group, semi-ring and hemi-ring. Furthermore, the notion of score function of LDF-relations is introduced to analyze the symmetry of the optimal decision and ranking of feasible alternatives. Additionally, a new algorithm for modeling uncertainty in decision-making problems is proposed based on LDFSs and LDF-relations. A practical application of proposed decision-making approach is illustrated by a numerical example. Proposed LDF-relations, their operations, and related results may serve as a foundation for computational intelligence and modeling uncertainties in decision-making problems.

1. Introduction

In this modern age of technology, modeling uncertainties in engineering, computer sciences, social sciences, medical sciences and economics is growing widely. To tackle such types of problems, classical mathematical methods are not always useful. In 1965, Zadeh [1], coined the notion of fuzzy set (FS) to handel the uncertainties in every day language. In FS theory, a person who is very sick could have the degree of sickness near to 0.89. On contrary, a person who is having degree of sickness 0.12 indicates that he has nearly recovered from illness. In decision making (DM) and operational research the concept of FS theory was broadly studied since 1965 (see [2,3,4]).
However, only the membership function is not always sufficient to describe the complexities in real life problems. In [5,6,7], Atanassov proposed the concept of intuitionistic fuzzy set (IFS) as an extension of FS. Atanassov’s IFS enhanced the idea of FS by allowing the objects non-membership degrees along with the existing membership degrees satisfying the condition that their sum will not exceed 1. Atanassov [8] introduced the concept of IF-relations on IFSs. Since then, there is a lot of research on IFSs and they have many real-life applications such as optimization in IF-environment [9], multi-attribute decision making (MADM) [10,11,12]. Feng et al. [13] introduced lexicographic orders of IF-values and their relationships.
Although, in some real life problems, the sum of membership and non-membership grades of the objects may exceed 1. To eradicate this problem, Yager [14,15] extended the concept of IFS to Pythagorean fuzzy set (PFS), where the sum of the squares of its membership and non-membership degrees must not exceed 1. Yager’s concept of PFS is also familiar as Atanassov’s IFS of type 2 [16]. Many scientists have been studied PFS in various aspects (see [17,18,19]). Furthermore, Yager in [20] generalized the notion of PFS and defined a new concept of q-rung orthopair fuzzy set (q-ROFS). Further research on q-ROFS with significant advances were made in [21,22]. Zhang [23] introduced bipolar FS and relations, and Chen [24] proposed m-polar FS. Akram [25] studied m-polar F graphs, theory, methods and applications in DM.
The concepts of FSs, IFSs, PFSs, and q-ROFSs, have a lot of research and applications in real-life. However, these sets have some strict conditions on membership and non-membership grades. In order to relax these strict conditions, Riaz and Hashmi [26], introduced the novel concept of linear Diophantine fuzzy set (LDFS). A LDFS extended the space of above mentioned sets by adding reference parameters corresponding to the membership and non-membership grades. LDFSs are most suitable mathematical structure in MADM where the decision makers can freely select the grades [26]. The study of LDFSs is growing rapidly, in recent days. Riaz et al. [27] established the notions of hybrid models namely, linear Diophantine fuzzy soft rough sets (LDFSRSs), and soft rough linear Diophantine fuzzy sets (SRLDFSs). They have also applied these notions on robust MCDM problem for the selection of sustainable material handling equipment. Recently, Kamaci [28] extended LDFSs towards various algebraic structures such as groups, rings and fields, and studied some related important properties. Almagrabi [29] introduced a new approach to q-linear Diophantine fuzzy emergency decision support system for COVID-19.
Binary relations are important and fundamental in different fields of pure and applied sciences to describe the correspondences among various objects. Since there are many real life objects which may not satisfy the bivalent condition and may be related to each other to a certain degree. In 1971, Zadeh [2] fuzzified the notion of binary relation and introduced the concept of fuzzy relation (F-relation). F-relations play an important role in FS theory and its applications. To model the situations where interactions between elements are more or less strong, F-relations are very useful. FS and FS-relations have a lot of important applications in diverse type of areas, for instance in F modeling, F control and uncertainty reasoning, neural network, data bases, pattern recognition, artificial intelligence (AI), clustering, medicine, economy and MCDM. A detailed study on FSs and F-relations is presented in “Mathematics of fuzziness—Basic issues” by Wang et al. in [30].
Zadeh’s F-relation provide the degree to which two objects are related to each other. However, in real life, there may some objects which are related to each other to a certain degree but may not. That is, there may be some hesitation or uncertainty about the degree that is assigned to the relationship of the objects. This problem is addressed by Atanassov in [8] and introduced the notion of intuitionistic fuzzy relation (IF-relation) as an extension of F-relation. IF-relation is basically a pair of F-relations, named as membership and non-membership F-relations, which represents both the negative and positive aspects of the given information. IF-relation is the most effective approach to deal with DM in medical diagnosis. Composition of two IF-relations and some of its properties were studied by [31,32,33]. Further, the concept of IF-equivalence relations waas studied by Hur et al. in [34]. Naeem et al. presented the novel concepts of Pythagorean m-polar FSs with applications in MCDM. Molodtsov [35] introduced soft set theory to deal vague and uncertain real-life problems with the help of parameterizations. Riaz et al., introduced the idea of m-polar neutrosophic sets and m-polar neutrosophic topology with applications to MADM [36].
The main objective of this paper is to introduce the concept of linear Diophantine fuzzy relation (LDF-relation) as an extension of IF-relation. A second objective of LDF-relation is to address modeling uncertainties in MCDM. Because LDF-relation is more efficient to relax the strict restrictions of IF-relation regarding membership and non-membership grades. Some operations on LDF-relation and their properties are investigated. Additionally, algebraic structures such as semigroup, semiring and hemiring are studied in the set of all LDF-relations. A third objective is to introduce notion of score function of LDF-relation and to analyze the symmetry of the optimal decision and ranking of feasible alternatives. A fourth objective is to develop a new algorithm and present its practical application to MCDM problems based on LDFSs and LDF-relations.
This manuscript is composed in the following order: Section 2 contains some basic concepts of FSs, IFSs, LDFSs, F-relation, IF-relations, semigroup, semiring and hemiring. Section 3 introduces the concept of LDF-relation and some fundamental operations with some significant properties. With the help of these operations and properties, some algebraic structures such as semigroup, semiring and hemiring, in the set of all LDF-relations are introduced. Section 4 is devoted to constructing an algorithm for DM with a numerical example. Finally, Section 5 presents the conclusion of this research paper.

2. Preliminaries

This section includes some essential concepts which are useful in the remaining sections of the manuscript. For detailed study, we refer the reader to [1,2,8,26,32,37]. In the whole manuscript, Q will be supposed to be a universal set.
Definition 1.
[1] A FS δ on Q is a mapping
δ : Q [ 0 , 1 ]
known as membership function which assigns the grade of membership to each object υ Q in δ. The set of all FSs on Q is denoted by F ( Q ) .
A binary relation from Q 1 to Q 2 is a subset of the cartesian product Q 1 × Q 2 , where Q 1 and Q 2 are two universes. In 1971, Zadeh [2] fuzzified the structure of binary relation and introduced a new concept, known as F-relation.
Definition 2.
[2] A F-relation R from Q 1 to Q 2 is simply a F-subset of Q 1 × Q 2 . That is, a F-relation or a F-binary relation from Q 1 to Q 2 is a membership function
R : Q 1 × Q 2 [ 0 , 1 ]
which assigns the grade of membership to each pair ( υ 1 , υ 2 ) Q 1 × Q 2 in R . The set of all F-relations from Q 1 to Q 2 is represented by F ( Q 1 × Q 2 ) .
Definition 3.
[5] An IFS in Q is an object of the following form:
I = { ( υ , < δ M ( υ ) , δ N ( υ ) > ) : υ Q }
where the mappings
δ M , δ N : Q [ 0 , 1 ]
represent the membership and non-membership functions, respectively, satisfying the following condition:
0 δ M ( υ ) + δ N ( υ ) 1 .
for all υ Q . Hesitation part is defined by λ ( υ ) = 1 ( δ M ( υ ) + δ N ( υ ) ) for each υ Q . The set of all IFSs is denoted by IF ( Q ) .
In 1984, Atanassov [8] also generalized the concept of F-relation [2] and introduced the concept of IF-relation.
Definition 4.
[8] An IF-relation from Q 1 to Q 2 is an IF-subset of Q 1 × Q 2 , that is an expression of the following form:
R I = { ( ( υ 1 , υ 2 ) , < δ R I M ( υ 1 , υ 2 ) , δ R I N ( υ 1 , υ 2 ) > ) : υ 1 Q 1 , υ 2 Q 2 }
where the membership and non-membership F-relations
δ R I M , δ R I N : Q 1 × Q 2 [ 0 , 1 ]
satisfy the condition 0 δ R I M ( υ 1 , υ 2 ) + δ R I N ( υ 1 , υ 2 ) 1 for all ( υ 1 , υ 2 ) Q 1 × Q 2 . The set of all IF-relations from Q 1 to Q 2 is denoted by IFR ( Q 1 × Q 2 ) .
Definition 5.
[26] A LDFS on Q is an object defined as follows:
£ D = { ( υ , < δ D M ( υ ) , δ D N ( υ ) > , < α ( υ ) , β ( υ ) > ) : υ Q }
where
δ D M , δ D N : Q [ 0 , 1 ]
are membership and non-membership functions, and α ( υ ) , β ( υ ) [ 0 , 1 ] are the reference parameters of δ D M ( υ ) , δ D N ( υ ) respectively, with 0 α ( υ ) δ D M ( υ ) + β ( υ ) δ D N ( υ ) 1 satisfying 0 α ( υ ) + β ( υ ) 1 for all υ Q . The hesitation part is defined as ξ ( υ ) π D ( υ ) = 1 ( α ( υ ) δ D M ( υ ) + β ( υ ) δ D N ( υ ) ) , where π D ( υ ) is known to be the degree of indeterminacy of υ to £ D , and ξ ( υ ) is reference parameter related to the degree of indeterminacy. We shall denote the collection of all LDFSs on Q by LDF ( Q ) .
In the following of this section, we shall recall some definitions of semigroup, semiring and hemiring.
Definition 6.
A non-empty set S together with an associative binary operation * defined on S is called a semigroup. It is usually denoted by the pair ( S , ) .
Definition 7.
A semigroup ( S , ) is called:
(1) 
monoid, if there exists an element e S such that e a = a e = a for all a S .
(2) 
idempotent, if a a = a for all a S .
Definition 8.
A non-empty set R with two binary operations +, and · is called a semiring, if
(1) 
( R , + ) is semigroup.
(2) 
( R , · ) is semigroup.
(3) 
Multiplication is distributive over addition from both sides, that is,
(i) 
a · ( b + c ) = ( a · b ) + ( a · c ) .
(ii) 
( b + c ) · a = ( b · a ) + ( c · a ) .
for all a , b , c R . We shall denote a semiring with two binary operations +, · by ( R , + , · ) .
(4) 
A semiring ( R , + , · ) is called commutative, if ( R , · ) is commutative semigroup, that is, a · b = b · a for all a , b R .
(5) 
A semiring ( R , + , · ) is said to have an identity element e, if for any a R a · e = e · a for some e R .
(6) 
A semiring ( R , + , · ) is said to have a zero element 0, if for any a R
(i) 
a + 0 = 0 + a = a .
(ii) 
a · 0 = 0 · a = 0 .
for some 0 R .
Definition 9.
A hemiring is a semiring ( R , + , · ) such that
(1) 
( R , + ) is commutative semigroup.
(2) 
( R , + , · ) have zero element 0.

3. Linear Diophantine Fuzzy Relation (Ldf-Relation)

We know that the binary relations are just the subsets of the cartesian product of two universes and they play a vital role in both pure and applied sciences. To extend the existing notion of IF-relation, we applied the notion of LDFS [26] to binary relations which removes the restrictions of IF-relations on membership and non-membership F-relations. In this regard, a new concept of LDF-relation is introduced in the motivation of Riaz and Hashmi’s work [26] only with the addition of reference parameters corresponding to membership and non-membership F-relations respectively.
Definition 10.
A LDF-relation R D from Q 1 to Q 2 is an expression of the following form:
R D = { ( ( υ 1 , υ 2 ) , < δ R D M ( υ 1 , υ 2 ) , δ R D N ( υ 1 , υ 2 ) > , < α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) > ) : υ 1 Q 1 , υ 2 Q 2 }
where the mappings
δ R D M , δ R D N : Q 1 × Q 2 [ 0 , 1 ]
are denoting the membership, and non-membership F-relations from Q 1 to Q 2 , respectively, and α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) [ 0 , 1 ] are the corresponding reference parameters to δ R D M ( υ 1 , υ 2 ) and δ R D N ( υ 1 , υ 2 ) respectively. These membership and non-membership F-relations satisfy the condition
0 α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) 1
for all ( υ 1 , υ 2 ) Q 1 × Q 2 with 0 α ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) 1 . For an LDF-relation from Q 1 to Q 2 , we shall use
R D = ( < δ R D M ( υ 1 , υ 2 ) , δ R D N ( υ 1 , υ 2 ) > , < α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) > )
for the sake of simplicity. The F-relation π D : Q 1 × Q 2 [ 0 , 1 ] associated with each LDF-relation 1, where
γ D ( υ 1 , υ 2 ) π D ( υ 1 , υ 2 ) = 1 ( α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) )
The number π D ( υ 1 , υ 2 ) is an index (a degree) of hesitation wether υ 1 and υ 2 are the relation R D or not, and γ D ( υ 1 , υ 2 ) is the reference parameter of degree of hesitation. We shall denote the set of all LDF-relations from Q 1 to Q 2 by LDFR ( Q 1 × Q 2 ) .
By Definition 10, an LDF-relation R D is simply an LDFS on Q 1 × Q 2 .
Remark 1. 
(i) 
Since every binary relation is a F-relation and every F-relation is an IF-relation with non-zero membership grade and zero non-membership grade. For parametric values α ( υ 1 , υ 2 ) 0 , β ( υ 1 , υ 2 ) = 0 , and δ R D M ( υ 1 , υ 2 ) 0 , an LDF-relation R D is a F-relation. For any reference parameters α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) [ 0 , 1 ] with 0 α ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) 1 , an IF-relation satisfies the condition
0 α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) 1
Hence, every IF-relation is also an LDF-relation. However, the converse is not true in general as it is proved in case of LDFSs [26], page 5423.
(ii) 
If the reference parameters α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) [ 0 , 1 ] do not satisfy the condition 0 α ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) 1 , then α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) may exceed 1. For instance, if δ R D M ( υ 1 , υ 2 ) = 0.88 , δ R D N ( υ 1 , υ 2 ) = 0.91 , and α ( υ 1 , υ 2 ) = 0.55 , β ( υ 1 , υ 2 ) = 0.71 . It is clear that α ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) > 1 , and hence α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) = 1.130 1 .
(iii) 
If δ R D M ( υ 1 , υ 2 ) 0 , δ R D N ( υ 1 , υ 2 ) = 1 , and α ( υ 1 , υ 2 ) 0 , then β ( υ 1 , υ 2 ) 1 . Because, then α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) 1 .
(iv) 
The Definition 10 of LDF-relation can be extended to n universal sets Q 1 × Q 2 × × Q n in similar manners.
In the motivation of the matrix notation of F-relations defined in [30], the matrix notation of LDF-relations is defined below.
Definition 11.
Let R D = ( < δ R D M ( x i , x j ) , δ R D N ( x i , x j ) > , < α ( x i , x j ) , ( x i , x j ) > ) be an LDF-relation from Q 1 to Q 2 , where Q 1 = { x 1 , x 2 , , x m } , and Q 2 = { y 1 , y 2 , , y n } are finite universes. Consider δ R D M ( x i , x j ) = ( a i j ) m × n , δ R D N ( x i , x j ) = ( b i j ) m × n , and α ( x i , x j ) = ( α i j ) m × n , β ( x i , x j ) = ( β i j ) m × n , with 0 α i j + β i j 1 satisfying 0 α i j a i j + β i j b i j 1 for all i , j , where 1 i | Q 1 | and 1 j | Q 2 | . Then, an LDF-relation R D can be represented in the form of four matrices as follows:
δ R D M = ( a i j ) m × n = a 11 a 12 a 1 n a 21 a 22 a 2 n . . . . . . . . . a m 1 a m 2 a m n ,   δ R D N = ( b i j ) m × n = b 11 b 12 b 1 n b 21 b 22 b 2 n . . . . . . . . . b m 1 b m 2 b m n
In addition,
α = ( α i j ) m × n = α 11 α 12 α 1 n α 21 α 22 α 2 n . . . . . . . . . α m 1 α m 2 α m n ,   β = ( β i j ) m × n = β 11 β 12 β 1 n β 21 β 22 β 2 n . . . . . . . . . β m 1 β m 2 β m n
Or in the form of one matrix as follows:
R D = ( ( a 11 , b 11 ) , ( α 11 , β 11 ) ) ( ( a 12 , b 12 ) , ( α 12 , β 12 ) ) ( ( a 1 n , b 1 n ) , ( α 1 n , β 1 n ) ) ( ( a 21 , b 21 ) , ( α 21 , β 21 ) ) ( ( a 22 , b 22 ) , ( α 22 , β 22 ) ) ( ( a 2 n , b 2 n ) , ( α 2 n , β 2 n ) ) . . . . . . . . . ( ( a m 1 , b m 1 ) , ( α m 1 , β m 1 ) ) ( ( a m 2 , b m 2 ) , ( α m 2 , β m 2 ) ) ( ( a m n , b m n ) , ( α m n , β m n ) ) ,
where R D = ( < δ R D M ( x i , x j ) , δ R D N ( x i , x j ) > , < α ( x i , x j ) , β ( x i , x j ) > ) = ( < a i j , b i j > , < α i j , β i j > ) m × n .
Since an LDF-relation is an LDFS on Q 1 × Q 2 , they have the same set-theoretic operations as LDFSs.
Definition 12.
Let R 1 D = ( < δ R 1 D M ( υ 1 , υ 2 ) , δ R 1 D N ( υ 1 , υ 2 ) > , < α 1 ( υ 1 , υ 2 ) , β 1 ( υ 1 , υ 2 ) > ) , and R 2 D = ( < δ R 2 D M ( υ 1 , υ 2 ) , δ R 2 D N ( υ 1 , υ 2 ) > , < α 2 ( υ 1 , υ 2 ) , β 2 ( υ 1 , υ 2 ) > ) be two LDF-relations from Q 1 to Q 2 . Then,
(1) 
R 1 D R 2 D if and only if
δ R 1 D M ( υ 1 , υ 2 ) δ R 2 D M ( υ 1 , υ 2 ) a n d δ R 1 D N ( υ 1 , υ 2 ) δ R 2 D N ( υ 1 , υ 2 ) ,
α 1 ( υ 1 , υ 2 ) α 2 ( υ 1 , υ 2 ) , a n d β 1 ( υ 1 , υ 2 ) β 2 ( υ 1 , υ 2 )
for all ( υ 1 , υ 2 ) Q 1 × Q 2 .
(2) 
R 1 D R 2 D = ( < ( δ R 1 D M δ R 2 D M ) ( υ 1 , υ 2 ) , ( δ R 1 D N δ R 2 D N ) ( υ 1 , υ 2 ) > , < α 1 ( υ 1 , υ 2 ) α 2 ( υ 1 , υ 2 ) , β 1 ( υ 1 , υ 2 ) β 2 ( υ 1 , υ 2 ) > ) , where
( δ R 1 D M δ R 2 D M ) ( υ 1 , υ 2 ) = δ R 1 D M ( υ 1 , υ 2 ) δ R 2 D M ( υ 1 , υ 2 ) , a n d
( δ R 1 D N δ R 2 D N ) ( υ 1 , υ 2 ) = δ R 1 D N ( υ 1 , υ 2 ) δ R 2 D N ( υ 1 , υ 2 )
for all ( υ 1 , υ 2 ) Q 1 × Q 2 .
(3) 
R 1 D R 2 D = ( < ( δ R 1 D M δ R 2 D M ) ( υ 1 , υ 2 ) , ( δ R 1 D N δ R 2 D N ) ( υ 1 , υ 2 ) > , < α 1 ( υ 1 , υ 2 ) α 2 ( υ 1 , υ 2 ) , β 1 ( υ 1 , υ 2 ) β 2 ( υ 1 , υ 2 ) > ) , where
( δ R 1 D M δ R 2 D M ) ( υ 1 , υ 2 ) = δ R 1 D M ( υ 1 , υ 2 ) δ R 2 D M ( υ 1 , υ 2 ) , a n d
( δ R 1 D N δ R 2 D N ) ( υ 1 , υ 2 ) = δ R 1 D N ( υ 1 , υ 2 ) δ R 2 D N ( υ 1 , υ 2 )
for all ( υ 1 , υ 2 ) Q 1 × Q 2 .
(4) 
R 1 D 1 = ( < δ R 1 D 1 M ( υ 2 , υ 1 ) , δ R 1 D 1 N ( υ 2 , υ 1 ) > , < α 1 1 ( υ 2 , υ 1 ) , β 1 1 ( υ 2 , υ 1 ) > ) is an LDF-relation from Q 2 to Q 1 , where
δ R 1 D 1 M ( υ 2 , υ 1 ) = δ R 1 D M ( υ 1 , υ 2 ) , a n d δ R 1 D 1 N ( υ 2 , υ 1 ) = δ R 1 D N ( υ 1 , υ 2 )
α 1 1 ( υ 2 , υ 1 ) = α 1 ( υ 1 , υ 2 ) , a n d β 1 1 ( υ 2 , υ 1 ) = β 1 ( υ 1 , υ 2 )
for all ( υ 2 , υ 1 ) Q 2 × Q 1 .
(5) 
R 1 D c = ( < δ R 1 D N ( υ 1 , υ 2 ) , δ R 1 D M ( υ 1 , υ 2 ) > , < β 1 ( υ 1 , υ 2 ) , α 1 ( υ 1 , υ 2 ) > ) .
Proposition 1.
If R 1 D , R 2 D LDFR ( Q 1 × Q 2 ) , then:
(i) 
R 1 D R 2 D , R 1 D R 2 D , R 1 D c LDFR ( Q 1 × Q 2 ) .
(ii) 
R 1 D 1 LDFR ( Q 2 × Q 1 ) .
Proof. 
The proof is straightforward in view of Definition 12.  □
As an illustration of the Definition 12, we present the following example.
Example 1.
Let Q 1 = { x 1 , x 2 , x 3 } , and Q 2 = { y 1 , y 2 } . The LDF-relations R D and P D from Q 1 to Q 2 are defined in Table 1 and Table 2, respectively.
After simple calculations, the union R D P D is obtained in the Table 3.
Their intersection R D P D is given in Table 4.
Further, LDF-relation P D 1 from Q 2 to Q 1 is calculated in Table 5.
In addition, R D c is presented in Table 6.
Proposition 2.
With the same notations as in Definition 12, the following properties hold:
(1) 
R 1 D R 2 D implies that R 1 D 1 R 2 D 1 .
(2) 
( R 1 D R 2 D ) 1 = R 1 D 1 R 2 D 1 .
(3) 
( R 1 D R 2 D ) 1 = R 1 D 1 R 2 D 1 .
(4) 
( R 1 D 1 ) 1 = R 1 D .
Proof. 
The proof is very easy in view of Definition 12. □
Definition 13.
In LDFR ( Q 1 × Q 2 ) , we denote and define full LDF-relation, and null LDF-relation as follows:
1 ^ D = { ( ( υ 1 , υ 2 ) , < 1 ^ D ( υ 1 , υ 2 ) , 0 ^ D ( υ 1 , υ 2 ) > , < 1 ^ ( υ 1 , υ 2 ) , 0 ^ ( υ 1 , υ 2 ) > ) : υ 1 Q 1 , υ 2 Q 2 } ,
0 ^ D = { ( ( υ 1 , υ 2 ) , < 0 ^ D ( υ 1 , υ 2 ) , 1 ^ D ( υ 1 , υ 2 ) > , < 0 ^ ( υ 1 , υ 2 ) , 1 ^ ( υ 1 , υ 2 ) > ) : υ 1 Q 1 , υ 2 Q 2 }
where,
1 ^ D ( υ 1 , υ 2 ) = 1 ^ ( υ 1 , υ 2 ) = 1 , for all ( υ 1 , υ 2 ) Q 1 × Q 2
0 ^ D ( υ 1 , υ 2 ) = 0 ^ ( υ 1 , υ 2 ) = 0 , for all ( υ 1 , υ 2 ) Q 1 × Q 2
As a direct consequence of the Definition 12 ( 2 ) and ( 3 ) , and Definition 13, we get the following result.
Proposition 3.
Let R 1 D , R 2 D , R 3 D LDFR ( Q 1 × Q 2 ) . Then, the following properties hold:
(1) 
R 1 D 0 ^ D = R 1 D .
(2) 
R 1 D 0 ^ D = 0 ^ D .
(3) 
R 1 D 1 ^ D = 1 ^ D .
(4) 
R 1 D 1 ^ D = R 1 D .
(5) 
R 1 D R 1 D = R 1 D .
(6) 
R 1 D R 1 D = R 1 D .
(7) 
R 1 D R 2 D = R 2 D R 1 D .
(8) 
R 1 D R 2 D = R 2 D R 1 D .
(9) 
( R 1 D R 2 D ) R 3 D = R 1 D ( R 2 D R 3 D ) .
(10) 
( R 1 D R 2 D ) R 3 D = R 1 D ( R 2 D R 3 D ) .
The above Proposition 3 is very important which yields to the following algebraic structure (see Corollary 1).
Corollary 1.
The pairs ( LDFR ( Q 1 × Q 2 ) , ) and ( LDFR ( Q 1 × Q 2 , ) ) are idempotent, commutative monoids with identity elements 0 ^ D , and 1 ^ D , respectively.
The next result is very important which gives rise to some other algebraic structures.
Proposition 4.
With the same notations as in above Proposition 3, the following assertions hold:
(1) 
R 1 D ( R 2 D R 3 D ) = ( R 1 D R 2 D ) ( R 1 D R 3 D ) .
(2) 
R 1 D ( R 2 D R 3 D ) = ( R 1 D R 2 D ) ( R 1 D R 3 D ) .
(3) 
If R 2 D R 1 D , and R 3 D R 1 D , imply that R 2 D R 3 D R 1 D .
(4) 
If R 1 D R 2 D , and R 1 D R 3 D , then R 1 D R 2 D R 3 D .
Proof. 
( 1 ) Let ( υ 1 , υ 2 ) Q 1 × Q 2 . Then,
[ δ R 1 D M ( δ R 2 D M δ R 3 D M ) ] ( υ 1 , υ 2 ) = δ R 1 D M ( υ 1 , υ 2 ) [ ( δ R 2 D M δ R 3 D M ) ( υ 1 , υ 2 ) ] = δ R 1 D M ( υ 1 , υ 2 ) [ δ R 2 D M ( υ 1 , υ 2 ) δ R 3 D M ( υ 1 , υ 2 ) ] = [ δ R 1 D M ( υ 1 , υ 2 ) δ R 2 D M ( υ 1 , υ 2 ) ] [ δ R 1 D M ( υ 1 , υ 2 ) δ R 3 D M ( υ 1 , υ 2 ) ] = [ ( δ R 1 D M δ R 2 D M ) ( υ 1 , υ 2 ) ] [ ( δ R 1 D M δ R 3 D M ) ( υ 1 , υ 2 ) ] = [ ( δ R 1 D M δ R 2 D M ) ( δ R 1 D M δ R 3 D M ) ] ( υ 1 , υ 2 )
In the similar manners, it can be prove that
[ δ R 1 D N ( δ R 2 D N δ R 3 D N ) ] ( υ 1 , υ 2 ) = [ ( δ R 1 D N δ R 2 D N ) ( δ R 1 D N δ R 3 D N ) ] ( υ 1 , υ 2 ) .
Moreover,
α 1 ( υ 1 , υ 2 ) ( α 2 ( υ 1 , υ 2 ) α 3 ( υ 1 , υ 2 ) ) = ( α 1 ( υ 1 , υ 2 ) α 2 ( υ 1 , υ 2 ) ) ( α 1 ( υ 1 , υ 2 ) α 3 ( υ 1 , υ 2 ) )
In addition,
β 1 ( υ 1 , υ 2 ) ( β 2 ( υ 1 , υ 2 ) β 3 ( υ 1 , υ 2 ) ) = ( β 1 ( υ 1 , υ 2 ) β 2 ( υ 1 , υ 2 ) ) ( β 1 ( υ 1 , υ 2 ) β 3 ( υ 1 , υ 2 ) )
(since α i ( υ 1 , υ 2 ) , β i ( υ 1 , υ 2 ) [ 0 , 1 ] , and ( [ 0 , 1 ] , , ) is a distributive lattice [38], where i = 1 , 2 , 3 ).
( 2 ) The proof is similar to the proof of ( 1 ) . ( 3 ) and ( 4 ) can easily be proved by using Definition 12  ( 1 ) , ( 2 ) . □
From Proposition 4, we have the following corollary.
Corollary 2.
The set LDFR ( Q 1 × Q 2 ) is the following algebraic structures:
(1) 
Commutative semiring ( LDFR ( Q 1 × Q 2 ) , , ) with identity element 1 ^ D , and zero element 0 ^ D .
(2) 
Commutative semiring ( LDFR ( Q 1 × Q 2 ) , , ) with identity element 0 ^ D , and zero element 1 ^ D .
The above Corollary 2 gives rise to the following result.
Corollary 3.
The set LDFR ( Q 1 × Q 2 ) is hemiring ( LDFR ( Q 1 × Q 2 ) , , ) with zero element 0 ^ D .
In the motivation of the composition of F-relations [2,30], we define the composition of two LDF-relations and study some of its important properties in the sequel of this manuscript.
Definition 14.
Let R D = ( < δ R D M ( υ 1 , υ 2 ) , δ R D N ( υ 1 , υ 2 ) > , < α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) > ) be an LDF-relation from Q 1 to Q 2 , and P D = ( < δ P D M ( υ 2 , υ 3 ) , δ P D N ( υ 2 , υ 3 ) > , < α ( υ 2 , υ 3 ) , β ( υ 2 , υ 3 ) > ) be an LDF-relation from Q 2 to Q 3 . We denote and define their composition as follows:
R D ^ P D = ( < ( δ R D M ^ δ P D M ) ( υ 1 , υ 3 ) , ( δ R D N ^ δ P D N ) ( υ 1 , υ 3 ) > , < ( α ^ α ) ( υ 1 , υ 3 ) , ( β ^ β ) ( υ 1 , υ 3 ) > )
where,
( δ R D M ^ δ P D M ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( δ R D M ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) )
( δ R D N ^ δ P D N ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( δ R D N ( υ 1 , υ 2 ) δ P D N ( υ 2 , υ 3 ) )
and
( α ^ α ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( α ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) ) ,
( β ^ β ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( β ( υ 1 , υ 2 ) β ( υ 2 , υ 3 ) ) .
for all ( υ 1 , υ 3 ) Q 1 × Q 3 .
Proposition 5.
With the same notations as in Definition 14, we have R D ^ P D LDFR ( Q 1 × Q 3 ) .
Proof. 
First, we prove that 0 ( α ^ α ) ( υ 1 , υ 3 ) + ( β ^ β ) ( υ 1 , υ 3 ) 1 . Since 0 α ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) 1 and 0 α ( υ 2 , υ 3 ) + β ( υ 2 , υ 3 ) 1 , then α ( υ 1 , υ 2 ) 1 β ( υ 1 , υ 2 ) and α ( υ 2 , υ 3 ) 1 β ( υ 2 , υ 3 ) . So,
( α ^ α ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( α ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) ) υ 2 Q 2 ( ( 1 β ( υ 1 , υ 2 ) ) ( 1 β ( υ 2 , υ 3 ) ) ) = υ 2 Q 2 ( 1 ( β ( υ 1 , υ 2 ) β ( υ 2 , υ 3 ) ) ) = 1 υ 2 Q 2 ( β ( υ 1 , υ 2 ) β ( υ 2 , υ 3 ) ) = 1 ( β ^ β ) ( υ 1 , υ 3 )
This proves that 0 ( α ^ α ) ( υ 1 , υ 3 ) + ( β ^ β ) ( υ 1 , υ 3 ) 1 . Now, to prove that
0 ( α ^ α ) ( υ 1 , υ 3 ) ( δ R D M ^ δ P D M ) ( υ 1 , υ 3 ) + ( β ^ β ) ( υ 1 , υ 2 ) ( δ R D N ^ δ P D N ) ( υ 1 , υ 3 ) 1 .
for all ( υ 1 , υ 3 ) Q 1 × Q 3 . Since 0 α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) + β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) 1 , for all ( υ 1 , υ 2 ) Q 1 × Q 2 , and 0 α ( υ 2 , υ 3 ) δ P D M ( υ 2 , υ 3 ) + β ( υ 2 , υ 3 ) δ R D M ( υ 2 , υ 3 ) 1 for all ( υ 2 , υ 3 ) Q 2 × Q 3 . It follows that:
α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) 1 β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) , and
α ( υ 2 , υ 3 ) δ P D M ( υ 2 , υ 3 ) 1 β ( υ 2 , υ 3 ) δ P D N ( υ 2 , υ 3 )
Let ( υ 1 , υ 3 ) Q 1 × Q 3 . Then, by using the Definition 14,
( α ^ α ) ( υ 1 , υ 3 ) ( δ R D M ^ δ P D M ) ( υ 1 , υ 3 ) = [ υ 2 Q 2 ( α ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) ) ] [ υ 2 Q 2 ( δ R D M ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) ) ] = υ 2 Q 2 υ 2 Q 2 [ ( α ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) ) ( δ R D M ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) ) ] = υ 2 Q 2 υ 2 Q 2 [ [ α ( υ 1 , υ 2 ) ( δ R D M ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) ) ] [ α ( υ 2 , υ 3 ) ( δ R D M ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) ) ] ] = υ 2 Q 2 υ 2 Q 2 [ [ α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) α ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) ] [ α ( υ 2 , υ 3 ) δ R D M ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) δ P D M ( υ 2 , υ 3 ) ] ] υ 2 Q 2 υ 2 Q 2 [ α ( υ 1 , υ 2 ) δ R D M ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) δ P D M ( υ 2 , υ 3 ) ] υ 2 Q 2 υ 2 Q 2 [ ( 1 β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) ) ( 1 β ( υ 2 , υ 3 ) δ P D N ( υ 2 , υ 3 ) ) ] = υ 2 Q 2 υ 2 Q 2 [ 1 ( β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) β ( υ 2 , υ 3 ) δ P D N ( υ 2 , υ 3 ) ) ] = 1 υ 2 Q 2 υ 2 Q 2 [ β ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) β ( υ 2 , υ 3 ) δ P D N ( υ 2 , υ 3 ) ] 1 [ υ 2 Q 2 ( β ( υ 1 , υ 2 ) β ( υ 2 , υ 3 ) ) ] [ υ 2 Q 2 ( δ R D N ( υ 1 , υ 2 ) δ P D N ( υ 2 , υ 3 ) ) ] = 1 ( β ^ β ) ( υ 1 , υ 3 ) ( δ R D N ^ δ P D N ) ( υ 1 , υ 3 ) )
(see Equations (3) and (4)). This proves Equation (2). Hence, R D ^ P D LDFR ( Q 1 × Q 3 ) . □
Theorem 1.
With the same assumptions as in the above Proposition 5, the following assertion hold:
( R D ^ P D ) 1 = P D 1 ^ R D 1
Proof. 
Let ( υ 3 , υ 1 ) Q 3 × Q 1 . According to the Definition 12 ( 4 ) , and Definition 14,
( δ R D M ^ δ P D M ) 1 ( υ 3 , υ 1 ) = ( δ R D M ^ δ P D M ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( δ R D M ( υ 1 , υ 2 ) δ P D M ( υ 2 , υ 3 ) ) = υ 2 Q 2 ( δ R D 1 M ( υ 2 , υ 1 ) δ P D 1 M ( υ 3 , υ 2 ) ) = υ 2 Q 2 ( δ P D 1 M ( υ 3 , υ 2 ) δ R D 1 M ( υ 2 , υ 1 ) ) = ( δ P D 1 M ^ δ R D 1 M ) ( υ 3 , υ 1 )
Similarly, it can be proved that ( δ R D N ^ δ P D N ) 1 ( υ 3 , υ 1 ) = ( δ P D 1 N ^ δ R D 1 N ) ( υ 3 , υ 1 ) . In addition,
( α ^ α ) 1 ( υ 3 , υ 1 ) = ( α ^ α ) ( υ 1 , υ 3 ) = υ 2 Q 2 ( α ( υ 1 , υ 2 ) α ( υ 2 , υ 3 ) ) = υ 2 Q 2 ( α 1 ( υ 2 , υ 1 ) α 1 ( υ 3 , υ 2 ) ) = υ 2 Q 2 ( α 1 ( υ 3 , υ 2 ) α 1 ( υ 2 , υ 1 ) ) = ( α 1 ^ α 1 ) ( υ 3 , υ 1 )
Similar proof for ( β ^ β ) 1 ( υ 3 , υ 1 ) = ( β 1 ^ β 1 ) ( υ 3 , υ 1 ) . This completes the proof. □
Theorem 2.
If R D LDFR ( Q 1 × Q 2 ) , and P 1 D , P 2 D LDFR ( Q 2 × Q 3 ) such that P 1 D P 2 D . Then,
(1) 
R D ^ P 1 D R D ^ P 2 D .
(2) 
P 1 D ^ P 1 D P 2 D ^ P 2 D .
Proof. 
( 1 ) The proof is straightforward in view of Definition 12  ( 1 ) and 14.
( 2 ) From ( 1 ) we have, P 1 D ^ P 1 D P 2 D ^ P 1 D P 2 D ^ P 2 D . □
Theorem 3.
If P 1 D , P 2 D LDFR ( Q 1 × Q 2 ) , and R D LDFR ( Q 2 × Q 3 ) with P 1 D P 2 D , then:
P 1 D ^ R D P 2 D ^ R D .
Proof. 
This proof is similar to the proof of Theorem 2 ( 1 ) . □
The following Theorem 4, informs us that LDF-relations satisfies the associative laws with respect to the composition defined in Definition 14.
Theorem 4.
Let R 1 D LDFR ( Q 1 × Q 2 ) , R 2 D LDFR ( Q 2 × Q 3 ) , and R 3 D LDFR ( Q 3 × Q 4 ) . Then:
R 1 D ^ ( R 2 D ^ R 3 D ) = ( R 1 D ^ R 2 D ) ^ R 3 D .
Proof. 
Let υ 1 Q 1 , υ 4 Q 4 . Then, by Definition 14
[ δ R 1 D M ^ ( δ R 2 D M ^ δ R 3 D M ) ] ( υ 1 , υ 4 ) = υ 3 Q 3 [ ( δ R 1 D M ^ δ R 2 D M ) ( υ 1 , υ 3 ) δ R 3 D M ( υ 3 , υ 4 ) ] = υ 3 Q 3 υ 2 Q 2 [ ( δ R 1 D M ( υ 1 , υ 2 ) δ R 2 D M ( υ 2 , υ 3 ) ) δ R 3 D M ( υ 3 , υ 4 ) ] = υ 2 Q 2 υ 3 Q 3 [ δ R 1 D M ( υ 1 , υ 2 ) ( δ R 2 D M ( υ 2 , υ 3 ) δ R 3 D M ( υ 3 , υ 4 ) ) ] = υ 2 Q 2 [ δ R 1 D M ( υ 1 , υ 3 ) ( υ 3 Q 3 ( δ R 2 D M ( υ 2 , υ 3 ) δ R 3 D M ( υ 3 , υ 4 ) ) ) ] = υ 2 Q 2 [ δ R 1 D M ( υ 1 , υ 2 ) ( δ R 2 D M ^ δ R 3 D M ) ( ( υ 2 , υ 4 ) ) ] = ( δ R 1 D M ^ δ R 2 D M ) ^ δ R 3 D M ( υ 1 , υ 4 )
Similarly, [ δ R 1 D N ^ ( δ R 2 D N ^ δ R 3 D N ) ] ( υ 1 , υ 4 ) = [ ( δ R 1 D N ^ δ R 2 D N ) ^ δ R 3 D N ] ( υ 1 , υ 4 ) . Now, let υ 1 Q 1 , υ 4 Q 4 . According to the Definition 14,
[ α 1 ^ ( α 2 ^ α 3 ) ] ( υ 1 , υ 4 ) = υ 3 Q 3 [ ( α 1 ^ α 2 ) ( υ 1 , υ 3 ) α 3 ( υ 3 , υ 4 ) ] = υ 3 Q 3 [ ( υ 2 Q 2 ( α 1 ( υ 1 , υ 2 ) α 2 ( υ 2 , υ 3 ) ) ) α 3 ( υ 3 , υ 4 ) ] = υ 3 Q 3 υ 2 Q 2 [ ( α 1 ( υ 1 , υ 2 ) α 2 ( υ 2 , υ 3 ) ) α 3 ( υ 3 , υ 4 ) ] = υ 3 Q 3 υ 2 Q 2 [ α 1 ( υ 1 , υ 2 ) ( α 2 ( υ 2 , υ 3 ) α 3 ( υ 3 , υ 4 ) ) ] = υ 2 Q 2 υ 3 Q 3 [ α 1 ( υ 1 , υ 2 ) ( α 2 ( υ 2 , υ 3 ) α 3 ( υ 3 , υ 4 ) ) ] = υ 2 Q 2 [ α 1 ( υ 1 , υ 2 ) ( υ 3 Q 3 ( α 2 ( υ 2 , υ 3 ) α 3 ( υ 3 , υ 4 ) ) ) ] = υ 2 Q 2 [ α 1 ( υ 1 , υ 2 ) ( α 2 ( ^ α 3 ) ( υ 2 , υ 4 ) ) ] = [ ( α 1 ^ α 2 ) ^ α 3 ] ( υ 1 , υ 4 )
Similar proof for [ β 1 ^ ( β 2 ^ β 3 ) ] ( υ 1 , υ 4 ) = [ ( β 1 ^ β 2 ) ^ β 3 ] ( υ 1 , υ 4 ) . Thus proof is complete. □
In the following two results, the distributive laws of union and intersection over composition are proved.
Theorem 5.
Let R D LDFR ( Q 1 × Q 2 ) , and P 1 D , P 2 D LDFR ( Q 2 × Q 3 ) . Then, the following properties hold:
(1) 
R D ^ ( P 1 D P 2 D ) = ( R D ^ P 1 D ) ( R D ^ P 2 D ) .
(2) 
R D ^ ( P 1 D P 2 D ) = ( R D ^ P 1 D ) ( R D ^ P 2 D ) .
Proof. 
( 1 ) Let ( υ 1 , υ 3 ) Q 1 × Q 3 . From Definition 14 and 12,
[ δ R D M ^ ( δ P 1 D M δ P 2 D M ) ] ( υ 1 , υ 3 ) = υ 2 Q 2 [ δ R D M ( υ 1 , υ 2 ) ( δ P 1 D M δ P 2 D M ) ( υ 2 , υ 3 ) ] = υ 2 Q 2 [ δ R D M ( υ 1 , υ 2 ) ( δ P 1 D M ( υ 2 , υ 3 ) δ P 2 D M ( υ 2 , υ 3 ) ) ] = υ 2 Q 2 [ ( δ R D M ( υ 1 , υ 2 ) δ P 1 D M ( υ 2 , υ 3 ) ) ( δ R D M ( υ 1 , υ 2 ) δ P 2 D M ( υ 2 , υ 3 ) ) ] = [ υ 2 Q 2 ( δ R D M ( υ 1 , υ 2 ) δ P 1 D M ( υ 2 , υ 3 ) ) ] [ υ 2 Q 2 ( δ R D M ( υ 1 , υ 2 ) δ P 2 D M ( υ 2 , υ 3 ) ) ] = ( δ R D M ^ δ P 1 D M ) ( υ 1 , υ 3 ) ( δ R D M ^ δ P 2 D M ) ( υ 1 , υ 3 ) = ( ( δ R D M ^ δ P 1 D M ) ( δ R D M ^ δ P 2 D M ) ) ( υ 1 , υ 3 )
In a similar way, it can be proved that [ δ R D N ^ ( δ P 1 D N δ P 2 D N ) ] ( υ 1 , υ 3 ) = [ ( δ R D N ^ δ P 1 D N ) ( δ R D N ^ δ P 2 D N ) ] ( υ 1 , υ 3 ) . Furthermore, since α ( υ 1 , υ 2 ) , α 1 ( υ 2 , υ 3 ) , α 2 ( υ 2 , υ 3 ) [ 0 , 1 ] and ( [ 0 , 1 ] , , ) is a distributive lattice. Therefore, [ α ^ ( α 1 α 2 ) ] ( υ 1 , υ 3 ) = [ ( α ^ α 1 ) ( α ^ α 2 ) ] ( υ 1 , υ 3 ) and [ β ^ ( β 1 β 2 ) ] ( υ 1 , υ 3 ) = [ ( β ^ β 1 ) ( β ^ β 2 ) ] ( υ 1 , υ 3 ) . ( 2 ) can be proved by following the same pattern. This completes the proof. □
Theorem 6.
Let P 1 D , P 2 D LDFR ( Q 1 × Q 2 ) , and R D LDFR ( Q 2 × Q 3 ) . Then, the following properties hold:
(1) 
( P 1 D P 2 D ) ^ R D = ( P 1 D ^ R D ) ( P 2 D ^ R D ) .
(2) 
( P 1 D P 2 D ) ^ R D = ( P 1 D ^ R D ) ( P 2 D ^ R D ) .
Proof. 
The proof is similar to the proof of Theorem 5. □
Theorem 4, 5, and 5 giving rise the following algebraic structures.
Corollary 4.
The triplet ( LDFR ( Q 1 × Q 1 ) , , ^ ) is:
(1) 
semiring with identity element 1 ^ D LDFR ( Q 1 × Q 1 ) and zero element 0 ^ D LDFR ( Q 1 × Q 1 ) .
(2) 
hemiring with zero element 0 ^ D LDFR ( Q 1 × Q 1 ) .
Now we define the concept of an equivalence LDF-relation. Let us assume that
R D = < δ R D M ( υ 1 , υ 2 ) , δ R D N ( υ 1 , υ 2 ) > , < α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) >
is an LDF-relation on a Q .
Definition 15.
The LDF-relation R D is called reflexive, if:
δ R D M ( ϵ , ϵ ) = 1 , δ R D N ( ϵ , ϵ ) = 0 , a n d α ( ϵ , ϵ ) = 1 , β ( ϵ , ϵ ) = 0
for all ϵ Q .
If | Q | = n , where | . | denotes the number of elements, and
R D = < δ R D M ( ϵ i , ϵ j ) , δ R D N ( ϵ i , ϵ j ) > , < α ( ϵ i , ϵ j ) , β ( ϵ i , ϵ j ) > = ( < ( a i j ) n × n , ( a i j ) n × n > , < ( α i j ) n × n , ( β i j ) n × n > ) ,
where i , j = 1 , 2 , , n . Then LDF relation R D is reflexive, if:
a i i = α i i = 1 , and b i i = β i i = 0 .
Definition 16.
The LDF-relation R D is called symmetric, if:
δ R D M ( ϵ 1 , ϵ 2 ) = δ R D M ( ϵ 2 , ϵ 1 ) ,
δ R D N ( ϵ 1 , ϵ 2 ) = δ R D N ( ϵ 2 , ϵ 1 ) ,
α ( ϵ 1 , ϵ 2 ) = α ( ϵ 2 , ϵ 1 ) ,
β ( ϵ 1 , ϵ 2 ) = β ( ϵ 2 , ϵ 1 )
for all ϵ 1 , ϵ 2 Q .
Since a relation is symmetric, if and only if its matrix is the same as its transpose. So, R D is symmetric, if and only if,
δ R D M = ( δ R D M ) T , δ R D N = ( δ R D N ) T and α = α T , β = β T .
Definition 17.
The LDF-relation R D is called transitive, if R D ^ R D R D , that is,
δ R D M ^ δ R D M δ R D M , δ R D N ^ δ R D N δ R D N , a n d α ^ α α , β ^ β β
Definition 18.
The LDF-relation R D is said to be an equivalence LDF-relation, if R D is reflexive, symmetric and transitive.
For illustration, we construct the following Example.
Example 2.
Let Q = { x 1 , x 2 , x 3 } . Consider an LDF relation R D on Q as follows:
ϑ R D M = 1 0.98 0.46 0.98 1 0.67 0.46 0.67 1 ,   ϑ R D N = 0 0.47 0.32 0.47 0 0.71 0.32 0.71 0 ,
In addition,
α = 1 0.33 0.26 0.33 1 0.47 0.26 0.47 1 ,   β = 0 0.46 0.63 0.46 0 0.34 0.63 0.34 0 .
Then, it can be easily seen that R D is an equivalence LDF-relation.

4. Application of LDF-Relations in Decision Making (DM)

Since LDF-relations are LDFSs, so its applications can be found in the field of AI, engineering, medical, DM and MADM [26]. DM as an abstract technique results best alternative among various choices. In this section, an algorithm is produced to solve some DM problems by utilizing the concept of LDF-relation, in the motivation of Naeem et al. [19], which is supported by a numerical example.
First, we define the score function on LDF-relations, in the motivation of Riaz et al. [26].
Definition 19.
Let R D = ( < δ R D M ( υ 1 , υ 2 ) , δ R D N ( υ 1 , υ 2 ) > , < α ( υ 1 , υ 2 ) , β ( υ 1 , υ 2 ) > ) be a LDF-relation from Q 1 to Q 2 . Define the score function on R D by a map
S : LDFR ( Q 1 × Q 2 ) [ 1 , 1 ]
given as follows:
S ( R D ) = 1 2 [ ( δ R D M ( υ 1 , υ 2 ) δ R D N ( υ 1 , υ 2 ) ) + ( α ( υ 1 , υ 2 ) β ( υ 1 , υ 2 ) ) ]
Now, we propose an Algorithm 1 to DM approach in view of LDF-relations as follows:
Algorithm 1
(1)
Input the data sets Q 1 , Q 2 and Q 3 .
(2)
Compute the LDF-relations R D from Q 1 to Q 2 , and P D from Q 2 to Q 3 .
(3)
Perform the composition operation ^ among R D and P D , that is, R D ^ P D .
(4)
Compute the error or hesitation values of according to Definition 10, that is, ε i k = γ i k π i k = 1 ( θ i k η i k M + θ i k η i k N ) , where η i k M = δ i j M ^ δ j k M , η i k N = δ i j N ^ δ j k N , and θ i k = α i j ^ α j k , θ i k = β i j ^ β j k , and 1 i | Q 1 | , 1 j | Q 2 | , and 1 k | Q 3 | , where | Q l | , l = 1 , 2 , 3 , represents the number of elements of | Q l | .
(5)
Compute the association grades among the elements of the sets Q 1 and Q 3 by using A ¨ = η i k M η i k N ε i k .
(6)
Find out the pair ( q i , q k ) , where q i Q 1 , q k Q 3 having the maximum association grade value A ¨ i k .
(7)
Decision: The pair ( q i , q k ) is the optimal choice.
To explain the above algorithm, the following example is elaborated.
Example 3.
Suppose that a person Mr. X wants to purchase a new brand one canal double story bungalow and the property dealer visited four bungalows Q 1 = { u 1 , u 2 , u 3 , u 4 } as per his requirement Q 2 = { l 1 = near to play ground , l 2 = near to park , l 3 = near to main service road } in reasonable price, where the set of prices is Q 3 = { p 1 = low , p 2 = medium , p 3 = high } .
Now, we consider an LDF-relation R D from Q 1 to Q 2 which describes the location of bungalows in a certain membership and non-membership degree functions δ R D M , and δ R D M together with the parametric values α = good location and β = not good location, to the locations, respectively, in the Table 7.
In addition, we consider the LDF-relation P D from Q 2 to Q 3 which describes the relationship among the locations of bungalows and their prices by the membership and non-membership F-relations δ P D M , δ P D N together with parametric values α = reasonable price, β = not reasonable price in Table 8.
By simple calculations of the composition 14, LDF-relation R D ^ P D from Q 1 to Q 3 given in Table 9 describes the relationship among the bungalows and their prices according to the locations.
Now, by using the Definition 19, hesitation degrees η i k = 1 ( γ i k θ i k M + γ i k θ i k N ) of R D ^ P D are given in Table 10.
Next, the association grades among objects of Q 1 and Q 3 by using the formulae A ¨ i k = θ i k M θ i k N η i k are given in Table 11.
Clearly, the pair ( u 4 , p 2 ) have the highest association grade. Thus, u 4 is the optimal choice for Mr. X to purchase property in good location and reasonable price. For confirmation of our result, we calculate the score values among the objects of Q 1 and Q 3 by using the Definition 19 are computed in Table 12.
It can be easily seen in the last row the pair ( u 4 , p 2 ) has the highest score value. Thus, our decision is true. Hence, our results are valid, and thus our proposed algorithm is a reliable method.

5. Conclusions

Binary relations play an important role in various fields of pure and applied sciences. This manuscript is devoted to studying the concept of LDF-relation in the motivation of Riaz and Hashmi’s work. This new concept of LDF-relation removes the limitations of IF-relation and enhances the space of membership and non-membership grades by adding the reference or control parameters. Some primary operations are defined and certain important results are established. With the help of these operations, it is investigated that the set of all LDF-relations give rise to some algebraic structures namely, semigroup, semiring and hemiring. Moreover, the concept of score function on an LDF-relation is introduced. Moreover, the notion of score function of LDF-relations is introduced to analyze the symmetry of the optimal decision and ranking of feasible alternatives. As an application of proposed LFD-relations in DM, an algorithm is rendered together with a numerical example. In future studies, this new work may be applied to various directions of MCDM and rough set theory using different hybrid techniques, for further research work. LDF-relation comes up with a rigorous mathematical model for modeling uncertainties in decision-making problems, including AI, robotics, machine learning, medical analysis, medicine, economics, and many other real life problems. We hope that the proposed model of LDF-relations and all the ideas in this paper shall exist as an establishment for LDFS theory and will lead to new fruitful results.

Author Contributions

S.A., M.S., M.R., and M.A., conceived and worked together to achieve this manuscript, M.S., R.C. and M.A. construct the ideas and algorithms for data analysis and design the model of the manuscript, S.A., M.R., and R.C., processed the data collection and wrote the paper. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University, Abha 61413, Saudi Arabia for funding this work through research groups program under grant number R.G. P-1/23/42.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Zadeh, L. Similarity relations and fuzzy orderings. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  3. Kaufmann, A. Introduction to the Theory of Fuzzy Subsets; Academic Press: New York, NY, USA, 1975; Volume I. [Google Scholar]
  4. Murali, V. Fuzzy equivalence relations. Fuzzy Sets Syst. 1989, 30, 155–163. [Google Scholar] [CrossRef]
  5. Atanssov, K.T. Intuintionistic Fuzzy Sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  6. Atanssov, K.T. More on Intuintionistic fuzzy sets. Fuzzy Sets Syst. 1989, 33, 37–45. [Google Scholar] [CrossRef]
  7. Atanassov, K.T. Intuitionistic Fuzzy Sets; Physica-Verlag: Heidelberg, NY, USA, 1999. [Google Scholar]
  8. Atanassov, K.T. Intuitionistic fuzzy relations (IFRs). In On Intuitionistic Fuzzy Sets Theory; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2012; Volume 283, pp. 147–193. [Google Scholar] [CrossRef]
  9. Angelov, P.P. Optimization in an intuitionistic fuzzy environment. Fuzzy Sets Syst. 1997, 86, 299–306. [Google Scholar] [CrossRef]
  10. Li, D.-F. Multiattribute decision making models and methods using intuitionistic fuzzy sets. J. Comput. Syst. Sci. 2005, 70, 73–85. [Google Scholar] [CrossRef] [Green Version]
  11. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  12. Dubois, D.; Gottwald, S.; Hajek, P.; Kacprzyk, J.; Prade, H. Terminological difficulties in fuzzy set theory—The case of “Intuitionistic Fuzzy Sets”. Fuzzy Sets Syst. 2005, 156, 485–491. [Google Scholar] [CrossRef]
  13. Feng, F.; Liang, M.; Fujita, H.; Yager, R.R.; Liu, X. Lexicographic orders of intuitionistic fuzzy values and their relationships. Mathematics 2019, 7, 166. [Google Scholar] [CrossRef] [Green Version]
  14. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar] [CrossRef]
  15. Yager, R.P. Pythagorean membership grades in multi-criteria decision maiking. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  16. Atanassov, K.T. Geometrical interpretation of the elemets of the intuitionistic fuzzy objects. Int. J. Biol. Autom. 2016, 20, S27–S42. [Google Scholar]
  17. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  18. Zhang, Q.; Hu, J.; Feng, J.; Liu, A.; Li, Y. New similarity measures of Pythagorean fuzzy sets and their applications. IEEE Access 2019, 7, 138192–138202. [Google Scholar] [CrossRef]
  19. Naeem, K.; Riaz, M.; Karaaslan, F. Some novel features of Pythagorean m-polar fuzzy sets with applications. Complex Intell. Syst. 2021, 7, 459–475. [Google Scholar] [CrossRef]
  20. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  21. Ali, M.I. Another view on q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 2018, 33, 2139–2153. [Google Scholar] [CrossRef]
  22. Liu, P.D.; Wang, P. Some q-Rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making. Int. J. Intell. Syst. 2018, 33, 259–280. [Google Scholar] [CrossRef]
  23. Zhang, W.-R. Bipolar fuzzy sets and relations: A computational framework for cognitive modeling and multiagent decision analysis, NAFIPS/IFIS/NASA ’94. In Proceedings of the First International Joint Conference of The North American Fuzzy Information Processing Society Biannual Conference, San Antonio, TX, USA, 18–21 December 1994; pp. 305–309. [Google Scholar] [CrossRef]
  24. Chen, J.; Li, S.; Ma, S.; Wang, X. m-Polar fuzzy sets: An extension of bipolar fuzzy sets. Sci. World J. 2014, 2014, 1–8. [Google Scholar] [CrossRef] [Green Version]
  25. Akram, M. m-Polar Fuzzy Graphs: Theory, Methods & Applications; Studies in Fuzziness and Soft Computing; Springer Nature Switzerland AG: Berlin/Heidelberg, Germany, 2019. [Google Scholar] [CrossRef]
  26. Riaz, M.; Hashmi, M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2019, 37, 5417–5439. [Google Scholar] [CrossRef]
  27. Riaz, M.; Hashmi, M.R.; Kalsoom, H.; Pamucar, D.; Chu, Y.-M. Linear Diophantine fuzzy soft rough sets for the selection of sustainable material handling equipment. Symmetry 2020, 12, 1215. [Google Scholar] [CrossRef]
  28. Kamacı, H. Linear Diophantine fuzzy algebraic structures. J. Ambient. Intell. Humaniz. Comput. 2021, 1–21. [Google Scholar] [CrossRef]
  29. Almagrabi, A.O.; Abdullah, S.; Shams, M.; Al-Otaibi, Y.D.; Ashraf, S. A new approach to q-linear Diophantine fuzzy emergency decision support system for COVID19. J. Ambient. Intell. Humaniz. Comput. 2021, 1–27. [Google Scholar] [CrossRef]
  30. Wang, X.Z.; Ruan, D.; Kerre, E.E. Mathematics of Fuzziness-Basic Issues. Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2009; Volume 245, pp. 1–227. [Google Scholar] [CrossRef]
  31. Burillo, P.; Bustince, H. Intuitionistic fuzzy relations, Part-I. Mathw. Soft Comput. 1995, 2, 5–38. [Google Scholar]
  32. Bustince, H.; Burillo, P. Structures on intuitionistic fuzzy relations. Fuzzy Sets Syst. 1996, 78, 293–303. [Google Scholar] [CrossRef]
  33. Deschrijver, G.; Kerre, E.E. On the composition of intuitionistic fuzzy relations. Fuzzy Sets Syst. 2003, 136, 333–361. [Google Scholar] [CrossRef]
  34. Hur, K.; Jang, S.Y.; Ahn, Y.S. Intuitionistic fuzzy equivalence relations. Honam Math. J. 2005, 27, 159–177. [Google Scholar]
  35. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  36. Hashmi, M.R.; Riaz, M.; Smarandache, F. m-Polar neutrosophic topology with applications to multi-criteria decision-making in medical diagnosis and clustering analysis. Int. J. Fuzzy Syst. 2019, 22, 273–292. [Google Scholar] [CrossRef]
  37. Nemitz, W.C. Fuzzy relations and fuzzy functions. Fuzzy Sets Syst. 1986, 19, 177–191. [Google Scholar] [CrossRef]
  38. Hur, K.; Jang, S.Y.; Kang, H.W. Intuitionistic fuzzy congruences on a lattice. J. Appl. Math. Comput. 2005, 18, 465–486. [Google Scholar] [CrossRef]
Table 1. LDF-relation R D .
Table 1. LDF-relation R D .
R D y 1 y 2
x 1 ( ( 0.71 , 0.21 ) , ( 0.42 , 0.58 ) ) ( ( 0.95 , 0.41 ) , ( 0.74 , 0.25 ) )
x 2 ( ( 0.93 , 0.52 ) , ( 0.51 , 0.47 ) ) ( ( 0.87 , 0.83 ) , ( 0.64 , 0.36 ) )
x 3 ( ( 0.37 , 0.61 ) , ( 0.61 , 0.33 ) ) ( ( 0.68 , 0.71 ) , ( 0.49 , 0.48 ) )
Table 2. LDF-relation P D .
Table 2. LDF-relation P D .
P D y 1 y 2
x 1 ( ( 0.42 , 0.65 ) , ( 0.46 , 0.52 ) ) ( ( 0.46 , 0.39 ) , ( 0.22 , 0.86 ) )
x 2 ( ( 0.63 , 0.99 ) , ( 0.34 , 0.64 ) ) ( ( 0.56 , 0.75 ) , ( 0.75 , 0.23 ) )
x 3 ( ( 0.75 , 0.71 ) , ( 0.45 , 0.47 ) ) ( ( 0.95 , 0.35 ) , ( 0.43 , 0.59 ) )
Table 3. Union R D P D .
Table 3. Union R D P D .
R D P D y 1 y 2
x 1 ( ( 0.71 , 0.21 ) , ( 0.46 , 0.52 ) ) ( ( 0.95 , 0.39 ) , ( 0.74 , 0.25 ) )
x 2 ( ( 0.93 , 0.52 ) , ( 0.51 , 0.47 ) ) ( ( 0.87 , 0.75 ) , ( 0.75 , 0.23 ) )
x 3 ( ( 0.75 , 0.61 ) , ( 0.61 , 0.33 ) ) ( ( 0.95 , 0.35 ) , ( 0.49 , 0.48 ) )
Table 4. Intersection R D P D .
Table 4. Intersection R D P D .
R D P D y 1 y 2
x 1 ( ( 0.42 , 0.65 ) , ( 0.42 , 0.58 ) ) ( ( 0.46 , 0.41 ) , ( 0.22 , 0.86 ) )
x 2 ( ( 0.63 , 0.99 ) , ( 0.34 , 0.64 ) ) ( ( 0.56 , 0.83 ) , ( 0.64 , 0.36 ) )
x 3 ( ( 0.37 , 0.71 ) , ( 0.45 , 0.47 ) ) ( ( 0.68 , 0.71 ) , ( 0.43 , 0.59 ) )
Table 5. LDF-relation P D 1 from Q 2 to Q 1 .
Table 5. LDF-relation P D 1 from Q 2 to Q 1 .
P D 1 x 1 x 2 x 3
y 1 ( ( 0.42 , 0.65 ) , ( 0.46 , 0.52 ) ) ( ( 0.63 , 0.99 ) , ( 0.34 , 0.64 ) ) ( ( 0.75 , 0.71 ) , ( 0.45 , 0.47 ) )
y 2 ( ( 0.46 , 0.39 ) , ( 0.22 , 0.86 ) ) ( ( 0.56 , 0.75 ) , ( 0.75 , 0.23 ) ) ( ( 0.95 , 0.35 ) , ( 0.43 , 0.59 ) )
Table 6. R D c .
Table 6. R D c .
R D y 1 y 2
x 1 ( ( 0.21 , 0.71 ) , ( 0.58 , 0.42 ) ) ( ( 0.41 , 0.95 ) , ( 0.25 , 0.74 ) )
x 2 ( ( 0.52 , 0.93 ) , ( 0.47 , 0.51 ) ) ( ( 0.83 , 0.87 ) , ( 0.36 , 0.64 ) )
x 3 ( ( 0.61 , 0.37 ) , ( 0.33 , 0.61 ) ) ( ( 0.71 , 0.68 ) , ( 0.48 , 0.49 ) )
Table 7. LDF-relation R D from Q 1 to Q 2 .
Table 7. LDF-relation R D from Q 1 to Q 2 .
R D l 1 l 2 l 3
u 1 ( ( 0.86 , 0.34 ) , ( 0.75 , 0.24 ) ) ( ( 0.56 , 0.49 ) , ( 0.50 , 0.37 ) ) ( ( 0.78 , 0.35 ) , ( 0.65 , 0.25 ) )
u 2 ( ( 0.75 , 0.34 ) , ( 0.60 , 0.24 ) ) ( ( 0.46 , 0.74 ) , ( 0.28 , 0.60 ) ) ( ( 0.45 , 0.41 ) , ( 0.32 , 0.27 ) )
u 3 ( ( 0.56 , 0.44 ) , ( 0.48 , 0.26 ) ) ( ( 0.34 , 0.66 ) , ( 0.25 , 0.53 ) ) ( ( 0.78 , 0.59 ) , ( 0.61 , 0.49 ) )
u 4 ( ( 0.95 , 0.11 ) , ( 0.80 , 0.10 ) ) ( ( 0.99 , 0.21 ) , ( 0.88 , 0.08 ) ) ( ( 0.86 , 0.35 ) , ( 0.75 , 0.24 ) )
Table 8. LDF-relation P D from Q 2 to Q 3 .
Table 8. LDF-relation P D from Q 2 to Q 3 .
P D p 1 p 2 p 3
l 1 ( ( 0.86 , 0.50 ) , ( 0.70 , 0.25 ) ) ( ( 0.89 , 0.42 ) , ( 0.75 , 0.20 ) ) ( ( 0.75 , 0.31 ) , ( 0.65 , 0.20 ) )
l 2 ( ( 0.65 , 0.42 ) , ( 0.60 , 0.18 ) ) ( ( 0.78 , 0.32 ) , ( 0.62 , 0.17 ) ) ( ( 0.75 , 0.27 ) , ( 0.65 , 0.15 ) )
l 3 ( ( 0.70 , 0.40 ) , ( 0.41 , 0.28 ) ) ( ( 0.86 , 0.21 ) , ( 0.48 , 0.21 ) ) ( ( 0.89 , 0.10 ) , ( 0.56 , 0.10 ) )
Table 9. Composition LDF-relation R D ^ P D from Q 1 to Q 3 .
Table 9. Composition LDF-relation R D ^ P D from Q 1 to Q 3 .
R D ^ P D p 1 p 2 p 3
u 1 ( ( 0.86 , 0.40 ) , ( 0.70 , 0.25 ) ) ( ( 0.86 , 0.35 ) , ( 0.75 , 0.24 ) ) ( ( 0.78 , 0.34 ) , ( 0.65 , 0.24 ) )
u 2 ( ( 0.75 , 0.41 ) , ( 0.60 , 0.25 ) ) ( ( 0.75 , 0.41 ) , ( 0.60 , 0.24 ) ) ( ( 0.75 , 0.34 ) , ( 0.60 , 0.24 ) )
u 3 ( ( 0.70 , 0.50 ) , ( 0.48 , 0.26 ) ) ( ( 0.78 , 0.44 ) , ( 0.48 , 0.26 ) ) ( ( 0.78 , 0.44 ) , ( 0.56 , 0.26 ) )
u 4 ( ( 0.86 , 0.40 ) , ( 0.70 , 0.18 ) ) ( ( 0.89 , 0.32 ) , ( 0.75 , 0.17 ) ) ( ( 0.86 , 0.27 ) , ( 0.65 , 0.15 ) )
Table 10. Hesitation degrees η i k = 1 ( γ i k θ i k M + γ i k θ i k N ) .
Table 10. Hesitation degrees η i k = 1 ( γ i k θ i k M + γ i k θ i k N ) .
η ik p 1 p 2 p 3
u 1 0.298 0.271 0.4114
u 2 0.4475 0.4516 0.4684
u 3 0.534 0.5112 0.4488
u 4 0.326 0.2781 0.3951
Table 11. Association grades with A ¨ i k = θ i k M θ i k N η i k .
Table 11. Association grades with A ¨ i k = θ i k M θ i k N η i k .
A ¨ ik p 1 p 2 p 3
u 1 0.7408 0.76515 0.640124
u 2 0.566525 0.564844 0.573904
u 3 0.433 0.555072 0.582528
u 4 0.7296 0.80104 0.75335
Table 12. Score values.
Table 12. Score values.
S ik p 1 p 2 p 3
u 1 0.455 0.51 0.425
u 2 0.345 0.35 0.385
u 3 0.21 0.28 0.32
u 4 0.49 0.575 0.545
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ayub, S.; Shabir, M.; Riaz, M.; Aslam, M.; Chinram, R. Linear Diophantine Fuzzy Relations and Their Algebraic Properties with Decision Making. Symmetry 2021, 13, 945. https://doi.org/10.3390/sym13060945

AMA Style

Ayub S, Shabir M, Riaz M, Aslam M, Chinram R. Linear Diophantine Fuzzy Relations and Their Algebraic Properties with Decision Making. Symmetry. 2021; 13(6):945. https://doi.org/10.3390/sym13060945

Chicago/Turabian Style

Ayub, Saba, Muhammad Shabir, Muhammad Riaz, Muhammad Aslam, and Ronnason Chinram. 2021. "Linear Diophantine Fuzzy Relations and Their Algebraic Properties with Decision Making" Symmetry 13, no. 6: 945. https://doi.org/10.3390/sym13060945

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

Article Metrics

Back to TopTop