Next Article in Journal
Three Edge-Disjoint Hamiltonian Cycles in Folded Locally Twisted Cubes and Folded Crossed Cubes with Applications to All-to-All Broadcasting
Previous Article in Journal
Sensorless Speed Control for SPMSM Using a Nonlinear Observer and Enhanced Super-Twisting ADRC
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Investigation of Linear Diophantine Fuzzy Nonlinear Fractional Programming Problems

1
Department of Mathematics and Statistics, Riphah International University, Sector I-14, Islamabad 44000, Pakistan
2
Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB T6G 2R3, Canada
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(15), 3383; https://doi.org/10.3390/math11153383
Submission received: 12 May 2023 / Revised: 19 July 2023 / Accepted: 27 July 2023 / Published: 2 August 2023

Abstract

:
The linear Diophantine fuzzy set notion is the main foundation of the interactive method of tackling nonlinear fractional programming problems that is presented in this research. When the decision maker (DM) defines the degree α of α level sets, the max-min problem is solved in this interactive technique using Zimmermann’s min operator method. By using the updating technique of degree α , we can solve DM from the set of α -cut optimal solutions based on the membership function and non-membership function. Fuzzy numbers based on α -cut analysis bestowing the degree α given by DM can first be used to classify fuzzy Diophantine inside the coefficients. After this, a crisp multi-objective non-linear fractional programming problem (MONLFPP) is created from a Diophantine fuzzy nonlinear programming problem (DFNLFPP). Additionally, the MONLFPP can be reduced to a single-objective nonlinear programming problem (NLPP) using the idea of fuzzy mathematical programming, which can then be solved using any suitable NLPP algorithm. The suggested approach is demonstrated using a numerical example.

1. Introduction

Decision-makers encounter numerous issues in everyday life while deciding between linear and nonlinear fractional programming problems (FPPs). The aims are typically conflicting, incommensurable, and fuzzy; therefore, many factors of uncertainty’s ambiguous character should be taken into consideration when formulating the issue. For the objective functions and constraints, many fuzzy parameters have been used. With the help of numerous studies, fuzzy nonlinear fractional programming problems (FNLFPP) are divided into two categories: nonlinear fractional programming problems (NLFPP) with fuzzy goals and NLFPP with fuzzy coefficients. These fuzzy parameters are described as fuzzy numbers, introduced by Sakawa et al. [1,2,3,4].
The idea of fuzzy set was developed initially by Zadeh [5]. Bellman and Zadeh [6] also provided a definition for a fuzzy decision. According to the theory of fuzzy sets, an element’s membership in a fuzzy set is represented by a single value between zero and one. However, because there may be some hesitation degree, it is not necessarily true that the degree of non-membership of an element in a fuzzy set is equal to 1 minus the membership degree. Because it provides a generalization of fuzzy sets, the theory of intuitionistic fuzzy set (IFS) is anticipated to play a significant role in modern mathematics.
The intuitionistic fuzzy set was developed by Atanassov [7,8,9], who also expanded upon the idea of a fuzzy set. Since it includes the degree of belongingness, the degree of non-belongingness, and the hesitation margin introduced by Atanassov [10], the knowledge and semantic representation of IFS become more expressive, innovative, and appropriate. IFS are fascinating and helpful when describing an issue using a linguistic variable in terms of a membership function that appears too rough, according to Szmidt and Kacprzyk [11,12]
Hezibah [13] suggested a Taylor series method to solve the intuitionistic fuzzy multi-objective nonlinear programming problem (IFMONLPP). In an intuitionistic fuzzy setting, Singh and Yadav [14] presented a method for the handling of nonlinear programming issues. A method to resolve the intuitionistic fuzzy linear fractional programming problem was also devised by Singh and Yadav [15] (IFLFPP). The Sperm Motility algorithm was studied by Raouf et al. [16] as a solution to fractional programming problems under uncertainty (FPPU). An interactive intuitionistic fuzzy nonlinear fractional programming problem was introduced by Amer [17].
The idea of “ α -cut optimality” is proposed in this study based on “ α -level sets of fuzzy numbers” to address nonlinear fractional programming issues with fuzzy parameters classified by fuzzy numbers. Then, as a generalization of the findings in Sakawa et al. [1,2,3,4], an interactive decision-making method is described that may quickly determine the decision-maker’s most satisfactory option from among a group of α -cut optimal solutions. Additionally, the objective function’s coefficients are used to measure a linear Diophantine fuzzy nonlinear fractional programming problem (LDFNLFPP), and the constraints are a set of triangular linear Diophantine fuzzy numbers (LDFNs). A deterministic multi-objective nonlinear fractional programming problem (MONLFPP) is created from the given LDFNLFPP. Next, the MONLFPP is converted into a single-objective NLPP utilizing a fuzzy mathematical programming approach [18,19,20]. Finally, a numerical example is provided to show the effectiveness of this approach.
In [1,13,14,17,21,22,23,24,25], (multi-objective) nonlinear programming problems have been studied under the environment of fuzzy sets and intuitionistic fuzzy sets. However, here, we study the nonlinear fractional programming problems in terms of more generalized fuzzy sets called linear Diophantine fuzzy sets.

2. Preliminaries and Basic Definitions

