Next Article in Journal
Are MCDA Methods Benchmarkable? A Comparative Study of TOPSIS, VIKOR, COPRAS, and PROMETHEE II Methods
Previous Article in Journal
Geometrical Formulation for Adjoint-Symmetries of Partial Differential Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fuzzy Goal Programming with an Imprecise Intuitionistic Fuzzy Preference Relations

by
Abdul Razzaq Abdul Ghaffar
1,
Md. Gulzarul Hasan
2,*,
Zubair Ashraf
3 and
Mohammad Faisal Khan
4
1
Department of Statistics and Operations Research, College of Science, King Saud University, Riyadh-11451, Saudi Arabia
2
Department of Mathematics, Madanapalle Institute of Technology and Science, Madanapalle-517325, India
3
Department of Computer Science, South Asian University, New Delhi-110021, India
4
College of Science and Theoretical studies, Saudi Electronic University, Riyadh-11673, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(9), 1548; https://doi.org/10.3390/sym12091548
Submission received: 30 July 2020 / Revised: 10 September 2020 / Accepted: 12 September 2020 / Published: 19 September 2020
(This article belongs to the Section Mathematics)

Abstract

:
Fuzzy goal programming (FGP) is applied to solve fuzzy multi-objective optimization problems. In FGP, the weights are associated with fuzzy goals for the preference among them. However, the hierarchy within the fuzzy goals depends on several uncertain criteria, decided by experts, so the preference relations are not always easy to associate with weight. Therefore, the preference relations are provided by the decision-makers in terms of linguistic relationships, i.e., goal A is slightly or moderately or significantly more important than goal B. Due to the vagueness and ambiguity associated with the linguistic preference relations, intuitionistic fuzzy sets (IFSs) are most efficient and suitable to handle them. Thus, in this paper, a new fuzzy goal programming with intuitionistic fuzzy preference relations (FGP-IFPR) approach is proposed. In the proposed FGP-IFPR model, an achievement function has been developed via the convex combination of the sum of individual grades of fuzzy objectives and amount of the score function of IFPRs among the fuzzy goals. As an extension, we presented the linear and non-linear, namely, exponential and hyperbolic functions for the intuitionistic fuzzy preference relations (IFPRs). A study has been made to compare and analyze the three FGP-IFPR models with intuitionistic fuzzy linear, exponential, and hyperbolic membership and non-membership functions. For solving all three FGP-IFPR models, the solution approach is developed that established the corresponding crisp formulations, and the optimal solution are obtained. The validations of the proposed FGP-IFPR models have been presented with an experimental investigation of a numerical problem and a banking financial statement problem. A newly developed distance measure is applied to compare the efficiency of proposed models. The minimum value of the distance function represents a better and efficient model. Finally, it has been found that for the first illustrative problem considered, the exponential FGP-IFPR model performs best, whereas for the second problem, the hyperbolic FGP-IFPR model performs best and the linear FGP-IFPR model shows worst in both cases.

1. Introduction

Multi-objective programming is a robust analytical method for the formulation of real-world problems in which two or more than two goals have to be optimized, simultaneously. It has been favourably implemented for various applications in the field of engineering, economics, machine learning, manpower planning etc., see Ull Hasan et al. [1], Hasan and Hasan [2], Hasan et al. [3,4], Ashraf et al. [5,6], Muhuri et al. [7], Suttorp and Igel [8], Marler and Arora [9], Alexandropoulos et al. [10], Bora et al. [11], Breen et al. [12], Kumar et al. [13], Palacios [14], Nepomuceno [15], Caqo et al. [16], Ashraf et al. [17], Zheng et al. [18], Yang and Chou [19].
The mathematical formulation of classical multi-objective programming is as follows:
Max ( Min ) : Z 1 ( X ) , Z 2 ( X ) , , Z K ( X ) ,
subject to A x b
x 0 , x S .
where Z k ( X ) k = 1 , 2 , , K represents the k-th objective function of decision variable X and S is the set of feasible solutions. Equation (2) represents the constraints of the optimization problem where A and b are the m × n and n × 1 dimensional matrices, respectively.
Goal programming (GP) is a regularly used methodology to overcome the multi-objective programming problems. Since, the initial proposal of GP by Charnes et al. Charnes et al. [20], Charnes and Cooper [21], several researchers, including Ignizio [22], Ignizio [23], Romero [24], Romero [25], Chang [26], Caballero and Go [27] and others expanded it theoretically as well practically. GP performs with the over-optimistic and under-pessimistic accomplishment of the objectives (goals) so that each goal is met with the smallest divergence from their particular target. In traditional GP, the aspiration level provides the best achievement value with the respective goal are explicitly acknowledged, though in real-world applications, the aspiration levels in the multi-objective decision-making problem are mostly not-precise. As a result, over the years, the principles of the fuzzy set approach was successfully utilized in GP.
Zadeh [28] initially offered the fuzzy sets (FSs). Following the proposal of FSs, Bellman and Zadeh [29] elaborated the decision approach in the imprecise context. Uncertainties, incorporated in GPs, due to the vagueness and ambiguity, are being handled by the concept of fuzzy decisions. The significance of accomplishment within every optimizing goal is greatly enhanced in fuzzy optimization methods, which enables the decision-maker (DM) to determine the best suitable result. The judgement of DM gets more and more difficult as the problem requires vague preferences for the target goals and their level of aspiration. Many researchers propose fuzzy goal programming (FGP) models, for example, Chen and Tsai [30], Aköz and Petrovic [31], Pramanik and Roy [32], Cheng [33], Jadidi et al. [34] and Jana et al. [35]. Among them, the most commonly used FGP method for solving multi-objective mathematical programming problems is proposed by Aköz and Petrovic [31]. In Aköz and Petrovic [31] approach, the importance relations among goals is imprecise and represented via linguistic terms, for example, Goal A is slightly or moderately or significantly more important than Goal B.
In the last few decades, the imprecise preference relation in FGP is applied to numerous real-world applications and theoretically extended by several other authors, such as Petrovic and Aköz [36], Torabi and Moghaddam [37], Khalili-Damghani and Sadi-Nezhad [38], Cheng [33], Díaz-Madroñero et al. [39], Sheikhalishahi and Torabi [40], Khan et al. [41], Bilbao-Terol et al. [42], Bilbao-Terol et al. [43] and Arenas-Parra et al. [44]. Some well-known research works that has been carried out in FGP has been summarized in Table 1. In Table 1, a summary of existing related work is presented and classified the concerning uncertainty incorporated in imprecise preference relations, choice of membership function (MF) for linguistic relation and the area of application. All existing FGP models dealing the imprecise preference relations with maximization of the belongingness degree. However, they do not consider the uncertainty causes by vagueness, incorrect data, and deliberate decisions. In addition, the hesitations among the DMs due to lack of information and conflicting choices might play a critical role in the imprecise preference relations. Thus, the FGP methods with the fuzzy membership function that represent the degree of belongingness for such situations are insufficient. The higher-order fuzzy sets have been proposed as the generalization of fuzzy sets to overcome these situations. The most popular and widely used higher order fuzzy set is named as intuitionistic fuzzy set (IFS). The concept of IFS was first introduced by Atanassov [45] and later on, Angelov [46] discussed the optimization problem in intuitionistic fuzzy environment.
In IFS, the membership and non-membership function represent the degree of belongingness and non-belongingness, respectively, instead of single MF. Intuitionistic fuzzy optimization technique simultaneously consider both aspects of satisfaction degree, which consists maximization of belongingness and minimization of non-belongingness for different objectives. Therefore, the IFS is a better choice to deal with the imprecise preference relations rather than fuzzy set because of the non-belongingness degree of the imprecise relations among fuzzy goals. Many authors Bharati and Singh [47], Seikh et al. [48], Ebrahimnejad and Verdegay [49], Kour et al. [50], Zhao et al. [51], Singh and Yadav [52], Mahajan and Gupta [53] and Roy et al. [54] discussed the real-life applications in intuitionistic fuzzy environment.
Moreover, from the literature, it could be observed that most of the existing works on FGP having the linguistic importance preference relation modeled with linear membership satisfaction degree. A linear MF is the simplest and commonly used MF in the fuzzy set. It is defined by fixing the lower and upper end points of the acceptability level. However, a linear MF is not necessarily the desirable representation for many real-life scenarios. Because the fuzzy goals that contain vagueness and ambiguity with a linear degree of belonging are somehow may not represent the real-life situation. Additionally, the imprecise preference relation between Goal A and Goal B also needs not to be linear. Hence, the most commonly known non-linear MFs that is Gaussian, and exponential MFs are developed that lead to a better description of the achievement level. The non-linear MFs are also not kind enough to represent all practical situations because the marginal MFs value is not deterministic. Non-linear MFs’ typical nature enables them to adjust their accomplishment values as per the conditions, enabling the DMs to implement their scheme with consistency in quite a satisfying way (Khan et al. [41], Singh and Yadav [52], Gupta and Mehlawat [58]).
Based on the above discussion, we have proposed fuzzy goal programming with intuitionistic fuzzy preference relation (FGP-IFPR) among fuzzy goals to model the problems with uncertainties and ambiguities more realistically. In the proposed FGP-IFPR model, we have presented the linear and non-linear MFs, which are used in the representation of the intuitionistic fuzzy preference relations (IFPR). A new achievement function consists of individual MF of objective functions, and score functions are utilized to measure the efficiency of different models. A distance function is developed for the proposed FGP-IFPR. To best of our knowledge and belief, no one has discussed in this domain so far. Therefore, this present work fills the gap as mentioned earlier.
The significant contributions of the work are summarized as follows:
  • A novel fuzzy goal programming with intuitionistic fuzzy preference relation named as FGP-IFPR is proposed for multi-objective programming problems.
  • Decision-makers provide the IFPRs among the goals in linguistic terms, such as, slightly more important, moderately more important, and significantly more important.
  • Intuitionistic fuzzy membership and non-membership functions, linear as well as non-linear, represent the linguistic preference relations.
  • New intuitionistic fuzzy exponential and hyperbolic functions are designed to portrait the IFPRs between the fuzzy objective functions.
  • For the extensive analysis and comparison, three different FGP-IFPR models are formulated corresponding to intuitionistic fuzzy linear, exponential and hyperbolic functions.
  • For solving all three FGP-IFPR models corresponding crisp formulations are established, and the results are thoroughly compared by using a new distance function that identifies the efficiency of models.
  • Experimental simulations are conducted on a well-known illustrative numerical example and financial banking statement application.
The rest of the paper is organized as follows: In Section 2, the basic definitions regarding fuzzy set and intuitionistic fuzzy set are discussed. Section 3 presents the basic FGP, the proposed FGP-IFPR, and intuitionistic fuzzy membership and non-membership functions. In Section 4, the solution approach to the proposed models is presented. Section 5 shows an experimental study to the proposed models. A numerical example and a banking sector problem have been studied in order to show the real-life application of the proposed approach. Finally, conclusions, limitations, and future scope have been discussed in Section 6.

2. Preliminaries

In this section, we have discussed some basic definitions and related terms of the fuzzy sets and intuitionistic fuzzy sets, see [28,51,59,60,61].
Definition 1.
Let X be the classical set of objects, therefore the set of ordered pairs W ˜ = { ( x , μ W ˜ ( x ) ) : x X } is said to be a fuzzy set, where μ W ˜ ( x ) : X [ 0 , 1 ] is called the membership function of W ˜ .
Definition 2.
An intuitionistic fuzzy set is given by ordered triplets as follows:
W ˜ = { x , μ W ˜ ( x ) , ν W ˜ ( x ) : x X }
where, μ W ˜ ( x ) : X [ 0 , 1 ] ; ν W ˜ ( x ) : X [ 0 , 1 ] such that, 0 μ W ˜ ( x ) + ν W ˜ ( x ) 1 . The  μ W ˜ ( x ) and ν W ˜ ( x ) denotes the membership and non-membership function of the element x into the set W ˜ .
For IFS W ˜ , λ W ˜ ( x ) = { 1 μ W ˜ ( x ) ν W ˜ ( x ) , x X } is called the intuitionistic index of the element x in the set W ˜ . It is also called as hesitancy degree of x to W ˜ . An ordinary fuzzy set is a special case of intuitionistic fuzzy set for which ν W ˜ ( x ) = 1 μ W ˜ ( x ) . It determines the amount of uncertainty about belongingness or non-belongingness of x to W ˜ . The larger the degree of hesitation, the more the uncertainty of belongingness (or not) x to W ˜ .
Definition 3.
In the IFS, θ W ˜ ( x ) is called the score function and defined as:
θ W ˜ ( x ) = { μ W ˜ ( x ) ν W ˜ ( x ) , x X } , such that , 1 θ W ˜ ( x ) 1

