Next Article in Journal
Chirped Periodic and Solitary Waves for Improved Perturbed Nonlinear Schrödinger Equation with Cubic Quadratic Nonlinearity
Next Article in Special Issue
Hermite–Jensen–Mercer-Type Inequalities via Caputo–Fabrizio Fractional Integral for h-Convex Function
Previous Article in Journal
More General Weighted-Type Fractional Integral Inequalities via Chebyshev Functionals
Previous Article in Special Issue
Existence of Solutions to a Class of Nonlinear Arbitrary Order Differential Equations Subject to Integral Boundary Conditions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability of Parametric Intuitionistic Fuzzy Multi-Objective Fractional Transportation Problem

by
Mohamed A. El Sayed
1,2,*,
Mohamed A. El-Shorbagy
3,4,
Farahat A. Farahat
5,
Aisha F. Fareed
2 and
Mohamed A. Elsisy
2,6
1
Basic Sciences Department, Faculty of Engineering, Badr University in Cairo BUC, Cairo 11829, Egypt
2
Department of Basic Engineering Sciences, Faculty of Engineering, Benha University, Benha 13511, Egypt
3
Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
4
Department of Basic Engineering Science, Faculty of Engineering, Menoufia University, Shebin El-Kom 32511, Egypt
5
Higher Technological Institute, Tenth of Ramadan City 44637, Egypt
6
Department of Basic Engineering Sciences, Menoufia Higher Institute of Engineering and Technologey, El-Bagour 32821, Egypt
*
Author to whom correspondence should be addressed.
Fractal Fract. 2021, 5(4), 233; https://doi.org/10.3390/fractalfract5040233
Submission received: 14 October 2021 / Revised: 1 November 2021 / Accepted: 8 November 2021 / Published: 19 November 2021
(This article belongs to the Special Issue Advances in Optimization and Nonlinear Analysis)

Abstract

:
In this study, a parametric intuitionistic fuzzy multi-objective fractional transportation problem (PIF-MOFTP) is proposed. The current PIF-MOFTP has a single-scalar parameter in the objective functions and an intuitionistic fuzzy supply and demand. Based on the ( α , β ) -cut concept a parametric ( α , β ) -MOFTP is established. Then, a fuzzy goal programming (FGP) approach is utilized to obtain ( α , β ) -Pareto optimal solution. We investigated the stability set of the first kind (SSFK) corresponding to the solution by extending the Kuhn-Tucker optimality conditions of multi-objective programming problems. An algorithm to crystalize the progressing SSFK for PIF-MOFTP as well as an illustrative numerical example is presented.

1. Introduction

Transportation issues (TP) have been studied in various writings [1,2,3,4,5,6,7]. These issues and their solution processes postulate a worthy task in logistics and supply chain organization for reducing expenses, further developing service quality, etc. [3,8]. Nonetheless, TP is described by multiple, incommensurable, and clashing objective functions, being known as the multi-objective transportation problem (MO-TP). Accordingly, in MO-TP, the idea of an ideal solution offers spot to the idea of the best compromise solution or the non-dominated solutions. Optimization of the ratio of two functions is called fractional programming (ratio optimization) [7,9]. To be sure, in such circumstances, it is often a question of optimizing a ratio of benefit/cost, stock/deals, specialist/patient, and so on, subject to some constraints [7,9].
One of the significant issues looked at by specialists is that involving the exact values of parameters [7]. In this way, this might involve thinking about vagueness, or specifying the fundamental parameters of the model, which are the coefficients of the objective function and the constrains [4,8]. Accordingly, it might be naturalistic to take the distinct adjectival information on specialists and leaders about the parameters which can be exemplified as fuzzy data [7,10]. Uncertainty may happen because of the accompanying unrestrained factors. In this study the main hypotheses are that the transportation charge has a parametric nature, and the supply and the demand parameters are intuitionistic fuzzy numbers (IFNs). The main hypotheses have not been presented in the literature, and the basic question is how we can get the SSFK for such PIF-MOFTP.

2. Literature Review

The research on MO-TP is improved by fusing the diverse numerical models and procedures. James et al. [11] examined transportation administration quality dependent on data combination. A lot of examination that deals with transportation wellbeing was created by Ergun et al. [12], Sheu and Chen [13]. Recently, MO-TP under different circumstances has been discussed by Roy et al. [14,15], Roy and Mahapatra [16], Roy [17], Maity and Roy [18,19].
Although fuzzy set theory (FST) is novel tool in handling uncertainties, it cannot tackle special kinds of uncertainties, as it is difficult to depict the membership degree using one specific value. To overcome the lack of knowledge of non-membership degrees, intuitionistic fuzzy set (IFS) was presented in 1986 by Atanassov [20] as an extension of FST. In IFS, each element in a set is attached with two grades: membership and non-membership, where the sum of these two grades is restricted to less or equal to one. Moreover, many creators have been utilized IFS for addressing various sorts of TPs [21,22]. The study of MO-TP with vague numbers has been presented by Ammar and Youness [1]. The fuzzy programming strategy was acquainted with tackle MO-TP with various non-linear membership functions [23]. IFS has additionally been utilized by several scientists to tackle different types of TPs [10,24]. One more strategy for thoroughly considering linear MO-TPs with vague nature has been suggested by Gupta and Kumar [25]. Recently, MO-TP under various types of uncertainty has been discussed by Roy and Mahapatra [16], Maity and Roy [26], and Ebrahimnejad and Verdegay [10]. Mahajan and Gupta [27] proposed a fully IF MO-TP utilizing various membership functions. Achievement stability set for parametric linear FGP problems has been introduced by El Sayed and Farahat [28]. The neutrosophic goal programming approach for solving the multi-objective fractional transportation problem was introduced by Veeramani et al., [29]. Pramanik and Banerjee [30] proposed a chance-constrained capacitated MO-TP with two fuzzy goals, and a consensus solution was found. Edalatpanah [31] developed a nonlinear framework for neutrosophic linear programming. Furthermore, Rizk-Allah et al. [32] developed a compromise solution framework for the MO-TP based on the neutrosophic environment. A fuzzy approach using generalized dinkelbach’s algorithm for linear multi-objective fractional transportation problem (MOFTP) has been presented by Cetin and Tiryaki [3]. A fuzzy mathematical programming approach for solving fuzzy linear fractional programming problem has been demonstrated by Veeramani and Sumathi [33]. El Sayed and Abo-Sinna [7] introduced the intuitionistic fuzzy multi-objective fractional transportation problem (IF-MOFTP).
Parametric programming examines the impact of preordained continuous varieties in the objective function coefficients and the right-hand side of the constraints on the ideal solution [34,35,36]. In parametric analysis the objective function and the right-hand side vectors are replaced with the parameterized function c ( ϑ ) and b ( α , β ) , where ϑ   and   α , β are the parameter of variation. The general idea of parametric analysis is to start with the α -Pareto optimal solution at ϑ = ϑ * ,   α = α * ,   β = β * . Then by applying KKT optimality the SSFK is determined [35,37]. The concept of the stability set of the first kind (SSFK) has been introduced by Osman [35], and extended by Saad [38], Saad and Hughes [39], Osman et al. [36], Saad et al. [40].
In prior examinations, the MO-TP was created with the presumption that the supply, demand, and cost boundaries were known. Nonetheless, applications, every one of the parameters of the TP are not for the most part characterized definitively. It might have IF values. Comparable contemplations might be taken for supply and demand parameters in TP of this paper. Keeping this perspective, the primary commitments are concerned with two unique viewpoints: one is to find a ( α , β ) -Pareto optimal solution for the PIF-MOFTP, and another is to investigate the SSFK for PIF-MOFTP. First, based on the ( α , β ) -cut methodology a parametric ( α , β ) -MOFTP is established. Then, A FGP approach is used to get ( α , β ) -Pareto optimal solution. Finally, the KKT optimality conditions applied to get the SSFK. An algorithm to clarify the developed SSFK for PIF-MOFTP as well as an illustrative numerical example are given.
The rest of this study is organized as follows: after the introduction and literature review, Section 3 introduces some basic concepts. Modelling of the PIF-MOFTP is presented in Section 4. Section 5 demonstrates the FGP methodology for tackling the PIF-MOFTP. In the next section the SSFK is investigated. An algorithm for obtaining the SSFK for PIF-MOFTP is introduced in Section 6. An illustrative example, discussion and limitations is given in Section 7. This paper ends with some concluding remarks.