This section is devoted to reviewing some fundamental ideas that are crucial in understanding the dominant model.
Definition 1 
([5]). If X is a collection of objects denoted generically by X, then a fuzzy set ℵ in X is a set of ordered pairs: { ( ϑ , μ ( ϑ ) ) | ϑ X } ,   μ is called the membership function of ℵ, which maps X to [ 0 , 1 ] , and μ ( ϑ ) is called the membership degree of ϑ in ℵ.
Definition 2 
([26]). Let ℵ be a fuzzy set on universal set X. Then, ℵ is called convex FS if r , s X and λ [ 0 , 1 ] , and we have
μ ( λ r + ( 1 λ ) s ) min { μ ( r ) , μ ( s ) } .
Definition 3 
([5]). A fuzzy set ℵ is said to be normalized if h ( ) = 1 .
Definition 4 
([26]). An α-level set of an FS is defined as
α = { ϑ X : μ ( ϑ ) α } for each α ( 0 , 1 ] .
Definition 5 
([26]). A fuzzy subset ℵ defined on a set R (of real numbers) is said to be a fuzzy number (FN) if ℵ satisfies the following axioms:
(a) ℵ is continuous: μ ( t ) is a continuous function from R [ 0 , 1 ] .
(b) ℵ is normalized: there exists t R such that μ ( t ) = 1 .
(c) Convexity of ℵ, i.e., t , u , w R , if t u w then μ ( u ) min { μ ( t ) , μ ( w ) } .
(d) Boundedness of support, i.e., S R and t R , if | t | S then μ ( t ) = 0 .
We denote the set of all FNs by F n s ( R ) .
Definition 6 
([27]). Let X be the universe. An LDFS R on X is defined as follows
R = ϑ , R τ ( ϑ ) , ξ R ν ( ϑ ) , α ( ϑ ) , β ( ϑ ) : ϑ X
where R τ ( ϑ ) , ξ R ν ( ϑ ) , α ( ϑ ) , β ( ϑ ) [ 0 , 1 ] such that
0 α ( ϑ ) R τ ( ϑ ) + β ( ϑ ) ξ R ν ( ϑ ) 1 , ϑ X
0 α ( ϑ ) + β ( ϑ ) 1 .
and the hesitation part can be written as
N π R = 1 ( α ( ϑ ) R τ ( ϑ ) + β ( ϑ ) ξ R ν ( ϑ ) )
where N is the reference parameter.
We write in short R = R τ , ξ R ν , α , β or R = R τ , ξ R ν , α , β for
R = ϑ , R τ ( ϑ ) , ξ R ν ( ϑ ) , α ( ϑ ) , β ( ϑ ) : ϑ X .
Definition 7 
([27]). An LDFS R = ϑ , R τ ( ϑ ) , ξ R ν ( ϑ ) , α ( ϑ ) , β ( ϑ ) : ϑ X is called a linear Diophantine fuzzy number (LDFN) if the following hold:
(i) There exists m R such that R τ ( ϑ ) = α ( ϑ ) = 1 and ξ R ν ( ϑ ) = β ( ϑ ) = 0 , where m is the mean value of R .
(ii) ( R τ and α) and ( ξ R ν and β) are piecewise continuous functions from R to the closed interval [ 0 , 1 ] and 0 α ( ϑ ) R τ ( ϑ ) + β ( ϑ ) ξ R ν ( ϑ ) 1 , ϑ X , where
R τ ( x ) = g 1 ( x ) m ϑ 1 x < m h 1 ( x ) ϑ 3 x m + ϑ 3 0 otherwise , ξ R ν ( x ) = g 2 ( x ) m ϑ 2 x m ; 0 g 1 ( x ) + g 2 ( x ) 1 h 2 ( x ) m x m + ϑ 3 ; 0 h 1 ( x ) + h 2 ( x ) 1 0 otherwise ,
and
α ( x ) = g 1 ( x ) m ϑ 1 x < m h 1 ( x ) ϑ 3 x m + ϑ 3 0 otherwise , β ( x ) = g 2 ( x ) m ϑ 2 x m ; 0 g 1 ( x ) + g 2 ( x ) 1 h 2 ( x ) m x m + ϑ 3 ; 0 h 1 ( x ) + h 2 ( x ) 1 0 otherwise .
Definition 8 
([28]). Let R be an LDFS on R with the following membership functions ( R τ and α) and non-membership functions ( ξ R ν and β)
R τ ( x ) = x ϑ 1 ϑ 3 ϑ 1 ϑ 1 x ϑ 3 ϑ 5 x ϑ 5 ϑ 3 ϑ 3 x ϑ 5 0 otherwise , ξ R ν ( x ) = ϑ 3 x ϑ 3 ϑ 2 ϑ 2 x ϑ 3 x ϑ 3 ϑ 4 ϑ 3 ϑ 3 x ϑ 4 0 otherwise ,
and
α ( x ) = x ϑ 2 ϑ 3 ϑ 2 ϑ 2 x ϑ 3 ϑ 4 x ϑ 4 ϑ 3 ϑ 3 x ϑ 4 0 otherwise , β ( x ) = ϑ 3 x ϑ 3 ϑ 1 ϑ 1 x ϑ 3 x ϑ 3 ϑ 5 ϑ 3 ϑ 3 x ϑ 5 0 otherwise .
Throughout the paper, we consider only a triangular LDFN of type 1 and we refer to this type as triangular LDFN (TLDFN). This TLDFN is denoted by
R T L D F N = ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) .
Definition 9 
([28]). A TLDFN R T L D F N = ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) is said to be positive if and only if ϑ 1 0 and ϑ 1 0 .
Definition 10 
([28]). Two TLDFNs R T L D F N = ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) and R T L D F N = ( δ 1 , δ 2 , δ 3 , δ 4 , δ 5 ) ( δ 1 , δ 2 , δ 3 , δ 4 , δ 5 ) are said to be equal if and only if ϑ 1 = δ 1 ,   ϑ 2 = δ 2 ,   ϑ 3 = δ 3 ,   ϑ 4 = δ 4 ,   ϑ 5 = δ 5 ,   ϑ 1 = δ 1 ,   ϑ 2 = δ 2 ,   ϑ 4 = δ 4 and ϑ 5 = δ 5 .
We now define the arithmetic operations on TLDFNs using the concept of interval arithmetic.
Definition 11 
([28]). Consider two positive TLDFNs R T L D F N = ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) ( ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 ) and R T L D F N = ( δ 1 , δ 2 , δ 3 , δ 4 , δ 5 ) ( δ 1 , δ 2 , δ 3 , δ 4 , δ 5 ) , then
(i) R T L D F N + R T L D F N = ( ϑ 1 + δ 1 , ϑ 2 + δ 2 , ϑ 3 + δ 3 , ϑ 4 + δ 4 , ϑ 5 + δ 5 ) ( ϑ 1 + δ 1 , ϑ 2 + δ 2 , ϑ 3 + δ 3 , ϑ 4 + δ 4 , ϑ 5 + δ 5 )
(ii) R T L D F N R T L D F N = ( ϑ 1 δ 5 , ϑ 2 δ 4 , ϑ 3 δ 3 , ϑ 4 δ 2 , ϑ 5 δ 1 ) ( ϑ 1 δ 5 , ϑ 2 δ 4 , ϑ 3 δ 3 , ϑ 4 δ 2 , ϑ 5 δ 1 ) ;
(iii) R T L D F N × R T L D F N = ( ϑ 1 δ 1 , ϑ 2 δ 2 , ϑ 3 δ 3 , ϑ 4 δ 4 , ϑ 5 δ 5 ) ( ϑ 1 δ 1 , ϑ 2 δ 2 , ϑ 3 δ 3 , ϑ 4 δ 4 , ϑ 5 δ 5 ) ;
(iv) R T L D F N ÷ R T L D F N = ϑ 1 δ 5 , ϑ 2 δ 4 , ϑ 3 δ 3 , ϑ 4 δ 2 , ϑ 5 δ 1 ϑ 1 δ 5 , ϑ 2 δ 4 , ϑ 3 δ 3 , ϑ 4 δ 2 , ϑ 5 δ 1 ;
(v) k × R T L D F N = ( k ϑ 1 , k ϑ 2 , k ϑ 3 , k ϑ 4 , k ϑ 5 ) ( k ϑ 1 , k ϑ 2 , k ϑ 3 , k ϑ 4 , k ϑ 5 ) i f k > 0 ( k ϑ 5 , k ϑ 4 , k ϑ 3 , k ϑ 2 , k ϑ 1 ) ( k ϑ 5 , k ϑ 4 , k ϑ 3 , k ϑ 2 , k ϑ 1 ) i f k < 0 .

3. Problem Formulation and Solution Concepts

