# An Efficient Ranking Technique for Intuitionistic Fuzzy Numbers with Its Application in Chance Constrained Bilevel Programming

Authors: Animesh Biswas; Arnab Kumar De
Journal: Advances in Fuzzy Systems
 (2016)

---

## Abstract

The aim of this paper is to develop a new ranking technique for intuitionistic fuzzy numbers using the method of defuzzification based on probability density function of the corresponding membership function, as well as the complement of nonmembership function. Using the proposed ranking technique a methodology for solving linear bilevel fuzzy stochastic programming problem involving normal intuitionistic fuzzy numbers is developed. In the solution process each objective is solved independently to set the individual goal value of the objectives of the decision makers and thereby constructing fuzzy membership goal of the objectives of each decision maker. Finally, a fuzzy goal programming approach is considered to achieve the highest membership degree to the extent possible of each of the membership goals of the decision makers in the decision making context. Illustrative numerical examples are provided to demonstrate the applicability of the proposed methodology and the achieved results are compared with existing techniques.


---

## Body

## 1. Introduction

The concept of bilevel programming problem (BLPP) was first introduced by Candler and Townsley [1]. The BLPP is considered as a class of optimization problems where two decision makers (DMs) locating at two different hierarchical levels independently control a set of decision variables paying serious attention to the benefit of the others in a highly conflicting decision making situation. The upper level DM is termed as leader and the lower level DM as follower. There are several applications of BLPP in many real life problems such as agriculture, biofuel production, economic systems, finance, engineering, banking, management sciences, and transportation problem. Several methods were proposed to solve BLPPs by different researchers [2, 3] in the past. But these traditional approaches are unable to provide a satisfactory solution if the parameter values involved with a BLPP inevitably contain some uncertain data or linguistic information. Stochastic programming (SP) and fuzzy programming (FP) are two powerful techniques to handle such type of problems. Using probability theory, Dantzig [4] introduced SP. The SP was developed in various directions like chance constrained programming (CCP), recourse programming, multiobjective SP, and so forth. Charnes and Cooper [5] developed the concept of CCP.Again, from the viewpoint of uncertainty or fuzziness involved in human’s judgments, Zimmermann [6] first applied fuzzy set theory [7] in decision making problems with several conflicting objectives. The concept of membership functions in BLPPs was introduced by Lai and Hwang [8]. Lai’s solution concept was then extended by Shih et al. [9] and a supervised search procedure with the use of max-min operator of Bellman and Zadeh [10] was proposed. The basic concept of this procedure is that the follower optimizes his/her objective function, taking into consideration leader’s goal. Recently, Lodwick and Kacprizyk [11] developed a methodology for solving decision making problems under fuzziness. The main difficulty of FP approach is that the objectives of the DMs are conflicting. So there is possibility of rejecting the solution again and again by the DMs and the solution process is continued by redefining the membership functions repeatedly until a satisfactory solution is obtained. This makes the solution process a very lengthy and tedious one. To remove these difficulties fuzzy goal programming (FGP) [12–14] is used as an efficient tool for making decision in an imprecisely defined multiobjective decision making (MODM) arena. Baky [15] developed a FGP technique for solving multiobjective multilevel programming problem.Also it is observed that the fuzzy sets (FSs) are not always capable of dealing with lack of knowledge with respect to degrees of membership. Realizing the fact Atanassov [16–18] introduced the concept of intuitionistic FSs (IFSs) by implementing a nonmembership degree which can handle the drawback of FSs and express more abundant and flexible information than the FSs. In recent years, there is a growing interest in the study of decision making problems with intuitionistic fuzzy numbers (IFNs) [19–21] and with interval-valued intuitionistic fuzzy information [22–25].The ranking of IFNs [26, 27] plays an important role in dealing with IFNs as ranking of fuzzy numbers (FNs). Grzegoraewski [28] suggested some methods for measuring distances between IFNs and interval-valued FNs, based on Hausdorff metric. The methodology for solving intuitionistic fuzzy linear programming problems with triangular IFNs (TIFNs) was developed by Dubey and Mehra [29] by converting the model into crisp linear programming problem. Li [30] developed a ratio ranking method for the TIFNs. Nehi [31] put forward a new ordering method of IFNs in which two characteristic values for IFNs are defined by the integral of the inverse fuzzy membership and nonmembership functions multiplied by the grade with powered parameters. Recently, numerous ranking methods for IFNs have been proposed in literature to rank IFNs [32–34]. Although many defuzzification methods have already been proposed so far, no method gives a right effective defuzzification output. Most of the existing defuzzification methods tried to make the estimation of IFNs in an objective way. This paper proposes a method using the concept probability density function of IFNs and Mellin’s transform [35, 36] to find the ranking of normal IFNs. This ranking method removes the ambiguous outcomes and distinguishes the alternatives clearly.In fuzzy BLPP [37] it is sometimes realized that the concept of membership function does not provide satisfactory solutions in a highly conflicting decision making situation. In this context IFNs can be used to capture both the membership and nonmembership degrees of uncertainties of both the DMs. Also there are some real world situations, where randomness and fuzziness occur simultaneously. The decision making problem having such type of ambiguous information is known as fuzzy stochastic programming problem. Many researchers [38–41] derived different methods to solve such type of decision making problems. But FGP approach for solving fuzzy stochastic linear BLPP with IFNs is yet to appear in the literature.In the present study FGP process is adopted for solving bilevel intuitionistic FP problems where the parameters are expressed in terms of normal IFNs. A ranking technique for normal IFNs is first proposed and then using the proposed technique the model is converted into a deterministic problem. The individual optimal value of each objective is found in isolation to construct the fuzzy membership goals of each of the objectives. Finally, FGP model is developed for the achievement of highest degree of each of the defined membership goals to the extent possible by minimizing group regrets in the decision making context. To explore the potentiality of the proposed approach, two illustrative examples are considered and solved and the achieved solutions are compared with the predefined technique developed by Dubey and Mehra [29].


## 2. Preliminaries

In this section some basic concepts on FNs, triangular FNs (TFNs), IFNs, and triangular IFNs (TIFNs) are discussed.


### 2.1. FN [42]

A fuzzy setA
~ defined on the set of real numbers, R, is said to be an FN if its membership function μ
A
~
(
x
) satisfies the following characteristics:(i)
μ
A
~
:
R
→
[
0,1
] is continuous.
(ii)
μ
A
~
x
=
0 for all x
∈
-
∞
,
a
∪
[
d
,
∞
).
(iii)
μ
A
~
(
x
) is strictly increasing on [
a
,
b
] and strictly decreasing on [
c
,
d
].
(iv)
μ
A
~
x
=
1 for all x
∈
[
b
,
c
], where a
≤
b
≤
c
≤
d.


