Mathematical Sciences International Research Journal Volume 7 Spl Issue ISSN 2278-8697

ROBUST RANKING METHOD OF MULTI OBJECTIVE

FUZZY LINEAR PROGRAMMING PROBLEMS WITH
OCTAGONAL FUZZY NUMBERS

N. Sudha
Department of Mathematics, Idhaya College for Women,
Kumbakonam –612001. Tamilnadu, India, [email protected]
R.Irene Hepzibah
Department of Mathematics, A.V.C. College (Autonomous),
Mannampandal – 609305, Tamilnadu, India, [email protected]
N. Anitha
Department of Mathematics, Annai college of Arts and Science,
Kumbakonam – 612001. Tamilnadu, India, [email protected]

Abstract: In this paper multi-objective optimization problems with fuzzy parameters in the objective
functions and constraints are considered.The paper aims at solving multi objective linear programming
problems in which the parameters are octagonal fuzzy numbers with the help of robust ranking method.
Preemptive optimization method is utilized to solve the multi-objective optimization problem. The
fuzzy linear programming problems can be transformed into crisp value problem to obtain an optimal
solution using simplex method. Numerical example is provided to check the effectiveness of the
proposed method.

Keywords: Octagonal Fuzzy Number, Multi Objective Linear Programming Problem, Ranking
Technique, Simplex Method.

1. Introduction:Making a decision becomes a part of our daily life. Multi-objective decision making is
one of the most widely used methods in the decision making area. Linear programming is one of the
most frequently applied operations research technique. An application of fuzzy optimization techniques
to linear programming problems with multiple objectives has been presented by Nasseri. S.H [5],
Zimmerman (1978) [13] and Tanaka [11]. Zimmerman introduced fuzzy linear programming in fuzzy
environment. The aim of the paper is to solve Multi objective Linear Programming Problem in which
decision variable cost coefficient involving in objective function and the right hand side coefficient in
the constraints are octagonal fuzzy numbers with the help of robust ranking method. In this paper we
consider a linear multi objective mathematical programming problem in which the coefficients defining
the objective functions are given as fuzzy numbers, and where moreover, each objective can be defined
by a different decision maker, with which the respective ways of comparing the fuzzy numbers involved.

2. Preliminaries:
2.1 Fuzzy Set:A fuzzy said ܽ෤ in R is a set of ordered pairs: ܽ෤ ൌ ሼሺ‫ݔ‬ǡ ߤܽ෤ ሺ‫ݔ‬ሻሻȁ‫ܴ߳ݔ‬ሽ, If ߤܽ෤ ሺ‫ݔ‬ሻ is called the
membership function of ‫ ݔ‬in ܽ෤ which maps R to a subset of non-negative real numbers whose
supremum is finite. Ifܵ‫ܽߤ ݔ݌ݑ‬෤ ሺ‫ݔ‬ሻ ൌ ͳ, the fuzzy set ܽ෤ is called normal. The membership function maps
each element of ‫ ݔ‬to a value between (0, 1).

~ ~
2.2 Fuzzy Number : A fuzzy number A is a convex normalized fuzzy set A of the real line Rsuch
that
~
1. It exists exactly one x0 ÎRwith ߤܽ෤ ሺ‫ Ͳݔ‬ሻ = 1 (x0 is called the mean value of A)
2. 2. ߤܽ෤ ሺ‫ݔ‬ሻ is piecewise continuous.

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 93
UGC Approved Journal - Journal No 43832

2.3 Octagonal Fuzzy Number:A fuzzy number is the normal Octagonal fuzzy number is denoted by
(a1,a2,a3,a4,a5,a6,a7,a8) where a1≤a2≤a3≤a4≤a5≤a6≤a7≤a8 are real numbers and its membership function (x) is
given below
Ͳ݂‫ ݔݎ݋‬൏ ܽͳ
‫ݔ ۓ‬െܽ
ͳ
ۖ݇ ൬ ൰ ݂‫ ͳܽݎ݋‬൑ ‫ ݔ‬൑ ܽʹ
ۖ ܽ ʹ െ ܽ ͳ
ۖ ݂݇‫ ʹܽݎ݋‬൑ ‫ ݔ‬൑ ܽ͵
ۖ݇ ൅ ሺͳ െ ݇ሻ ൬ ‫ ݔ‬െ ܽ͵ ൰ ݂‫ ܽݎ݋‬൑ ‫ ݔ‬൑ ܽ
͵ Ͷ
ۖ ܽͶ െ ܽ͵
ߤܽ෤ ሺ‫ݔ‬ሻ ൌ ͳ݂‫ܽݎ݋‬Ͷ ൑ ‫ ݔ‬൑ ܽͷ