The general mathematical model of LDFNLFPP can be written as follows:
Max Z ( x ˜ L ) = f ( x , A ˜ L ) g ( x , B ˜ L ) , subject to h j 1 ( x , C ˜ L ) D ˜ j 1 L , j 1 = 1 , 2 , , m 1 , h j 2 ( x , E ˜ L ) j ˜ j 2 L , j 2 = m 1 + 1 , , m 2 , h j 3 ( x , I ˜ L ) = L ˜ j 3 L , j 3 = m 2 + 1 , , m , x 0 , g ( x , B ˜ L ) 0 ,
where x is n-dimensional decision variable vector x = ( x 1 , x 2 , , x n ) , f ( x , A ˜ L ) and g ( x , B ˜ L ) 0 , h j 1 ( x , C ˜ L ) , h j 2 ( x , E ˜ L ) and h j 3 ( x , I ˜ L ) , respectively, are supposed to be real valued continuous nonlinear functions with LDFNs. The parameters A ˜ L , B ˜ L , C ˜ L , D ˜ L , E ˜ L , j ˜ L , I ˜ L and L ˜ L are considered TLDFNs.
Similarly,
Max Z ( x ˜ L ) = f ( x , A ˜ L ) g ( x , B ˜ L ) , subject to h j 1 ( x , C ˜ L ) D ˜ j 1 L , j 1 = 1 , 2 , , m 1 , h j 2 ( x , E ˜ L ) j ˜ j 2 L , j 2 = m 1 + 1 , , m 2 , h j 3 ( x , I ˜ L ) = L ˜ j 3 L , j 3 = m 2 + 1 , , m , x 0 , g ( x , B ˜ L ) 0 ,
where x is n-dimensional decision variable vector x = ( x 1 , x 2 , , x n ) , f ( x , A ˜ L ) and g ( x , B ˜ L ) 0 , h j 1 ( x , C ˜ L ) , h j 2 ( x , E ˜ L ) and h j 3 ( x , I ˜ L ) , respectively, are supposed to be real valued continuous nonlinear functions with LDFNs. The parameters A ˜ L , B ˜ L , C ˜ L , D ˜ L , E ˜ L , j ˜ L , I ˜ L and L ˜ L are considered TLDFNs.
In this section, the methodology for the solution of an interactive LDFNLFPP is expanded where all coefficients are TLDFNs. This problem varies from the crisp problem via parametric values. The parameters are known precisely in crisp or non-fuzzy models. Consequently, for a precise degree of α , as in Definition 4, which is described by the DM, problems ( 8 ) and ( 9 ) can be redeveloped as the following linear Diophantine non-fuzzy α -nonlinear fractional programming problem ( α -LDNLFPP) with linear Diophantine non-fuzzy numbers ( α -LDFNs):
Max θ ( x ) = F ( x , A ) G ( x , B ) , subject to H j 1 ( x , C ) D j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( x , E ) J j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( x , I ) = L j 3 , j 3 = m 2 + 1 , , m , x 0 , G ( x , b ) 0 , J ˜ L ( J ) α J ,
where J is any coefficient and the parameters A , B , C , D , E , J , I and L, respectively, are assumed to be non-fuzzy numbers defined as ( θ 1 , θ 2 , θ 3 , θ 4 , θ 5 ) .
Max θ ( x ) = F ( x , A ) G ( x , B ) , subject to H j 1 ( x , C ) D j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( x , E ) D j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( x , I ) = D j 3 , j 3 = m 2 + 1 , , m , x 0 , g ( x , b ) 0 , α J ˜ L ( J ) α J ,
where J is any coefficient and the parameters A , B , C , D , E , J , I and L , respectively, are assumed to be non-fuzzy numbers defined as ( θ 1 , θ 2 , θ 3 , θ 4 , θ 5 ) .

4. Solution Procedure for an Interactive LDFNLFPP