### 2.2. TFN [43]

An FNA
~
=
(
a
,
b
,
c
) is said to be TFN if its membership function μ
A
~
(
x
) is given by (1)
μ
A
~
x
=
0
if
x
<
a
or
x
>
c
x
-
a
b
-
a
if
a
≤
x
≤
b
c
-
x
c
-
b
if
b
≤
x
≤
c
.The TFN can be expressed in the form of Figure1.Figure 1
TFN.


### 2.3. IFN [44]

An IFNA
~ is(i)
an IFS defined onR;
(ii)
normal; that is, there existsx
∈
R such that μ
A
~
x
=
1 and ν
A
~
x
=
0;
(iii)
convex for the membership functionμ
A
~
x; that is, μ
A
~
(
λ
x
1
+
(
1
-
λ
)
x
2
)
≥
m
i
n
⁡
{
μ
A
~
x
1
,
μ
A
~
(
x
2
)
} for all x
1
,
x
2
∈
R
,
0
≤
λ
≤
1;
(iv)
concave for the nonmembership functionν
A
~
x; that is, ν
A
~
(
λ
x
1
+
(
1
-
λ
)
x
2
)
≤
m
a
x
⁡
{
ν
A
~
x
1
,
ν
A
~
(
x
2
)
} for all x
1
,
x
2
∈
R
,
0
≤
λ
≤
1.


### 2.4. TIFN [30]

LetA
~
=
{
b
,
a
,
c
,
w
a
,
u
a
} be a TIFN. Then the membership and the nonmembership function of A
~ are expressed as (2)
μ
A
~
x
=
x
-
b
a
-
b
w
a
if
b
≤
x
≤
a
c
-
x
c
-
a
w
a
if
a
≤
x
≤
c
0
if
x
<
b
or
x
>
c
,
ν
A
~
x
=
a
-
x
a
-
d
u
a
if
b
≤
x
≤
a
x
-
a
e
-
a
u
a
if
a
≤
x
≤
c
1
if
x
<
b
or
x
>
c
.That TIFN is expressed by Figure 2.Figure 2
TIFN.A TIFN is called normal ifw
a
=
1 and u
a
=
0 for at least one x.


## 2.1. FN [42]

A fuzzy setA
~ defined on the set of real numbers, R, is said to be an FN if its membership function μ
A
~
(
x
) satisfies the following characteristics:(i)
μ
A
~
:
R
→
[
0,1
] is continuous.
(ii)
μ
A
~
x
=
0 for all x
∈
-
∞
,
a
∪
[
d
,
∞
).
(iii)
μ
A
~
(
x
) is strictly increasing on [
a
,
b
] and strictly decreasing on [
c
,
d
].
(iv)
μ
A
~
x
=
1 for all x
∈
[
b
,
c
], where a
≤
b
≤
c
≤
d.


## 2.2. TFN [43]

An FNA
~
=
(
a
,
b
,
c
) is said to be TFN if its membership function μ
A
~
(
x
) is given by (1)
μ
A
~
x
=
0
if
x
<
a
or
x
>
c
x
-
a
b
-
a
if
a
≤
x
≤
b
c
-
x
c
-
b
if
b
≤
x
≤
c
.The TFN can be expressed in the form of Figure1.Figure 1
TFN.


## 2.3. IFN [44]

An IFNA
~ is(i)
an IFS defined onR;
(ii)
normal; that is, there existsx
∈
R such that μ
A
~
x
=
1 and ν
A
~
x
=
0;
(iii)
convex for the membership functionμ
A
~
x; that is, μ
A
~
(
λ
x
1
+
(
1
-
λ
)
x
2
)
≥
m
i
n
⁡
{
μ
A
~
x
1
,
μ
A
~
(
x
2
)
} for all x
1
,
x
2
∈
R
,
0
≤
λ
≤
1;
(iv)
concave for the nonmembership functionν
A
~
x; that is, ν
A
~
(
λ
x
1
+
(
1
-
λ
)
x
2
)
≤
m
a
x
⁡
{
ν
A
~
x
1
,
ν
A
~
(
x
2
)
} for all x
1
,
x
2
∈
R
,
0
≤
λ
≤
1.


## 2.4. TIFN [30]

LetA
~
=
{
b
,
a
,
c
,
w
a
,
u
a
} be a TIFN. Then the membership and the nonmembership function of A
~ are expressed as (2)
μ
A
~
x
=
x
-
b
a
-
b
w
a
if
b
≤
x
≤
a
c
-
x
c
-
a
w
a
if
a
≤
x
≤
c
0
if
x
<
b
or
x
>
c
,
ν
A
~
x
=
a
-
x
a
-
d
u
a
if
b
≤
x
≤
a
x
-
a
e
-
a
u
a
if
a
≤
x
≤
c
1
if
x
<
b
or
x
>
c
.That TIFN is expressed by Figure 2.Figure 2
TIFN.A TIFN is called normal ifw
a
=
1 and u
a
=
0 for at least one x.


## 3. Proposed Ranking Technique for Normal TIFN