3. Preliminaries

This part presents the concept of IFS [20,21,41,42].
Definition 1.
An IFS  A ˜ I  in  X  is a set of ordered triples A ˜ I = { ( x , μ A ˜ I ( x ) , v A ˜ I ( x ) ) | x X } , where  μ A ˜ I ( x ) ,   v A ˜ I ( x ) : X [ 0 , 1 ]  are functions such that  0 μ A ˜ I ( x ) + v A ˜ I ( x ) 1 ,   x X . The value of  μ A ˜ I ( x )  acts as the grade of membership and  v A ˜ I ( x )  acts as the grade of non-membership of the element  x X  being in  A ˜ I .  h ( x ) = 1 μ A ˜ I ( x ) v A ˜ I ( x )  represents the grade of hesitation for the element  x  in  A ˜ I [20,41].
Definition 2.
An IFN of the form A ˜ I = ( a 1 , a 2 , a 3 ; a 1 , a 2 , a 3 ) is said to be triangular IFN (TIFN) with membership and non-membership functions defined as [41,43]:
μ A ˜ I ( x ) = { x a 1 a 2 a 1 ,                                     a 1 x a 2 , a 3 x a 3 a 2 ,                                     a 2 x a 3 0 ,                                             o t h e r w i s e ,
ν A ˜ I ( x ) = { a 2 x a 2 a ¯ 1                                     a ¯ 1 x a 2 x a 2 a ¯ 3 a 2                                     a 2 x a ¯ 3 1                                             o t h e r w i s e ,
where x a 1 a 2 a 1 , and x a 2 a ¯ 3 a 2 are continuous monotone increasing functions, a 3 x a 3 a 2 and a 2 x a 2 a ¯ 1 are continuous monotone decreasing functions. x a 1 a 2 a 1 , a 3 x a 3 a 2 , a 2 x a 2 a ¯ 1   and   x a 2 a ¯ 3 a 2 are the left and the right basis functions of the membership function and the non-membership function (see Figure 1), respectively. a ¯ 1 a 1 a 2 a 3 a ¯ 3 and 0 μ A ˜ I ( x ) + v A ˜ I ( x ) 1 ,     x X .
Definition 3.
A TIFNs A ˜ I = ( a 1 , a 2 , a 3 ; a 1 , a 2 , a 3 ) is assumed to be a non-negative TIFN iff, a 1 0 [41,43].
Definition 4.
Two TIFNs A ˜ I = ( a 1 , a 2 , a 3 ; a 1 , a 2 , a 3 ) and A ˜ I = ( b 1 , b 2 , b 3 ; b 1 , b 2 , b 3 ) are equivalent to one another, A ˜ I = B ˜ I iff, a i = b i and a i = b i     i = 1 , 2 , 3 [7,41,43].
Definition 5.
( α , β ) -cut of an IFS A ˜ I is defined by: A ˜ ( α , β ) I = { x : μ A ˜ I ( x ) α , ν A ˜ I ( x ) β ,   α + β 1 , x X } ;   w h e r e   α , β ( 0 , 1 ] .
Definition 6.
( α , β ) -cut of a TIFN A ˜ I = ( a 1 , a 2 , a 3 ; a 1 , a 2 , a 3 ) is the set of all x whose degree of membership is greater than or equal to α and degree of non-membership is less than or equal to β , i.e., A ˜ ( α , β ) I = { x : μ A ˜ I ( x ) α , ν A ˜ I ( x ) β ,   α + β 1 , x X } .
The ( α , β ) -cut of a TIFN is shown in Figure 2, is defined as the crisp set of elements x which belong to A ˜ I at least to the degree α and which does belong to A ˜ I at most to the degree β .
Now, μ A ˜ I ( x ) α x a 1 a 2 a 1 α and a 3 x a 3 a 2 α , or x a 1 + α ( a 2 a 1 ) and x a 3 α ( a 3 a 2 ) again, ν A ˜ I ( x ) β a 2 x a 2 a ¯ 1 β and x a 2 a ¯ 3 a 2 β , or x a 2 β ( a 2 a ¯ 1 ) and x a 2 + β ( a ¯ 3 a 2 ) [43]. Thus, referring to Figure 2  A ˜ ( α , β ) I = [ A L , A U ] , where A L = m a x { a 1 + α ( a 2 a 1 ) , a 2 β ( a 2 a ¯ 1 ) } and A U = m i n { a 3 α ( a 3 a 2 ) , a 2 + β ( a ¯ 3 a 2 ) } .

4. Mathematical Formulation

In genuine case TP, during the modeling process, the transportation parameters are not precise on account of insufficient information the variance of the market situation. To deal quantitatively with such unclear information, we deemed parametric IF-MOFTP in which single-scalar parameter ϑ in the objective functions and an intuitionistic fuzzy supply and demand. Suppose that there are m sources and n destinations. Thus, modelling of the parametric IF-MOFTP can be obtained as [3,7,9]:
M a x Z q ( x , ϑ ) = i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) x i j ( q ) + δ ( q ) i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) , q = 1 , 2 , , Q ,
Subject to:
j = 1 n x i j a ˜ i I , i = 1 , 2 , , m ,
i = 1 m x i j b ˜ j I , j = 1 , 2 , , n ,
x i j 0 , i = 1 , 2 , , m , j = 1 , 2 , , n .
where c i j ( q ) = ( c i j + ϑ ω i j ) ( q ) denotes the parametric profit gained from shipment of i t h source to j t h destination. Also, d i j ( q ) denotes the expense per unit of shipment from i t h source to j t h destination. δ ( q ) , ρ ( q ) are some constant profit and cost, respectively. x i j ( q ) is the quantity shipped from i t h source to j t h destination. a ˜ i I = ( a i 1 , a i 2 , a i 3 ; a ¯ i 1 , a i 2 , a ¯ i 3 ) stands for the available intuitionistic fuzzy supply at i t h source and b ˜ j I = ( b j 1 , b j 2 , b j 3 ; b ¯ j 1 , b j 2 , b ¯ j 3 ) alludes to the accessible intuitionistic fuzzy demand at j t h destination. Further, we postulate that i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) > 0 ,   q = 1 , 2 , , Q ;   a ˜ i I > 0 I ,   b ˜ j I > 0 I ,     j ; ( c i j + ϑ ω i j ) ( q ) > 0 I ,   δ ( q ) , ρ ( q ) > 0 for all i ,   j , and the gross supply is greater than or equal the gross demand [3,7].
i = 1 m ( a ˜ i I ) ( α , β ) j = 1 n ( b ˜ j I ) ( α , β ) .
The disparity (7) is considered as a necessary and sufficient condition for the existence of a feasible solution to PIF-MOFTP.
For a certain degree of ( α , β ) -cut the PIF-MOFTP could be transformed into parametric ( α , β ) -MOFTP as:
M a x Z q ( x , ϑ ) = i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) x i j ( q ) + δ ( q ) i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) , q = 12 , , Q ,
Subject to:
j = 1 n x i j ( a i ) ( α , β ) i = 1 , 2 , , m ,
i = 1 m x i j ( b j ) ( α , β ) j = 1 , 2 , , n ,
x i j 0 , i = 1 , 2 , , m , j = 1 , 2 , , n ,
a i L ( a i ) ( α , β ) a i U , i = 1 , 2 , , m ,
b j L ( b j ) ( α , β ) b j U , j = 1 , 2 , , n .
Based on the concept of a convex linear combination method proposed in [40] parametric ( α , β ) -MOFTP can be rewritten as:
M a x Z q ( x , ϑ ) = i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) x i j ( q ) + δ ( q ) i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) , q = 12 , , Q ,
Subject to:
j = 1 n x i j λ   a i L + ( 1 λ ) a i U i = 1 , 2 , , m ,
i = 1 m x i j λ   b j L + ( 1 λ ) b j U j = 1 , 2 , , n ,
x i j 0 , λ [ 0 , 1 ] , i = 1 , 2 , , m , j = 1 , 2 , , n ,
Let M ( α , β ) denote the set of constraints in Equations (15)–(17), the parametric ( α , β ) -MOFTP has an ( α , β ) -Pareto optimal solution x i j * at ϑ * .
Definition 7.
( α , β ) -Pareto optimal solution. x ij * M ( α , β ) is said to be an ( α , β ) -Pareto optimal solution to ( α , β ) -MOFTP if and only if there does not exist another x i j ° M ( α , β )   a i ( a i ) ( α , β ) ,   b j ( b j ) ( α , β ) , such that Z q ( x i j ° , ϑ * ) Z q ( x i j * , ϑ * ) with at least one strict inequality hold for q   ( q = 1 , 2 , , Q ) .