‫۔‬ ܽ͸ െ ‫ݔ‬
ۖ ݇ ൅ ሺͳ െ ݇ሻ ൬ܽ െ ܽ ൰ ݂‫ܽݎ݋‬ͷ ൑ ‫ ݔ‬൑ ܽ͸
͸ ͷ
ۖ
ۖ ݂݇‫ܽݎ݋‬͸ ൑ ‫ ݔ‬൑ ܽ͹
ۖ݇ ൬ ܽ ͺ െ ‫ݔ‬
൰ ݂‫ܽݎ݋‬͹ ൑ ‫ ݔ‬൑ ܽͺ
ۖ ܽͺ െ ܽ͹
‫ە‬ Ͳ݂‫ ݔݎ݋‬൒ ܽͺ

Remark 2.4: Ifk =0,the octagonal fuzzy number reduces to the trapezoidalnumber (a3,a4,a5,a6) and if
k=1, it reduces to the trapezoidal number (a1,a4,a5,a8).

Remark 2.5: According to the above mentioned definition, octagonal fuzzy number ‫ܣ‬ሚɘ is the ordered
quadruple ൫݈ͳ ሺ‫ݎ‬ሻǡ ‫ ͳݏ‬ሺ‫ݐ‬ሻǡ ‫ ʹݏ‬ሺ‫ݐ‬ሻǡ ݈ʹ ሺ‫ݐ‬ሻ൯ , for ‫ א ݎ‬ሾͲǡ ݇ሿ and ‫ א ݐ‬ሾ݇ǡ ɘሿ
‫ ݔ‬െ ܽͳ ‫ ݔ‬െ ܽ͵
݈ͳ ሺ‫ݎ‬ሻ ൌ ݇ ൬ ൰ǡ‫ ͳݏ‬ሺ‫ݐ‬ሻ ൌ ݇ ൅ ሺͳ െ ݇ሻ ൬ ൰ǡ
ܽʹ െ ܽͳ ܽͶ െ ܽ͵
ܽ͸ െ ‫ݔ‬ ܽͺ െ ‫ݔ‬
‫ ʹݏ‬ሺ‫ݐ‬ሻ ൌ ݇ ൅ ሺͳ െ ݇ሻ ൬ ൰ǡ ݈ʹ ሺ‫ݐ‬ሻ ൌ ݇ ൬ ൰
ܽ͸ െ ܽͷ ܽͺ െ ܽ͹

Definition 2.6: An octagonal fuzzy number denoted by ‫ܣ‬ሚɘ is defined to be the ordered quadruple
‫ܣ‬ሚɘ ൌ ൫݈ͳ ሺ‫ݎ‬ሻǡ ‫ ͳݏ‬ሺ‫ݐ‬ሻǡ ‫ ʹݏ‬ሺ‫ݐ‬ሻǡ ݈ʹ ሺ‫ݐ‬ሻ൯ , for ‫ א ݎ‬ሾͲǡ ݇ሿ and ‫ א ݐ‬ሾ݇ǡ ɘሿ
where
݈ͳ ሺ‫ݎ‬ሻ is a bounded left continuous non decreasing function over ሾͲǡ ɘͳ ሿǡ ሾͲ ൑ ɘͳ ൑ ݇ሿ
‫ ͳݏ‬ሺ‫ݐ‬ሻ is a bounded left continuous non decreasing function over ሾ݇ǡ ɘʹ ሿǡ ሾ݇ ൑ ɘʹ ൑ ɘሿ
‫ ʹݏ‬ሺ‫ݐ‬ሻ is a bounded left continuous non decreasing function over ሾ݇ǡ ɘʹ ሿǡ ሾ݇ ൑ ɘʹ ൑ ɘሿ
݈ʹ ሺ‫ݎ‬ሻ is a bounded left continuous non decreasing function over ሾͲǡ ɘͳ ሿǡ ሾͲ ൑ ɘͳ ൑ ݇ሿ