By using the division in Definition ( 12 ) , problems ( 10 ) and ( 11 ) reduce to an equivalent linear Diophantine multi-objective nonlinear fractional programming problem (LDMONLFPP) as follows:
Max θ 1 ( x ) = F ( x , θ 1 ) G ( x , δ 5 ) , Max θ 2 ( x ) = F ( x , θ 2 ) G ( x , δ 4 ) , Max θ 3 ( x ) = F ( x , θ 3 ) G ( x , δ 3 ) , Max θ 4 ( x ) = F ( x , θ 4 ) G ( x , δ 2 ) , Max θ 5 ( x ) = F ( x , θ 5 ) G ( x , δ 1 ) subject to H j 1 ( x , C ) D j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( x , E ) J j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( x , I ) = L j 3 , j 3 = m 2 + 1 , , m , x 0 ,
and
Max θ 1 ( x ) = F ( x , θ 1 ) G ( x , δ 5 ) , Max θ 2 ( x ) = F ( x , θ 2 ) G ( x , δ 4 ) , Max θ 3 ( x ) = F ( x , θ 3 ) G ( x , δ 3 ) , Max θ 4 ( x ) = F ( x , θ 4 ) G ( x , δ 2 ) , Max θ 5 ( x ) = F ( x , θ 5 ) G ( x , δ 1 ) , subject to H j 1 ( x , C ) D j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( x , E ) D j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( x , I ) = D j 3 , j 3 = m 2 + 1 , , m , x 0 ,
Let us consider ( θ 1 ( x ) , θ 2 ( x ) , θ 3 ( x ) , θ 4 ( x ) , θ 5 ( x ) ) ( θ 1 ( x ) , θ 2 ( x ) , θ 3 ( x ) , θ 4 ( x ) , θ 5 ( x ) ) 0 as feasible regions of problems ( 12 ) and ( 13 ) . Hence, using Charnes and Cooper’s transformation, the above model LDMONLFPP can be transformed into a linear Diophantine multi-objective nonlinear programming problem (LDMONLPP) by taking y = t x , t > 0 , as follows:
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , s . t G ( y / t , δ 5 ) 1 , G ( y / t , δ 4 ) 1 , G ( y / t , δ 3 ) 1 , G ( y / t , δ 2 ) 1 , G ( y / t , δ 1 ) 1 , H j 1 ( y / t , c 1 ) ( d 1 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 2 ) ( d 2 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 3 ) ( d 3 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 4 ) ( d 4 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 5 ) ( d 5 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 1 ) ( J 1 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 2 ) ( J 2 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 3 ) ( J 3 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 4 ) ( J 4 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 5 ) ( J 5 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 1 ) = ( L 1 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 2 ) = ( L 2 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 3 ) = ( L 3 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 4 ) = ( L 4 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 5 ) = ( L 5 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 .
Similarly,
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , s . t G ( y / t , δ 5 ) 1 , G ( y / t , δ 4 ) 1 , G ( y / t , δ 3 ) 1 , G ( y / t , δ 2 ) 1 , G ( y / t , δ 1 ) 1 , H j 1 ( y / t , c 1 ) ( d 1 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 2 ) ( d 2 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 3 ) ( d 3 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 4 ) ( d 4 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 1 ( y / t , c 5 ) ( d 5 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 1 ) ( J 1 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 2 ) ( J 2 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 3 ) ( J 3 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 4 ) ( J 4 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 2 ( y / t , e 5 ) ( J 5 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 1 ) = ( L 1 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 2 ) = ( L 2 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 3 ) = ( L 3 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 4 ) = ( L 4 ) j 3 , j 3 = m 2 + 1 , , m , H j 3 ( y / t , i 5 ) = ( L 5 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 .
Now, to solve problems ( 14 ) and ( 15 ) , the following algorithm can be developed.
Step 1: Use the method proposed by Amer [17]; we expand this method to decompose problems ( 14 ) and ( 15 ) into nine sub-problems, MONLPPs, according to TLDFNs as follows:
(P 1 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 5 ) 1 , H j 1 ( y / t , c 1 ) ( d 1 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 1 ) ( J 1 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 1 ) = ( L 1 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 2 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 4 ) 1 , H j 1 ( y / t , c 2 ) ( d 2 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 2 ) ( J 2 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 2 ) = ( L 2 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 3 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 3 ) 1 , H j 1 ( y / t , c 3 ) ( d 3 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 3 ) ( J 3 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 3 ) = ( L 3 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 4 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 2 ) 1 , H j 1 ( y / t , c 4 ) ( d 4 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 4 ) ( J 4 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 4 ) = ( L 4 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 5 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 1 ) 1 , H j 1 ( y / t , c 5 ) ( d 5 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 5 ) ( J 5 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 5 ) = ( L 5 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 6 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 5 ) 1 , H j 1 ( y / t , c 1 ) ( d 1 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 1 ) ( J 1 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 1 ) = ( L 1 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 7 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 4 ) 1 , H j 1 ( y / t , c 2 ) ( d 2 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 2 ) ( J 2 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 2 ) = ( L 2 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
(P 8 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 2 ) 1 , H j 1 ( y / t , c 4 ) ( d 4 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 4 ) ( J 4 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 4 ) = ( L 4 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
and
(P 9 ) :
Max θ 1 ( y / t ) = F ( y / t , θ 1 ) , Max θ 2 ( y / t ) = F ( y / t , θ 2 ) , Max θ 3 ( y / t ) = F ( y / t , θ 3 ) , Max θ 4 ( y / t ) = F ( y / t , θ 4 ) , Max θ 5 ( y / t ) = F ( y / t , θ 5 ) , subject to G ( y / t , δ 1 ) 1 , H j 1 ( y / t , c 5 ) ( d 5 ) j 1 , j 1 = 1 , 2 , , m 1 , H j 2 ( y / t , e 5 ) ( J 5 ) j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( y / t , i 5 ) = ( L 5 ) j 3 , j 3 = m 2 + 1 , , m , y 0 , t > 0 ,
Step 2: Solve models P i , i = 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 as individual objective functions under the given constraints.
Step 3: Find the optimal points of all the sub-problems and let the total solution set be X = i = 1 9 X i .
Step 4: Find the value of each objective function θ i ( y / t ) , i = 1 , , 5 and θ i ( y / t ) , i = 1 , , 4 at each point obtained in step 3.
Step 5: Find the upper and lower bounds U , U and L , L , respectively, for objective functions
L = min { θ i ( y / t ) : x X , i = 1 , , 5 } and U = max { θ i ( y / t ) : x X , i = 1 , , 5 } L = min { θ i ( y / t ) : x X , i = 1 , , 4 } and U = max { θ i ( y / t ) : x X , i = 1 , , 4 }
Step 6: Then, IMONLFPPs (12) and (13) are equivalent to the following fuzzy model using Zimmermann’s technique.
Find x
such that θ ( x ) U H j 1 ( x , C ) D j 1 , j 1 = 1 , , m 1 , H j 2 ( x , E ) D j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( x , I ) D j 3 , j 3 = m 2 + 1 , , m , x 0 ,
and find x
such that θ ( x ) U H j 1 ( x , C ) D j 1 , j 1 = 1 , , m 1 , H j 2 ( x , E ) D j 2 , j 2 = m 1 + 1 , , m 2 , H j 3 ( x , I ) D j 3 , j 3 = m 2 + 1 , , m , x 0 ,
where , ≥ and ≈ are fuzzy inequality and fuzzy equality, respectively. Fuzzy in this context means that the DM’s specified rigorous equality and inequality are subject to some tolerance.
Since the objective is to maximize it, the DM becomes more satisfied as the objective value approaches the upper bound. Let U and α U stand for the degree of attainability of the upper bound U of the objective function θ ( x ) and L stand for the least sustainable level of the objective value by the DM.
Step 7: Take the membership functions as follows:
U ( θ ( x ) ) = 0 if θ ( x ) < L , ( θ ( x ) ) t L t U t L t if L θ ( x ) U , 1 if θ ( x ) > U .
Let D , J and L , respectively, represent the degree of achievability of the available constraints; they are defined by the following.
For ( J 1 = 1 , 2 , , m 1 ) ,
D ( H j 1 ( x , C ) ) = 0 if H j 1 ( x , C ) < d j 1 , ( d j 1 r ) t ( H j 1 ( x , C ) ) t ( d j 1 r ) t ( d j 1 ) t if d j 1 H j 1 ( x , C ) d j 1 r , 0 if H j 1 ( x , C ) > d j 1 r .
For ( J 2 = m 1 + 1 , , m 2 ) ,
J ( H j 2 ( x , E ) ) = 0 if H j 2 ( x , E ) < j j 2 , ( H j 2 ( x , E ) ) t ( j j 2 l ) t ( j j 2 ) t ( j j 2 L ) t if j j 2 L H j 2 ( x , E ) j j 2 , 1 if H j 2 ( x , E ) > j j 2 .
For ( J 3 = m 2 + 1 , , m ) ,
J ( H j 3 ( x , I ) ) = 0 if H j 3 ( x , I ) < I j 3 , ( H j 3 ( x , I ) ) t ( l j 3 l ) t ( l j 3 ) t ( l j 3 l ) t if l j 3 l H j 3 ( x , I ) l j 3 , ( l j 3 r ) t ( H j 3 ( x , I ) ) t ( l j 3 r ) t ( l j 3 ) t if l j 3 H j 3 ( x , I ) l j 3 r , 0 if H j 3 ( x , I ) > l j 3
where t > 0 is specified by the DM.
Similarly, for the membership fuction α ,
α U ( θ ( x ) ) = 0 if θ ( x ) < L , ( θ ( x ) ) t L t U t L t if L θ ( x ) U , 1 if θ ( x ) > U .
Let α D , α J and α L , respectively, represent the degree of achievability of the available constraints; they are defined by the following.
For ( J 1 = 1 , 2 , , m 1 ) ,
α D ( H j 1 ( x , C ) ) = 0 if H j 1 ( x , C ) < d j 1 , ( d j 1 r ) t ( H j 1 ( x , C ) ) t ( d j 1 r ) t ( d j 1 ) t if d j 1 H j 1 ( x , C ) d j 1 r , 0 if H j 1 ( x , C ) > d j 1 r .
For ( J 2 = m 1 + 1 , , m 2 ) ,
α J ( H j 2 ( x , E ) ) = 0 if H j 2 ( x , E ) < j j 2 , ( H j 2 ( x , E ) ) t ( j j 2 r ) t ( j j 2 ) t ( j j 2 L ) t if j j 2 L H j 2 ( x , E ) j j 2 , 1 if H j 2 ( x , E ) > j j 2 .
For ( J 3 = m 2 + 1 , , m ) ,
α J ( H j 3 ( x , I ) ) = 0 if H j 3 ( x , I ) < I j 3 , ( H j 3 ( x , I ) ) t ( l j 3 r ) t ( l j 3 ) t ( l j 3 l ) t if l j 3 l H j 3 ( x , I ) l j 3 , ( l j 3 r ) t ( H j 3 ( x , I ) ) t ( l j 3 r ) t ( l j 3 ) t if l j 3 H j 3 ( x , I ) l j 3 r , 0 if H j 3 ( x , I ) > l j 3 .
The LDFNLFPP can be summarized as the question of how to formulate a sound strategy that will satisfy the DM to the greatest extent given a set of fuzzy objectives and fuzzy constraints. Between fuzzy objectives and fuzzy constraints, there should be the highest possible degree of balance.
Let
λ = min ( U ( θ ( x ) , D ( H j 1 ( x , C ) ) , j 1 = 1 , 2 , , m 1 , J ( H j 2 ( x , E ) ) , j 2 = m 1 + 1 , 2 , , m 2 , L ( H j 3 ( x , I ) ) , j 3 = m 2 + 1 , 2 , , m ,
and
λ = min ( α U ( θ ( x ) , α D ( H j 1 ( x , C ) ) , j 1 = 1 , 2 , , m 1 , α J ( H j 2 ( x , E ) ) , j 2 = m 1 + 1 , 2 , , m 2 , α L ( H j 3 ( x , I ) ) , j 3 = m 2 + 1 , 2 , , m ,
where λ and λ are the overall satisfaction levels for the DM.
Step 8: Ask the DM to select t; then, transform models (16) and (17) into the crisp model, which can easily be solved via suitable crisp NLPP methods as follows:
Max λ subject to U ( θ ( x ) λ D ( H j 1 ( x , C ) λ , j 1 = 1 , , m 1 , J ( H j 2 ( x , E ) λ , j 2 = m 1 + 1 , , m 2 , L ( H j 3 ( x , I ) λ , j 3 = m 2 + 1 , , m , x 0 .
or
Max λ subject to ( θ ( x ) ) t L t λ U t L t ( d j 1 r ) t ( H j 1 ( x , C ) ) t λ ( ( d j 1 r ) t ( d j 1 ) t ) , j 1 = 1 , , m 1 , ( H j 2 ( x , E ) ) t ( j j 2 l ) t λ ( ( j j 2 ) t ( j j 2 L ) t ) , j 2 = m 1 + 1 , , m 2 , ( H j 3 ( x , I ) ) t ( l j 3 l ) t λ ( ( l j 3 ) t ( l j 3 l ) t ) , j 3 = m 2 + 1 , , m , ( l j 3 r ) t ( H j 3 ( x , I ) ) t λ ( ( l j 3 r ) t ( l j 3 ) t ) , j 3 = m 2 + 1 , , m , x 0 .
Similarly,
Max λ subject to α U ( θ ( x ) λ α D ( H j 1 ( x , C ) λ , j 1 = 1 , , m 1 , α J ( H j 2 ( x , E ) λ , j 2 = m 1 + 1 , , m 2 , α L ( H j 3 ( x , I ) λ , j 3 = m 2 + 1 , , m , x 0 .
or
Max λ subject to ( θ ( x ) ) t L t λ U t L t ( d j 1 r ) t ( H j 1 ( x , C ) ) t λ ( ( d j 1 r ) t ( d j 1 ) t ) , j 1 = 1 , , m 1 , ( H j 2 ( x , E ) ) t ( j j 2 l ) t λ ( ( j j 2 ) t ( j j 2 L ) t ) , j 2 = m 1 + 1 , , m 2 , ( H j 3 ( x , I ) ) t ( l j 3 l ) t λ ( ( l j 3 ) t ( l j 3 l ) t ) , j 3 = m 2 + 1 , , m , ( l j 3 r ) t ( H j 3 ( x , I ) ) t λ ( ( l j 3 r ) t ( l j 3 ) t ) , j 3 = m 2 + 1 , , m , x 0 .

5. Numerical Example

Let us consider the following LDFNLFPP:
Max θ ( x ˜ L ) = 7 ˜ x 1 2 + 6 ˜ x 2 2 + 8 ˜ 7 ˜ x 1 2 + 8 ˜ x 2 2 + 5 ˜ subject to 9 ˜ x 1 + 3 ˜ x 2 28 ˜ 4 ˜ x 1 + 3 ˜ x 2 19 ˜ x 1 , x 2 0 .
where
7 ˜ = ( 5 , 6 , 7 , 8 , 9 ) ( 2 , 4 , 7 , 9 , 10 ) , 6 ˜ = ( 4 , 6 , 8 , 9 , 10 ) ( 3 , 4 , 8 , 11 , 12 ) , 8 ˜ = ( 8 , 9 , 10 , 11 , 12 ) ( 5 , 8 , 10 , 13 , 15 ) , 5 ˜ = ( 2 , 3 , 4 , 5 , 6 ) ( 1 , 2 , 4 , 6 , 8 ) , 9 ˜ = ( 1 , 2 , 3 , 4 , 5 ) ( 0 , 2 , 3 , 7 , 8 ) , 3 ˜ = ( 2 , 4 , 6 , 8 , 9 ) ( 1 , 3 , 6 , 9 , 10 ) , 4 ˜ = ( 6 , 7 , 8 , 9 , 10 ) ( 5 , 6 , 8 , 11 , 13 ) , 26 ˜ = ( 18 , 19 , 22 , 26 , 28 ) ( 17 , 18 , 22 , 27 , 30 ) , 19 ˜ = ( 19 , 20 , 23 , 27 , 29 ) ( 17 , 18 , 23 , 30 , 32 ) .
Taking
Max θ ( x ) = 7 ˜ x 1 2 + 6 ˜ x 2 2 + 8 ˜ 7 ˜ x 1 2 + 8 ˜ x 2 2 + 5 ˜ subject to 9 ˜ x 1 + 3 ˜ x 2 28 ˜ 4 ˜ x 1 + 3 ˜ x 2 19 ˜ x 1 , x 2 0 .
Suppose that the DM determines α = 0.5 [ 0 , 1 ] . The membership function (6) is used to convert an LDFN of the above problem (30) into its linear Diophantine non-fuzzy numbers ( α -LDFNs) referring to problem (10).
Let the LDFNs and α -LDFNs be given by the values listed in the Table 1 below.
Problem (30) is equivalent to the following LDMONLFPP:
Max θ 1 ( x ) = 6 x 1 2 + 6 x 2 2 + 9 8 x 1 2 + 11 x 2 2 + 5 , Max θ 2 ( x ) = 6.5 x 1 2 + 7 x 2 2 + 9.5 7.5 x 1 2 + 10.5 x 2 2 + 4.5 , Max θ 3 ( x ) = 7 x 1 2 + 8 x 2 2 + 10 7 x 1 2 + 10 x 2 2 + 4 , Max θ 4 ( x ) = 7.5 x 1 2 + 8.5 x 2 2 + 10.5 6.5 x 1 2 + 9.5 x 2 2 + 3.5 , Max θ 5 ( x ) = 8 x 1 2 + 9 x 2 2 + 11 6 x 1 2 + 9 x 2 2 + 3 , subject to 2 x 1 + 4 x 2 20 , 2.5 x 1 + 5 x 2 20.5 , 3 x 1 + 6 x 2 22 , 3.5 x 1 + 7 x 2 24 , 4 x 1 + 7.5 x 2 25 , 7 x 1 + 4 x 2 21 , 7.5 x 1 + 5 x 2 21.5 , 8 x 1 + 6 x 2 23 , 8.5 x 1 + 7 x 2 25 , 9 x 1 + 7.5 x 2 26 , x 1 , x 2 0 .
Using the transformation of Charnes and Cooper, problem (31) is equivalent to the following LDMONLPP:
Max θ 1 ( y / t ) = 6 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 2 ( y / t ) = 6.5 y 1 2 + 7 y 2 2 + 9.5 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 7.5 y 1 2 + 8.5 y 2 2 + 10.5 t 2 , Max θ 5 ( y / t ) = 8 y 1 2 + 9 y 2 2 + 11 t 2 , subject to 8 y 1 2 + 11 y 2 2 + 5 t 2 1 , 7.5 y 1 2 + 10.5 y 2 2 + 4.5 t 2 1 , 7 y 1 2 + 10 y 2 2 + 4 t 2 1 , 6.5 y 1 2 + 9.5 y 2 2 + 3.5 t 2 1 , 6 y 1 2 + 9 y 2 2 + 3 t 2 1 , 2 y 1 + 4 y 2 20 t 0 , 2.5 y 1 + 5 y 2 20.5 t 0 , 3 y 1 + 6 y 2 22 t 0 , 3.5 y 1 + 7 x 2 24 t 0 , 4 y 1 + 7.5 y 2 25 t 0 , 7 y 1 + 4 y 2 21 t 0 7.5 y 1 + 5 y 2 21.5 t 0 8 y 1 + 6 y 2 23 t 0 8.5 y 1 + 7 y 2 25 t 0 9 y 1 + 7.5 y 2 26 t 0 y 1 , y 2 0 , t > 0 .
The above problem (32) can be transformed into the following five sub-problems of MONLPPs:
P 1 :
Max θ 1 ( y / t ) = 6 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 2 ( y / t ) = 6.5 y 1 2 + 7 y 2 2 + 9.5 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 7.5 y 1 2 + 8.5 y 2 2 + 10.5 t 2 , Max θ 5 ( y / t ) = 8 y 1 2 + 9 y 2 2 + 11 t 2 , subject to 8 y 1 2 + 11 y 2 2 + 5 t 2 1 , 2 y 1 + 4 y 2 20 t 0 , 7 y 1 + 4 y 2 21 t 0 y 1 , y 2 0 , t > 0 .
P 2 :
Max θ 1 ( y / t ) = 6 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 2 ( y / t ) = 6.5 y 1 2 + 7 y 2 2 + 9.5 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 7.5 y 1 2 + 8.5 y 2 2 + 10.5 t 2 , Max θ 5 ( y / t ) = 8 y 1 2 + 9 y 2 2 + 11 t 2 , subject to 7.5 y 1 2 + 10.5 y 2 2 + 4.5 t 2 1 , 2.5 y 1 + 5 y 2 20.5 t 0 , 7.5 y 1 + 5 y 2 21.5 t 0 , y 1 , y 2 0 , t > 0 .
P 3 :
Max θ 1 ( y / t ) = 6 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 2 ( y / t ) = 6.5 y 1 2 + 7 y 2 2 + 9.5 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 7.5 y 1 2 + 8.5 y 2 2 + 10.5 t 2 , Max θ 5 ( y / t ) = 8 y 1 2 + 9 y 2 2 + 11 t 2 , subject to 7 y 1 2 + 10 y 2 2 + 4 t 2 1 , 3 y 1 + 6 y 2 22 t 0 , 8 y 1 + 6 y 2 23 t 0 y 1 , y 2 0 , t > 0 .
P 4 :
Max θ 1 ( y / t ) = 6 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 2 ( y / t ) = 6.5 y 1 2 + 7 y 2 2 + 9.5 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 7.5 y 1 2 + 8.5 y 2 2 + 10.5 t 2 , Max θ 5 ( y / t ) = 8 y 1 2 + 9 y 2 2 + 11 t 2 , subject to 6.5 y 1 2 + 9.5 y 2 2 + 3.5 t 2 1 , 3.5 y 1 + 7 x 2 24 t 0 , 8.5 y 1 + 7 y 2 25 t 0 y 1 , y 2 0 , t > 0 .
P 5 :
Max θ 1 ( y / t ) = 6 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 2 ( y / t ) = 6.5 y 1 2 + 7 y 2 2 + 9.5 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 7.5 y 1 2 + 8.5 y 2 2 + 10.5 t 2 , Max θ 5 ( y / t ) = 8 y 1 2 + 9 y 2 2 + 11 t 2 , subject to 6 y 1 2 + 9 y 2 2 + 3 t 2 1 , 4 y 1 + 7.5 y 2 25 t 0 9 y 1 + 7.5 y 2 26 t 0 y 1 , y 2 0 , t > 0 .
Solve models P i , i = 1 , 2 , 3 , 4 , 5 as single-objective NLPPs. The lower and upper bounds L and U, respectively, for the objective functions are L = 1.800000 and U = 3.666667 .
The LDMONLFPP (31) is equivalent to the following fuzzy model:
Find x subject to 8 x 1 2 + 9 x 2 2 + 11 6 x 1 2 + 9 x 2 2 + 3 3.666667 9 x 1 + 3 x 2 26 4 x 1 + 3 x 2 19 x 1 , x 2 0 .
Further, using the membership functions in (18)–(21), model (33) is equivalent to the following crisp model:
Max λ subject to ( 8 x 1 2 + 9 x 2 2 + 11 6 x 1 2 + 9 x 2 2 + 3 ) t ( 1.800000 ) t ( 3.666667 ) t ( 1.800000 ) t 9 x 1 + 3 x 2 26 4 x 1 + 3 x 2 19 x 1 , x 2 0 .
Using LINGO, taking t = 2 , the solution is ( x 1 , x 2 ) = ( 1.234568 , 1.234568 ) ,   θ ( x ) = ( 0.803613 , 0.941796 , 1.098683 , 1.251017 , 1.427196 ) with satisfaction level λ = 1 .
Now, suppose that the DM determines α = 0.5 [ 0 , 1 ] . The membership function (7) is used to convert an LDFN of the above problem (30) into its linear Diophantine non-fuzzy numbers ( α -LDFNs) referring to problem (11).
Now,
Max θ ( x ) = 7 ˜ x 1 2 + 6 ˜ x 2 2 + 8 ˜ 7 ˜ x 1 2 + 8 ˜ x 2 2 + 5 ˜ subject to 9 ˜ x 1 + 3 ˜ x 2 28 ˜ 4 ˜ x 1 + 3 ˜ x 2 19 ˜ x 1 , x 2 0 .
Let the LDFNs and α -LDFNs be given by the values listed in the Table 2 below.
Problem (30) is equivalent to the following LDMONLFPP:
Max θ 1 ( x ) = 4.5 x 1 2 + 5.5 x 2 2 + 7.5 8.5 x 1 2 + 12.5 x 2 2 + 6 , Max θ 2 ( x ) = 5.5 x 1 2 + 6 x 2 2 + 9 8 x 1 2 + 11.5 x 2 2 + 5 Max θ 3 ( x ) = 7 x 1 2 + 8 x 2 2 + 10 7 x 1 2 + 10 x 2 2 + 4 , Max θ 4 ( x ) = 8 x 1 2 + 9.5 x 2 2 + 11.5 5.5 x 1 2 + 9 x 2 2 + 3 , Max θ 5 ( x ) = 8.5 x 1 2 + 10 x 2 2 + 12.5 4.5 x 1 2 + 7.5 x 2 2 + 2.5 , subject to 1.5 x 1 + 3.5 x 2 19.5 , 2.5 x 1 + 4.5 x 2 20 , 3 x 1 + 6 x 2 22 , 5 x 1 + 7.5 x 2 24.5 , 5.5 x 1 + 8 x 2 26 , 6.5 x 1 + 3.5 x 2 20 , 7 x 1 + 4.5 x 2 20.5 , 8 x 1 + 6 x 2 23 , 9.5 x 1 + 7.5 x 2 26.5 , 10.5 x 1 + 8 x 2 27.5 , x 1 , x 2 0 .
Using the transformation of Charnes and Cooper, problem (34) is equivalent to the following LDMONLPP:
Max θ 1 ( y / t ) = 4.5 y 1 2 + 5.5 y 2 2 + 7.5 t 2 Max θ 2 ( y / t ) = 5.5 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 8 y 1 2 + 9.5 y 2 2 + 11.5 t 2 , Max θ 5 ( y / t ) = 8.5 y 1 2 + 10 y 2 2 + 12.5 t 2 , subject to 8.5 y 1 2 + 12.5 y 2 2 + 6 t 2 1 , 8 y 1 2 + 11.5 y 2 2 + 5 t 2 1 , 7 y 1 2 + 10 y 2 2 + 4 t 2 1 , 5.5 y 1 2 + 9 y 2 2 + 3 t 2 1 4.5 y 1 2 + 7.5 y 2 2 + 2.5 t 2 1 1.5 y 1 + 3.5 y 2 19.5 t 0 , 2.5 y 1 + 4 . 5 y 2 20 t 0 , 3 y 1 + 6 y 2 22 t 0 5 y 1 + 7.5 y 2 24.5 t 0 5.5 y 1 + 8 y 2 26 t 0 6.5 y 1 + 3.5 y 2 20 t 0 7 y 1 + 4.5 y 2 20.5 t 0 8 y 1 + 6 y 2 23 t 0 9.5 y 1 + 7.5 y 2 25 t 0 10.5 y 1 + 8 y 2 27.5 t 0 y 1 , y 2 0 , t > 0 .
The above problem (35) can be transformed into the following four sub-problems of MONLPPs:
P 1 :
Max θ 1 ( y / t ) = 4.5 y 1 2 + 5.5 y 2 2 + 7.5 t 2 Max θ 2 ( y / t ) = 5.5 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 8 y 1 2 + 9.5 y 2 2 + 11.5 t 2 , Max θ 5 ( y / t ) = 8.5 y 1 2 + 10 y 2 2 + 12.5 t 2 , subject to 8.5 y 1 2 + 12.5 y 2 2 + 6 t 2 1 , 1.5 y 1 + 3.5 y 2 19.5 t 0 , 6.5 y 1 + 3.5 y 2 20 t 0 y 1 , y 2 0 , t > 0 .
P 2 :
Max θ 1 ( y / t ) = 4.5 y 1 2 + 5.5 y 2 2 + 7.5 t 2 Max θ 2 ( y / t ) = 5.5 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 8 y 1 2 + 9.5 y 2 2 + 11.5 t 2 , Max θ 5 ( y / t ) = 8.5 y 1 2 + 10 y 2 2 + 12.5 t 2 , subject to 8 y 1 2 + 11.5 y 2 2 + 5 t 2 1 , 2.5 y 1 + 4 . 5 y 2 20 t 0 , 7 y 1 + 4.5 y 2 20.5 t 0 y 1 , y 2 0 , t > 0 .
P 4 :
Max θ 1 ( y / t ) = 4.5 y 1 2 + 5.5 y 2 2 + 7.5 t 2 Max θ 2 ( y / t ) = 5.5 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 8 y 1 2 + 9.5 y 2 2 + 11.5 t 2 , Max θ 5 ( y / t ) = 8.5 y 1 2 + 10 y 2 2 + 12.5 t 2 , subject to 5.5 y 1 2 + 9 y 2 2 + 3 t 2 1 , 5 y 1 + 7.5 y 2 24.5 t 0 9.5 y 1 + 7.5 y 2 25 t 0 , y 1 , y 2 0 , t > 0 .
P 5 :
Max θ 1 ( y / t ) = 4.5 y 1 2 + 5.5 y 2 2 + 7.5 t 2 Max θ 2 ( y / t ) = 5.5 y 1 2 + 6 y 2 2 + 9 t 2 , Max θ 3 ( y / t ) = 7 y 1 2 + 8 y 2 2 + 10 t 2 , Max θ 4 ( y / t ) = 8 y 1 2 + 9.5 y 2 2 + 11.5 t 2 , Max θ 5 ( y / t ) = 8.5 y 1 2 + 10 y 2 2 + 12.5 t 2 , subject to 4.5 y 1 2 + 7.5 y 2 2 + 2.5 t 2 1 , 5.5 y 1 + 8 y 2 26 t 0 , 10.5 y 1 + 8 y 2 27.5 t 0 , y 1 , y 2 0 , t > 0 .
Solve models P i , i = 1 , 2 , 4 , 5 as single-objective NLPPs. The lower and upper bounds L and U, respectively, for the objective functions are L = 1.250000 and U = 5.000000 .
The LDMONLFPP (34) is equivalent to the following fuzzy model:
Find x subject to 8.5 x 1 2 + 10 x 2 2 + 12.5 4.5 x 1 2 + 7.5 x 2 2 + 2.5 5.000000 9 x 1 + 3 x 2 26 4 x 1 + 3 x 2 19 x 1 , x 2 0 .
Further, using the membership functions in (21)–(24), model (36) is equivalent to the following crisp model:
Max λ subject to ( 8.5 x 1 2 + 10 x 2 2 + 12.5 4.5 x 1 2 + 7.5 x 2 2 + 2.5 ) t ( 1.250000 ) t ( 5.000000 ) t ( 1.250000 ) t 9 x 1 + 3 x 2 26 4 x 1 + 3 x 2 19 x 1 , x 2 0 .
Using LINGO, taking t = 2 , the solution is ( x 1 , x 2 ) = ( 1.234568 , 1.234568 ) ,   θ ( x ) = ( 0.598347 , 0.764026 , 1.098683 , 1.5208096 , 1.957533 ) with satisfaction level λ = 1 .
Hence, the optimal solution of the above TFLDFLP problem is
( θ 1 , θ 2 , θ 3 , θ 4 , θ 5 ) ( θ 1 , θ 2 , θ 3 , θ 4 , θ 5 ) = ( 0.803613 , 0.941796 , 1.098683 , 1.251017 , 1.427196 ) ( 0.598347 , 0.764026 , 1.098683 , 1.5208096 , 1.957533 ) .
The flow chart is given in Figure 1.

6. Conclusions

This study suggests an interactive technique to solve the LDFNLFPP in which the coefficients of the objective function and the constraints are taken as TLDFNs based on α -cut analysis defined by the DM. In the suggested methodology, the problem is transformed from an LDFNLFPP to an IMONLFPP using a fuzzy mathematical programming approach, and then the solution is transformed into an NLPP. For problems with uncertain and hesitant decision-making in manufacturing, planning, and scheduling systems, the suggested methodology will be highly beneficial. The approach can be modified in the future to address bi-level multi-objective nonlinear fractional programming problems using the goal linear Diophantine fuzzy method.

Author Contributions

Conceptualization, investigation, S.I., N.Y. and M.G. 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

No data were used to support this study.

Acknowledgments

The authors are highly grateful to the referees for their valuable comments and suggestions.

Conflicts of Interest

The authors of this paper declare that they have no conflict of interest.

References

  1. Sakawa, M.; Yano, H. Interactive decision making for multiobjective nonlinear programming problems with fuzzy parameters. Fuzzy Set. Syst. 1989, 29, 315–326. [Google Scholar] [CrossRef]
  2. Sakawa, M.; Nishizaki, I.; Uemura, Y. Interactive fuzzy programming for two-level linear fractional programming problems with fuzzy parameters. Fuzzy Set. Syst. 2000, 115, 93–103. [Google Scholar] [CrossRef]
  3. Sakawa, M.; Nishizaki, I. Interactive fuzzy programming for two-level linear fractional programming problems. Fuzzy Set. Syst 2001, 119, 31–40. [Google Scholar] [CrossRef]
  4. Sakawa, M.; Nishizaki, I.; Uemura, Y. Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: A case study. Eur. J. Oper. Res. 2001, 135, 142–157. [Google Scholar] [CrossRef]
  5. Zadeh, L.A. Fuzzy sets. Inform. Control. 1956, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  6. Bellman, R.E.; Zadeh, L.A. Decision-making in a fuzzy environment. Manag. Sci. 1970, 17, 144–164. [Google Scholar] [CrossRef]
  7. Atanassov, K.T. Intuitionistic fuzzy sets. Int. J. Bioautomation 2016, 20, 1–6. [Google Scholar]
  8. Atanassov, K.T. Intuitionistic Fuzzy Sets. Fuzzy Set. Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  9. Atanassov, K.T. New operations defined over intuitionistic fuzzy sets. Fuzzy Set. Syst. 1994, 61, 137–142. [Google Scholar] [CrossRef]
  10. Atanassov, K.T. Intuitionistic fuzzy sets. Stud. Fuzziness Soft Comput. 1999, 35, 1–137. [Google Scholar]
  11. Szmidt, E.; Kacprzyk, J. Intuitionistic fuzzy sets in some medical applications. Computational Intelligence. In Proceedings of the Theory and Applications: International Conference, 7th Fuzzy Days, Dortmund, Germany, 1–3 October 2001; pp. 148–151. [Google Scholar]
  12. Szmidt, E.; Kacprzyk, J. Medical diagnostic reasoning using a similarity measure for intuitionistic fuzzy sets. Notes Int. Fuzzy Set. 2004, 10, 61–69. [Google Scholar]
  13. Hepzibah, R.I.; Gani, A.N.; Vidhya, R. Intuitionistic fuzzy multi-objective non-linear programming problem (IFMONLPP) using a Taylor series approach. Int. J. Innov. Res. Technol. Sci. Eng. 2014, 3, 14105–14112. [Google Scholar]
  14. Singh, S.K.; Yadav, S.P. Intuitionistic fuzzy non linear programming problem: Modeling and optimization in manufacturing systems. J. Intell. Fuzzy Syst. 2015, 28, 1421–1433. [Google Scholar] [CrossRef]
  15. Singh, S.K.; Yadav, S.P. Fuzzy programming approach for solving intuitionistic fuzzy linear fractional programming problem. Int. J. Fuzzy Syst. 2016, 18, 263–269. [Google Scholar] [CrossRef]
  16. Raouf, O.A.; Hassan, B.M.A.; Hezam, I.M. Sperm motility algorithm for solving fractional programming problems under uncertainty. Int. J. Adv. Comput. Sci. Appl. 2017, 8, 40–48. [Google Scholar]
  17. Amer, A.H. An interactive intuitionistic fuzzy non-linear fractional programming problem. Int. J. Appl. Eng. Res. 2018, 13, 8116–8125. [Google Scholar]
  18. Charnes, A.; Cooper, W.W. Programming with linear fractional functionals. Nav. Res. Logist. Q. 1962, 9, 181–186. [Google Scholar] [CrossRef]
  19. Chen, F.; Huang, G.H.; Fan, Y.R.; Liao, R.F. A nonlinear fractional programming approach for environmental–economic power dispatch. Int. J. Electr. Power Energy Syst. 2016, 78, 463–469. [Google Scholar]
  20. Veeramani, C.; Sumathi, M. Fuzzy mathematical programming approach for solving fuzzy linear fractional programming problem. RAIRO Oper. Res. 2014, 48, 109–122. [Google Scholar] [CrossRef] [Green Version]
  21. Anuradha, D.; Sobana, V.E. Solving intuitionistic fuzzy multi-objective nonlinear programming problem. IOP Conf. Ser. Mater. Sci. Eng. 2017, 263, 4042104. [Google Scholar] [CrossRef] [Green Version]
  22. Beaula, T.; Seetha, R. Nonlinear programming with Trapezoidal intuitionistic fuzzy parameters. Malaya J. Mat. 2020, 8, 2088–2091. [Google Scholar] [CrossRef] [PubMed]
  23. Dey, S.; Roy, T.K. Intuitionistic fuzzy goal programming technique for solving non-linear multi-objective structural problem. J. Fuzzy Set Valued Anal. 2015, 3, 179–193. [Google Scholar] [CrossRef]
  24. Lalitha, M.; Loganathan, C. Solving nonlinear programming problem in fuzzy environment. Int. J. Pure Appl. Math. 2018, 118, 491–499. [Google Scholar]
  25. Rani, D.; Gulati, T.R.; Garg, H. Multi-objective non-linear programming problem in intuitionistic fuzzy environment: Optimistic and pessimistic view point. Expert Syst. Appl. 2016, 64, 228–238. [Google Scholar] [CrossRef]
  26. Ebrahimnejad, A.; Verdegay, J.L. Fuzzy sets-based methods and techniques for modern analytics. Stud. Fuzziness Soft Comput. 2018, 364, 1–361. [Google Scholar]
  27. Riaz, M.; Hashmi, M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2018, 37, 5417–5439. [Google Scholar] [CrossRef]
  28. Khan, N.; Yaqoob, N.; Shams, M.; Gaba, Y.U.; Riaz, M. Solution of linear and quadratic equations based on triangular linear diophantine fuzzy numbers. J. Funct. Spaces 2021, 2021, 8475863. [Google Scholar] [CrossRef]
Figure 1. Problem-solving flow chart.
Figure 1. Problem-solving flow chart.
Mathematics 11 03383 g001
Table 1. LDFNs and their corresponding α -LDFNs.
Table 1. LDFNs and their corresponding α -LDFNs.
LDFNs α -LDFNs
7 ˜ = ( 5 , 6 , 7 , 8 , 9 ) 7 = ( 6 , 6.5 , 7 , 7.5 , 8 )
6 ˜ = ( 4 , 6 , 8 , 9 , 10 ) 6 = ( 6 , 7 , 8 , 8.5 , 9 )
8 ˜ = ( 8 , 9 , 10 , 11 , 12 ) 8 = ( 9 , 9.5 , 10 , 10.5 , 11 )
5 ˜ = ( 2 , 3 , 4 , 5 , 6 ) 5 = ( 3 , 3.5 , 4 , 4.5 , 5 )
9 ˜ = ( 1 , 2 , 3 , 4 , 5 ) 9 = ( 2 , 2.5 , 3 , 3.5 , 4 )
3 ˜ = ( 2 , 4 , 6 , 8 , 9 ) 3 = ( 4 , 5 , 6 , 7 , 7.5 )
4 ˜ = ( 6 , 7 , 8 , 9 , 10 ) 4 = ( 7 , 7.5 , 8 , 8.5 , 9 )
26 ˜ = ( 18 , 19 , 22 , 26 , 28 ) 26 = ( 20 , 20.5 , 22 , 24 , 25 )
19 ˜ = ( 19 , 20 , 23 , 27 , 29 ) 19 = ( 21 , 21.5 , 23 , 25 , 26 )
Table 2. LDFNs and their corresponding α -LDFNs.
Table 2. LDFNs and their corresponding α -LDFNs.
LDFNs α -LDFNs
7 ˜ = ( 2 , 4 , 7 , 9 , 10 ) 7 = ( 4.5 , 5.5 , 7 , 8 , 8.5 )
6 ˜ = ( 3 , 4 , 8 , 11 , 12 ) 6 = ( 5.5 , 6 , 8 , 9.5 , 19 )
8 ˜ = ( 5 , 8 , 10 , 13 , 15 ) 8 = ( 7.5 , 9 , 10 , 11.5 , 12.5 )
5 ˜ = ( 1 , 2 , 4 , 6 , 8 ) 5 = ( 2.5 , 3 , 4 , 5 , 6 )
9 ˜ = ( 0 , 2 , 3 , 7 , 8 ) 9 = ( 1.5 , 2.5 , 3 , 5 , 5.5 )
3 ˜ = ( 1 , 3 , 6 , 9 , 10 ) 3 = ( 3.5 , 4.5 , 6 , 7.5 , 8 )
4 ˜ = ( 5 , 6 , 8 , 11 , 13 ) 4 = ( 6.5 , 7 , 8 , 9.5 , 10.5 )
26 ˜ = ( 17 , 18 , 22 , 27 , 30 ) 26 = ( 19.5 , 20 , 22 , 24.5 , 26 )
19 ˜ = ( 17 , 18 , 23 , 30 , 32 ) 19 = ( 20 , 20.5 , 23 , 26.5 , 27.5 )
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Iqbal, S.; Yaqoob, N.; Gulistan, M. An Investigation of Linear Diophantine Fuzzy Nonlinear Fractional Programming Problems. Mathematics 2023, 11, 3383. https://doi.org/10.3390/math11153383

AMA Style

Iqbal S, Yaqoob N, Gulistan M. An Investigation of Linear Diophantine Fuzzy Nonlinear Fractional Programming Problems. Mathematics. 2023; 11(15):3383. https://doi.org/10.3390/math11153383

Chicago/Turabian Style

Iqbal, Salma, Naveed Yaqoob, and Muhammad Gulistan. 2023. "An Investigation of Linear Diophantine Fuzzy Nonlinear Fractional Programming Problems" Mathematics 11, no. 15: 3383. https://doi.org/10.3390/math11153383

APA Style

Iqbal, S., Yaqoob, N., & Gulistan, M. (2023). An Investigation of Linear Diophantine Fuzzy Nonlinear Fractional Programming Problems. Mathematics, 11(15), 3383. https://doi.org/10.3390/math11153383

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