3. Fuzzy Goal Programming with Intuitionistic Fuzzy Preference Relations

This section is about the detailing of the basic model of FGP, FGP with linear fuzzy preference relation, linear and non-linear intuitionistic fuzzy membership and non-membership functions and proposed FGP with intuitionistic fuzzy preference relations (FGP-IFPR) formulation. This section also provides intuitionistic fuzzy formulations for linear, exponential and hyperbolic functions of preference relations.

3.1. Basic Fuzzy Goal Programming Model

Multi-objective optimization problems are widespread in day to day life. In real life, it is not always possible to have precise aspiration levels for the goals. When the goals have imprecise aspiration levels than we apply fuzzy goal programming (FGP). FGP is a technique to provide a solution when the decision-maker (DM) is allowed to specify imprecise aspiration levels to the objectives. An objective with an imprecise aspiration level can be treated as a fuzzy goal. Let Z = { Z k : k = 1 , , K } be a set of fuzzy goals, having maximization (B) and minimization (C) type fuzzy goals. The FGP model by Tiwari et al. [62] can be written as follows:
Optimize : x Z k ( x ) a k , Z k B Z k ( x ) a k Z k C such that : A x b x 0
Here, optimize means to find an optimal (maximum or minimum or both) solution x such that all the fuzzy goals are satisfied. In addition, ⪆ and ⪅ implies the fuzzy linguistic terms essentially greater than or equal to and essentially less than or equal to, respectively. A x b represents the constraints in vectors. Moreover, a k represents the aspiration level for kth goal Z k . Fuzzy aspiration levels are either provided by the DM or determined from the payoff table. The payoff table is obtained by solving the defuzzified model separately for each objective and determine other objectives for each solution.
Let us assume that u k and t k , k = 1 , , K are the upper and lower limits for minimization and maximization type fuzzy goals, respectively, with  a k as their aspiration levels. Then, the MF ( μ k ) for the objective function Z k corresponding to each situation can be modelled as follows:
  • For the maximization type fuzzy goal, we have:
    μ k = 0 , Z k t k Z k t k a k t k , t k < Z k < a k 1 , Z k a k
  • For minimization type fuzzy goal, we have:
    μ k = 1 , Z k a k u k Z k u k a k , a k < Z k < u k 0 , Z k u k
Due to the conflicting nature of objective functions, it may not always be easy to provide the crisp weight to the most preferred/desired goals over others. In this situation, uncertainty may be incorporated in relative preference relation among the goals, or simultaneously the use of relative preference relation among the goals, which may contain some vagueness and hesitation from the DM’s point of view. When there lies fuzzy relations in linguistic terms like “slightly or significantly or moderately more important” then we employ the Aköz and Petrovic [31] model, which gives a fuzzy goal method with imprecise goal hierarchy. Basically, three fuzzy relations R ˜ 1 ( k , l ) , R ˜ 2 ( k , l ) and R ˜ 3 ( k , l ) for “kth goal is slightly more important than lth goal”, “kth goal is moderately more important than lth goal” and “kth goal is significantly more important than lth goal” are used with MFs μ R ˜ 1 ( k , l ) , μ R ˜ 2 ( k , l ) and μ R ˜ 3 ( k , l ) , respectively. These MFs of fuzzy preference relations are defined as follows:
μ R ˜ 1 ( k , l ) = μ k μ l + 1 , if 1 μ k μ l 0 ; 1 , 0 μ k μ l 1 .
μ R ˜ 2 ( k , l ) = μ k μ l + 1 2 , 1 μ k μ l 1 ;
μ R ˜ 3 ( k , l ) = 0 , 1 μ k μ l 0 ; μ k μ l , 0 μ k μ l 1 .
Thus, the FGP model shown in Equation (6) with fuzzy hierarchies as in Aköz and Petrovic [31] is formulated as:
  • Objective-1: It maximizes the sum of achievement levels of all the fuzzy goals Z k .
    Maximize k = 1 K μ k
  • Objective-2: It maximizes the sum of membership grades for the fuzzy preference relations.
    Maximize k = 1 K l = 1 K b k l μ R ˜ ( k , l )
    Convex combination of the two objectives by applying the respective weights α and ( 1 α ) to obtain a compromise solution between the two objectives becomes:
    Maximize Z = α ( k = 1 K μ k ) + ( 1 α ) ( k = 1 K l = 1 K b k l μ R ˜ ( k , l ) )
    subject to , μ k = Z k t k a k t k , Z k maximization type fuzzy goal ,
    μ k = u k Z k u k a k , Z k minimization type fuzzy goal ,
    ( μ k μ l + 1 ) μ R ˜ 1 ( k , l ) b k l = 1 and R ˜ ( k , l ) = R ˜ 1 ,
    ( μ k μ l + 1 ) 2 μ R ˜ 2 ( k , l ) b k l = 1 and R ˜ ( k , l ) = R 2 ˜ ,
    ( μ k μ l ) μ R ˜ 3 ( k , l ) b k l = 1 and R ˜ ( k , l ) = R 3 ˜ ,
    A x b ,
    x 0 , 0 μ k 1 , , k = 1 , , K ,
    0 μ R ˜ ( k , l ) 1 for all b k l = 1
    Here, b k l , k , l = 1 , 2 , , K and k l ; be a binary variable, taking value 1 if there is an importance relation defined between the goal Z k and Z l , and 0 otherwise, i.e., value of b k l = 1 , when a fuzzy relation exists otherwise its value is zero. The constraint (14b) and (14c) represents the linear membership functions for maximization and minimization type fuzzy goals whereas, constraints (14d) to (14f) are for the achievement levels of fuzzy imprecise relations. In constraint (14h) and (14i), the non-negativity restrictions to variable x and bound to MFs) are presented.

3.2. Fuzzy Preference Relations under Intuitionistic Fuzzy Enviourment

The concept of multiobjective optimization with FGP only considers the membership grade of each preference relation. It does not consider the hesitation of DM on each preference relation. The vagueness and hesitation due to the imprecise preference relation among goals may be dealt with IFPRs in a very convenient manner. The major advantage of FGP-IFPR over FGP is that it separates the degree of acceptance and non-acceptance over a decision by the decision maker. To include this advantage in problem-solving, we are proposing this FGP-IFPR approach. To efficiently model the problem, we proposed the formulation of linear and non-linear linguistic fuzzy importance relation among different goals based on Aköz and Petrovic [31] model namely, goal k is “slightly more important than” or “moderately more important than” or “significantly more important than” goal l. These linguistic terms has been assigned with the fuzzy relations defined as R ˜ 1 , R ˜ 2 and R ˜ 3 with different membership and non-membership functions μ R ˜ i and ν R ˜ i i = 1 , 2 and 3 respectively.
The hierarchy structure of the problem model is explained through Figure 1. It is divided into five sections as a type of preference relation, linguistic term, intuitionistic fuzzy relation, intuitionistic fuzzy membership function and intuitionistic fuzzy non-membership function. It explains that initially, the linguistic preference on fuzzy goals is assigned by the DM. It may be assigned as linear, exponential or hyperbolic preference relation. As the case is intuitionistic, these relations are further divided into three different categories of slightly, moderately and significantly more and not more important cases. The membership grade provides a satisfaction level of these relations. Whereas, the non-membership grade provides the satisfaction level of the opposite part of preference relation, i.e., not more important. The decision of the type of preference relation completely depends upon the type of real-life problem. The transform function for these preference relation is also defined in Table 2.
Before moving to the proposed FGP-IFPR, we shall first define the formulations for different membership and non-membership functions namely linear (L), exponential (E), and hyperbolic (H) for linguistic preference relations among different goals, which are to be maximized and minimized in order to achieve the importance among goals, respectively.

3.2.1. Linear Membership and Non-Membership Function

The linear membership function of an IFPR for each linguistic term can be defined as follows:
μ R ˜ 1 ( k , l ) L = ( μ k μ l + 1 ) , if 1 μ k μ l 0 ; 1 , if 0 μ k μ l 1 .
μ R ˜ 2 ( k , l ) L = ( μ k μ l + 1 2 ) , if 1 μ k μ l 1 ;
μ R ˜ 3 ( k , l ) L = 0 , if 1 μ k μ l 0 ; ( μ k μ l ) , if 0 μ k μ l 1 .
where, μ R ˜ 1 ( k , l ) L , μ R ˜ 2 ( k , l ) L , and  μ R ˜ 3 ( k , l ) L represents the linear MFs of an IFPR for each linguistic term  { R ˜ 1 , R ˜ 2 , R ˜ 3 } .
The linear non-membership function for the IFPR for each linguistic term can be defined as follows:
ν R ˜ 1 ( k , l ) L = ( μ k μ l ) , if 1 μ k μ l 0 ; 0 , if 0 μ k μ l 1 .
ν R ˜ 2 ( k , l ) L = 1 , if 1 μ k μ l 0 ; 1 ( μ k μ l ) 2 , if 0 μ k μ l 1 .
ν R ˜ 3 ( k , l ) L = 1 , if 1 μ k μ l 0 ; 1 ( μ k μ l ) , if 0 μ k μ l 1 .
where, ν R ˜ 1 ( k , l ) L , ν R ˜ 2 ( k , l ) L , and  ν R ˜ 3 ( k , l ) L represents the linear non-membership function of an IFPR for each linguistic term { R ˜ 1 , R ˜ 2 , R ˜ 3 } . A pictorial demonstration of linear membership and non-membership function of IFPR R ˜ 1 , R ˜ 2 , and  R ˜ 3 are shown in Figure 2.

3.2.2. Exponential Membership and Non-Membership Function

The exponential membership function of an IFPR for each linguistic term can be defined as follows:
μ R ˜ 1 ( k , l ) E = 1 e s * ( μ k μ l + 1 ) 1 e s , if 1 μ k μ l 0 ; 1 , if 0 μ k μ l 1 .
μ R ˜ 2 ( k , l ) E = 1 e s * ( μ k μ l + 1 2 ) 1 e s , if 1 μ k μ l 1 ;
μ R ˜ 3 ( k , l ) E = 0 , if 1 μ k μ l 0 ; 1 e s * ( μ k μ l ) 1 e s , if 0 μ k μ l 1 .
where, μ R ˜ 1 ( k , l ) E , μ R ˜ 2 ( k , l ) E , and  μ R ˜ 3 ( k , l ) E represents the exponential membership function of an IFPR for each linguistic term { R ˜ 1 , R ˜ 2 , R ˜ 3 } . Additionally, s is the measurement of grades of fuzziness and defined by the decision makers according to the ambiguity of the relations.
The exponential non-membership function of an IFPR for each linguistic term can be defined as follows:
ν R ˜ 1 ( k , l ) E = e s * ( μ k μ l + 1 ) e s 1 e s , if 1 μ k μ l 0 ; 0 , if 0 μ k μ l 1 .
ν R ˜ 2 ( k , l ) E = e s * ( μ k μ l + 1 2 ) e s 1 e s , if 1 μ k μ l 1 ;
ν R ˜ 3 ( k , l ) E = 1 , if 1 μ k μ l 0 ; e s * ( μ k μ l ) e s 1 e s , if 0 μ k μ l 1 .
where ν R ˜ 1 ( k , l ) E , ν R ˜ 2 ( k , l ) E , and  ν R ˜ 3 ( k , l ) E represents the exponential non-membership function of an IFPR for each linguistic term { R ˜ 1 , R ˜ 2 , R ˜ 3 } . A pictorial demonstration of exponential membership and non-membership function of IFPRs R ˜ 1 , R ˜ 2 , and  R ˜ 3 are shown in Figure 3.

3.2.3. Hyperbolic Membership and Non-Membership Function