5. FGP Methodology for PIF-MOFTP

In this section the FGP approach is applied to obtain the compromise solution of the parametric ( α , β ) -MOFTP. The objective functions are modeled as fuzzy goals characterized by its’ membership function μ ( z q ( x , ϑ * ) ) [36,44,45,46]. The model formulation and solution process are carried out at ϑ = ϑ*. The membership functions of the qth fuzzy goals [36,44], is defined as:
μ ( z q ( x , ϑ * ) ) = { 1 , i f   Z q ( x , ϑ * ) u q * , Z q ( x , ϑ * ) g q * u q * g q * , i f   g q * Z q ( x , ϑ * ) u q * , 0 , i f   Z q ( x , ϑ * ) g q * ,                       q = 1 , 2 , , Q
where u q *   =   m a x   Z q ( x , ϑ * ) , g q *   =   m i n   Z q ( x , ϑ * ) , and denotes the upper and lower tolerance limit for the membership function of qth objective, respectively. In the FGP approach, the most extensive level of membership is unity. So, the membership goals having the aspired level unity follows as [44]:
μ q ( Z q ( x , ϑ * ) ) + d q d q + = 1 , q = 1 , 2 , , Q ,
where d q , d q + 0 , with d q × d q + = 0 , denote the under- and over-deviations, respectively, from the aspired levels [36,44]. The final FGP model of the parametric ( α , β ) -MOFTP can be obtained as:
M i n A F = q = 1 Q w q   d q ,
Subject to:
Z q ( x , ϑ * ) g q * u q * g q * + d q d q + = 1 , q = 1 , 2 , , Q ,
j = 1 n x i j λ   a i L + ( 1 λ ) a i U i = 1 , 2 , , m ,
i = 1 m x i j λ   b j L + ( 1 λ ) b j U j = 1 , 2 , , n ,
x i j 0 , λ [ 0 , 1 ] , i = 1 , 2 , , m , j = 1 , 2 , , n ,
d q × d q + = 0 ,   and   d q ,   d q + 0 , q = 1 , 2 , , Q ,
where w q represents the relative importance of achieving the aspired levels of the respective fuzzy goals which given by [44,47]:
w q = 1 u q * g q * , q = 1 , 2 , , Q

Extension of Pal’s Method to Linearize the Membership Goals

It can be easily realized that the parametric membership goals in Equation (19) are non-linear fractional in nature. To avoid such problem, Pal et al. [45] method is extended here to linearize the q t h membership goals with single-scalar parameter ϑ = ϑ * as:
μ q ( Z q ( x , ϑ * ) ) + d q d q + = 1 , q = 1 , 2 , , Q ,
L q ( Z q ( x , ϑ * ) ) L q g q * + d q d q + = 1 ; L q = 1 u q * g i j * ,
Z q ( x , ϑ * ) = i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) x i j ( q ) + δ ( q ) i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) , q = 1 , 2 , , Q ,
Substituting from Equation (29) in Equation (28), we obtain:
L q i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) x i j ( q ) + δ ( q ) i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) L q g q * + d q d q + = 1 ,
L q [ i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) x i j ( q ) + δ ( q ) ] L q g q * [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]   + d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]   d q + [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] = [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] ,
( L q [ i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) x i j ( q ) + δ ( q ) ] + d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]                               d q + [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]                               ) = ( 1 + L q g q * ) [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] ,
( L q [ i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) x i j ( q ) + δ ( q ) ] + d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]                               d q + [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]                               ) = L q ° [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] ;         L q 0 = ( 1 + L q g q * )
[ L q i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] x i j ( q ) + d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] d q + [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] = [ L q 0 ρ ( q ) L q δ ( q ) ] ,
C i j ( q ) x i j ( q ) + d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] d q + [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] = G q ;
where
C i j ( q ) = [ L q i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] ,
G q = [ L q 0 ρ ( q ) L q δ ( q ) ] ,
Considering Pal et al. [45], the goal expression in Equation (35) can be linearized as follows. Letting D q = d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ]   and   D q + = d q + [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] , then the linear form of expression in Equation (32) is obtained as:
C i j ( q ) x i j ( q ) + D q D q + = G q ,
with D q ,   D q + 0 ;   a n d   D q × D q + = 0 , since d q ,   d q + 0 , and i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) > 0 . So, minimization of d q means minimization of D q = d q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] which is also non-linear. So, involvement of d q 1 , in the solution leads to impose the following constraint in the model:
D q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + ρ ( q ) ] 1 .
Now, the final FGP model of the parametric ( α , β ) -MOFTP in model (20)–(25) becomes:
M i n A F = q = 1 Q w q   d q ,
Subject to:
[ L q i = 1 m j = 1 n ( c i j + ϑ * ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] x i j ( q ) + D q D q + = [ L q 0 ρ ( q ) L q δ ( q ) ] ,
i = 1 m j = 1 n d i j ( q ) x i j ( q ) + D q ρ ( q ) , q = 1 , 2 , , Q , i , j ,
j = 1 n x i j λ   a i L + ( 1 λ ) a i U , i = 1 , 2 , , m ,
i = 1 m x i j λ   b j L + ( 1 λ ) b j U j = 1 , 2 , , n ,
x i j 0 , λ [ 0 , 1 ] , i = 1 , 2 , , m , j = 1 , 2 , , n ,
D q × D q + = 0 ,   and   D q ,   D q + 0 , q = 1 , 2 , , Q .
Thus, the above FGP model provides the satisfactory solution x i j * for the parametric ( α , β ) -MOFTP.

6. The SSFK for Parametric ( α , β ) -MOFTP

The main area of inquiry is as follows: having solved the parametric ( α , β ) -MOFTP, to what extent can its data with respect to α , β   and   ϑ be changed without invalidating the efficiency of its ( α , β ) -Pareto optimal solution? The set of feasible parameters, the solvability set, and the SSFK for parametric ( α , β ) -MOFTP are defined as:
Definition 8.
The set of feasible parameters for the parametric  ( α , β ) -MOFTP is defined by:
= { a R m , b R n | a i L α , β ( a ˜ i I ) ,   i = 1 , 2 , m ;   b j L α , β ( b ˜ j I ) ,   j = 1 , 2 , , n ;   α , β [ 0 , 1 ] ;   a n d   M ( α , β ) ( x i j , a , b ) } .  
Definition 9.
The solvability set   of the parametric  ( α , β ) -MOFTP is defined by:
= { ( ϑ , a , b ) R × R m × R n | p a r a m e t r i c ( α , β ) M O F T P   h a s a n   ( α , β ) P a r e t o   o p t i m a l   s o l u t i o n . } .
Definition 10.
Suppose that  x i j *  be an  ( α , β ) -Pareto optimal solution of the parametric   ( α , β ) -MOFTP, then the SSFK  S 1 ( x i j * , α , β )  corresponding to  x i j *  is defined by:
S 1 ( x i j * , α , β ) = { ( ϑ , a , b ) R × R m × R n | x i j *   i s   a n   ( α , β ) P a r e t o   o p t i m a l   s o l u t i o n   o f   p a r a m e t r i c   ( α , β ) M O F T P   } .
The SSFK of the parametric ( α , β ) -MOFTP is the set of all parameters corresponding to one ( α , β ) -Pareto optimal solution [35,36]. It is easy to see that the stability of the parametric ( α , β ) -MOFTP model (14)–(17) implies the stability of the parametric FGP model which is defined as follows:
M i n A F = q = 1 Q w q   d q , q
Subject to:
[ L q i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] x i j ( q ) + D q D q + = [ L q 0 ρ ( q ) L q δ ( q ) ] ,
i = 1 m j = 1 n d i j ( q ) x i j ( q ) + D q ρ ( q ) , q = 1 , 2 , , Q , i , j
j = 1 n x i j λ   a i L + ( 1 λ ) a i U , i = 1 , 2 , , m ,
i = 1 m x i j λ   b j L + ( 1 λ ) b j U , j = 1 , 2 , , n ,
x i j 0 , λ [ 0 , 1 ] , ϑ R , i = 1 , 2 , , m , j = 1 , 2 , , n ,
D q × D q + = 0 ,   and   D q ,   D q + 0 , q = 1 , 2 , , Q .

6.1. KKT Optimality Conditions for Parametric FGP Model

The Lagrangian function of parametric FGP model (47)–(53) follows as [36,37]:
L = [ q = 1 Q w q   D q ] +   ξ q [ [ L q i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] x i j ( q ) + D q D q + [ L q 0 ρ ( q ) L q δ ( q ) ] ] +   υ q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + D q ρ ( q ) ] + τ i [ j = 1 n x i j ( λ   a i L + ( 1 λ ) a i U ) ] +   η j [ i = 1 m x i j + ( λ   b j L + ( 1 λ ) b j U ) ] + φ i j [ x i j ] + ψ i [ a i L ] + ϕ j [ b j L ] + ϖ i [ a i U ] + ϵ j [ b j U ] +   ζ q [ D q ] + π q [ D q + ] ,
where ξ , υ , τ , η ,   φ , ψ , ϕ , ϖ ,   ϵ , ζ   and   π are the Lagrange multipliers. Thus, KKT optimality conditions [28,36,37,39] have the following form:
L x i j = ξ q [ L q i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] + υ q [ i = 1 m j = 1 n d i j ( q ) ] + τ i η j φ i j = 0 , i = 1 , 2 , , m , j = 1 , 2 , , n ,
L a i L = λ τ i ψ i = 0 , i = 1 , 2 , m ,
L a i U = ( 1 λ ) τ i ϖ i = 0 , i = 1 , 2 , m ,
L b j L = λ η j ϕ j = 0 , i = 1 , 2 , m ,
L b j U = ( 1 λ ) η j ϵ j = 0 , i = 1 , 2 , m ,
L D q = q = 1 Q w q + ξ q + υ q ζ q = 0 , q = 1 , 2 , , Q ,
L D q + = ξ q π q = 0 , q = 1 , 2 , , Q ,
[ L q i = 1 m j = 1 n ( c i j + ϑ ω i j ) ( q ) L q 0 i = 1 m j = 1 n d i j ( q ) ] x i j ( q ) + D q D q + [ L q 0 ρ ( q ) L q δ ( q ) ] = 0 ,
i = 1 m j = 1 n d i j ( q ) x i j ( q ) + D q ρ ( q ) 0 , q = 1 , 2 , , Q , i , j
j = 1 n x i j [ λ   a i L + ( 1 λ ) a i U ] 0 , i = 1 , 2 , , m ,
[ λ   b j L + ( 1 λ ) b j U ] i = 1 m x i j 0 , j = 1 , 2 , , n ,
x i j 0 , i = 1 , 2 , , m , j = 1 , 2 , , n ,
D i j ,   D i j + 0 , q = 1 , 2 , , Q ,
υ q [ i = 1 m j = 1 n d i j ( q ) x i j ( q ) + D q ρ ( q ) ] = 0 , q = 1 , 2 , , Q , i , j  
τ i [ j = 1 n x i j ( λ   a i L + ( 1 λ ) a i U ) ] = 0 , i = 1 , 2 , , m ,
η j [ i = 1 m x i j + ( λ   b j L + ( 1 λ ) b j U ) ] = 0 , j = 1 , 2 , , n ,
φ i j [ x i j ] = 0 ,
ψ i [ a i L ] = 0 ,
ϕ j [ b j L ] = 0 ,  
ϖ i [ a i U ] = 0 ,
ϵ j [ b j U ] = 0 ,  
ζ q [ D q ] = 0 ,
π q [ D q + ] = 0 ,
υ , τ , η ,   φ , ψ , ϕ , ϖ ,   ϵ , ζ , π 0 ,   and   ϑ , ξ R ;
where the KKT conditions (55)–(78) are evaluated at x i j * . Solving the system of Equations (55)–(78), the SSFK S 1 ( x i j * , α , β ) for parametric IF-MOFTP is obtained.