LetA
~
=
{
a
2
,
a
,
a
3
,
(
a
1
,
a
,
a
4
)
} be a normal TIFN. Then the membership and the nonmembership functions of A
~ are expressed as (3)
μ
A
~
x
=
x
-
a
2
a
-
a
2
if
a
2
≤
x
≤
a
a
3
-
x
a
3
-
a
if
a
≤
x
≤
a
3
0
if
x
<
a
2
or
x
>
a
3
,
ν
A
~
x
=
a
-
x
a
-
a
1
if
a
1
≤
x
≤
a
x
-
a
a
4
-
a
if
a
≤
x
≤
a
4
1
if
x
<
a
1
or
x
>
a
4
,which is presented in Figure 3.Figure 3
Triangular normal IFN.It is to be noted here that if the nonmembership value decreases, acceptance of the IFN increases. As a consequence, if the value of complement of the nonmembership function increases, the acceptance possibility of the IFN increases. Considering those concepts, membership functions as well as the complement of the nonmembership functions are taken into account to rank the IFNs. The complement of the nonmembership function of a normal TIFNA
~ is given by(4)
1
-
ν
A
~
x
=
x
-
a
1
a
-
a
1
if
a
1
≤
x
≤
a
a
4
-
x
a
4
-
a
if
a
≤
x
≤
a
4
0
if
x
<
a
1
or
x
>
a
4
.Let us define two probability density functions f
1
(
x
) and f
2
(
x
) corresponding to the membership function μ
A
~
x and the complement of the nonmembership function 1
-
ν
A
~
x, respectively.Letf
1
x
=
k
1
μ
A
~
x; then ∫
-
∞
∞
f
1
x
d
x
=
1 implies k
1
∫
-
∞
∞
μ
A
~
x
d
x
=
1;   that is,(5)
k
1
∫
a
2
a
x
-
a
2
a
-
a
2
d
x
+
∫
a
a
3
a
3
-
x
a
3
-
a
d
x
=
1
;that is,(6)
k
1
=
2
a
3
-
a
2
.Thus(7)
f
1
x
=
2
x
-
a
2
a
3
-
a
2
a
-
a
2
if
a
2
≤
x
≤
a
2
a
3
-
x
a
3
-
a
2
a
3
-
a
if
a
≤
x
≤
a
3
0
if
x
<
a
2
or
x
>
a
3
.Similarly, defining f
2
x
=
k
2
(
1
-
ν
A
~
x
), the constant k
2 and the function f
2
x are obtained as (8)
k
2
=
2
a
4
-
a
1
,
f
2
x
=
2
x
-
a
1
a
4
-
a
1
a
-
a
1
if
a
1
≤
x
≤
a
2
a
4
-
x
a
4
-
a
1
a
4
-
a
if
a
≤
x
≤
a
4
0
if
x
<
a
1
or
x
>
a
4
.Let f
(
x
) be the probability density function corresponding to the normal TIFN A
~ which is defined as (9)
f
x
=
λ
f
1
x
+
1
-
λ
f
2
x
,
0
≤
λ
≤
1
.A technique for defuzzification of fuzzy number using Mellin’s transform was developed by R. Saneifard and R. Saneifard [36]. There are lots of successful applications [45–49] of this technique. From that viewpoint, Mellin’s transformation has been applied to find the defuzzified value of IFNs. Mellin’s transform is given by (10)
M
X
t
=
∫
0
∞
x
t
-
1
f
x
d
x
.Here X denotes the random variable corresponding to the normal TIFN A
~. Thus(11)
M
X
t
=
∫
0
∞
x
t
-
1
λ
f
1
x
+
1
-
λ
f
2
x
d
x
=
2
λ
∫
a
2
a
x
t
-
1
x
-
a
2
a
-
a
2
a
3
-
a
2
d
x
+
∫
a
a
3
x
t
-
1
a
3
-
x
a
3
-
a
a
3
-
a
2
d
x
+
2
1
-
λ
∫
a
1
a
x
t
-
1
x
-
a
1
a
-
a
1
a
4
-
a
1
d
x
+
∫
a
a
4
x
t
-
1
a
4
-
x
a
4
-
a
a
4
-
a
1
d
x
=
2
λ
a
-
a
2
a
3
-
a
2
a
t
+
1
-
a
2
t
+
1
t
+
1
-
a
2
a
t
-
a
2
t
t
+
2
λ
a
3
-
a
a
3
-
a
2
a
3
a
3
t
-
a
t
t
-
a
3
t
+
1
-
a
t
+
1
t
+
1
+
2
1
-
λ
a
-
a
1
a
4
-
a
1
a
t
+
1
-
a
1
t
+
1
t
+
1
-
a
1
a
t
-
a
1
t
t
+
2
1
-
λ
a
4
-
a
a
4
-
a
1
a
4
a
4
t
-
a
t
t
-
a
4
t
+
1
-
a
t
+
1
t
+
1
.For t
=
2, Mellin’s transform converted to the definition of expectation of a random variable. Since the target is to find the expected or defuzzified value of TIFNs, t
=
2 has been considered.Thus the crisp equivalent value of the normal TIFN is found as(12)
V
A
~
=
M
X
2
=
2
λ
a
3
-
a
2
a
2
2
+
a
a
2
+
a
2
3
-
a
2
a
2
+
a
2
+
2
λ
a
3
-
a
2
a
3
a
3
+
a
2
-
a
3
2
+
a
3
a
+
a
2
3
+
2
1
-
λ
a
4
-
a
1
a
2
+
a
a
1
+
a
1
2
3
-
a
1
a
+
a
1
2
+
2
1
-
λ
a
4
-
a
1
a
4
a
4
+
a
2
-
a
4
2
+
a
4
a
+
a
2
3
,
V
A
~
=
λ
a
2
+
a
3
-
a
1
-
a
4
+
a
1
+
a
4
+
a
3
.For any two normal TIFNs A
~ and B
~ if V
A
~ and V
B
~ represent their equivalent crisp values, then,(1)
V
A
~
<
V
B
~ if and only if A
~
≲
B
~;
(2)
V
A
~
>
V
B
~ if and only if A
~
≳
B
~;
(3)
V
A
~
=
V
B
~ if and only if A
~
≅
B
~.It is worthy to mention here that Wang and Kerre [50] proposed seven axioms as the reasonable properties of ordering fuzzy quantities for an ordering approach. The properties of IFNs depend on two FSs, namely, membership function and nonmembership function; and it can easily be shown that all the seven axioms have been satisfied by the proposed ranking technique as described above.The derived process of ranking of normal TIFNs is to be summarized through the following algorithm.


### 3.1. Solution Algorithm

Step 1.
Write the membership functionμ
A
~
x and nonmembership function ν
A
~
x of the normal TIFN A
~ (refer to (3)).Step 2.
Calculate the complement1
-
ν
A
~
x of the nonmembership function ν
A
~
x of the normal TIFN A
~ (refer to (4)).Step 3.
Construct the probability density functionf
1
x for the membership function μ
A
~
x and f
2
x for the complement of the nonmembership function ν
A
~
x of the normal TIFN A
~ (refer to (7) and (8)).Step 4.
Take the convex combination off
1
x and f
2
x to form the probability density function of the normal TIFN A
~ (refer to (9)).Step 5.
Use Mellin’s transform to calculate the crisp value of the normal TIFNA
~ (refer to (12)).Step 6.
Stop.


### 3.2. Illustrative Example