Remark 2.7: Ifω=1, then the above-defined number is called a normal octagonalfuzzy number

3.1 Robust Ranking Technique:To provide results which are consistent with human intuition, robust
ranking technique is used and it satisfies compensation, linearity and additive properties. If ܽ෤ is a convex
ͳ
fuzzy number, the robust ranking index is defined by Âሺܽ෤ሻ ൌ ‫ Ͳ׬‬ሺͲǤͷሻ ሺܽߙ‫ ܮ‬ǡ ܽߙܷ ሻ݀ߙ

Journal Published by IMRF Journals | April 2018 Edition | 94

Mathematical Sciences International Research Journal Volume 7 Spl Issue ISSN 2278-8697

where ሺܽߙ‫ ܮ‬ǡ ܽߙܷ ሻ ൌ ሾሼሺܾ െ ܽሻߙ ൅ ܽǡ ݀ െ ሺ݀ െ ܿሻߙሽǡ ሼሺ݂ െ ݁ሻߙ ൅ ݁ǡ ݄ െ ሺ݄ െ ݃ሻߙሽሿ is the ߙ - level cut of a
fuzzy number ܽ෤. Here this method is proposed for ranking the objective values. The representative value
of fuzzy number ܽ෤ is given by Robust ranking index R(ܽ෤).

3.2 Ranking Functions:A convenient method for comparing of the fuzzy numbers is by use of ranking
functions. We define a ranking function Â:F(R)®R. which maps each fuzzy number into the real line.
Now, suppose that ܽ෤ and ܾ෨ be two octagonal fuzzy numbers. Therefore, we define orders on F(R) as
following:
ܽ෤ Â൒„෨ if and only if Âሺܽ෤ሻ ൒ Âሺܾ෨ሻ
൐෨
ܽ෤  „ if and only if Âሺܽ෤ሻ ൐ Âሺܾ෨ሻ
ൌ෨
ܽ෤ „ if and only if Âሺܽ෤ሻ ൌ Âሺܾ෨ሻ
Where ܽ෤ and ܾ are in F(R). Also we write ܽ෤ Â൑„෨ if and only if ܾ෨ Â൒ƒ෤
෨

4. Fuzzy Multi – Objective Linear Programming Problem:

4.1 Multi – Objective Linear Programming Problem: A Linear Multi – objective optimization
problem is stated as
Minimize Z ൌ [C1x+ C2x+….+ Cnx]
Subject to constraints AX ൑ ܾǡ ‫ ݔ‬൒ Ͳ (1)
where Cj, j=1,2,…,n is an N vector of cost coefficients, A an m×n – coefficients matrix of constraints and b
an m vector of demand (resource) availability.

4.2 Fuzziness in the Constraints: Two different models can be considered. In the first the fuzzification
of (1) leads to the following model:
Minimize Z ൌ [C1x+ C2x+….+ Cnx]
Subject to constraints AX ൑݃ ܾǡ ‫ ݔ‬൒ Ͳ (2)
where the symbol ൑݃ indicates, as usual that there exists membership functions. ߤͳ ǣ ‫ ݔ‬՜ ሾͲǡ ͳሿǡ ݅ ൌ
ͳǡʹǡ ǥ ǡ ݉ expressing for each ‫ ܴܰ߳ݔ‬the accomplishment degree of the i constraint.
th

4.3 Fuzziness in the Objective Functions: We can suppose that the coefficients in the objective
functions are given by fuzzy numbers. Then the corresponding model can be defined as
݂ ݂ ݂
Minimize : ൣ‫ܺ ͳܥ‬ǡ ‫ܺ ʹܥ‬ǡ ǥ ǡ ‫ܺ ݊ܥ‬൧
Subject to constraints AX ൑ ܾǡ ‫ ݔ‬൒ Ͳ (3)
݂
where each ‫ ݆ܥ‬ǡ ݅ ൌ ͳǡʹǡ ǥ ǡ ݊ is an N- vector of fuzzy numbers, for the sake of simplicity, assume that all
the fuzzy numbers giving the fuzzy costs of the objective function have an octagonal shape.