The hyperbolic membership function of an IFPR for each linguistic term can be defined as follows:
μ R ˜ 1 ( k , l ) H = e 3 + 6 ( μ k μ l ) e ( 3 + 6 ( μ k μ l ) ) + e 3 + 6 ( μ k μ l ) + e 3 e 3 + e 3 , if 1 μ k μ l 0 ; 1 , if 0 μ k μ l 1 .
μ R ˜ 2 ( k , l ) H = e 3 ( μ k μ l ) e 3 ( μ k μ l ) + e 3 ( μ k μ l ) , if 1 μ k μ l 1 ;
μ R ˜ 3 ( k , l ) H = 0 , if 1 μ k μ l 0 ; e 3 + 6 ( μ k μ l ) e 3 6 ( μ k μ l ) + e 3 + 6 ( μ k μ l ) e 3 e 3 + e 3 , if 0 μ k μ l 1 .
where, μ R ˜ 1 ( k , l ) H , μ R ˜ 2 ( k , l ) H , and  μ R ˜ 3 ( k , l ) H represents the hyperbolic membership function of an IFPR for each linguistic term { R ˜ 1 , R ˜ 2 , R ˜ 3 } .
The hyperbolic non-membership function of an IFPR for each linguistic term can be defined as follows:
ν R ˜ 1 ( k , l ) H = e ( 3 + 6 ( μ k μ l ) ) e ( 3 + 6 ( μ k μ l ) ) + e 3 + 6 ( μ k μ l ) e 3 e 3 + e 3 , if 1 μ k μ l 0 ; 0 , if 0 μ k μ l 1 .
ν R ˜ 2 ( k , l ) H = e 3 ( μ k μ l ) e 3 ( μ k μ l ) + e 3 ( μ k μ l ) , if 1 μ k μ l 1 ;
ν R ˜ 3 ( k , l ) H = 1 , if 1 μ k μ l 0 ; e 3 6 ( μ k μ l ) e 3 6 ( μ k μ l ) + e 3 + 6 ( μ k μ l ) + e 3 e 3 + e 3 , if 0 μ k μ l 1 .
here, ν R ˜ 1 ( k , l ) H , ν R ˜ 2 ( k , l ) H , and  ν R ˜ 3 ( k , l ) H represents the exponential non-membership function of an IFPR for each linguistic term { R ˜ 1 , R ˜ 2 , R ˜ 3 } . A pictorial demonstration of hyperbolic membership and non-membership function of IFPRs R ˜ 1 , R ˜ 2 , and  R ˜ 3 are shown in Figure 4.
It is to be mentioned that the membership and non-membership function of IFPRs are defined over the transform function μ k μ l where k is not equal to l. k and l, both represents the index of MF of objective function, see Khalili-Damghani et al. [55] and Khalili-Damghani et al. [56]. The membership functions of IFPRs have to be maximizied, whereas, non-membership functions minimized in order to achieve the relative importance among the intuitionistic fuzzy goals.

3.3. Proposed FGP-IFPR Model

Aköz and Petrovic [31] defined the achievement function as a convex combination of the sum of individual membership function of fuzzy goals and the sum of satisfaction degrees of the imprecise linguistic importance relations but here, for FGP-IFPR, we define the achievement function as a convex combination of the sum of individual membership function of fuzzy goals and the sum of score functions of the imprecise linguistic importance relations.
In order to achieve these fuzzy goals, we define score function
S R ˜ i ( k , l ) A = ( μ R ˜ i ( k , l ) A ν R ˜ i ( k , l ) A ) , i = 1 , 2 a n d 3 ,
Let b k l , k , l = 1 , 2 , , K where k l ; be a binary variable, taking value 1 if there is an importance relation defined between the goal Z k and Z l , and 0 otherwise. The lower and upper tolerance limit for each fuzzy goal is represented by t k and u k respectively. So, the proposed model with new achievement function and with weight α in intuitionistic fuzzy environment is formulated as follows:   
Maximize Z = α ( k = 1 K μ k ) + ( 1 α ) ( k = 1 K l = 1 K b k , l S R ˜ i ( k , l ) A )
subject to , μ k = Z k ( x ) t k a k t k , ( M a x i m i z a t i o n t y p e g o a l )
μ k = u k Z k ( x ) u k a k , ( M i n i m i z a t i o n t y p e g o a l )
0 μ k 1
μ R ˜ i ( k , l ) A μ R ˜ i ( k , l )
ν R ˜ i ( k , l ) A ν R ˜ i ( k , l )
S R ˜ i ( k , l ) A = ( μ R ˜ i ( k , l ) A ν R ˜ i ( k , l ) A )
μ R ˜ i ( k , l ) A ν R ˜ i ( k , l ) A
0 μ R ˜ i ( k , l ) A + ν R ˜ i ( k , l ) A 1
0 μ R ˜ ( k , l ) A 1 , 0 ν R ˜ i ( k , l ) A 1 b k l = 1 o r 0
A x b , x 0
i = 1 , 2 a n d 3 ; k , l = 1 , 2 , , K w h e r e k l .
where superscript A = ( L , E , a n d H ) represents the type of membership functions i.e., linear, exponential and hyperbolic used to express the satisfactory degree of decision makers respectively. μ R ˜ i ( k , l ) A and ν R ˜ i ( k , l ) A , A = l i n e a r , e x p o n e n t i a l and h y p e r b o l i c ; represents the type of membership and non-membership function used by the decision makers and i = 1 , 2 and 3 represents the type of linguistic preference relation among different fuzzy goals. μ k represents the membership grade for kth objective function or goal.

4. Solution Approach

The approach to solving the proposed FGP-IFPR models is a composition of several steps. The first step is to formulate the crisp model of the problem with all the goal functions. After that, for determining the tolerance and aspiration values of the respective goal functions, either the crisp model is solved for each objective function or the decision-maker may provide it. The obtained solution should be feasible and optimal. Take the optimum value of objective functions as the target aspiration value. Determine then all of the objective function values for the solution obtained. This step will give us a payoff table (values of extreme solutions), and aspiration, including tolerance level values. Formulate all membership grades for objective functions which are fuzzy goals. Create the transform function for preferential linguistic relationships by using objective functions membership grades. Establish the intuitionistic fuzzy preferential linguistic relationships between different objective functions, and formulate the intuitionistic fuzzy membership and non-membership grades functions. Form the desired intuitionistic fuzzy preference relationship function (IFPR) among the fuzzy goals, it can be either linear or exponential or hyperbolic function. Define the score function by taking the difference of membership and non-membership function of each IFPRs. Now, formulate the FGP-IFPR models for the problem, as detailed in the section above. Solve the formulation using any optimization software packages. We have used the NEOS server online facility provided by Wisconsin Institutes for Discovery at the University of Wisconsin in Madison for solving optimization problems, and AMPL (Fourer et al. [63]) for mathematical modeling of the issues.
In this paper, the obtained FGP-IFPR model has been modeled in AMPL language (Fourer et al. [63]) and solved using solvers available on NEOS server online facility provided by Wisconsin Institutes for Discovery at the University of Wisconsin in Madison for solving optimization problems, see Gropp, W. Moré [64], Czyzyk et al. [65], Dolan [66] and Server [67]. As the results are obtained, we need to investigate the feasibility of solutions. If the result is infeasible, rest the aspiration and tolerance conditions and restart, if not, offer the answer to the experts. The step by step procedure of the solution approach is presented in Algorithm 1 and Figure 5 shows the flow diagram.
Algorithm 1 Solution approach
1:
Input: Data and parametric values of problem.
2:
Output: Optimal solution.
3:
Formulate the crisp multi-objective programming problem.
4:
Consider K-single objective optimization problems and determine the individual optima.
5:
if Aspiration values are not known then
6:
    Find the optimal values of each single objective optimization problem.
7:
Evaluate the membership function for each fuzzy goals.
8:
Define the linguistic preference relations among the different goals by using membership and non-membership functions via choosing linear or non-linear function.
9:
Calculate the score function by considering the difference of membership and non-membership function for each fuzzy preference relation.
10:
Formulate the FGP-IFPR model with their aspiration values.
11:
Apply the optimization toolbox for finding the optimal solutions.
12:
Stop and present the solution obtained to the decision maker.

5. Experimental Study

In order to validate the proposed models, we considered two examples. The first example was a numerical example and second one was a banking application problem. The problems were modeled as the proposed FGP-IFPR using all of the linear, exponential, and hyperbolic membership functions.

5.1. Example 1

In this numerical example, used by Chen and Tsai [30], Aköz and Petrovic [31], Cheng [33] and Arenas-Parra et al. [44], we had to find best solution x = ( x 1 , x 2 , x 3 , x 4 ) for the following multi-objective mathematical programming problem.
Goal 1 : 4 x 1 + 2 x 2 + 8 x 3 + x 4 35
Goal 2 : 4 x 1 + 7 x 2 + 6 x 3 + 2 x 4 100
Goal 3 : x 1 6 x 2 + 5 x 3 + 10 x 4 120
Goal 4 : 5 x 1 + 3 x 2 + 2 x 4 70
Goal 5 : 4 x 1 + 4 x 2 + 4 x 3 40
subject to 7 x 1 + 5 x 2 + 3 x 3 + 2 x 4 98
7 x 1 + x 2 + 2 x 3 + 6 x 4 117
x 1 + x 2 + 2 x 3 + 6 x 4 130
9 x 1 + x 2 + 6 x 4 105
x i 0 , i = 1 , , 4 .
Here, we had five objectives as Goal-1, Goal-2, Goal-3, Goal-4, and Goal-5. The fuzzy preference relations among these objectives (goals) were given as follows:
  • Goal-1 is moderately more important than Goal-2 ( μ 12 ).
  • Goal-2 is moderately more important than Goal-4 ( μ 24 ).
  • Goal-2 is moderately more important than Goal-5 ( μ 25 ).
  • Goal-3 is moderately more important than Goal-2 ( μ 32 ).
Now, the problem has been solved using solution approach of Algorithm 1 by applying proposed FGP-IFPR models and results were obtained.

5.2. Solution Steps for Example 1