6.2. Algorithm for Determination of the SSFK S1 ( x i j * , a , b )

Following the above discussion, the algorithm for obtaining the SSFK S 1 ( x i j * , α , β ) for parametric ( α , β ) -MOFTP van be described as follows (Algorithms 1 and 2):
Algorithm 1 Phase I: Obtain an ( α , β ) -Pareto Optimal Solution of the Problem
1:
Set the value of α , and β .
2:
Presume that ϑ = ϑ * .
3:
Calculate the sole maximum and minimum values of Z q ( x , ϑ * ) ,   q = 1 , 2 , , Q .
4:
Set the goals and the upper tolerance limits for Z q ( x , ϑ * ) ,   q = 1 , 2 , , Q .
5:
Formulate μ ( z q ( x , ϑ * ) ) ,   q = 1 , 2 , , Q as in Equation (18).
6:
Evaluate the weights w i j as defined in Equation (26).
7:
Do the linearization procedures at ϑ = ϑ * for each parametric membership goal according to Equations (35)–(38).
8:
Formulate and solve the FGP model (Equations (40)–(46)) to get ( α , β ) -Pareto optimal solution x i j * .
Algorithms 2 Phase II: Determination of the SSFK S 1 ( x i j * , α , β )
1:
Formulate the parametric FGP model (Equations (47)–(53)).
2:
Obtain the Lagrangian function, for the final FGP model, as in Equation (54).
3:
Apply the KKT optimality conditions to find the SSFK (Equations (55)–(78)).
4:
Reduce and solve the system of Equations (55)–(78), to obtain S 1 ( x i j * , α , β ) and stop.

7. Numerical Example