The following three TIFNs are considered to find their equivalent crisp value by the proposed technique.LetA
~
=
1.5,2
,
2.5
,
(
1,2
,
3
), B
~
=
0.6,1
,
1.4
,
(
0.2,1
,
1.8
), and C
~
=
2.2,3
,
3.8
,
(
1.8,3
,
4.2
) be three TIFNs.The membership function of the TIFNA
~ is given by (13)
μ
A
~
x
=
x
-
1.5
0.5
if
1.5
≤
x
≤
2
2.5
-
x
0.5
if
2
≤
x
≤
2.5
0
o
t
h
e
r
w
i
s
e
.The nonmembership function of A
~ is presented as (14)
ν
A
~
x
=
2
-
x
if
1
≤
x
≤
2
x
-
2
if
2
≤
x
≤
3
1
o
t
h
e
r
w
i
s
e
.The complement of the non-membership function ν
A
~
x is calculated as(15)
1
-
ν
A
~
x
=
x
-
1
if
1
≤
x
≤
2
3
-
x
if
2
≤
x
≤
3
0
o
t
h
e
r
w
i
s
e
.Let f
1
(
x
) and f
2
(
x
) be the respective density functions of the membership function and the complement of nonmembership function which are calculated as defined in the proposed methodology. Then the density function of the TIFN A
~ is considered as x
=
λ
f
1
x
+
(
1
-
λ
)
f
2
(
x
), (
0
≤
λ
≤
1
).Using Mellin’s transform the crisp value of TIFNA
~ is calculated as V
A
~
=
2. Similarly the crisp value of TIFNs B
~ and C
~ is evaluated as V
B
~
=
1, V
C
~
=
3, (
0
≤
λ
≤
1
).Thus the ordering in the proposed ranking technique isB
~
≲
A
~
≲
C
~.


### 3.3. Comparison of the Proposed Ranking Method with the Predefined Methods

The proposed ranking technique is compared with other predefined ranking methods [29–34] to explore the consistency of the proposed ranking methodology through Table 1.Table 1
Comparison between ranking techniques.
Methodology
IFN
Ranking value
Result
Dubey and Mehra  [29]
A
~
=
1.5,2
,
2.5
,
(
1,2
,
3
)
R
A
~
,
λ
=
1.33
+
0.34
λ
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
(
0.2,1
,
1.8
)
R
B
~
,
λ
=
0.47
+
0.26
λ
C
~
=
2.2,3
,
3.8
,
(
1.8,3
,
4.2
)
R
C
~
,
λ
=
2.2
+
0.27
λ
Li [30]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
R
A
~
,
λ
=
2
1.67
-
0.34
λ
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
R
B
~
,
λ
=
1
1.53
-
0.26
λ
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
R
C
~
,
λ
=
3
1.8
-
0.27
λ
Nehi  [31]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
C
μ
k
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
C
μ
k
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
C
μ
k
C
~
=
3
Wan  [32]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
V
C
A
~
α
=
0.10,  V
C
A
~
β
=
0.35
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
V
C
B
~
α
=
0.16
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
V
C
C
~
α
=
0.10,  V
C
C
~
β
=
0.28
Wan and Yi  [34]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
m
μ
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
m
μ
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
m
μ
C
~
=
3
Wan et al.  [33]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
h
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
h
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
h
C
~
=
3
Proposed method
A
~
=
1.5,2
,
2.5
,
1,2
,
3
V
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
V
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
V
C
~
=
3From Table1 it is evident that the ordering obtained using the proposed methodology is identical in comparison with other techniques. This indicates that the proposed methodology is consistent with the other predefined techniques which can be considered as an alternative technique for ranking IFNs. However, the superiority of the proposed approach would be reflected in the context of solving BLPPs with TIFNs.Using the proposed ranking method of normal TIFN a fuzzy stochastic linear bilevel programming (FSLBLP) model is developed and solved in the following section.


## 3.1. Solution Algorithm

Step 1.
Write the membership functionμ
A
~
x and nonmembership function ν
A
~
x of the normal TIFN A
~ (refer to (3)).Step 2.
Calculate the complement1
-
ν
A
~
x of the nonmembership function ν
A
~
x of the normal TIFN A
~ (refer to (4)).Step 3.
Construct the probability density functionf
1
x for the membership function μ
A
~
x and f
2
x for the complement of the nonmembership function ν
A
~
x of the normal TIFN A
~ (refer to (7) and (8)).Step 4.
Take the convex combination off
1
x and f
2
x to form the probability density function of the normal TIFN A
~ (refer to (9)).Step 5.
Use Mellin’s transform to calculate the crisp value of the normal TIFNA
~ (refer to (12)).Step 6.
Stop.


## 3.2. Illustrative Example

The following three TIFNs are considered to find their equivalent crisp value by the proposed technique.LetA
~
=
1.5,2
,
2.5
,
(
1,2
,
3
), B
~
=
0.6,1
,
1.4
,
(
0.2,1
,
1.8
), and C
~
=
2.2,3
,
3.8
,
(
1.8,3
,
4.2
) be three TIFNs.The membership function of the TIFNA
~ is given by (13)
μ
A
~
x
=
x
-
1.5
0.5
if
1.5
≤
x
≤
2
2.5
-
x
0.5
if
2
≤
x
≤
2.5
0
o
t
h
e
r
w
i
s
e
.The nonmembership function of A
~ is presented as (14)
ν
A
~
x
=
2
-
x
if
1
≤
x
≤
2
x
-
2
if
2
≤
x
≤
3
1
o
t
h
e
r
w
i
s
e
.The complement of the non-membership function ν
A
~
x is calculated as(15)
1
-
ν
A
~
x
=
x
-
1
if
1
≤
x
≤
2
3
-
x
if
2
≤
x
≤
3
0
o
t
h
e
r
w
i
s
e
.Let f
1
(
x
) and f
2
(
x
) be the respective density functions of the membership function and the complement of nonmembership function which are calculated as defined in the proposed methodology. Then the density function of the TIFN A
~ is considered as x
=
λ
f
1
x
+
(
1
-
λ
)
f
2
(
x
), (
0
≤
λ
≤
1
).Using Mellin’s transform the crisp value of TIFNA
~ is calculated as V
A
~
=
2. Similarly the crisp value of TIFNs B
~ and C
~ is evaluated as V
B
~
=
1, V
C
~
=
3, (
0
≤
λ
≤
1
).Thus the ordering in the proposed ranking technique isB
~
≲
A
~
≲
C
~.


## 3.3. Comparison of the Proposed Ranking Method with the Predefined Methods