5.1 Numerical Example:Consider the following fuzzy bi – objective optimization problem

‫ݖݔܽܯ‬ǁͳ ൌ ܿͳ ‫ݔ‬෤ͳ ൅ ܿʹ ‫ݔ‬෤ʹ , ‫ݖݔܽܯ‬ǁʹ ൌ ݀ͳ ‫ݔ‬෤ͳ ൅ ݀ʹ ‫ݔ‬෤ʹ
Subject to constraints ܽͳͳ ‫ݔ‬෤ͳ ൅ ܽͳʹ ‫ݔ‬෤ʹ Â൑ܾͳ , ܽʹͳ ‫ݔ‬෤ͳ ൅ ܽʹʹ ‫ݔ‬෤ʹ Â൑ܾʹ , ‫ݔ‬෤ͳ ǡ ‫ݔ‬෤ʹ Â൒Ͳ
where ܿͳ ൌ ሺെʹǡ െͳǡͲǡͳǡʹǡ͵ǡ͸ǡ͹ሻ , ܿʹ ൌ ሺͳǡʹǡ͵ǡͶǡͷǡ͸ǡͻǡͳͲሻ
݀ͳ ൌ ሺെʹǡ െͳǡͳǡʹǡʹǡͶǡ͸ǡͺሻ , ݀ͳ ൌ ሺെʹǡ െͳǡͳǡʹǡ͵ǡ͸ǡ͸ǡͻሻ
ܽͳͳ ൌ ሺ͸ǡͺǡͻǡͳͳǡͳͷǡͳ͹ǡͳͺǡʹͲሻ , ܽͳʹ ൌ ሺͳǡʹǡͶǡͷǡͺǡͳͲǡͳʹǡͳͶሻ
ܽʹͳ ൌ ሺʹǡ͵ǡ͸ǡ͹ǡͺǡͳͲǡͳͳǡͳ͵ሻ , ܽʹʹ ൌ ሺͷǡ͸ǡͺǡͻǡͳͲǡͳͳǡͳ͵ǡͳͶሻ
ܾͳ ൌ ሺͻͲǡͳͲͲǡͳʹͲǡͳ͵ͲǡͳͷͲǡͳ͸Ͳǡͳ͹ͲǡͳͺͲሻ , ܾʹ ൌ ሺͳͳͷǡͳʹͲǡͳ͵Ͳǡͳ͵ͷǡͳ͵ͷǡͳͶͷǡͳͶͷǡͳͷͷሻ

Solution:
Step 1:Using robust ranking technique. The given octagonal fuzzy number can be converted into a crisp
value.
ͳ

Âሺܽ෤ሻ ൌ නሺͲǤͷሻ ሺܽߙ‫ ܮ‬ǡ ܽߙܷ ሻ݀ߙ

Ͳ
where ሺܽߙ‫ ܮ‬ǡ ܽߙܷ ሻ ൌ ሾሼሺܾ െ ܽሻߙ ൅ ܽሽ ൅ ሼ݀ െ ሺ݀ െ ܿሻߙሽ ൅ ሼሺ݂ െ ݁ሻߙ ൅ ݁ሽ ൅ ሼ݄ െ ሺ݄ െ ݃ሻߙሽሿ

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 95
UGC Approved Journal - Journal No 43832

ͳ ͳ

Âሺܿͳ ሻ ൌ Âሺെʹǡ െͳǡͲǡͳǡʹǡ͵ǡ͸ǡ͹ሻ ൌ නሺͲǤͷሻ ሾߙ െ ʹ ൅ ͳ െ ߙ ൅ ߙ ൅ ʹ ൅ ͹ െ ߙሿ݀ߙ ൌ නሺͲǤͷሻ ሺͺሻ݀ߙ ൌ Ͷ