The solution steps are summarized as follows.
Step-1 Start with given multi-objective programming problem as given in Equations (23a)–(23j).
Step-2 Formulate the problem as five single objective models (based on the respective goals). All the five optimization problems are solved for finding the best and worst values of goals. The decision maker can provide the aspiration values as per choice or determine it based on individual solution of the problem models.
Step-3 For this multi objective problem, the tolerance limits are provided. The upper limit for minimization type fuzzy goal Z 1 is u 1 = 55 , the lower limits for maximization type fuzzy goals Z 2 , Z 3 , Z 4 and Z 5 are t 2 = 40 , t 3 = 70 , t 4 = 30 and t 5 = 10 , respectively, with a k as their corresponding aspiration levels.
Step-4 The membership function ( μ k ) for each objective function Z k is modeled using Equations (7) and (8) as follows:
μ 1 = ( 55 Z 1 ) ( 55 35 ) ; μ 2 = ( Z 2 40 ) ( 100 40 ) ; μ 3 = ( Z 3 70 ) ( 120 70 ) ; μ 4 = ( Z 4 30 ) ( 70 30 ) ; μ 5 = ( Z 5 10 ) ( 40 10 ) .
Step-5 The intuitionistic fuzzy functions for the preference relations are formulated and presented in this step. Suppose, μ 12 , μ 24 , μ 25 , and μ 32 are the intuitionistic fuzzy membership function and ν 12 , ν 24 , ν 25 , and ν 32 are intuitionistic fuzzy non-membership function with respect to the linguistic preference relations as given in problem definition. Thus, the linear membership function and non-membership function formulation for each preference relation using Equations (15a)–(15c) and Equations (16a)–(16c) are as:
μ 12 = ( μ 1 μ 2 + 1 ) 2 ; μ 24 = ( μ 2 μ 4 + 1 ) 2 ; μ 25 = ( μ 2 μ 5 + 1 ) 2 ; μ 32 = ( μ 3 μ 2 + 1 ) 2 .
v 12 = ( 1 μ 1 + μ 2 ) 2 ; v 24 = ( 1 μ 2 + μ 4 ) 2 ; v 25 = ( 1 μ 2 + μ 5 ) 2 ; v 32 = ( 1 μ 3 + μ 2 ) 2 .
The exponential membership function and non-membership function formulation for each preference relation using Equations (17a)–(17c) and Equations (18a)–(18c) are as:
μ 12 = ( 1 e s . ( μ 1 μ 2 + 1 ) / 2 ) ( 1 e s ) ; μ 24 = ( 1 e s . ( μ 2 μ 4 + 1 ) / 2 ) ( 1 e s ) ;
μ 25 = ( 1 e s . ( μ 2 μ 5 + 1 ) / 2 ) ( 1 e s ) ; μ 32 = ( 1 e s . ( μ 3 μ 2 + 1 ) / 2 ) ( 1 e s ) .
v 12 = ( e s . ( μ 1 μ 2 + 1 ) / 2 e s ) ( 1 e s ) ; v 24 = ( e s . ( μ 2 μ 4 + 1 ) / 2 e s ) ( 1 e s ) ;
v 25 = ( e s . ( μ 2 μ 5 + 1 ) / 2 e ( s ) ) ( 1 e s ) ; v 32 = ( e s . ( μ 3 μ 2 + 1 ) / 2 e s ) ( 1 e s ) .
The hyperbolic membership function and non-membership function formulation for each preference relation using Equations (19a)–(19c) and Equations (20a)–(20c) are as:
μ 12 = e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; μ 24 = e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
μ 25 = e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; μ 32 = e 3 ( μ 3 μ 2 ) e 3 ( μ 3 μ 2 ) + e 3 ( μ 3 μ 2 ) ] .
v 12 = e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; v 24 = e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
v 25 = e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; v 32 = e 3 ( μ 3 μ 2 ) e 3 ( μ 3 μ 2 ) + e 3 ( μ 3 μ 2 ) .
Step-6 Problem formulations: The FGP-IFPR model of numerical Example-1 is formulated using preference relation functions.
We apply three different kinds of intuitionistic fuzzy functions for preference relations, namely, linear, exponential, and hyperbolic, so there are three different formulations.
Formulation I: FGP-IFPR for linear.
Maximize α . ( μ 1 + μ 2 + μ 3 + μ 4 + μ 5 ) + ( 1 α ) . ( S 12 + S 24 + S 25 + S 32 ) subject to ,
μ 12 ( μ 1 μ 2 + 1 ) 2 ; μ 24 ( μ 2 μ 4 + 1 ) 2 ; μ 25 ( μ 2 μ 5 + 1 ) 2 ; μ 32 ( μ 3 μ 2 + 1 ) 2 ;
v 12 ( 1 μ 1 + μ 2 ) 2 ; v 24 ( 1 μ 2 + μ 4 ) 2 ; v 25 ( 1 μ 2 + μ 5 ) 2 ; v 32 ( 1 μ 3 + μ 2 ) 2 ;
S 12 = μ 12 v 12 ; S 24 = μ 24 v 24 ; S 25 = μ 25 v 25 ; S 32 = μ 32 v 32
μ 1 = ( 55 Z 1 ) ( 55 35 ) ; μ 2 = ( Z 2 40 ) ( 100 40 ) ; μ 3 = ( Z 3 70 ) ( 120 70 ) ; μ 4 = ( Z 4 30 ) ( 70 30 ) ; μ 5 = ( Z 5 10 ) ( 40 10 ) ;
0 μ 1 1 ; 0 μ 2 1 ; 0 μ 3 1 ; 0 μ 4 1 ; 0 μ 5 1
1 μ 12 v 12 0 ; 1 μ 24 v 24 0 ; 1 μ 25 v 25 0 ; 1 μ 32 v 32 0 ;
0 μ 12 + v 12 1 ; 0 μ 24 + v 24 1 ; 0 μ 25 + v 25 1 ; 0 μ 32 + v 32 1 ;
Equations (23f)–(23j)
Formulation II: FGP-IFPR for exponential.
Maximize α . ( μ 1 + μ 2 + μ 3 + μ 4 + μ 5 ) + ( 1 α ) . ( S 12 + S 24 + S 25 + S 32 ) subject to ,
μ 12 ( 1 e s . ( μ 1 μ 2 + 1 ) / 2 ) ( 1 e s ) ; μ 24 ( 1 e s . ( μ 2 μ 4 + 1 ) / 2 ) ( 1 e s ) ;
μ 25 ( 1 e s . ( μ 2 μ 5 + 1 ) / 2 ) ( 1 e s ) ; μ 32 ( 1 e s . ( μ 3 μ 2 + 1 ) / 2 ) ( 1 e s ) ;
v 12 ( e s . ( μ 1 μ 2 + 1 ) / 2 e s ) ( 1 e s ) ; v 24 ( e s . ( μ 2 μ 4 + 1 ) / 2 e s ) ( 1 e s ) ;
v 25 ( e s . ( μ 2 μ 5 + 1 ) / 2 e ( s ) ) ( 1 e s ) ; v 32 ( e s . ( μ 3 μ 2 + 1 ) / 2 e s ) ( 1 e s )
Equations (24d)–(24h)
Equations (23f)–(23j)
Formulation III: FGP-IFPR for hyperbolic.
Maximize α . ( μ 1 + μ 2 + μ 3 + μ 4 + μ 5 ) + ( 1 α ) . ( S 12 + S 24 + S 25 + S 32 ) subject to ,
μ 12 e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; μ 24 e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
μ 25 e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; μ 32 e 3 ( μ 3 μ 2 ) e 3 ( μ 3 μ 2 ) + e 3 ( μ 3 μ 2 ) ;
v 12 e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; v 24 e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
v 25 e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; v 32 e 3 ( μ 3 μ 2 ) e 3 ( μ 3 μ 2 ) + e 3 ( μ 3 μ 2 ) ;
Equations (24d)–(24h)
Equations (23f)–(23j)
Step-7 Now, we solve the above FGP-IFPR models of example 1 using any linear and non linear optimization solver and software.
Step-8 Stop, the optimal and feasible solution is obtained.

Results and Discussion for Example 1

The problem consisting of five multiple objectives was modelled and solved. It provided a feasible and optimal result. To get a more detailed nature of three FGP-IFPR models, the results were evaluated for α = 0 , 0.1 , 0.2 , 0.3 , 0.4 , 0.5 , 0.6 , 0.7 , 0.8 , 0.9 and 1 .
The results obtained on solving are presented in Table 3 and Table 4. In Table 3, the intuitionistic fuzzy membership values, intuitionistic fuzzy non-membership values corresponding to the given four fuzzy preference relations are tabulated along with the score function. The higher value of score function was better than smaller values, as it was the difference of membership and non-membership function values. From Table 3, it can be seen that for the case of linear preference relation, the sum of membership grades were decreasing for the values of α . The non-membership grades were increasing, and as a result of them, the score function values were decreasing. For better visualisation of the score function, see, Figure 6. In case of linear FGP-IFPR, at α = 0 , score function was 1.3091 whereas for α = 1 , it became 0.098. For exponential and hyperbolic preference relation FGP-IFPR models, the same decreasing pattern was followed by the score function. On comparing the three FGP-IFPR models, the hyperbolic FGP-IFPR performed best for score function, and linear FGP-IFPR performed worst. At α = 1 , the values were very much nearby for exponential and hyperbolic FGP-IFPR models.
For the solution values of this example, the values of decision variables, optimal goal values and fuzzy goals and their individual membership grades were also evaluated. In Table 4, the solution values that are x 1 , x 2 , x 3 , and x 4 , objective functions Z 1 , Z 2 , Z 3 , Z 4 , and Z 5 , and grades are presented. The values of sum of membership grades of objective functions, in case of linear, exponential and hyperbolic FGP-IFPR models continuously increases for values of α . There was an increase in sum of membership grades for exponential FGP-IFPR model at α = 0.4 , before that the values were less than linear FGP-IFPR model. In Figure 7, it is clear that from α = 0.4–1, exponential FGP-IFPR model have larger value of μ k than linear and hyperbolic FGP-IFPR models, whereas before 0.4 hyperbolic FGP-IFPR model gives better values for μ k . There was much less difference for exponential and linear FGP-IFPR models from α = 0.4–0.7, whereas for hyperbolic and exponential FGP-IFPR models, the same values as from α = 0.6–0.7 applied.

5.3. Example 2: Banking Application

In this example, a real-life application was studied with the banking financial statement management system of Maybank. The data of financial statements are shown in Table 5. They included total assets, liabilities, total equity, earning and profit, taken from Halim et al. [68]. We have given six objectives as Goal-1: assets, Goal-2: liabilities, Goal-3: equity, Goal-4: earning, Goal-5: profitability, and Goal-6: financial statement. The decision variables were:
x 1 = the amount of financial statement in year 2010.
x 2 = the amount of financial statement in year 2011.
x 3 = the amount of financial statement in year 2012.
x 4 = the amount of financial statement in year 2013.
x 5 = the amount of financial statement in year 2014.
The fuzzy goals were as follows:
0.3367 x 1 + 0.4516 x 2 + 0.4948 x 3 + 0.5603 x 4 + 0.6403 x 5 2.4837 ; (Goal 1)
0.3080 x 1 + 0.4157 x 2 + 0.4509 x 3 + 0.5126 x 4 + 0.5856 x 5 2.2729 ; (Goal 2)
0.0287 x 1 + 0.0325 x 2 + 0.0438 x 3 + 0.0477 x 4 + 0.0547 x 5 0.2074 ; (Goal 3)
0.0038 x 1 + 0.0026 x 2 + 0.0057 x 3 + 0.0066 x 4 + 0.0067 x 5 0.0254 ; (Goal 4)
0.2908 x 1 + 0.3766 x 2 + 0.4256 x 3 + 0.4792 x 4 + 0.5518 x 5 2.1241 ; (Goal 5)
0.9680 x 1 + 1.2790 x 2 + 1.4209 x 3 + 1.6064 x 4 + 1.8391 x 5 7.1135 ; (Goal 6)
x 1 , x 2 , x 3 , x 4 , x 5 0 (non-negativity restrictions)
Based on the discussion with experts, the type of linguistic preference relations among the bank financial statement goals were:
  • Asset (Goal-1) is moderately more important than liability (Goal-2): μ 12 .
  • Liability (Goal-2) is moderately more important than earning (Goal-4): μ 24 .
  • Liability (Goal-2) is moderately more important than profitability (Goal-5): μ 25 .
  • Asset (Goal-1) is moderately more important than profitability (Goal-5): μ 15 .
Now, the problem was solved using solution approach of Algorithm 1 by applying proposed FGP-IFPR models and results were obtained.

5.4. Solution Steps for Example 2