The proposed ranking technique is compared with other predefined ranking methods [29–34] to explore the consistency of the proposed ranking methodology through Table 1.Table 1
Comparison between ranking techniques.
Methodology
IFN
Ranking value
Result
Dubey and Mehra  [29]
A
~
=
1.5,2
,
2.5
,
(
1,2
,
3
)
R
A
~
,
λ
=
1.33
+
0.34
λ
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
(
0.2,1
,
1.8
)
R
B
~
,
λ
=
0.47
+
0.26
λ
C
~
=
2.2,3
,
3.8
,
(
1.8,3
,
4.2
)
R
C
~
,
λ
=
2.2
+
0.27
λ
Li [30]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
R
A
~
,
λ
=
2
1.67
-
0.34
λ
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
R
B
~
,
λ
=
1
1.53
-
0.26
λ
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
R
C
~
,
λ
=
3
1.8
-
0.27
λ
Nehi  [31]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
C
μ
k
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
C
μ
k
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
C
μ
k
C
~
=
3
Wan  [32]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
V
C
A
~
α
=
0.10,  V
C
A
~
β
=
0.35
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
V
C
B
~
α
=
0.16
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
V
C
C
~
α
=
0.10,  V
C
C
~
β
=
0.28
Wan and Yi  [34]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
m
μ
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
m
μ
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
m
μ
C
~
=
3
Wan et al.  [33]
A
~
=
1.5,2
,
2.5
,
1,2
,
3
h
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
h
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
h
C
~
=
3
Proposed method
A
~
=
1.5,2
,
2.5
,
1,2
,
3
V
A
~
=
2
B
~
≲
A
~
≲
C
~
B
~
=
0.6,1
,
1.4
,
0.2,1
,
1.8
V
B
~
=
1
C
~
=
2.2,3
,
3.8
,
1.8,3
,
4.2
V
C
~
=
3From Table1 it is evident that the ordering obtained using the proposed methodology is identical in comparison with other techniques. This indicates that the proposed methodology is consistent with the other predefined techniques which can be considered as an alternative technique for ranking IFNs. However, the superiority of the proposed approach would be reflected in the context of solving BLPPs with TIFNs.Using the proposed ranking method of normal TIFN a fuzzy stochastic linear bilevel programming (FSLBLP) model is developed and solved in the following section.


## 4. FSLBLP Model Formulation

An LFSBLP problem with normal TIFNs as coefficients is presented as follows:(16)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
Z
~
1
≅
∑
j
=
1
n
c
~
1
j
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
Z
~
2
≅
∑
j
=
1
n
c
~
2
j
x
j
S
u
b
j
e
c
t
t
o
r
∑
j
=
1
n
a
~
i
j
x
j
≲
b
~
i
≥
1
-
γ
i
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
,where c
~
k
j
=
c
k
j
2
,
c
k
j
,
c
k
j
3
,
c
k
j
1
,
c
k
j
,
c
k
j
4 and a
~
i
j
=
a
i
j
2
,
a
i
j
,
a
i
j
3
,
a
i
j
1
,
a
i
j
,
a
i
j
4 (k
=
1,2; j
=
1,2
,
…
,
n; i
=
1,2
,
…
,
m) are normal TIFNs and γ
i is any real number that lies within 0,1. Here b
~
i
(
i
=
1,2
,
…
,
m
) denotes fuzzy random variable following normal distribution whose mean m
b
~
i
=
m
b
i
2
,
m
b
i
,
m
b
i
3
,
m
b
i
1
,
m
b
i
,
m
b
i
4 and standard deviation σ
b
~
i
=
σ
b
i
2
,
σ
b
i
,
σ
b
i
3
,
σ
b
i
1
,
σ
b
i
,
σ
b
i
4 are normal TIFNs and ≅, ≲, and ≳ denote fuzzily equal, less than or equal, and greater than or equal, respectively. The decision vector X
1
=
(
x
11
,
x
12
,
…
,
x
1
n
1
) is controlled by the upper level DM and X
2
=
(
x
21
,
x
22
,
…
,
x
2
n
2
) is controlled by the lower level DM; X
=
X
1
∪
X
2 and n
1
+
n
2
=
n.


### 4.1. FP Model Formulation [5]

Applying CCP technique, the probabilistic constraintsP
r
∑
j
=
1
n
a
~
i
j
x
j
≲
b
~
i
≥
1
-
γ
i (i
=
1,2
,
…
,
m) are modified as follows:(17)
P
r
∑
j
=
1
n
a
~
i
j
x
j
≲
b
~
i
≥
1
-
γ
i
;
that is
,
P
r
b
~
i
≲
∑
j
=
1
n
a
~
i
j
x
j
≤
γ
i
;
that is
,
P
r
b
~
i
-
m
b
~
i
σ
b
~
i
≲
∑
j
=
1
n
a
~
i
j
x
j
-
m
b
~
i
σ
b
~
i
≤
γ
i
;
that is
,
Φ
∑
j
=
1
n
a
~
i
j
x
j
-
m
b
~
i
σ
b
~
i
≤
γ
i
or
∑
j
=
1
n
a
~
i
j
x
j
≤
m
b
~
i
+
Φ
-
1
γ
i
σ
b
~
i
,where the function Φ
(
·
) represents the cumulative distribution function of the standard normal fuzzy random variate.Hence the linear fuzzy BLPP is written in the following form as(18)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
Z
~
1
≅
∑
j
=
1
n
c
~
1
j
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
Z
~
2
≅
∑
j
=
1
n
c
~
2
j
x
j
Subject  to
∑
j
=
1
n
a
~
i
j
x
j
≤
m
b
~
i
+
Φ
-
1
γ
i
σ
b
~
i
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
.


### 4.2.  Construction of Linear Bilevel Programming Model Using Proposed Ranking Method

In this subsection the proposed ranking function is applied to convert the FP model into a deterministic model. Using the linearity of ranking function, the above model is written as(19)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
V
Z
~
1
=
∑
j
=
1
n
V
c
~
1
j
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
V
Z
~
2
=
∑
j
=
1
n
V
c
~
2
j
x
j
Subject  to
∑
j
=
1
n
V
a
~
i
j
x
j
≤
V
m
b
~
i
+
Φ
-
1
γ
i
V
σ
b
~
i
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
.Using the parameters of TIFNs, model (19) is expressed as (20)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
V
Z
~
1
=
∑
j
=
1
n
λ
c
1
j
2
+
c
1
j
3
-
c
1
j
1
-
c
1
j
4
+
c
1
j
1
+
c
1
j
4
+
c
1
j
3
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
V
Z
~
2
=
∑
j
=
1
n
λ
c
2
j
2
+
c
2
j
3
-
c
2
j
1
-
c
2
j
4
+
c
2
j
1
+
c
2
j
4
+
c
2
j
3
x
j
Subject  to
∑
j
=
1
n
λ
a
i
j
2
+
a
i
j
3
-
a
i
j
1
-
a
i
j
4
+
a
i
j
1
+
a
i
j
4
+
a
i
j
3
x
j
≤
λ
m
b
i
2
+
m
b
i
3
-
m
b
i
1
-
m
b
i
4
+
m
b
i
1
+
m
b
i
+
m
b
i
4
3
+
Φ
-
1
γ
i
λ
σ
b
i
2
+
σ
b
i
3
-
σ
b
i
1
-
σ
b
i
4
+
σ
b
i
1
+
σ
b
i
+
σ
b
i
4
3
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
;
0
≤
λ
≤
1
.Now, the DMs are trying to optimize their objective independently under the system constraints defined above. Let V
Z
~
1
b and V
Z
~
2
b be the best value of the objective of the upper and lower level DMs, respectively, obtained by solving each objective independently. Since the DMs are trying to maximize their objective and they also want that the maximum value of the objective of the other level DM cannot exceed his minimum value of the objective, therefore, the worst values V
Z
~
1
wand V
Z
~
2
w are calculated by considering the best solution point of the other level DM. That is,(21)
V
Z
~
1
w
=
V
Z
~
1
at best  solution  point  of  2nd  level  DM
,
V
Z
~
2
w
=
V
Z
~
2
at best  solution  point  of 1st level DM
.Hence the fuzzy goal for each objective is expressed as (22)
V
Z
~
k
≳
V
Z
~
k
b
;
k
=
1,2
.Thus the membership function of the upper and lower level objective is constructed as(23)
μ
V
Z
~
k
=
0
if
V
Z
~
k
≤
V
Z
~
k
w
V
Z
~
k
-
V
Z
~
k
w
V
Z
~
k
b
-
V
Z
~
k
w
if
V
Z
~
k
w
≤
V
Z
~
k
≤
V
Z
~
k
b
1
if
V
Z
~
k
≥
V
Z
~
k
b
k
=
1,2
.With the help of the above membership functions, the FGP model is defined in the next section.