Ͳ Ͳ
Similarly, Âሺܿʹ ሻ ൌ ܴሺͳǡʹǡ͵ǡͶǡͷǡ͸ǡͻǡͳͲሻ ൌ ͳͲ
Âሺ݀ͳ ሻ ൌ Âሺെʹǡ െͳǡͳǡʹǡʹǡͶǡ͸ǡͺሻ ൌ ͷ , Âሺ݀ͳ ሻ ൌ Âሺെʹǡ െͳǡͳǡʹǡ͵ǡ͸ǡ͸ǡͻሻ ൌ ͸
Âሺܽͳͳ ሻ ൌ Âሺ͸ǡͺǡͻǡͳͳǡͳͷǡͳ͹ǡͳͺǡʹͲሻ ൌ ʹ͸ , Âሺܽͳʹ ሻ ൌ ÂሺͳǡʹǡͶǡͷǡͺǡͳͲǡͳʹǡͳͶሻ ൌ ͳͶ
Âሺܽʹͳ ሻ ൌ Âሺʹǡ͵ǡ͸ǡ͹ǡͺǡͳͲǡͳͳǡͳ͵ሻ ൌ ͳͷ , Âሺܽʹʹ ሻ ൌ ܴሺͷǡ͸ǡͺǡͻǡͳͲǡͳͳǡͳ͵ǡͳͶሻ ൌ ͳͻ
Âሺܾͳ ሻ ൌ ÂሺͻͲǡͳͲͲǡͳʹͲǡͳ͵ͲǡͳͷͲǡͳ͸Ͳǡͳ͹ͲǡͳͺͲሻ ൌ ʹ
Âሺܾʹ ሻ ൌ ÂሺͳͳͷǡͳʹͲǡͳ͵Ͳǡͳ͵ͷǡͳ͵ͷǡͳͶͷǡͳͶͷǡͳͷͷሻ ൌ ʹ͹Ͳ

Step 2: The crisp valued linear programming problem can be formulated as follows. Suppose we decide
that the first objective is preferable.
‫ݖ݁ݖ݅݉݅ݔܽܯ‬ǁͳ ൌ Ͷ‫ ͳݔ‬൅ ͳͲ‫ ʹݔ‬൅ Ͳ‫ ͵ݔ‬൅ Ͳ‫ݔ‬Ͷ
subject to constraints,
ʹ͸‫ ͳݔ‬൅ ͳͶ‫ ʹݔ‬൅ ‫ ͵ݔ‬൅ Ͳ‫ݔ‬Ͷ ൌ ʹ͹ͷ
ͳͷ‫ ͳݔ‬൅ ͳͻ‫ ʹݔ‬൅ Ͳ‫ ͵ݔ‬൅ ‫ݔ‬Ͷ ൌ ʹ͹Ͳ and ‫ ͳݔ‬ǡ ‫ ʹݔ‬ǡ ‫ ͵ݔ‬ǡ ‫ݔ‬Ͷ ൒ Ͳ

Enter into fuzzy simplex table and the results are tabulated below.

Table 5.1

‫ܤܥ‬ Basis x1 x2 x3 x4 ܾ݅ Ratio

4 10 0 0
0 ‫͵ݔ‬ 26 14 1 0 275 19.64

0 ‫ݔ‬Ͷ 15 19 0 1 270 14.21←

‫ ݆ݖ‬െ ݆ܿ -4 -10 ↑ 0 0 Ͳ෨ 0

Here ߛͳ ൌ ‫ ͳݖ‬െ ܿͳ ൌ െͶ ൏ Ͳ , ߛʹ ൌ ‫ ʹݖ‬െ ܿʹ ൌ െͳͲ ൏ Ͳߚ this impliesߛʹ ൏ ߛͳ .

Hence related to the fuzzy non basic variableߛʹ , ‫ݔ‬෤ʹ is an entering variable. According to the minimum
ratio test given in the step 3 of the fuzzy simplex algorithm, ‫ݔ‬෤Ͷ is a leaving variable. Now after pivoting
the resulting table is as follows:

Table 5.2

Basis x1 x2 x3 x4 ܾ݅
CB
4 10 0 0
0 ‫͵ݔ‬ 14.9 0 1 -0.70 76.06

10 ‫ʹݔ‬ 0.79 1 0 0.05 14.21

‫ ݆ݖ‬െ ݆ܿ 3.9 0 0 0.50 142

Since all ‫ ݆ݖ‬െ ݆ܿ ൒ Ͳ,then the current solution is optimal.