To demonstrate the proposed algorithm for finding the SSFK, consider the following parametric IF-MOFTP:
M a x   ( Z 1 ( x , ϑ ) = ϑ x 11   +   ( 2   +   ϑ ) x 12   +   ( 3   +   2 ϑ ) x 21   +   6 x 22   +   4 x 11   +   3 x 12   +   x 21   +   2 x 22   +   2 ,     Z 2 ( x , ϑ ) = 2 x 11   +   ( 3   +   ϑ ) x 12   +   ( 4   +   2 ϑ ) x 21   +   ( 5   +   ϑ ) x 22   +   6 x 11   +   2 x 12   +   3 x 21   +   x 22 +   4 ) ,
Subject to:
Supply constraints:
x 11 + x 12 a ˜ 1 I , x 21 + x 22 a ˜ 2 I ,
Demand constraints:
x 11 + x 21 b ˜ 1 I , x 12 + x 22 b ˜ 2 I ,
where the membership functions μ a ˜ 1 I ( x ) , μ a ˜ 2 I ( x ) , μ b ˜ 1 I ( x ) ,   μ b ˜ 2 I ( x ) and the non-membership functions γ a ˜ 1 I ( x ) ,   γ a ˜ 2 I ( x ) ,   γ b ˜ 2 I ( x ) ,   γ b ˜ 2 I ( x ) of the supplies and demands are described as follows:
μ a ˜ 1 I ( x ) = { x 140 20 i f   140 x 160 , 180 x 20 i f   160 x 180 , 0 o t h e r w i s e ,   γ a ˜ 1 I ( x ) = { 160 x 30 i f   130 x 160 , x 160 40 i f   160 x 200 , 1 o t h e r w i s e ,
μ a ˜ 2 I ( x ) = { x 220 20 i f   220 x 240 , 250 x 10 i f   240 x 250 , 0 o t h e r w i s e ,   γ a ˜ 2 I ( x ) = { 240 x 20 i f   210 x 240 , x 240 30 i f   240 x 270 , 1 o t h e r w i s e ,
μ b ˜ 1 I ( x ) = { x 40 10 i f   40 x 50 , 60 x 10 i f   50 x 60 , 0 o t h e r w i s e ,   γ b ˜ 1 I ( x ) = { 50 x 20 i f   30 x 50 , x 50 30 i f   50 x 80 , 1 o t h e r w i s e ,
μ b ˜ 2 I ( x ) = { x 310 10 i f   310 x 320 , 350 x 30 i f   320 x 350 , 0 o t h e r w i s e ,   γ b ˜ 2 I ( x ) = { 320 x 20 i f   300 x 320 , x 320 60 i f   320 x 380 , 1 o t h e r w i s e ,
Phase I: Finding an ( α , β ) -Pareto optimal solution of the parametric IF-MOFTP.
For a desired values of α = 0.6, and β = 0.2 , then applying the concept of ( α , β ) -cut of the IFN we formulate the ( α , β ) -MOFTP at ϑ = ϑ * = 3 .
M a x   ( Z 1 ( x ) = 3 x 11 +   5 x 12 +   9 x 21 +   6 x 22 +   8 x 11 +   3 x 12 +   x 21 +   2 x 22 +   2 ,     Z 2 ( x ) = 2 x 11 +   6 x 12 +   10 x 21 +   8 x 22 +   6 x 11 +   2 x 12 +   3 x 21 +   x 22 +   4 ) ,
Subject to:
Supply constraints:
x 11 + x 12 [ 154 ,   168 ] , x 21 + x 22 [ 234 ,   244 ] .
Demand constraints:
x 11 + x 21 [ 46 ,   54 ] , x 12 + x 22 [ 316 ,   332 ] .
Based on the concept of convex linear combination on the constraints, then we obtain the MOFTP:
M a x   ( Z 1 ( x ) = 3 x 11 +   5 x 12 +   9 x 21 +   6 x 22 +   8 x 11 +   3 x 12 +   x 21 + 2 x 22 +   2 ,     Z 2 ( x ) = 2 x 11 +   6 x 12 +   10 x 21 +   8 x 22 +   6 x 11 +   2 x 12 +   3 x 21 +   x 22 +   4 ) ,
Subject to:
x 11 + x 12 165.2 ,   x 21 + x 22 240 ,   x 11 + x 21 51.6 ,   x 12 + x 22 328.8 .
A FGP approach is utilized to solve the MOFTP according to the model of Equations (40)–(46). Firstly, the coefficients of the linearized membership goals are obtained in Table 1.
M i n   A F = 3.0665 D 1 + 0.8386 D 2 ,
Subject to:
0.682 x 11 10.22 x 12 + 19.081 x 21 + 1.364 x 22 + D 1 D 1 + = 7.497 ,
2.8628 x 11 4.048 x 12 5.234 x 21 + 2.169 x 22 + D 2 D 2 + = 13.128 ,
x 11 3 x 12 x 21 2 x 22 + D 1 2 ,
x 11 2 x 12 3 x 21 x 22 + D 2 4 ,
x 11 + x 12 165.2 ,
x 21 + x 22 240 ,
x 11 + x 21 51.6 ,
x 12 + x 22 328.8 ,
x 11 , x 12 , x 21 , x 22 ,   D 1 ,   D 1 + , D 2 ,   D 2 + 0 .
Using Lingo programming, the ( α , β ) -Pareto optimal solution of the parametric IF-MOFTP is obtained at ( x 11 * , x 12 * , x 21 * , x 22 * ,   D 1 ,   D 1 + , D 2 ,   D 2 + ) = ( 0 , 165.88 ,   76.39 ,   163.61 ,   0 ,   0 ,   726.78 ,   0 ) .
Phase II: determination of the SSFK S 1 ( x * , α , β ) .
To determine the SSFK S 1 ( x * , a , b ) of the parametric IF-MOFTP, the coefficients of the linearized membership goals in the parametric form are recalculated in Table 2.
Therefore, the stability of parametric IF-MOFTP implies the stability of the parametric FGP model which is defined as:
M i n   A F = 3.067 D 1 + 0.839 D 2 ,
Subject to:
( 8.518 + 3.067 ϑ ) x 11 + ( 19.42 + 3.067 ϑ ) x 12 + ( 0.682 + 6.133 ϑ ) x 21 + 1.364 x 22
+ D 1 D 1 + = 7.497 ,
2.8628 x 11 + ( 6.564 + 0.839 ϑ ) x 12 + ( 10.266 + 1.677 ϑ ) x 21
+ ( 0.347 + 0.839 ϑ ) x 22 + D 2 D 2 + = 13.128 ,
x 11 3 x 12 x 21 2 x 22 + D 1 2 ,
x 11 2 x 12 3 x 21 x 22 + D 2 4 ,
x 11 + x 12 0.2 a 1 L + 0.8 a 1 U ,
x 21 + x 22 0.4 a 2 L + 0.6 a 2 U ,
x 11 + x 21 0.3 b 1 L + 0.7 b 1 U ,
x 12 + x 22 0.2 b 2 L + 0.8 b 2 U ,
x 11 , x 12 , x 21 , x 22 ,   a 1 L , a 1 U , a 2 L , a 2 U ,   b 1 L , b 1 U , b 2 L , b 2 U 0 ,
D 1 ,   D 1 + , D 2 ,   D 2 + 0 ;   ϑ R
The Lagrangean function of the above parametric FGP model follows as:
L =   3.067 D 1 + 0.839 D 2 + ξ 1 [ ( 8.518 + 3.067 ϑ ) x 11 + ( 19.42 + 3.067 ϑ ) x 12   + ( 0.682 + 6.133 ϑ ) x 21 + 1.364 x 22 + D 1 D 1 + + 7.497 ] +   ξ 2 [ 2.8628 x 11 + ( 6.564 + 0.839 ϑ ) x 12 + ( 10.266 + 1.677 ϑ ) x 21 + ( 0.347 + 0.839 ϑ ) x 22 + D 2 D 2 + 13.128   ] +   ϑ 1 [ x 11 3 x 12 x 21 2 x 22 + D 1 2 ] + ϑ 2 [ x 11 2 x 12 3 x 21 x 22 + D 2 4 ] +   τ 1 [ x 11 + x 12 0.2 a 1 L 0.8 a 1 U ] + τ 2 [ x 21 + x 22 0.4 a 2 L 0.6 a 2 U ] +   η 1 [ x 11 x 21 + 0.3 b 1 L + 0.7 b 1 U ] + η 2 [ x 12 x 22 + 0.2 b 2 L + 0.8 b 2 U ] + φ 1 [ x 11 ] +   φ 2 [ x 12 ] + φ 3 [ x 21 ] + φ 4 [ x 22 ] + ψ 1 [ a 1 L ] + ψ 2 [ a 2 L ] + ϕ 1 [ b 1 L ] + ϕ 2 [ b 2 L ] +   ϖ 1 [ a 1 U ] + ϖ 2 [ b 2 U ] + ϵ 1 [ b 1 U ] + ϵ 2 [ b 2 U ] + ζ 1 [ D 1 ] + ζ 2 [ D 2 ] + π 1 [ D 1 + ] +   π 2 [ D 2 + ]
where ϑ , ξ 1 , ξ 2 R , and υ 1 , υ 2 , τ 1 , τ 2 , η 1 , η 2 , φ 1 , φ 2 , φ 3 , φ 4 , ψ 1 , ψ 2 , ϕ 1 , ϕ 2 , ϖ 1 , ϖ 2 , ϵ 1 , ϵ 2 0 , and ζ 1 , ζ 2 , π 1 , π 2 0 , are the Lagrange multipliers. Therefore, KKT optimality conditions follows as:
L x 11 = ( 8.518 + 3.067 ϑ ) ξ 1 2.863 ξ 2 υ 1 υ 2 + τ 1 η 1 φ 1 = 0
L x 12 = ( 19.42 + 3.067 ϑ ) ξ 1 + ( 6.564 + 0.839 ϑ ) ξ 2 3 υ 1 2 υ 2 + τ 1 η 2 φ 2 = 0 ,
L x 21 = ( 0.682 + 6.133 ϑ ) ξ 1 + ( 10.266 + 1.677 ϑ ) ξ 2 υ 1 3 υ 2 + τ 2 η 1 φ 3 = 0 ,
L x 22 = 1.364 ξ 1 + ( 0.347 + 0.839 ϑ ) ξ 2 2 υ 1 υ 2 + τ 2 η 2 φ 4 = 0 ,
L a 1 L = 0.2 τ 1 ψ 1 = 0 ,
L a 1 U = 0.8 τ 1 ϖ 1 = 0 ,
L a 2 L = 0.4 τ 2 ψ 2 = 0 ,
L a 2 U = 0.6 τ 2 ϖ 2 = 0 ,
L b 1 L = 0.3 η 1 ϕ 1 = 0 ,
L b 1 U = 0.7 η 1 ϵ 1 = 0 ,
L b 2 L = 0.2 η 2 ϕ 2 = 0 ,
L b 2 U = 0.8 η 2 ϵ 2 = 0 ,
L D 1 = 3.067 + ξ 1 + v 1 ζ 1 = 0 ,
L D 1 + = ξ 1 π 1 = 0 ,
L D 2 = 0.839 + ξ 2 + υ 2 ζ 2 = 0 ,
L D 2 + = ξ 2 π 2 = 0 ,
υ 1 [ x 11 3 x 12 x 21 2 x 22 + D 1 2 ] = 0 ,   i.e. ,   υ 1 = 0 ,
υ 2 [ x 11 2 x 12 3 x 21 x 22 + D 2 4 ] = 0 ,   i.e. ,   υ 2 = 0 ,
τ 1 [ x 11 + x 12 0.2 a 1 L 0.8 a 1 U ] = 0 ,   i.e. ,     τ 1 = 0 ,  
τ 2 [ x 21 + x 22 0.4 a 2 L 0.6 a 2 U ] = 0 ,   i.e. ,   τ 2 0 ,  
η 1 [ x 11 x 21 + 0.3 b 1 L + 0.7 b 1 U ] = 0 ,   i.e. ,   η 1 = 0 ,
η 2 [ x 12 x 22 + 0.2 b 2 L + 0.8 b 2 U ] = 0 ,   i.e. ,   η 2 = 0 ,
φ 1 [ x 11 ] = 0 ,   i.e. ,   φ 1 0 ,
φ 2 [ x 12 ] = 0 ,   i.e. ,   φ 2 = 0 ,
φ 3 [ x 21 ] = 0 ,     i.e. ,   φ 3 = 0 ,
φ 4 [ x 22 ] = 0 ,   i.e. ,   φ 4 = 0 ,
ψ 1 [ a 1 L ] = 0 ,   i.e. ,   ψ 1 = 0 ,
ψ 2 [ a 2 L ] = 0 ,   i.e. ,   ψ 2 = 0 ,
ϕ 1 [ b 1 L ] = 0 ,   i.e. ,   ϕ 1 = 0 ,
ϕ 2 [ b 2 L ] = 0 ,   i.e. ,   ϕ 2 = 0 ,
ϖ 1 [ a 1 U ] = 0 ,   i.e. ,   ϖ 1 = 0 ,
ϖ 2 [ a 2 U ] = 0 ,   i.e. ,   ϖ 2 = 0 ,
ϵ 1 [ b 1 U ] = 0 ,   i.e. ,   ϵ 1 = 0 ,
ϵ 2 [ b 2 U ] = 0 ,   i.e. ,   ϵ 2 = 0 ,
ζ 1 [ D 1 ] = 0 ,   i.e. , ζ 1 0 ,
ζ 2 [ D 2 ] = 0 ,   i.e. ,   ζ 2 = 0 ,
π 1 [ D 1 + ] = 0 ,   i.e. ,   π 1 0 ,
π 2 [ D 2 + ] = 0 ,   i.e. ,   π 2 0 ,
x 11 3 x 12 x 21 2 x 22 + D 1 2 ,
x 11 2 x 12 3 x 21 x 22 + D 2 4 ,
x 11 + x 12 0.2 a 1 L + 0.8 a 1 U ,
x 21 + x 22 0.4 a 2 L + 0.6 a 2 U ,
x 11 + x 21 0.3 b 1 L + 0.7 b 1 U ,
x 12 + x 22 0.2 b 2 L + 0.8 b 2 U ,
x 11 , x 12 , x 21 , x 22 ,   a 1 L , a 1 U , a 2 L , a 2 U ,   b 1 L , b 1 U , b 2 L , b 2 U , D 1 ,   D 1 + , D 2 ,   D 2 + 0 ;   ϑ R
Solving the above system of Equation. we get: υ 1 = υ 2 = τ 1 = τ 2 = η 1 = η 2 = φ 2 = φ 3 = φ 4 = ψ 1 = ψ 2 = ϕ 1 = ϕ 2 = ϖ 1 = ϖ 2 = ϵ 1 = ϵ 2 = ζ 2 = 0 , and φ 1 , ζ 1 , π 1 , π 2 0 . Also, ξ 2 = π 2 = 0.839 ,   ξ 1 = π 1 . The above system of Equation is reduced to the following:
( 8.518 + 3.067 ϑ ) ξ 1 2.863 ξ 2 φ 1 = 0 ,
( 19.42 + 3.067 ϑ ) ξ 1 + ( 6.564 + 0.839 ϑ ) ξ 2 = 0 ,
( 0.682 + 6.133 ϑ ) ξ 1 + ( 10.266 + 1.677 ϑ ) ξ 2 = 0 ,
1.364 ξ 1 + ( 0.347 + 0.839 ϑ ) ξ 2 = 0 ,
Therefore, the SSFK for the parametric IF-MOFTP is given by:
S 1 ( 0 , 165.88 ,   76.39 ,   163.61 ,   0 ,   0 ,   726.78 ,   0 )   = { ϑ R ,   α , β [ 0 , 1 ] | 12.948   ξ 1 + [ 1.41 + 6.133 ξ 1 ] ϑ + 5.799 φ 1 = 0 , ξ 1 = ζ 1 3.67 ;   ξ 1 = π 1 ;   ξ 2 = π 2 = 0.839 , ζ 1 ,   φ 1 , π 1 , π 2 0 ;   ξ 1 , ξ 2 R }
After applying the KKT optimality conditions we obtain a large system of algebraic equations. By reducing and solving the algebraic system of equations the SSFK is obtained. The SSFK introduces the values and relations between different parameters which generate the same solution of the PIF-MOFTP as indicated by set S 1 . To test the obtained results of the SSFK, different values of α , β [ 0 , 1 ] will be taken and the solution will remain the same.

8. Conclusions

The SSFK for the PIF-MOFTP was investigated in this study. Also, we characterized definitions of the set of feasible parameters and the solvability set for PIF-MOFTP. First, the concept of ( α , β ) -cut methodology was applied to get the parametric model. Moreover, the FGP approach was applied to find a ( α , β ) -Pareto optimal solution for PIF-MOFTP which has not been published in the literature to date. To obtain the SSFK for the novel model of PIF-MOFTP, the KKT necessary optimality conditions are applied. After applying the KKT optimality conditions, we obtained a large system of algebraic equations. By reducing and solving the algebraic system of equations, the SSFK was obtained. A detailed procedure that determines the SSFK for the PIF-MOFTP was exhibited. A numerical example was given to ensure the applicability and efficiency of the proposed PIF-MOFTP.
The major limitation of the proposed PIF-MOFTP is that a specific ( α , β ) -level is adopted in the proposed methods to represent the confidence level on DMs’ subjective uncertainty to specify parameter values in the PIF-MOFTP. For simplification, the ( α , β ) -level for all parameters of the supply and demand in the solution process are assumed to be the same. However, these may be limitations in practical applications. The determination of ( α , β ) -levels for various DMs’ subjective uncertainties could be different in the real world due to DMs’ different consideration of the real transportation data. Thus, this will be addressed in future studies.
Several remaining areas of research in the topic of parametric MOFTP include the following:
  • The parametric study of multi-choice MOTP should be addressed.
  • Real-world PIF-MOFTP is a vital field in the future research.
  • Rough parametric MOFTP is a vital topic to be investigated.

Author Contributions

Conceptualization, M.A.E.S., M.A.E.-S. and F.A.F.; Methodology, M.A.E.S., F.A.F. and M.A.E.; Investigation, M.A.E.S., M.A.E.-S., A.F.F. and M.A.E.; writing—review and editing, M.A.E.S., M.A.E.-S., A.F.F., M.A.E. and F.A.F. 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.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ammar, E.E.; Youness, E.A. Study on multi-objective transportation problem with fuzzy numbers. Appl. Math. Comput. 2005, 166, 241–253. [Google Scholar]
  2. Bit, A.K.; Biswal, M.P.; Alam, S.S. Fuzzy programming approach to multi-criteria decision-making transportation problem. Fuzzy Sets Syst. 1992, 50, 135–141. [Google Scholar] [CrossRef]
  3. Cetin, N.; Tiryaki, F. A Fuzzy Approach Using Generalized Dinkelbach’s Algorithm for Multiobjective Linear Fractional Transportation Problem. Math. Probl. Eng. 2014, 2014, 702319. [Google Scholar] [CrossRef]
  4. Chanas, S.; Kuchta, D. A concept of the optimal solution of the transportation problem with fuzzy cost coefficients. Fuzzy Sets Syst. 1996, 82, 299–305. [Google Scholar] [CrossRef]
  5. Charnes, A.; Cooper, W.W. The steppingstone method for explaining linear programming calculation in transportation problem. Manag. Sci. 1954, 1, 49–69. [Google Scholar] [CrossRef]
  6. Diaz, J.A. Finding a complete description of all efficient solutions to a multi-objective transportation problem. Ekon.-Mat. Obz. 1979, 15, 62–73. [Google Scholar]
  7. El Sayed, M.; Abo-Sinna, M.A. A novel Approach for Fully Intuitionistic Fuzzy Multi-Objective Fractional Transportation Problem. Alex. Eng. J. 2020, 60, 1447–1463. [Google Scholar] [CrossRef]
  8. Beaula, T.; Priyadharsini, M. A new algorithm for finding a fuzzy optimal solution for intuitionistic fuzzy transportation problems. Int. J. Appl. Fuzzy Sets Artif. Intell. 2015, 5, 183–192. [Google Scholar]
  9. Arya, R.; Singh, P.; Kumari, S.; Obaidat, M.S. An approach for solving fully fuzzy multi-objective linear fractional optimization problems. Soft Comput. 2020, 24, 9105–9119. [Google Scholar] [CrossRef]
  10. Ebrahimnejad, A.; Verdegay, J.L. A new approach for solving fully intuitionistic fuzzy transportation problems. Fuzzy Optim. Decis. Mak. 2017, 17, 447–474. [Google Scholar] [CrossRef]
  11. Liou, J.J.; Hsu, C.-C.; Chen, Y.-S. Improving transportation service quality based on information fusion. Transp. Res. Part A Policy Pract. 2014, 67, 225–239. [Google Scholar] [CrossRef]
  12. Ergun, O.; Kuyzu, G.; Savelsbergh, M. Reducing truckload transportation through collaboration. Transp. Sci. 2007, 41, 206–221. [Google Scholar] [CrossRef] [Green Version]
  13. Sheu, J.B.; Chen, Y.J. Transportation and economics of scale in recycling low-value materials. Transp. Res. Part B Methodol. 2014, 65, 65–76. [Google Scholar] [CrossRef]
  14. Roy, S.K.; Maity, G.; Weber, G.-W. Multi-objective two-stage grey transportation problem using utility function with goals. Cent. Eur. J. Oper. Res. 2016, 25, 417–439. [Google Scholar] [CrossRef]
  15. Roy, S.K.; Maity, G.; Weber, G.W.; Gök, S.Z.A. Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal. Ann. Oper. Res. 2017, 253, 599–620. [Google Scholar] [CrossRef]
  16. Roy, S.K.; Mahapatra, D.R. Multi-objective interval valued transportation probabilistic problem involving lognormal. Int. J. Math. Sci. Comput. 2011, 1, 14–21. [Google Scholar]
  17. Roy, S.K. Multi-choice stochastic transportation problem involving Weibull distribution. Int. J. Oper. Res. 2014, 21, 38. [Google Scholar] [CrossRef]
  18. Maity, G.; Roy, S.K.; Verdegay, J.L. Multi-objective transportation problem with cost reliability under uncertain environment. Int. J. Comput. Intell. Syst. 2016, 9, 839–849. [Google Scholar] [CrossRef] [Green Version]
  19. Maity, G.; Roy, S.K. Solving a multi-objective transportation problem with nonlinear cost and multi-choice demand. Int. J. Manag. Sci. Eng. Manag. 2014, 11, 62–70. [Google Scholar] [CrossRef]
  20. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  21. Gong, Z.; Zhangc, N.; Chiclanad, F. The optimization ordering model for intuitionistic fuzzy preference relations with utility functions. Knowl.-Based Syst. 2018, 162, 174–184. [Google Scholar] [CrossRef] [Green Version]
  22. Jana, B.; Roy, T.K. Multi-objective intuitionistic fuzzy linear programming and its application in transportation model. Notes Intuit. Fuzzy Sets 2007, 13, 34–51. [Google Scholar]
  23. Verma, R.; Biswal, M.; Biswas, A. Fuzzy programming technique to solve multi-objective transportation problems with some non-linear membership functions. Fuzzy Sets Syst. 1997, 91, 37–43. [Google Scholar] [CrossRef]
  24. Gourav, G.; Kumari, A. An efficient method for solving intuitionistic fuzzy transportation problem of type-2. Int. J. Appl. Comput. Math. 2017, 3, 3795–3804. [Google Scholar]
  25. Gupta, A.; Kumar, A. A new method for solving linear multi-objective transportation problems with fuzzy parameters. Appl. Math. Model. 2012, 36, 1421–1430. [Google Scholar] [CrossRef] [Green Version]
  26. Maity, G.; Roy, S.K. Solving multi-choice multi-objective transportation problem: A utility function approach. J. Uncertain. Anal. Appl. 2014, 2, 11. [Google Scholar] [CrossRef] [Green Version]
  27. Mahajan, S.; Gupta, S.K. On fully intuitionistic fuzzy multiobjective transportation problems using different membership functions. Ann. Oper. Res. 2019, 296, 211–241. [Google Scholar] [CrossRef]
  28. El Sayed, M.; Farahat, F. Study of Achievement Stability Set for Parametric Linear FGP Problems. Ain Shams Eng. J. 2020, 11, 1345–1353. [Google Scholar] [CrossRef]
  29. Veeramani, C.; Edalatpanah, S.A.; Sharanya, S. Solving the Multiobjective Fractional Transportation Problem through the Neutrosophic Goal Programming Approach. Discret. Dyn. Nat. Soc. 2021, 2021, 7308042. [Google Scholar] [CrossRef]
  30. Pramanik, S.; Banerjee, D. Multi-objective chance constrained capacitated transportation problem based on fuzzy goal programming. Int. J. Comput. Appl. 2012, 44, 42–46. [Google Scholar] [CrossRef]
  31. Edalatpanah, S.A. A nonlinear approach for neutrosophic linear programming. J. Appl. Res. Ind. Eng. 2019, 6, 367–373. [Google Scholar] [CrossRef]
  32. Rizk-Allah, R.M.; Hassanien, A.E.; Elhoseny, M. A multi-objective transportation model under neutrosophic environment. Comput. Electr. Eng. 2018, 69, 705–719. [Google Scholar] [CrossRef] [Green Version]
  33. 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]
  34. Emam, O.E. A parametric study on multi-objective integer quadratic programming problems under uncertainty. Gen. Math. Notes 2011, 6, 49–60. [Google Scholar]
  35. Osman, M.S. Qualitative analysis of basic notions in parametric convex programming, (parameters in the objective function). Apl. Mat. 1977, 22, 333–348. [Google Scholar] [CrossRef]
  36. Osman, M.S.; Emam, O.E.; El Sayed, M.A. On Parametric Multi-level Multi-objective Fractional Programming Problems with Fuzziness in the Constraints. Br. J. Math. Comput. Sci. 2016, 18, 1–19. [Google Scholar] [CrossRef] [PubMed]
  37. Hsien-Chung, W. The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions. Fuzzy Optim. Decis. Mak. 2009, 8, 1–28. [Google Scholar]
  38. Saad, O.M. On stability of proper efficient solutions in multi-objective fractional programming problems under fuzziness. Math. Comput. Model. 2007, 45, 221–231. [Google Scholar] [CrossRef]
  39. Saad, O.M.; Hughes, J.B. Bicriterion integer linear fractional programs with parameters in the objective functions. J. Inf. Optim. Sci. 1998, 19, 97–108. [Google Scholar] [CrossRef]
  40. Saad, O.M.; Elshafei, M.M.; Sleem, M.M. On some stability notions for fuzzy three-level fractional programming problem. Math. Sci. Lett. 2021, 10, 23–34. [Google Scholar]
  41. Mahapatra, G.S.; Roy, T.K. Intuitionistic Fuzzy Number and Its Arithmetic Operation with Application on System Failure. J. Uncertain Syst. 2013, 7, 92–107. [Google Scholar]
  42. Mahmoodirad, A.; Allahviranloo, T.; Niroomand, S. A new effective solution method for fully intuitionistic fuzzy transportation problem. Soft Comput. 2019, 23, 4521–4530. [Google Scholar] [CrossRef]
  43. Roy, S.K.; Ebrahimnejad, A.; Verdegay, J.L.; Das, S. New approach for solving intuitionistic fuzzy multi-objective transportation problem. Sadhana 2018, 43, 3. [Google Scholar] [CrossRef] [Green Version]
  44. Mohamed, R.H. The relationship between goal programming and fuzzy programming. Fuzzy Sets Syst. 1997, 89, 215–222. [Google Scholar] [CrossRef]
  45. Pal, B.B.; Moitra, B.N.; Maulik, U. A goal programming procedure for fuzzy multi-objective linear fractional programming problem. Fuzzy Sets Syst. 2003, 139, 395–405. [Google Scholar] [CrossRef]
  46. Zangiabadi, M.; Maleki, H.R. Fuzzy goal programming technique to solve multi-objective transportation problems with some non-linear membership functions. Iran. J. Fuzzy Syst. 2013, 10, 61–74. [Google Scholar]
  47. Osman, M.; Emam, O.; El Sayed, M.A. Interactive Approach for Multi-Level Multi-Objective Fractional Programming Problems with Fuzzy Parameters. Beni-Suef Univ. J. Basic Appl. Sci. 2018, 7, 139–149. [Google Scholar] [CrossRef]
Figure 1. Triangular Intuitionistic Fuzzy number.
Figure 1. Triangular Intuitionistic Fuzzy number.
Fractalfract 05 00233 g001
Figure 2. The ( α , β ) -cut of a TIFN.
Figure 2. The ( α , β ) -cut of a TIFN.
Fractalfract 05 00233 g002
Table 1. The coefficient of the linearized membership goals ( c i j ) T  and Gij.
Table 1. The coefficient of the linearized membership goals ( c i j ) T  and Gij.
Z1(x)Z2(x)
( c i j q ) T ( 0.682 10.22 19.081 1.364 ) T ( 2.8628 4.048 5.234 2.1688 ) T
Gij−7.49713.128
Table 2. The coefficients of the linearized membership goals [ ( c i j + ϑ ω i j ) ( q ) ] T   a n d   G i j .
Table 2. The coefficients of the linearized membership goals [ ( c i j + ϑ ω i j ) ( q ) ] T   a n d   G i j .
Z 1 ( x , ϑ ) Z 2 ( x , ϑ )
[ ( c i j + ϑ ω i j ) ( q ) ] T ( 8.518 + 3.067 ϑ 19.42 + 3.067 ϑ 0.682 + 6.133 ϑ 1.364 ) T ( 2.863 6.564 + 0.839 ϑ 10.266 + 1.677 ϑ 0.347 + 0.839 ϑ ) T  
Gij7.49713.128
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

El Sayed, M.A.; El-Shorbagy, M.A.; Farahat, F.A.; Fareed, A.F.; Elsisy, M.A. Stability of Parametric Intuitionistic Fuzzy Multi-Objective Fractional Transportation Problem. Fractal Fract. 2021, 5, 233. https://doi.org/10.3390/fractalfract5040233

AMA Style

El Sayed MA, El-Shorbagy MA, Farahat FA, Fareed AF, Elsisy MA. Stability of Parametric Intuitionistic Fuzzy Multi-Objective Fractional Transportation Problem. Fractal and Fractional. 2021; 5(4):233. https://doi.org/10.3390/fractalfract5040233

Chicago/Turabian Style

El Sayed, Mohamed A., Mohamed A. El-Shorbagy, Farahat A. Farahat, Aisha F. Fareed, and Mohamed A. Elsisy. 2021. "Stability of Parametric Intuitionistic Fuzzy Multi-Objective Fractional Transportation Problem" Fractal and Fractional 5, no. 4: 233. https://doi.org/10.3390/fractalfract5040233

APA Style

El Sayed, M. A., El-Shorbagy, M. A., Farahat, F. A., Fareed, A. F., & Elsisy, M. A. (2021). Stability of Parametric Intuitionistic Fuzzy Multi-Objective Fractional Transportation Problem. Fractal and Fractional, 5(4), 233. https://doi.org/10.3390/fractalfract5040233

Article Metrics

Back to TopTop