### 4.3. Weighted FGP Model Formulation

In FGP model formulation, the membership functions are first converted into flexible membership goals by introducing under- and overdeviational variables to each of them and thereby assigning the highest membership value (unity) as the aspiration level to each of them. Also it is evident that full achievement of all the membership goals is not possible in MODM context. So the underdeviational variables are minimized to achieve the best goal values of objectives in the decision making environment.Thus a FGP model is formulated as(24)
F
i
n
d
X
x
1
,
x
2
,
…
,
x
n
so  as  to
M
i
n
i
m
i
z
e
D
=
∑
k
=
1
K
w
k
d
k
-
Subject  to
μ
V
Z
~
k
+
d
k
-
-
d
k
+
=
1
;
k
=
1,2
,
∑
j
=
1
n
λ
a
i
j
2
+
a
i
j
3
-
a
i
j
1
-
a
i
j
4
+
a
i
j
1
+
a
i
j
4
+
a
i
j
3
x
j
≤
λ
m
b
i
2
+
m
b
i
3
-
m
b
i
1
-
m
b
i
4
+
m
b
i
1
+
m
b
i
+
m
b
i
4
3
+
Φ
-
1
γ
i
λ
σ
b
i
2
+
σ
b
i
3
-
σ
b
i
1
-
σ
b
i
4
+
σ
b
i
1
+
σ
b
i
+
σ
b
i
4
3
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
;
0
≤
λ
≤
1
,where w
k
≥
0 represents the numerical weights of the goals which are determined as (25)
w
k
=
p
k
V
Z
~
k
b
-
V
Z
~
k
w
,
k
=
1,2
;
p
k
>
0
.The developed model (24) is solved to find the most satisfactory solution in the decision making environment.


### 4.4. Solution Algorithm

The methodology for developing the intuitionistic FSLBLP model is presented in the form of an algorithm as follows.Step 1.
Apply CCP technique to all the fuzzy probabilistic constraints, to form a fuzzy linear bilevel programming model (refer to (18)).Step 2.
Using the proposed ranking technique of IFNs, the deterministic linear bilevel model is developed (refer to (19)).Step 3.
The individual optimal value of the objective of each DM is found in isolation.Step 4.
The worst value of the objective of the DMs is evaluated at the best solution point of the other level DMs (refer to (21)).Step 5.
Construct the fuzzy membership goals of the objective of each DM (refer to (22)).Step 6.
FGP approach is used to achieve maximum degree of each of the membership goals (refer to (24)).Step 7.
Stop.


## 4.1. FP Model Formulation [5]

Applying CCP technique, the probabilistic constraintsP
r
∑
j
=
1
n
a
~
i
j
x
j
≲
b
~
i
≥
1
-
γ
i (i
=
1,2
,
…
,
m) are modified as follows:(17)
P
r
∑
j
=
1
n
a
~
i
j
x
j
≲
b
~
i
≥
1
-
γ
i
;
that is
,
P
r
b
~
i
≲
∑
j
=
1
n
a
~
i
j
x
j
≤
γ
i
;
that is
,
P
r
b
~
i
-
m
b
~
i
σ
b
~
i
≲
∑
j
=
1
n
a
~
i
j
x
j
-
m
b
~
i
σ
b
~
i
≤
γ
i
;
that is
,
Φ
∑
j
=
1
n
a
~
i
j
x
j
-
m
b
~
i
σ
b
~
i
≤
γ
i
or
∑
j
=
1
n
a
~
i
j
x
j
≤
m
b
~
i
+
Φ
-
1
γ
i
σ
b
~
i
,where the function Φ
(
·
) represents the cumulative distribution function of the standard normal fuzzy random variate.Hence the linear fuzzy BLPP is written in the following form as(18)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
Z
~
1
≅
∑
j
=
1
n
c
~
1
j
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
Z
~
2
≅
∑
j
=
1
n
c
~
2
j
x
j
Subject  to
∑
j
=
1
n
a
~
i
j
x
j
≤
m
b
~
i
+
Φ
-
1
γ
i
σ
b
~
i
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
.


## 4.2.  Construction of Linear Bilevel Programming Model Using Proposed Ranking Method