The solution steps are summarized as follows.
Step-1 Start with given multi-objective programming problem as follows:
Maximize Z 1 = 0.3367 x 1 + 0.4516 x 2 + 0.4948 x 3 + 0.5603 x 4 + 0.6403 x 5 2.4837
Minimize Z 2 = 0.3080 x 1 + 0.4157 x 2 + 0.4509 x 3 + 0.5126 x 4 + 0.5856 x 5 2.2729
Maximize Z 3 = 0.0287 x 1 + 0.0325 x 2 + 0.0438 x 3 + 0.0477 x 4 + 0.0547 x 5 0.2074
Maximize Z 4 = 0.0038 x 1 + 0.0026 x 2 + 0.0057 x 3 + 0.0066 x 4 + 0.0067 x 5 0.0254
Maximize Z 5 = 0.2908 x 1 + 0.3766 x 2 + 0.4256 x 3 + 0.4792 x 4 + 0.5518 x 5 2.1241
Maximize Z 6 = 0.9680 x 1 + 1.2790 x 2 + 1.4209 x 3 + 1.6064 x 4 + 1.8391 x 5 7.1135
subject to x 1 , x 2 , x 3 , x 4 , x 5 0
Step-2 Formulate the problem as six single objective problems (based on the respective goals).
Step-3 On solving each optimization problem individually, we get the aspiration values, as given in Table 5. In addition, the upper limit for minimization fuzzy goal Z 2 is u 2 = 2.2729 and lower limits for maximization fuzzy goals Z 1 is t 1 = 2.4837 , Z 3 is t 3 = 0.2115 , Z 4 is t 4 = 0.0280 , Z 5 is t 5 = 2.1248 , Z 6 is t 6 = 7.1228 , with a k as their corresponding aspiration levels.
Step-4 The membership function ( μ k ) for each objective function Z k corresponding to each situation can be modeled using Equations (7) and (8) as follows:
μ 1 = ( Z 1 2.4837 ) ( 2.4941 2.4837 ) ; μ 2 = ( 2.2729 Z 2 ) ( 2.2729 2.2633 ) ; μ 3 = ( Z 3 0.2115 ) ( 0.2207 0.2115 ) ;
μ 4 = ( Z 4 0.0280 ) ( 0.0292 0.0280 ) ; μ 5 = ( Z 5 2.1248 ) ( 2.1459 2.1248 ) ; μ 6 = ( Z 6 7.122 ) ( 7.1624 7.1228 ) .
Step-5 The intuitionistic fuzzy functions for the preference relations are presented in this step. Suppose μ 12 , μ 24 , μ 25 , and μ 15 are the intuitionistic fuzzy membership function and ν 12 , ν 24 , ν 25 , and ν 15 are intuitionistic fuzzy non-membership function with respect to the linguistic preference relations as given in problem definition. Thus, the linear membership function and non-membership function formulation for each preference relation using Equations (15a)–(15c) and Equations (16a)–(16c) are calculated as:
μ 12 = ( μ 1 μ 2 + 1 ) 2 ; μ 24 = ( μ 2 μ 4 + 1 ) 2 ; μ 25 = ( μ 2 μ 5 + 1 ) 2 ; μ 15 = ( μ 1 μ 5 + 1 ) 2 ;
v 12 = ( 1 μ 1 + μ 2 ) 2 ; v 24 = ( 1 μ 2 + μ 4 ) 2 ; v 25 = ( 1 μ 2 + μ 5 ) 2 ; v 15 = ( 1 μ 1 + μ 5 ) 2 ;
The exponential membership function and non-membership function formulation for each preference relation using Equations (17a)–(17c) and Equations (18a)–(18c) are calculated as:
μ 12 = ( 1 e s . ( μ 1 μ 2 + 1 ) / 2 ) ( 1 e s ) ; μ 24 = ( 1 e s . ( μ 2 μ 4 + 1 ) / 2 ) ( 1 e s ) ;
μ 25 = ( 1 e s . ( μ 2 μ 5 + 1 ) / 2 ) ( 1 e s ) ; μ 15 = ( 1 e s . ( μ 1 μ 5 + 1 ) / 2 ) ( 1 e s ) ;
v 12 = ( e s . ( μ 1 μ 2 + 1 ) / 2 e s ) ( 1 e s ) ; v 24 = ( e s . ( μ 2 μ 4 + 1 ) / 2 e s ) ( 1 e s ) ;
v 25 = ( e s . ( μ 2 μ 5 + 1 ) / 2 e s ) ( 1 e s ) ; v 15 = ( e s . ( μ 1 μ 5 + 1 ) / 2 e s ) ( 1 e s ) ;
The hyperbolic membership function and non-membership function formulation for each preference relation using Equations (19a)–(19c) and Equations (20a)–(20c) are calculated as:
μ 12 = e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; μ 24 = e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
μ 25 = e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; μ 15 = e 3 ( μ 1 μ 5 ) e 3 ( μ 1 μ 5 ) + e 3 ( μ 1 μ 5 ) ;
v 12 = e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; v 24 = e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
v 25 = e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; v 15 = e 3 ( μ 1 μ 5 ) e 3 ( μ 1 μ 5 ) + e 3 ( μ 1 μ 5 ) ;
Step-6 Problem formulations: The FGP-IFPR model of numerical Example-2 are formulated using preference relation functions. We have applied three different kinds of intuitionistic fuzzy functions for preference relations, namely, linear, exponential, and hyperbolic, there will be three different formulations.
Formulation I: FGP-IFPR for linear.
Maximize α . ( μ 1 + μ 2 + μ 3 + μ 4 + μ 5 + μ 6 ) + ( 1 α ) . ( S 12 + S 24 + S 25 + S 32 ) subject to ,
μ 12 ( μ 1 μ 2 + 1 ) 2 ; μ 24 ( μ 2 μ 4 + 1 ) 2 ; μ 25 ( μ 2 μ 5 + 1 ) 2 ; μ 15 ( μ 1 μ 5 + 1 ) 2
v 12 ( 1 μ 1 + μ 2 ) 2 ; v 24 ( 1 μ 2 + μ 4 ) 2 ; v 25 ( 1 μ 2 + μ 5 ) 2 ; v 15 ( 1 μ 1 + μ 5 ) 2
μ 1 = ( Z 1 2.4837 ) ( 2.4941 2.4837 ) ; μ 2 = ( 2.2729 Z 2 ) ( 2.2729 2.2633 ) ; μ 3 = ( Z 3 0.2115 ) ( 0.2207 0.2115 ) ;
μ 4 = ( Z 4 0.0280 ) ( 0.0292 0.0280 ) ; μ 5 = ( Z 5 2.1248 ) ( 2.1459 2.1248 ) ; μ 6 = ( Z 6 7.122 ) ( 7.1624 7.1228 )
S 12 = μ 12 v 12 ; S 24 = μ 24 v 24 ; S 25 = μ 25 v 25 ; S 32 = μ 15 v 15 ;
1 μ 12 v 12 0 ; 1 μ 24 v 24 0 ; 1 μ 25 v 25 0 ; 1 μ 15 v 15 0 ;
0 μ 12 + v 12 1 ; 0 μ 24 + v 24 1 ; 0 μ 25 + v 25 1 ; 0 μ 15 + v 15 1 ;
0 μ 1 1 ; 0 μ 2 1 ; 0 μ 3 1 ; 0 μ 4 1 ; 0 μ 5 1 ; 0 μ 6 1 .
Formulation II: FGP-IFPR for exponential.
Maximize α . ( μ 1 + μ 2 + μ 3 + μ 4 + μ 5 + μ 6 ) + ( 1 α ) . ( S 12 + S 24 + S 25 + S 32 ) subject to ,
μ 12 ( 1 e s . ( μ 1 μ 2 + 1 ) / 2 ) ( 1 e s ) ; μ 24 ( 1 e s . ( μ 2 μ 4 + 1 ) / 2 ) ( 1 e s ) ;
μ 25 ( 1 e s . ( μ 2 μ 5 + 1 ) / 2 ) ( 1 e s ) ; μ 15 ( 1 e s . ( μ 1 μ 5 + 1 ) / 2 ) ( 1 e s )
v 12 ( e s . ( μ 1 μ 2 + 1 ) / 2 e s ) ( 1 e s ) ; v 24 ( e s . ( μ 2 μ 4 + 1 ) / 2 e s ) ( 1 e s )
v 25 ( e s . ( μ 2 μ 5 + 1 ) / 2 e ( s ) ) ( 1 e s ) ; v 15 ( e s . ( μ 1 μ 5 + 1 ) / 2 e s ) ( 1 e s )
Equations (28f)–(28i)
Formulation III: FGP-IFPR for hyperbolic.
Maximize α . ( μ 1 + μ 2 + μ 3 + μ 4 + μ 5 + μ 6 ) + ( 1 α ) . ( S 12 + S 24 + S 25 + S 32 ) subject to ,
μ 12 e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; μ 24 e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
μ 25 e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; μ 15 e 3 ( μ 1 μ 5 ) e 3 ( μ 1 μ 5 ) + e 3 ( μ 1 μ 5 )
v 12 e 3 ( μ 1 μ 2 ) e 3 ( μ 1 μ 2 ) + e 3 ( μ 1 μ 2 ) ; v 24 e 3 ( μ 2 μ 4 ) e 3 ( μ 2 μ 4 ) + e 3 ( μ 2 μ 4 ) ;
v 25 e 3 ( μ 2 μ 5 ) e 3 ( μ 2 μ 5 ) + e 3 ( μ 2 μ 5 ) ; v 15 e 3 ( μ 1 μ 5 ) e 3 ( μ 1 μ 5 ) + e 3 ( μ 1 μ 5 ) ;
Equations (28f)–(28i)
Step-7 Now, we solve the above FGP-IFPR model of Example 2 using any linear and non linear optimization solver and software.
Step-8 Stop, the optimal and feasible solution is obtained.

Results and Discussion for Example 2

The problem solved in Example 2 was a real-life problem. The solutions i.e., amount of financial statement in 2010, 2011, 2012, 2013, and 2014 ( x 1 , x 2 , x 3 , x 4 , and x 5 ) were determined. The problem consisted of six different goals. Similar to Example 1, membership grade, non-membership grades, goal values and their satisfaction levels were determined and presented in Table 6 and Table 7. In Table 6, the preference membership grades decreased for linear and exponential FGP-IFPR models from α = 0.0–1.0 whereas it increased for non-membership grades. As a result, score function decreased for increasing values of α . For hyperbolic FGP-IFPR model, it was similar to linear and exponential FGP-IFPR models from α = 0–0.9. At α = 1 , there was an increase in score function value from 0 to 0.5933.
The value of score function remained constant for multiple values of α . For linear FGP-IFPR, it remained constant as 0.2572 for α = 0.2–0.8 and became 0 for α = 0.9–1. For exponential FGP-IFPR model, the score function was 1.08345 for α = 0.2–0.3, then again it became constant with value 0.5124 for α = 0.4–0.8. If we see Figure 8, the hyperbolic FGP-IFPR model from α = 0.4–0.9 performed better for score function values than other models, whereas linear FGP-IFPR model performed worst among all FGP-IFPR models from α = 0–1. In Table 7 and Figure 9, the sum of individual membership grades μ k also tended towards increased value for all models of linear, exponential and hyperbolic preference relations. If we compared all three models, the exponential FGP-IFPR had the larger value of μ k for all values of α . The solution values of all the objectives are also provided in Table 7.

5.5. Efficiency Analysis

The proposed method was applied to solve two experimental problems. Example 1 was a numerical problem and Example 2 was a banking financial statement problem. The procedure followed the solution algorithm explained in Section 4 beginning with determining the individual best and worst objective function values, then the choice and construction of membership and non-membership functions based on decision maker linguistic preference relation and constructing FGP-IFPR. The computational time was acceptable for all the problem models.
Here, FGP-IFPR models for linear, exponential and hyperbolic membership functions provided different optimal solutions. To determine the efficiency of the FGP-IFPR approach, we evaluated the degree of closeness of the outcome to the optimal solution for the different models. To measure closeness, the distance function was utilized, see Pramanik and Roy [69], Zheng et al. [70] and Zhao et al. [51]. A new distance function for selecting the priority solution for the proposed FGP-IFPR models was introduced in this paper.
D ( x ) = k = 1 K ( 1 μ k ) 2 + k = 1 K ( 1 S R i ( k , l ) ) 2 1 / 2
The distance function with smaller value provided the most satisfying solution as it represented the best solution among all other solutions. Furthermore, the proposed FGP-IFPR approach considered a utility function divided into two criteria, namely: (1) sum of individual membership function and (2) sum of preference membership function achievement level. Based on these two criteria with a different value of α , the performance of the different FGP-IFPR models could be analyzed. In Table 8, Figure 10 and Figure 11, the results for distance function values are tabulated and plotted for different values of α and for three of FGP-IFPR models. In Figure 10, for Example 1, at all values of α = 0 1 , the hyperbolic FGP-IFPR model performed best, and linear FGP-IFPR performed worst. The overall performance ranking was H y p e r b o l i c > E x p o n e n t i a l > L i n e a r . For Example 2, at α = 0.1 , the performance pattern was E x p o n e n t i a l > L i n e a r > H y p e r b o l i c , whereas for rest of the values of α , it is E x p o n e n t i a l > H y p e r b o l i c > L i n e a r see in Figure 11. It can be seen that, with respect the problem type and value of α , the performance of linear, exponential and hyperbolic FGP-IFPR models changed.

6. Conclusions, Limitations, and Future Directions

The paper aims to propose a fuzzy goal programming with intuitionistic fuzzy preference relations (FGP-IFPR) approach. The FGP-IFPR model involves the achievement of the fuzzy goals and uncertain preference relationships among goals with the degree of belongingness and non-belongingness, simultaneously. Linguistically imprecise relation represents the associations amongst the fuzzy goals. The IFPRs among goals are addressed as linear and non-linear (exponential and hyperbolic) functions. The use of non-linear functions for the imprecise relative importance among fuzzy objective lead towards the more realistic representation of the linguistic term and provide flexibility in the decision-making process. The perception of intuitionistic fuzzy exponential and hyperbolic functions have more justified significance because it can smoothly overcome the weaknesses associated with the structure of the Gaussian function amidst non-zero functional values affecting its broad range of the footprint. The mathematical expressibility of intuitionistic fuzzy exponential and hyperbolic functions only requires two parametric values. The objective function of FGP-IFPR is a convex combination of membership degrees of fuzzy goals and score function of the IFPRs. We presented the three linear, exponential, and hyperbolic FGP-IFPR formulations and an extensive step by step solutions procedure to find the optimal solutions for these formulated models. An experimental study is done to provide a comprehensive validation of these approaches. Two numerical examples are considered for proposed models. The first example is a numerical problem, and the second example is the banking financial statement problem. For both instances, the optimal goal values, decision variables, and fuzzy goals are evaluated along with the grades and total score values to three FGP-IFPR models for different values of the weighted objective parameter. On the analysis of the obtained optimal solutions to three FGP-IFPR models by using the distance function, it has been found that, in case of example 1, the FGP-IFPR for hyperbolic performs best and FGP-IFPR for linear performs worst. The ranking of the efficiency of FGP-IFPR models is H y p e r b o l i c > E x p o n e n t i a l > L i n e a r . For example 2, the ranking of the efficiency of FGP-IFPR models is E x p o n e n t i a l > H y p e r b o l i c > L i n e a r .
The proposed FGP-IFPR framework has multiple advantages over several existing approaches in terms of: (1) better representation of uncertain importance relations among goals, (2) including the concept of the intuitionistic fuzzy set for preference relations, (3) simultaneously evaluating the degree of belongingness and non-belongingness, (4) preventing the difficulty of providing weights to the goals, and (5) enhancing the membership degree as well as efficiently reduce the non-membership degree. All the existing methods dealt only with the linear fuzzy preference relations. The limitation of the work is that the judgements are drawn based on considered models that may change according to the problem. Further, only three types of preference relations namely “slightly more important”, or “moderately more important”, or “significantly more important” are considered.
In the future, we will increase the numbers of preference relations, that are needed to represent by the intuitionistic fuzzy exponential and hyperbolic functions. The proposed models can be applied to a large number of real-life applications where the number of objectives is enormous, for example, manufacturing, human resource management, sustainable economy, forest management, portfolio optimization. This work can be further extended to the FGP-IFPR model with other non-linear functions like parabolic, s-curve, and so on, and its applications to real-life problems.