Therefore solution is‫ ͳݔ‬ൌ Ͳ , ‫ ʹݔ‬ൌ ͳͶǤʹ and ‫ ͳݖ݁ݖ݅݉݅ݔܽܯ‬ൌ ͳͶʹ
Next, we impose an extra constraint: Ͷ‫ ͳݔ‬൅ ͳͲ‫ ʹݔ‬൑ ͳͶʹ
We take it second objective ‫ݖݔܽܯ‬ǁʹ ൌ ͷ‫ ͳݔ‬൅ ͸‫ʹݔ‬
Subject to constraints ʹ͸‫ ͳݔ‬൅ ͳͶ‫ ʹݔ‬൑ ʹ͹ͷ ,
ͳͷ‫ ͳݔ‬൅ ͳͻ‫ ʹݔ‬൑ ʹ͹Ͳ ,
Ͷ‫ ͳݔ‬൅ ͳͲ‫ ʹݔ‬൑ ͳͶʹ , ‫ݔ‬෤ͳ ǡ ‫ݔ‬෤ʹ ൒ Ͳ

Standard Fuzzy Linear Programming Problem:

‫ݖݔܽܯ‬ǁʹ ൌ ͷ‫ ͳݔ‬൅ ͸‫ ʹݔ‬൅ Ͳ‫ ͵ݔ‬൅ Ͳ‫ݔ‬Ͷ ൅ Ͳ‫ݔ‬ͷ
subject to constraints,
ʹ͸‫ ͳݔ‬൅ ͳͶ‫ ʹݔ‬൅ ‫ ͵ݔ‬൅ Ͳ‫ݔ‬Ͷ ൅ Ͳ‫ݔ‬ͷ ൌ ʹ͹ͷ
ͳͷ‫ ͳݔ‬൅ ͳͻ‫ ʹݔ‬൅ Ͳ‫ ͵ݔ‬൅ ‫ݔ‬Ͷ ൅ Ͳ‫ݔ‬ͷ ൌ ʹ͹Ͳ

Journal Published by IMRF Journals | April 2018 Edition | 96

Mathematical Sciences International Research Journal Volume 7 Spl Issue ISSN 2278-8697

Ͷ‫ ͳݔ‬൅ ͳͲ‫ ʹݔ‬൅ Ͳ‫ ͵ݔ‬൅ Ͳ‫ݔ‬Ͷ ൅ ‫ݔ‬ͷ ൌ ͳͶʹand

‫ ͳݔ‬ǡ ‫ ʹݔ‬ǡ ‫ ͵ݔ‬ǡ ‫ݔ‬Ͷ ǡ ‫ݔ‬ͷ ൒ Ͳ
Enter into fuzzy simplex table.

Table 5.3

Basis x1 x2 x3 x4 x5 ܾ݅ Ratio
CB 5 6 0 0 0 0
0 ‫͵ݔ‬ 26 14 1 0 0 275 19.6

0 ‫ݔ‬Ͷ 15 19 0 1 0 270 14.2

0 ‫ݔ‬ͷ 4 10 0 0 1 142 14.2←

‫ ݆ݖ‬െ ݆ܿ -5 -6 ↑ 0 0 0 0

It is obvious that ‫ ʹݔ‬is an entering variable fuzzy variable and ‫ݔ‬ͷ is an leaving fuzzy variable.

Table 5.4

Basis x1 x2 x3 x4 x5 ܾ݅ Ratio
CB 5 6 0 0 0
0 ‫͵ݔ‬ 20.4 0 1 0 -1.4 76.2 3.735

0 ‫ݔ‬Ͷ 7.4 0 0 1 -1.9 0.2 0.027←

6 ‫ʹݔ‬ 0.4 1 0 0 0.1 14.2 35.5

‫ ݆ݖ‬െ ݆ܿ -2.6↑ 0 0 0 0.6

It is obvious that ‫ݔ‬෤ͳ is an entering variable fuzzy variable and ‫ݔ‬෤Ͷ is an leaving fuzzy variable.

Table 5.5

Basis x1 x2 x3 x4 x5 ܾ݅
CB 5 6 0 0 0
0 0 1 -2.75 2.6
0 ‫͵ݔ‬ 75.6
1 0 0 0.13 -0.2
5 ‫ͳݔ‬ 0.03
0 1 0 -0.05 0.2
6 ‫ʹݔ‬ 14.2
‫ ݆ݖ‬െ ݆ܿ 0 0 0 0 0.6