In this subsection the proposed ranking function is applied to convert the FP model into a deterministic model. Using the linearity of ranking function, the above model is written as(19)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
V
Z
~
1
=
∑
j
=
1
n
V
c
~
1
j
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
V
Z
~
2
=
∑
j
=
1
n
V
c
~
2
j
x
j
Subject  to
∑
j
=
1
n
V
a
~
i
j
x
j
≤
V
m
b
~
i
+
Φ
-
1
γ
i
V
σ
b
~
i
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
.Using the parameters of TIFNs, model (19) is expressed as (20)
Find
X
x
1
,
x
2
,
…
,
x
n
so  as  to
m
a
x
X
1
V
Z
~
1
=
∑
j
=
1
n
λ
c
1
j
2
+
c
1
j
3
-
c
1
j
1
-
c
1
j
4
+
c
1
j
1
+
c
1
j
4
+
c
1
j
3
x
j
,
where  for  given
X
1
;
X
2
solves
m
a
x
X
2
V
Z
~
2
=
∑
j
=
1
n
λ
c
2
j
2
+
c
2
j
3
-
c
2
j
1
-
c
2
j
4
+
c
2
j
1
+
c
2
j
4
+
c
2
j
3
x
j
Subject  to
∑
j
=
1
n
λ
a
i
j
2
+
a
i
j
3
-
a
i
j
1
-
a
i
j
4
+
a
i
j
1
+
a
i
j
4
+
a
i
j
3
x
j
≤
λ
m
b
i
2
+
m
b
i
3
-
m
b
i
1
-
m
b
i
4
+
m
b
i
1
+
m
b
i
+
m
b
i
4
3
+
Φ
-
1
γ
i
λ
σ
b
i
2
+
σ
b
i
3
-
σ
b
i
1
-
σ
b
i
4
+
σ
b
i
1
+
σ
b
i
+
σ
b
i
4
3
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
;
0
≤
λ
≤
1
.Now, the DMs are trying to optimize their objective independently under the system constraints defined above. Let V
Z
~
1
b and V
Z
~
2
b be the best value of the objective of the upper and lower level DMs, respectively, obtained by solving each objective independently. Since the DMs are trying to maximize their objective and they also want that the maximum value of the objective of the other level DM cannot exceed his minimum value of the objective, therefore, the worst values V
Z
~
1
wand V
Z
~
2
w are calculated by considering the best solution point of the other level DM. That is,(21)
V
Z
~
1
w
=
V
Z
~
1
at best  solution  point  of  2nd  level  DM
,
V
Z
~
2
w
=
V
Z
~
2
at best  solution  point  of 1st level DM
.Hence the fuzzy goal for each objective is expressed as (22)
V
Z
~
k
≳
V
Z
~
k
b
;
k
=
1,2
.Thus the membership function of the upper and lower level objective is constructed as(23)
μ
V
Z
~
k
=
0
if
V
Z
~
k
≤
V
Z
~
k
w
V
Z
~
k
-
V
Z
~
k
w
V
Z
~
k
b
-
V
Z
~
k
w
if
V
Z
~
k
w
≤
V
Z
~
k
≤
V
Z
~
k
b
1
if
V
Z
~
k
≥
V
Z
~
k
b
k
=
1,2
.With the help of the above membership functions, the FGP model is defined in the next section.


## 4.3. Weighted FGP Model Formulation

In FGP model formulation, the membership functions are first converted into flexible membership goals by introducing under- and overdeviational variables to each of them and thereby assigning the highest membership value (unity) as the aspiration level to each of them. Also it is evident that full achievement of all the membership goals is not possible in MODM context. So the underdeviational variables are minimized to achieve the best goal values of objectives in the decision making environment.Thus a FGP model is formulated as(24)
F
i
n
d
X
x
1
,
x
2
,
…
,
x
n
so  as  to
M
i
n
i
m
i
z
e
D
=
∑
k
=
1
K
w
k
d
k
-
Subject  to
μ
V
Z
~
k
+
d
k
-
-
d
k
+
=
1
;
k
=
1,2
,
∑
j
=
1
n
λ
a
i
j
2
+
a
i
j
3
-
a
i
j
1
-
a
i
j
4
+
a
i
j
1
+
a
i
j
4
+
a
i
j
3
x
j
≤
λ
m
b
i
2
+
m
b
i
3
-
m
b
i
1
-
m
b
i
4
+
m
b
i
1
+
m
b
i
+
m
b
i
4
3
+
Φ
-
1
γ
i
λ
σ
b
i
2
+
σ
b
i
3
-
σ
b
i
1
-
σ
b
i
4
+
σ
b
i
1
+
σ
b
i
+
σ
b
i
4
3
;
i
=
1,2
,
…
,
m
x
j
≥
0
;
j
=
1,2
,
…
,
n
;
0
≤
λ
≤
1
,where w
k
≥
0 represents the numerical weights of the goals which are determined as (25)
w
k
=
p
k
V
Z
~
k
b
-
V
Z
~
k
w
,
k
=
1,2
;
p
k
>
0
.The developed model (24) is solved to find the most satisfactory solution in the decision making environment.


## 4.4. Solution Algorithm

The methodology for developing the intuitionistic FSLBLP model is presented in the form of an algorithm as follows.Step 1.
Apply CCP technique to all the fuzzy probabilistic constraints, to form a fuzzy linear bilevel programming model (refer to (18)).Step 2.
Using the proposed ranking technique of IFNs, the deterministic linear bilevel model is developed (refer to (19)).Step 3.
The individual optimal value of the objective of each DM is found in isolation.Step 4.
The worst value of the objective of the DMs is evaluated at the best solution point of the other level DMs (refer to (21)).Step 5.
Construct the fuzzy membership goals of the objective of each DM (refer to (22)).Step 6.
FGP approach is used to achieve maximum degree of each of the membership goals (refer to (24)).Step 7.
Stop.


## 5. Numerical Example