Author Contributions

Conceptualization, formal analysis, investigation, methodology, software, validation, visualization, writing—original draft by M.G.H.; software, visualization, validation, writing—original draft, writing—review and editing by Z.A.; writing—review and editing by A.R.A.G. and M.F.K. funding acquisition by A.R.A.G. All authors have read and agreed to the published version of the manuscript.

Funding

The Research Work is supported by Deanship of Scientific Research, College of Science-Research Center, King Saud University, Riyadh, Saudi Arabia.

Acknowledgments

The authors are thankful to the anonymous referees, assistant editor, and the journal editor for their fruitful constructive comments and suggestions for the improvement of the manuscript. The Project was supported by King Saud University, Deanship of Scientific Research, College of Science-Research Center.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ull Hasan, M.G.; Ali, I.; Hasan, S.S. Annualized Hours Planning with Fuzzy Demand Constraint. Available online: https://probstat.org.in/PSF-2016-05.pdf (accessed on 10 August 2020).
  2. Hasan, M.G.; Hasan, S.S. Manpower Planning with Annualized Hours Flexibility: A Fuzzy Mathematical Programming Approach. Decis. Mak. Manuf. Serv. 2016, 10, 5–29. [Google Scholar] [CrossRef] [Green Version]
  3. Hasan, M.G.; Qayyum, Z.; Hasan, S.S. Multi-Objective Annualized Hours Manpower Planning Model: A Modified Fuzzy Goal Programming Approach. Ind. Eng. Manag. Syst. 2019, 18, 52–66. [Google Scholar] [CrossRef]
  4. Hasan, M.G.; Qayyum, Z.; Hasan, S.S. Planning and Scheduling of Manpower in an Annualized Hours Environment Integrating Workers Willingness and Efficiency. Ind. Eng. Manag. Syst. 2019, 18, 1–24. [Google Scholar] [CrossRef]
  5. Ashraf, Z.; Muhuri, P.K.; Lohani, Q.D.; Nath, R. Fuzzy multi-objective reliability-redundancy allocation problem. In Proceedings of the 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Beijing, China, 6–11 July 2014; pp. 2580–2587. [Google Scholar]
  6. Ashraf, Z.; Muhuri, P.K.; Lohani, Q.D. Particle swam optimization based reliability-redundancy allocation in a type-2 fuzzy environment. In Proceedings of the 2015 IEEE Congress on Evolutionary Computation (CEC), Sendai, Japan, 25–28 May 2015; pp. 1212–1219. [Google Scholar]
  7. Muhuri, P.K.; Ashraf, Z.; Lohani, Q.D. Multiobjective reliability redundancy allocation problem with interval type-2 fuzzy uncertainty. IEEE Trans. Fuzzy Syst. 2017, 26, 1339–1355. [Google Scholar]
  8. Suttorp, T.; Igel, C. Multi-objective optimization of support vector machines. In Multi-Objective Machine Learning; Springer: Berlin/Heidelberg, Germany, 2006; pp. 199–220. [Google Scholar]
  9. Marler, R.T.; Arora, J.S. Survey of multi-objective optimization methods for engineering. Struct. Multidiscip. Optim. 2004, 26, 369–395. [Google Scholar] [CrossRef]
  10. Alexandropoulos, S.A.N.; Aridas, C.K.; Kotsiantis, S.B.; Vrahatis, M.N. Multi-Objective Evolutionary Optimization Algorithms for Machine Learning: A Recent Survey. In Approximation and Optimization; Springer: Berlin/Heidelberg, Germany, 2019; pp. 35–55. [Google Scholar]
  11. Bora, T.C.; Mariani, V.C.; dos Santos Coelho, L. Multi-objective optimization of the environmental-economic dispatch with reinforcement learning based on non-dominated sorting genetic algorithm. Appl. Therm. Eng. 2019, 146, 688–700. [Google Scholar] [CrossRef]
  12. Breen, M.; Murphy, M.; Upton, J. Development of a dairy multi-objective optimization (DAIRYMOO) method for economic and environmental optimization of dairy farms. Appl. Energy 2019, 242, 1697–1711. [Google Scholar] [CrossRef]
  13. Kumar, S.; Mandal, K.K.; Chakraborty, N. Optimal DG placement by multi-objective opposition based chaotic differential evolution for techno-economic analysis. Appl. Soft Comput. 2019, 78, 70–83. [Google Scholar] [CrossRef]
  14. Palacios, J.J.; González-Rodríguez, I.; Vela, C.R.; Puente, J. Robust multiobjective optimisation for fuzzy job shop problems. Appl. Soft Comput. 2017, 56, 604–616. [Google Scholar] [CrossRef] [Green Version]
  15. Nepomuceno, E.G. A novel method for structure selection of the Recurrent Random Neural Network using multiobjective optimisation. Appl. Soft Comput. 2019, 76, 607–614. [Google Scholar] [CrossRef]
  16. Cao, L.; Xu, L.; Goodman, E.D.; Li, H. Decomposition-based evolutionary dynamic multiobjective optimization using a difference model. Appl. Soft Comput. 2019, 76, 473–490. [Google Scholar] [CrossRef]
  17. Ashraf, Z.; Muhuri, P.K.; Lohani, Q.D.; Roy, M.L. Type-2 fuzzy reliability–redundancy allocation problem and its solution using particle-swarm optimization algorithm. Granul. Comput. 2019, 4, 145–166. [Google Scholar] [CrossRef]
  18. Zheng, Y.J.; Wang, Y.; Ling, H.F.; Xue, Y.; Chen, S.Y. Integrated civilian–military pre-positioning of emergency supplies: A multiobjective optimization approach. Appl. Soft Comput. 2017, 58, 732–741. [Google Scholar] [CrossRef]
  19. Yang, I.T.; Chou, J.S. Multiobjective optimization for manpower assignment in consulting engineering firms. Appl. Soft Comput. 2011, 11, 1183–1190. [Google Scholar] [CrossRef]
  20. Charnes, A.; Cooper, W.W.; Ferguson, R.O. Optimal estimation of executive compensation by linear programming. Manag. Sci. 1955, 1, 138–151. [Google Scholar] [CrossRef]
  21. Charnes, A.; Cooper, W.W. Management models and industrial applications of linear programming. Manag. Sci. 1957, 4, 38–91. [Google Scholar] [CrossRef]
  22. Ignizio, J.P. A review of goal programming: A tool for multiobjective analysis. J. Oper. Res. Soc. 1978, 29, 1109–1119. [Google Scholar] [CrossRef]
  23. Ignizio, J.P. Generalized goal programming An overview. Comput. Oper. Res. 1983, 10, 277–289. [Google Scholar] [CrossRef]
  24. Romero, C. Handbook of Critical Issues in Goal Programming; Pergamon Press: Oxford, UK, 1991; pp. 1–12. [Google Scholar] [CrossRef]
  25. Romero, C. A general structure of achievement function for a goal programming model. Eur. J. Oper. Res. 2003, 153, 675–686. [Google Scholar] [CrossRef]
  26. Chang, C.T. Efficient structures of achievement functions for goal programming models. Asia-Pac. J. Oper. Res. 2007, 24, 755–764. [Google Scholar] [CrossRef]
  27. Caballero, R.; Go, T. Goal Programming: RealisticT argets for the Near Future. J. Multi-Criteria Decis. Anal. 2010, 110, 79–110. [Google Scholar] [CrossRef]
  28. Zadeh, L. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  29. Bellman, R.; Zadeh, L. Decision Making in a Fuzzy Environment. Manag. Sci. 1970, 17, 141–164. [Google Scholar] [CrossRef]
  30. Chen, L.H.; Tsai, F.C. Fuzzy goal programming with different importance and priorities. Eur. J. Oper. Res. 2001, 133, 548–556. [Google Scholar] [CrossRef]
  31. Aköz, O.; Petrovic, D. A fuzzy goal programming method with imprecise goal hierarchy. Eur. J. Oper. Res. 2007, 181, 1427–1433. [Google Scholar] [CrossRef]
  32. Pramanik, S.; Roy, T.K. Multiobjective Transportation Model with Fuzzy Parameters: Priority based Fuzzy Goal Programming Approach. J. Transp. Syst. Eng. Inf. Technol. 2008, 8, 40–48. [Google Scholar] [CrossRef]
  33. Cheng, H.W. A satisficing method for fuzzy goal programming problems with different importance and priorities. Qual. Quant. 2013, 47, 485–498. [Google Scholar] [CrossRef]
  34. Jadidi, O.; Zolfaghari, S.; Cavalieri, S. A new normalized goal programming model for multi-objective problems: A case of supplier selection and order allocation. Int. J. Prod. Econ. 2014, 148, 158–165. [Google Scholar] [CrossRef]
  35. Jana, R.K.; Sharma, D.K.; Chakraborty, B. A hybrid probabilistic fuzzy goal programming approach for agricultural decision-making. Int. J. Prod. Econ. 2016, 173, 134–141. [Google Scholar] [CrossRef]
  36. Petrovic, D.; Aköz, O. A fuzzy goal programming approach to integrated loading and scheduling of a batch processing machine. J. Oper. Res. Soc. 2008, 59, 1211–1219. [Google Scholar] [CrossRef]
  37. Torabi, S.A.; Moghaddam, M. Multi-site integrated production-distribution planning with trans-shipment: A fuzzy goal programming approach. Int. J. Prod. Res. 2012, 50, 1726–1748. [Google Scholar] [CrossRef]
  38. Khalili-Damghani, K.; Sadi-Nezhad, S. A decision support system for fuzzy multi-objective multi-period sustainable project selection. Comput. Ind. Eng. 2013, 64, 1045–1060. [Google Scholar] [CrossRef]
  39. Díaz-Madroñero, M.; Mula, J.; Jiménez, M. Fuzzy goal programming for material requirements planning under uncertainty and integrity conditions. Int. J. Prod. Res. 2014, 52, 6971–6988. [Google Scholar] [CrossRef]
  40. Sheikhalishahi, M.; Torabi, S. Maintenance supplier selection considering life cycle costs and risks: A fuzzy goal programming approach. Int. J. Prod. Res. 2014, 52, 7084–7099. [Google Scholar] [CrossRef]
  41. Khan, M.F.; Hasan, M.; Quddoos, A.; Fügenschuh, A.; Hasan, S.S. Goal Programming Models with Linear and Exponential Fuzzy Preference Relations. Symmetry 2020, 12, 934. [Google Scholar] [CrossRef]
  42. Bilbao-Terol, A.; Jiménez, M.; Arenas-Parra, M. A group decision making model based on goal programming with fuzzy hierarchy: An application to regional forest planning. Ann. Oper. Res. 2016, 245, 137–162. [Google Scholar] [CrossRef]
  43. Bilbao-Terol, A.; Arenas-Parra, M.; Cañal-Fernández, V.; Jiménez, M. A sequential goal programming model with fuzzy hierarchies to Sustainable and responsible portfolio selection problem. J. Oper. Res. Soc. 2016, 67, 1259–1273. [Google Scholar] [CrossRef]
  44. Arenas-Parra, M.; Bilbao-Terol, A.; Jiménez, M. Standard goal programming with fuzzy hierarchies: A sequential approach. Soft Comput. 2016, 20, 2341–2352. [Google Scholar] [CrossRef]
  45. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  46. Angelov, P.P. Optimization in an intuitionistic fuzzy environment. Fuzzy Sets Syst. 1997, 86, 299–306. [Google Scholar] [CrossRef]
  47. Bharati, S.K.; Singh, S.R. Solving multi objective linear programming problems using intuitionistic fuzzy optimization method: A comparative study. Int. J. Model. Optim. 2014, 4, 10. [Google Scholar] [CrossRef]
  48. Seikh, M.R.; Nayak, P.K.; Pal, M. Application of intuitionistic fuzzy mathematical programming with exponential membership and quadratic non-membership functions in matrix games. Ann. Fuzzy Math. Inform. 2015, 9, 183–195. [Google Scholar]
  49. 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]
  50. Kour, D.; Mukherjee, S.; Basu, K. Solving intuitionistic fuzzy transportation problem using linear programming. Int. J. Syst. Assur. Eng. Manag. 2017, 8, 1090–1101. [Google Scholar] [CrossRef]
  51. Zhao, X.; Zheng, Y.; Wan, Z. Interactive intuitionistic fuzzy methods for multilevel programming problems. Expert Syst. Appl. 2017, 72, 258–268. [Google Scholar] [CrossRef]
  52. Singh, S.; Yadav, S. Intuitionistic fuzzy multi-objective linear programming problem with various membership functions. Ann. Oper. Res. 2017, 269, 693–707. [Google Scholar] [CrossRef]
  53. Mahajan, S.; Gupta, S. On fully intuitionistic fuzzy multiobjective transportation problems using different membership functions. Ann. Oper. Res. 2019, 1–31. [Google Scholar] [CrossRef]
  54. Roy, S.K.; Ebrahimnejad, A.; Verdegay, J.L.; Das, S. New approach for solving intuitionistic fuzzy multi-objective transportation problem. Sādhanā 2018, 43, 3. [Google Scholar] [CrossRef] [Green Version]
  55. Khalili-Damghani, K.; Sadi-Nezhad, S.; Tavana, M. Solving multi-period project selection problems with fuzzy goal programming based on TOPSIS and a fuzzy preference relation. Inf. Sci. 2013, 252, 42–61. [Google Scholar] [CrossRef]
  56. Khalili-Damghani, K.; Tavana, M.; Amirkhan, M. A fuzzy bi-objective mixed-integer programming method for solving supply chain network design problems under ambiguous and vague conditions. Int. J. Adv. Manuf. Technol. 2014, 73, 1567–1595. [Google Scholar] [CrossRef]
  57. Hashmi, N.; Jalil, S.A.; Javaid, S. A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences. Soft Comput. 2019, 23, 12401–12415. [Google Scholar] [CrossRef]
  58. Gupta, P.; Mehlawat, M.K. Bector–Chandra type duality in fuzzy linear programming with exponential membership functions. Fuzzy Sets Syst. 2009, 160, 3290–3308. [Google Scholar] [CrossRef]
  59. Atanassov, K.T. Intuitionistic fuzzy sets. In Intuitionistic Fuzzy Sets; Springer: Berlin/Heidelberg, Germany, 1999; pp. 1–137. [Google Scholar]
  60. Rani, D.; Gulati, T.; 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]
  61. Ashraf, Z.; Khan, M.S.; Lohani, Q.D. New bounded variation based similarity measures between Atanassov intuitionistic fuzzy sets for clustering and pattern recognition. Appl. Soft Comput. 2019, 85, 105529. [Google Scholar] [CrossRef]
  62. Tiwari, R.; Dharmar, S.; Rao, J. Fuzzy goal programming—An additive model. Fuzzy Sets Syst. 1987, 24, 27–34. [Google Scholar] [CrossRef]
  63. Fourer, R.; Gay, D.M.; Kernighan, B.W. AMPL-A Modeling Language for Mathematical Programming. In Thomson Learning, 2nd ed.; AMPL Optimization Inc.: Albuquerque, NM, USA, 2003. [Google Scholar]
  64. Gropp, W. Moré, J. Optimization environments and the NEOS server. In Approximation Theory and Optimization; Buhmann, M.D., Iserles, A., Eds.; Cambridge University Press: Cambridge, UK, 1997; pp. 167–182. [Google Scholar]
  65. Czyzyk, J.; Mesnier, M.P.; More, J.J. NEOS server. IEEE Comput. Sci. Eng. 1998, 5, 68–75. [Google Scholar] [CrossRef]
  66. Dolan, E. The NEOS Server 4.0 Administrative Guide Tech. In Technical Report, Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division; Argonne National Laboratory: Argonne, IL, USA, 2001. [Google Scholar]
  67. Server, N. State-of-the-Art Solvers for Numerical Optimization. Available online: https://neos-server.org/neos/ (accessed on 10 August 2020).
  68. Halim, B.A.; Karim, H.A.; Fahami, N.A.; Mahad, N.F.; Nordin, S.K.S.; Hassan, N. Bank financial statement management using a goal programming model. Procedia-Soc. Behav. Sci. 2015, 211, 498–504. [Google Scholar] [CrossRef] [Green Version]
  69. Pramanik, S.; Roy, T.K. Fuzzy goal programming approach to multilevel programming problems. Eur. J. Oper. Res. 2007, 176, 1151–1166. [Google Scholar] [CrossRef]
  70. Zheng, Y.; Liu, J.; Wan, Z. Interactive fuzzy decision making method for solving bilevel programming problem. Appl. Math. Model. 2014, 38, 3136–3141. [Google Scholar] [CrossRef]