From the fuzzy simplex table 5.5 we observe that ‫ ݆ݖ‬െ ݆ܿ ൒ Ͳ, then the current solution is optimal.
Hence ‫ ͳݔ‬ൌ ͲǤͲ͵and ‫ ʹݔ‬ൌ ͳͶǤʹ
The optimal solution is ‫ݖ݁ݖ݅݉݅ݔܽܯ‬ǁʹ ൌ ͷሺͲǤͲ͵ሻ ൅ ͸ሺͳͶǤʹሻ
‫ݖ݁ݖ݅݉݅ݔܽܯ‬ǁʹ ൌ ͺͷǤ͵ͷ
And the fuzzy optimal value of its first objective function is ‫ݖ‬ǁͳ ൌ ͳͶʹ
The fuzzy optimal value of its second objective function is ‫ݖ‬ǁʹ ൌ ͺͷǤ͵ͷ

Conclusion:In this paper, Multi objective fuzzy linear programming problem is solved with fuzzy
coefficients in the objective function and constraints. In particular octagonal fuzzy numbers are used as
coefficients and converting them into a crisp value using robust ranking method technique to derive a
fuzzy optimal solution.

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 97
UGC Approved Journal - Journal No 43832

References:

1. Cadenas J.M., Verdegay J.L.(2000) Using ranking functions in Multi objective fuzzy linear
programming, Fuzzy sets and Systems, 111, 47-53.
2. Irene Hepzibah. R (2015), “Ranking Function methods for solving fuzzy multi – objective linear
programming problems”, International Journal of Applied Engineering Research.
3. Maleki H.R. (2002), Ranking function and their applications to fuzzy linear programming, Far east
Journal of mathematical science, 283-301.
4. Malini .S.U and Felbin C. Kennedy (2018), “An Approach for solving fuzzy transportation problem
using octagonal fuzzy numbers”, Applied Mathematics Sciences, Vol.7,2013,No.54,2661-2673.
5. Nagoorgani. A. and Irene Hepzibah. R. (2007) An Algorithmic Approach to fuzzy linear
programming problems using Layer Ranking Method, Proceedings of International conference on
Modelling and Simulation, CIT, Coimbatore, Tamilnadu, India.
6. Nasseri. S.H and Ardil. E. (2007), “Simplex method for Fuzzy Variable Linear Programming
Problems”, world academy of science Engineering and Technology 8.
7. Nasseri. S.H, Ardil. E, Yazdani. A and Zaefarian. R. (2007), “Simplex method for solving Linear
Programming Problems with Fuzzy Numbers”, world academy of science Engineering and
Technology 10.
8. Rajerajeswari.P and Shayasudha. A, “Ranking of Hexagonal fuzzy Numbers for solving Multi –
objective Fuzzy linear programming problem”
9. Slevakumari. K and Tamilarasi.R. (2017) “Ranking of octagonal fuzzy numbers for solving fuzzy
linear programming problems”, International Journal of Engineering Research and Application,
ISSN : 2248-9622, Vol.7. Issue 10, PP.62-65
10. Sophia prochelvi.R, Irene Hepzibah.R. (2014) , “On solving Multi objective Fractional linear
programming problems”, international journal of current research, PP.8095-8102.
11. Takashi M (2001), “A Fuzzy Linear Programming Problems as bi-Criteria optimization problem”,
Appl. Math. Comput.,120 : 109 – 121
12. Tanaka . H and Asai . K (1984), fuzzy linear programming problems with fuzzy numbers, Fuzzy sets
and systems, 13 : 1-10.
13. Zhang G, Yong – Hong Wu, Remias M, Jie Lu (2003). Formulation of fuzzy linear programming
problems as four – objective constrained optimization problems, Appl. Math. Computer., 139 : 383 –
399.
14. Zimmermann H J (1978). Fuzzy Programming and Linear Programming with several objective
functions, Fuzzy sets systems 1: 45 – 55.
15. Zimmermann H J (1985). Application of fuzzy set theory to mathematical programming Multi-
Objective fuzzy linear programming problem.

***

Journal Published by IMRF Journals | April 2018 Edition | 98