To illustrate the proposed methodology the following FSLBLP problem is considered with coefficients of objectives and system constraints are taken as normal TIFNs:(26)
Find
X
x
1
,
x
2
so  as  to
M
a
x
Z
~
1
≅
8
~
x
1
+
17
~
x
2
M
a
x
Z
~
2
≅
15
~
x
1
+
4
~
x
2
Subject  to
P
r
10
~
x
1
+
6
~
x
2
≲
b
~
1
≥
0.15
Pr
⁡
7
~
x
1
+
12
~
x
2
≲
b
~
2
≥
0.09
x
1
,
x
2
≥
0
,where b
~
1 and b
~
2 denote fuzzy random variables following normal distribution. Here 8
~, 17
~, 15
~, 4
~, 10
~, 6
~, 7
~, and 12
~ are all normal TIFNs. Then the TIFNs can be expressed as (27)
8
~
=
7.6,8
,
8.5
,
7,8
,
9
,
17
~
=
16,17,18
,
15,17,18.6
,
15
~
=
14.4,15,15.6
,
14,15,16.5
,
4
~
=
3,4
,
4.8
,
2.6,4
,
5
,
10
~
=
9.4,10,10.8
,
8.5,10,11.5
,
6
~
=
5.6,6
,
6.5
,
5,6
,
7
,
7
~
=
6,7
,
8
,
5.6,7
,
8.9
,
12
~
=
11.2,12,13
,
10.5,12,13.5
.The mean m
b
~
i and standard deviation σ
b
~
i
i
=
1,2 of the fuzzy random variables b
~
i following normal distribution are given as(28)
m
b
~
1
=
20
~
=
19.4,20,21
,
19,20,21.2
,
σ
b
~
1
=
5
~
=
4,5
,
5.9
,
3.8,5
,
6
,
m
b
~
2
=
21
~
=
19.8,21,21.7
,
19.5,21,23
,
σ
b
~
2
=
4
~
=
3.6,4
,
5.5
,
3,4
,
5.84
.Applying CCP methodology the above linear fuzzy stochastic BLPP is converted into linear fuzzy BLPP as(29)
Find
X
x
1
,
x
2
so  as  to
Max
⁡
Z
~
1
≅
8
~
x
1
+
17
~
x
2
Max
⁡
Z
~
2
≅
15
~
x
1
+
4
~
x
2
Subject  to
10
~
x
1
+
6
~
x
2
≲
20
~
+
1.04
×
5
~
7
~
x
1
+
12
~
x
2
≲
21
~
+
1.37
×
4
~
x
1
,
x
2
≥
0
.By applying the proposed ranking technique of normal TIFNs, the above IFNs are converted into the equivalent crisp values as(30)
V
8
~
=
8
+
0.033
λ
,
V
17
~
=
16.87
+
0.133
λ
,
V
15
~
=
15.17
-
0.17
λ
,
V
4
~
=
3.87
+
0.07
λ
,
V
10
~
=
10
+
0.07
λ
,
V
6
~
=
6
+
0.03
λ
,
V
20
~
=
20.07
+
0.07
λ
,
V
5
~
=
4.93
+
0.03
λ
,
V
7
~
=
7.17
-
0.17
λ
,
V
12
~
=
12
+
0.07
λ
,
V
21
~
=
21.17
-
0.33
λ
,
V
4
~
=
4.28
+
0.09
λ
.Hence the deterministic model of (29) is represented as (31)
M
a
x
V
Z
~
1
=
8
+
0.033
λ
x
1
+
16.87
+
0.133
λ
x
2
M
a
x
V
Z
~
2
=
15.17
-
0.17
λ
x
1
+
3.87
+
0.07
λ
x
2
Subject  to
10
+
0.07
λ
x
1
+
6
+
0.03
λ
x
2
≤
25.2
+
0.1
λ
7.17
-
0.17
λ
x
1
+
12
+
0.07
λ
x
2
≤
27.03
-
0.21
λ
x
1
,
x
2
≥
0
.Now, each objective is considered independently and is solved with respect to the system of constraints in (31) to find the individual optimal values of the objectives. The results are obtained as(32)
V
Z
~
1
b
=
38.00
,
at  the  point
0,2.25
,
V
Z
~
2
b
=
38.23
,
at  the  point
2.52,0
.The worst values of V
(
Z
~
1
) and V
(
Z
~
2
) are obtained by putting the best solution point of the 2nd and 1st objective, respectively. Thus (
V
(
Z
~
1
)
)
w
=
20.16 and (
V
(
Z
~
2
)
)
w
=
8.71.Then the fuzzy goals of the objectives are found as(
Z
~
1
)
≳
38.00
,
V
(
Z
~
2
)
≳
38.23.The membership function of the objectives is written as(33)
μ
V
Z
~
1
=
0.056
8
+
0.033
λ
x
1
+
16.87
+
0.133
λ
x
2
-
20.16
,
μ
V
Z
~
2
=
0.034
15.17
-
0.17
λ
x
1
+
3.87
+
0.07
λ
x
2
-
8.71
.Hence the FGP model can be presented by eliciting the membership goals as(34)
Find
X
x
1
,
x
2
So  as  to  Min
D
=
0.040
d
1
-
+
0.034
d
2
-
Subject  to
μ
V
Z
~
1
+
d
1
-
-
d
1
+
=
1
μ
V
Z
~
2
+
d
2
-
-
d
2
+
=
1
10
+
0.07
λ
x
1
+
6
+
0.03
λ
x
2
≤
25.2
+
0.1
λ
7.17
-
0.17
λ
x
1
+
12
+
0.07
λ
x
2
≤
27.03
-
0.21
λ
x
1
,
x
2
≥
0
,where d
1
-, d
1
+, d
2
-, and d
2
+
≥
0 with d
1
-
·
d
1
+
,
d
2
-
·
d
2
+
=
0.Now solving the above model usingsoftware LINGO (ver. 11) the solutions are found as x
1
=
1.81, x
2
=
1.17 with objective values V
Z
~
1
=
34.48 and V
(
Z
~
2
)
=
31.78.The solutions achieved through FGP technique are summarized in Table2.Table 2
Compromise solution obtained by proposed methodology.
Objective
Solution point
Ranking value of the objective
Membership value
Z
~
1
x
1
=
1.81, x
2
=
1.17
V
(
Z
~
1
)
=
34.48
μ
V
(
Z
~
1
)
=
0.80
Z
~
2
V
(
Z
~
2
)
=
31.78
μ
V
(
Z
~
2
)
=
0.78If the numerical example presented in this section is solved by applying the ranking technique of IFN developed by Dubey and Mehra [29], then the objective values are obtained as V
(
Z
~
1
)
=
33.98 and V
(
Z
~
2
)
=
30.86. The solutions achieved by two ranking techniques are summarized in Table 3.Table 3
Comparison of solutions between existing and proposed techniques.
Ranking technique
Solution point
Objective values
Membership value
Dubey and Mehra  [29]
x
1
=
1.81
V
Z
~
1
=
33.98
μ
V
(
Z
~
1
)
=
0.79
x
2
=
1.29
V
Z
~
2
=
30.86
μ
V
(
Z
~
2
)
=
0.76
Proposed technique
x
1
=
1.81
V
Z
~
1
=
34.48
μ
V
(
Z
~
1
)
=
0.80
x
2
=
1.17
V
Z
~
2
=
31.78
μ
V
(
Z
~
2
)
=
0.78This comparison can also be shown graphically as in Figure4.Figure 4
Comparison of solutions.From the comparison table and from Figure4 it is realized that better objective values are obtained if the example is solved by the proposed ranking technique. So the proposed ranking technique is more acceptable to the DMs in real life decision making context.


## 6. Conclusions

This paper presents a new ranking technique for normal TIFNs. The proposed methodology can be used to find the defuzzified value of intuitionistic trapezoidal FNs. Based on the proposed ranking technique an intuitionistic LFSBLP model is developed. This methodology covers a wider range of applications with enriched solutions than earlier techniques. The proposed model can also be applied to solve many real life decision making problems in which parameters are expressed in the form of IFNs. Further the proposed methodology can be used efficiently to solve multiobjective fractional programming problems, multilevel optimization problems, and other associated problems in an intuitionistic fuzzy stochastic decision making arena. However, it is hoped that the proposed methodology may open up new vistas into the way of making decision in an imprecisely defined decision making arena.



---

*Source: 6475403-2016-04-28.xml*