Figure 1. Hierarchy structure of decision-maker (DM) preference on fuzzy goals.
Figure 1. Hierarchy structure of decision-maker (DM) preference on fuzzy goals.
Symmetry 12 01548 g001
Figure 2. Linear membership and non-membership functions for the intuitionistic fuzzy preference relation (IFPR).
Figure 2. Linear membership and non-membership functions for the intuitionistic fuzzy preference relation (IFPR).
Symmetry 12 01548 g002
Figure 3. Exponential membership and non-membership functions for the IFPRs.
Figure 3. Exponential membership and non-membership functions for the IFPRs.
Symmetry 12 01548 g003
Figure 4. Hyperbolic membership and non-membership functions for the IFPRs.
Figure 4. Hyperbolic membership and non-membership functions for the IFPRs.
Symmetry 12 01548 g004
Figure 5. Flow chart of proposed solution procedure.
Figure 5. Flow chart of proposed solution procedure.
Symmetry 12 01548 g005
Figure 6. Score function for Example 1.
Figure 6. Score function for Example 1.
Symmetry 12 01548 g006
Figure 7. Sum of membership grades of objective functions for Example 1.
Figure 7. Sum of membership grades of objective functions for Example 1.
Symmetry 12 01548 g007
Figure 8. Score function for Example 2
Figure 8. Score function for Example 2
Symmetry 12 01548 g008
Figure 9. Sum of membership grades of objective functions for Example 2.
Figure 9. Sum of membership grades of objective functions for Example 2.
Symmetry 12 01548 g009
Figure 10. Distance measure for Example 1.
Figure 10. Distance measure for Example 1.
Symmetry 12 01548 g010
Figure 11. Distance measure for Example 2.
Figure 11. Distance measure for Example 2.
Symmetry 12 01548 g011
Table 1. Literature summary.
Table 1. Literature summary.
Author’sUncertaintyPreference RelationContribution/Application
Petrovic and Aköz [36]Fuzzy setLinear MFLoading and scheduling of machine
Torabi and Moghaddam [37]Fuzzy setLinear MFProduction distribution planning
Khalili-Damghani and Sadi-Nezhad [38]Fuzzy setLinear MFProject selection
Khalili-Damghani et al. [55]Fuzzy setLinear MFProject selection/TOPSIS
Khalili-Damghani et al. [56]Fuzzy setLinear MFSupply chain network
Díaz-Madronero et al. [39]Fuzzy setLinear MFMaterial reqirements planning
Sheikhalishahi and Torabi [40]Fuzzy setLinear MFMaintainence supplier selection
Bilbao-Terol et al. [42]Fuzzy setLinear MFRegional forest planning
Arenas-Parra et al. [44]Fuzzy setLinear MFSequential approach
Bilbao-Terol et al. [43]Fuzzy setLinear MFPortfolio selection problem
Hashmi et al. [57]Fuzzy setLinear MFTransportation problem
Hasan et al. [3]Fuzzy setLinear MFManpower planning problem
Khan et al. [41]Fuzzy setLinear and Exponential MFsNumerical example
Proposed workIntuitionistic Fuzzy setHyperbolic, Exponential and Linear MFsNumerical example and Banking financial statement problem
Table 2. Linguistic relative preferences of goal k over l.
Table 2. Linguistic relative preferences of goal k over l.
Linguistic TermFuzzy RelationIntuitionistic FuzzyTransform Function
Membership fn.Non-Membership fn.
Slightly more important than R ˜ 1 μ R ˜ 1 ν R ˜ 1
Moderately more important than R ˜ 2 μ R ˜ 2 ν R ˜ 2 μ k ( X ) μ l ( X )
Significantly more important than R ˜ 3 μ R ˜ 3 ν R ˜ 3 k , l ( 1 K )
Table 3. Result values for preference membership, non-membership grades and score function of proposed FGP-IFPR for Example 1.
Table 3. Result values for preference membership, non-membership grades and score function of proposed FGP-IFPR for Example 1.
Formulation α μ 12 μ 24 μ 25 μ 32 μ R i ( k , l ) ν 12 ν 24 ν 25 v 32 ν R i ( k , l ) S R i ( k , l )
I:FGP-IFPR0.00.77950.59540.77950.5002.65450.22040.40450.22040.50001.34531.3091
for Linear0.10.77950.59540.77950.50002.65450.22040.40450.22040.50001.34531.3091
0.20.77950.59540.77950.50002.65450.22040.40450.22040.50001.34531.3091
0.30.77950.59540.77950.50002.65450.22040.40450.22040.50001.34531.3091
0.40.60230.58570.60230.53392.32440.39760.41420.39760.46601.67540.6488
0.50.60230.58570.60230.53392.32440.39760.41420.39760.46601.67540.6488
0.60.60230.58570.60230.53392.32440.39760.41420.39760.46601.67540.6488
0.70.60230.58570.60230.53392.32440.39760.41420.39760.46601.67540.6488
0.80.60230.58570.60230.53392.32440.39760.41420.39760.46601.67540.6488
0.90.56820.59400.50000.52832.19060.43170.40590.50000.47161.80920.3812
1.00.48550.48930.50000.49291.96790.45220.43900.50000.47861.86980.0980
II:FGP-IFPR0.00.93760.71540.60040.93763.19100.06240.28460.39960.06240.80902.3819
for Exponential0.10.93760.71540.60040.93763.19100.06240.28450.39960.06240.80902.3819
0.20.93760.71540.60040.93763.19090.06240.28460.39960.06240.80902.3819
0.30.89920.71270.61120.89923.12230.10080.28730.38880.10080.87772.2445
0.40.71580.70130.65450.71582.78740.28420.29870.34550.28421.21261.5749
0.50.71580.70130.65450.71582.78740.28420.29870.34550.28421.21261.5749
0.60.71580.70130.65450.71582.78740.28420.29870.34550.28421.21261.5749
0.70.71580.70130.65450.71582.78740.28420.29870.34550.28421.21261.5749
0.80.68790.70810.64960.62932.67500.31210.29190.35040.37071.32501.3499
0.90.64910.71710.64320.50002.50930.35090.28290.35690.50001.49071.0186
1.00.48420.47430.48070.50001.93920.40590.36650.40760.50001.68000.2593
III:FGP-IFPR00.96630.75860.50000.96633.19120.03370.24140.50000.03370.80882.3823
for Hyperbolic0.10.96610.75860.50020.96613.19110.03390.24140.49980.03390.80892.3821
0.20.94900.75430.52070.94903.33790.05100.24570.47930.05100.82712.3458
0.30.92480.75010.54040.92483.14020.07520.24990.45960.07520.85982.2803
0.40.89040.74580.56010.89043.08670.10960.25420.43990.10960.91332.1734
0.50.83480.74080.58240.83482.99280.16520.25920.41760.16521.00721.9857
0.60.77350.73670.60060.77352.88430.22650.26330.39940.22651.11571.7685
0.70.77350.73670.60060.77352.88430.22650.26330.39940.22651.11571.7685
0.80.77350.73670.60060.77352.88430.22650.26330.39940.22651.11571.7685
0.90.77350.73670.60060.77352.88430.22650.26330.39940.22651.11571.7685
1.00.47510.46550.49970.50001.94030.38660.34000.43890.50001.66550.2748
Table 4. Result values for solution: objective functions and their membership grade of proposed FGP-IFPR for Example 1.
Table 4. Result values for solution: objective functions and their membership grade of proposed FGP-IFPR for Example 1.
Formulation α x 1 x 2 x 3 x 4 Z 1 Z 2 Z 3 Z 4 Z 5 μ 1 μ 2 μ 3 μ 4 μ 5 μ k
I:FGP-IFPR0.00.00004.19351.612913.709735.000066.4516120.000040.000023.22581.00000.44081.00000.25000.44083.1317
for Linear0.10.00004.19351.612913.709735.000066.4516120.000040.000023.22581.00000.44081.00000.25000.44083.1317
0.20.00004.19351.612913.709735.000066.4516120.000040.000023.22581.00000.44081.00000.25000.44083.1317
0.30.00004.19351.612913.709735.000066.4516120.000040.000023.22581.00000.44081.00000.25000.44083.1317
0.40.00007.48220.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1464
0.50.00007.48220.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1464
0.60.00007.48220.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1464
0.70.00007.48220.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1464
0.80.00007.48220.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1464
0.90.00008.25630.295416.123935.000091.8146113.179057.016834.20691.00000.86350.86350.67540.80684.2094
1.00.00008.25630.295416.123935.000091.8146113.179057.016834.20691.00000.86350.86350.67540.80684.2094
II:FGP-IFPR0.00.00001.99412.375412.008835.000052.2287120.000030.000017.47801.00000.20381.00000.00000.24932.4531
for Exponential0.10.00001.99412.375412.008835.000052.2287120.000030.000017.47801.00000.20381.00000.00000.24932.4531
0.20.00001.99412.375412.008835.000052.2287120.000030.000017.47801.00000.20381.00000.00000.24932.4531
0.30.00003.06792.003112.839235.000059.1723120.000034.881920.28401.00000.31951.00000.12200.34282.7844
0.40.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.50.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.60.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.70.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.80.00008.20180.307916.133035.000091.5262113.659056.871534.03891.00000.85880.87320.67180.80134.2050
0.90.00009.16470.087215.972535.000096.6217105.173059.439337.00791.00000.94370.70350.73600.90034.2834
1.00.00009.16470.087215.972535.000096.6217105.173059.439337.00791.00000.94370.70350.73600.90034.2834
III:FGP-IFPR0.00.00004.19361.612913.709735.000066.4516120.000040.000023.22581.00000.44091.00000.25000.44073.13172
for Hyperbolic0.10.00004.19961.610813.714335.000066.4905120.000040.027323.24151.00000.44151.00000.25070.44133.1336
0.20.00004.86171.381314.226435.000070.7722120.000043.037724.97181.00000.51291.00000.32590.49913.3379
0.30.00005.50021.159914.720235.000074.9015120.000045.941126.64061.00000.58171.00000.39850.55473.5349
0.40.00006.14240.937315.216835.000079.0543120.000048.860828.31881.00000.65091.00000.47150.61063.7331
0.50.00006.87640.682815.784435.000083.8009120.000052.198230.23711.00000.73001.00000.55500.67463.9595
0.60.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.70.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.80.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
0.90.00007.48230.472816.253035.000087.7187120.000054.952731.82031.00000.79531.00000.62380.72734.1465
1.00.00008.25630.295416.123935.000091.8146113.179057.016834.20691.00000.86360.86360.67540.80694.2095
Table 5. Data summarized from Maybank financial statement from year 2010 to 2014 (RM’ trillion).
Table 5. Data summarized from Maybank financial statement from year 2010 to 2014 (RM’ trillion).
Goal Year TotalAspiration Values
20102011201220132014
Asset0.33670.45160.49480.56030.64032.48372.4941
Liability0.30800.41570.45090.51260.58562.27292.2633
Equity0.02870.03250.04380.04770.05470.20740.2207
Profit0.00380.00260.00570.00660.00670.02540.0292
Earnings0.29080.37660.42560.47920.55182.12412.1459
Total0.96801.27901.42091.60641.83917.11357.1624
Table 6. Result values for preference membership, non-membership grades and score function of fuzzy goal programming with intuitionistic fuzzy relations (FGP-IFPR) for Example 2.
Table 6. Result values for preference membership, non-membership grades and score function of fuzzy goal programming with intuitionistic fuzzy relations (FGP-IFPR) for Example 2.
Formulation α μ 12 μ 24 μ 25 μ 15 μ R i ( k , l ) v 12 ν 24 ν 25 ν 15 ν R i ( k , l ) S R i ( k , l )
I:FGP-IFPR0.00.58340.51200.58340.50002.17890.41650.48790.41650.50001.82090.3579
for Linear0.10.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.20.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.30.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.40.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.50.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.60.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.70.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.80.50000.62860.50000.50002.12860.50000.37130.50000.50001.87130.2572
0.90.50000.50000.50000.50002.00000.50000.50000.50000.50002.00000.0000
1.00.50000.50000.50000.50002.00000.50000.50000.50000.50002.00000.0000
II:FGP-IFPR0.00.70290.63200.61980.70042.65000.29710.36800.38020.29961.34501.3100
for Exponential0.10.71450.74890.50000.60382.56720.28550.25110.50000.39621.43281.1344
0.20.68420.78790.50000.56962.54170.31580.21210.50000.43041.45831.0835
0.30.68420.78790.50000.56962.54170.31580.21210.50000.43041.45831.0835
0.40.62250.63370.50000.50002.25620.37750.36630.50000.50001.74380.5124
0.50.62250.63370.50000.50002.25620.37750.36630.50000.50001.74380.5124
0.60.62250.63370.50000.50002.25620.37750.36630.50000.50001.74380.5124
0.70.62250.63370.50000.50002.25620.37750.36630.50000.50001.74380.5124
0.80.62250.63370.50000.50002.25620.37750.36630.50000.50001.74380.5124
0.90.62250.56540.50000.50002.18790.37750.43460.50000.50001.81210.3758
1.00.48270.48690.50000.50001.96960.42210.45280.50000.50001.87500.0946
III:FGP-IFPR0.00.64380.58800.57010.70572.50770.35620.41200.42990.29431.49241.0151
for Hyperbolic0.10.65380.58250.56270.70852.50750.34620.41750.43730.29151.49261.0149
0.20.66340.64460.50000.66342.47150.33660.35540.50000.33661.52850.9430
0.30.58490.74350.50000.58492.41340.41510.25650.50000.41511.58670.8267
0.40.50000.82400.50000.50002.32400.50000.17600.50000.50001.67600.6479
0.50.50000.82400.50000.50002.32400.50000.17600.50000.50001.67600.6479
0.60.50000.82400.50000.50002.32400.50000.17600.50000.50001.67600.6479
0.70.50000.82400.50000.50002.32400.50000.17600.50000.50001.67600.6480
0.80.50000.82400.50000.50002.32400.50000.17600.50000.50001.67600.6480
0.90.50000.79670.50000.50002.29670.50000.20330.50000.50001.70330.5934
1.00.50000.50000.50000.50002.00000.50000.50000.50000.50002.00000.0000
Table 7. Result values for solution: Objective functions and their membership grade of FGP-IFPR for Example 2.
Table 7. Result values for solution: Objective functions and their membership grade of FGP-IFPR for Example 2.
Formulation α x 1 x 2 x 3 x 4 x 5 Z 1 Z 2 Z 3 Z 4 Z 5 Z 6 μ 1 μ 2 μ 3 μ 4 μ 5 μ 6 μ k
I:FGP-IFPR0.00.0000.40581.37172.89780.00002.48562.27260.21150.02802.12537.12330.19090.02400.00000.00000.024000.03280.2718
for Linear0.10.00000.33712.88861.61480.00002.48632.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.20.00000.33712.88861.61480.00002.48632.27040.21450.02802.13007.12980.25720.25720.32710.00000.25720.19771.2966
0.30.00000.33712.88861.61480.00002.48632.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.40.00000.33712.88861.61480.00002.48632.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.50.00000.33712.88861.61480.00002.48632.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.60.00000.33712.88861.61480.00002.48632.27030.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.70.00000.33712.88861.61480.00002.48632.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.80.00000.33712.88861.61480.00002.48632.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19771.2966
0.90.00000.26002.40772.10100.00002.48602.27070.21410.02822.12957.12890.22280.22280.28600.22280.22280.17471.3521
1.00.00000.26002.40772.10100.00002.48602.27070.21410.02822.12957.12890.22280.22280.28600.22280.22280.17471.3521
II:FGP-IFPR0.00.00000.40611.37052.89890.00002.48572.27270.21150.02802.12537.12340.19490.01990.00000.00000.02540.03560.2758
for Exponential0.10.00000.28694.17030.52780.00002.48872.27020.21760.02802.13587.14030.48430.28270.61500.00000.52290.46292.3678
0.20.00000.25864.79430.00000.00002.48902.26930.21840.02802.13797.14300.51160.37860.74960.0000.61880.53082.7894
0.30.00000.25864.79430.00000.00002.48902.26930.21840.02802.13797.14300.51160.37860.74960.00000.61880.53082.7894
0.40.00000.04174.99170.00000.00002.48882.26820.22000.02862.14037.14630.49200.49200.92390.46840.73230.61383.7224
0.50.00000.04174.99170.00000.00002.48882.26820.22000.02862.14037.14630.49200.49200.92390.46840.73230.61383.7224
0.60.00000.04174.99170.00000.00002.48882.26820.22000.02862.14037.14630.49200.49200.92390.46840.73230.61383.7224
0.70.00000.04174.99170.00000.00002.48882.26820.22000.02862.14037.14630.49200.49200.92390.46840.73230.61383.7224
0.80.00000.04174.99170.00000.00002.48882.26820.22000.02862.14037.14630.49200.49200.92390.46840.73230.61383.7224
0.90.00000.00004.73180.26290.00002.48862.26840.21980.02872.13997.14580.47340.47340.90170.58890.71370.60133.7525
1.00.00000.00004.73180.26290.00002.48862.26840.21980.02872.13997.14580.47340.47340.90170.58890.71370.60133.7525
III:FGP-IFPR0.00.00000.40391.38222.88970.00002.48532.27230.21150.02802.12517.12240.15790.05940.00000.00000.01220.00930.2387
for Hyperbolic0.10.00000.40411.38102.89050.00002.48542.27240.21150.02802.12517.12250.16150.05550.00000.00000.01350.01180.2423
0.20.00000.38371.86102.48410.00002.48592.27200.21250.02802.12697.12540.21240.09920.10550.00000.09930.08600.6024
0.30.00000.36072.36932.05410.00002.48612.27120.21350.02802.12857.12760.23460.17740.21510.00000.17740.14130.9458
0.40.00000.33722.88861.61490.00002.48642.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19781.2967
0.50.00000.33722.88861.61490.00002.48642.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19781.2966
0.60.00000.33722.88861.61490.00002.48642.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19781.2966
0.70.00000.33722.88861.61490.00002.48642.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19781.2966
0.80.00000.33722.88861.61490.00002.48642.27040.21450.02802.13027.12980.25720.25720.32710.00000.25720.19781.2966
0.90.00000.32832.83321.67090.00002.48632.27050.21450.02802.13017.12970.25330.25330.32240.02570.25330.19511.3030
1.00.00000.26002.40782.10110.00002.48602.27080.21410.02832.12957.12890.22280.22280.28610.22280.22280.17481.3522
Table 8. Distance function values.
Table 8. Distance function values.
FGP-IFPR for Example 1FGP-IFPR for Example 2
α LinearExponentialHyperbolicLinearExponentialHyperbolic
0.01.79751.78641.55882.97242.70572.7971
0.11.79751.78641.55792.70242.15662.7976
0.21.79751.78641.45732.70242.09112.7000
0.31.79751.63761.36932.70242.09112.6333
0.41.75431.31841.29672.70242.03282.6221
0.51.75431.31841.24962.70242.03282.6221
0.61.75431.31841.25842.70242.03282.6221
0.71.75431.31841.25842.70242.03282.6221
0.81.75431.39801.25852.70242.03282.6221
0.91.86401.57891.25842.75802.07362.7580
1.01.99691.91711.91252.75802.18852.6257

Share and Cite

MDPI and ACS Style

Abdul Ghaffar, A.R.; Hasan, M.G.; Ashraf, Z.; Khan, M.F. Fuzzy Goal Programming with an Imprecise Intuitionistic Fuzzy Preference Relations. Symmetry 2020, 12, 1548. https://doi.org/10.3390/sym12091548

AMA Style

Abdul Ghaffar AR, Hasan MG, Ashraf Z, Khan MF. Fuzzy Goal Programming with an Imprecise Intuitionistic Fuzzy Preference Relations. Symmetry. 2020; 12(9):1548. https://doi.org/10.3390/sym12091548

Chicago/Turabian Style

Abdul Ghaffar, Abdul Razzaq, Md. Gulzarul Hasan, Zubair Ashraf, and Mohammad Faisal Khan. 2020. "Fuzzy Goal Programming with an Imprecise Intuitionistic Fuzzy Preference Relations" Symmetry 12, no. 9: 1548. https://doi.org/10.3390/sym12091548

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