• No results found

On solutions of fuzzy multi-objective programming problems through weighted coefficients in two-Phase approach

N/A
N/A
Protected

Academic year: 2020

Share "On solutions of fuzzy multi-objective programming problems through weighted coefficients in two-Phase approach"

Copied!
12
0
0

Loading.... (view fulltext now)

Full text

(1)

1. Introduction

In general, there is no single optimal solution in multi-objective problems, but rather there is a set of inferior (pareto optimal) solutions from which the Decision Maker (DM) must select the most preferred or best compromise solution as the one to implement. Multi-objective analysis assumes that the objectives are generally in conflict. When a Multi-Objective Linear Programming (MOLP) problem be modeled, how to calculate the exact values of the coefficients is a probabilistic task.

As known, the fuzzy set theory was introduced by Zadeh [20] to deal with fuzziness. Up to now, the fuzzy set theory has been applied to broad fields. Fuzzy set theory has to be set up using data which is approximately known. Fuzzy numerical data can be represented by means of fuzzy subsets of the real line, known as fuzzy numbers. For the fuzzy set theory development, we may referee to the papers of Kaufmann and Gupta [9], and Dubois [2]; they extended the use of algebraic operations of real numbers to fuzzy numbers by the use a fuzzy faction principle. Fuzzy linear constraints with fuzzy numbers were studied by Dubois [2]. Normally, the coefficients are either given by a DM subjectively or by statistical inference from historical data. Therefore, to reflect this uncertainty, we need to construct a model with inexact coefficients. Bitran [1] and Steuer [15] proposed different algorithms to solve a MOLP problem in which the cost coefficients are interval-valued. They applied the vector-maximum theory introduced by Philip [12] to find the efficient extreme points. The authors of [18] studied MOLP problem with

Corresponding author

E-mail address: [email protected] DOI: 10.22105/jarie.2018.130777.1037

On Solutions of Fuzzy Multi-Objective Programming Problems

through Weighted Coefficients in Two-Phase Approach

Hamiden Abdelwahed Khalifa

Department of Operations Research, Institute of Statistical Studies and Research, Cairo University, Giza, Egypt.

A B S T R A C T P A P E R I N F O

In this paper, a Fuzzy Multi-Objective Linear Programming (FMOLP) problem having both objective functions and constraints fuzzy parameters is introduced. Theses fuzzy parameters are characterized by trapezoidal fuzzy numbers. The FMOLP problem is converted into the corresponding deterministic MOLP problem through the use of intervals arithmetic operations. Then, a two-phase approach having equal weighted coefficients is proposed to generate an efficient solution for the MOLP problem. The major advantage of the new model is that the proposed approach as long as the weighted coefficients not necessarly equal and generates an efficient solution. A numerical example is given to clarify the obtained results. Chronicle:

Received: 06 March 2018 Accepted:30 August 2018

Keywords:

Multi-Objective Programming Problems.

Fuzzy Parameters. Fuzzy Numbers.

 Efficient Solution. Two-Phase Approach. Compromise Index.

Journal of Applied Research on Industrial

Engineering

(2)

fuzzy-numbered cost coefficients. They based on the membership functions to transform the considered problem into the parametrically interval-valued MOLP problem. Shaocheng [16] developed a solution procedure to cope with interval-valued linear programming problems to obtain an interval-valued optimal solution. The work [18] proposed a solution procedure for a MOLP with interval-valued coefficients.

Veeramani et al. [17] studied the fuzzy MOLP problem with fuzzy technological coefficients and resources. They solved the problem based on the proposed method introduced by Gasimov and Yenimez [7]. Singh and Yadav [10] reduced the Fuzzy MOLP problem to the corresponding ordinary one using the ranking function and hence solved it using the fuzzy programming technique. Hamadameen [8] proposed a technique for solving fuzzy MOLP problem in which the objective functions coefficients are triangular fuzzy numbers. Under fuzzy environment, Grag [3] presented an alternative method for computing the various arithmetic operations of a system using the sigmoidal number. Based on optimistic and pessimistic view point, Rani et al. [13] investigated an algorithm for solving multi-objective optimization problem. Through the use of concept of the distribution and complementary distribution functions, Garg [4] studied the basic arithmetic operations for two generalized positive parabolic fuzzy numbers. Depending on the definition of different types of fuzzy numbers, namely gamma, normal, Cauchy, and triangular for uncertainty, Garg [6] investigated the performance and sensitivity analysis of the systems at different levels of confidence. Also, the performance towards the data provided by the decision makers. Under uncertainty, vague, and imprecise of data, Garg [5] suggested an alternative approach for solving multi-objective reliability optimization problem. In this paper, a two- phase approach having equal weighted coefficients is proposed to generate an

 efficient solution for multi-objective programming problem with fuzzy parameters in the objective functions and constraints. We show that the proposed approach is as long as the weighted coefficients not necessary equal, and generate an efficient solution. The remainder of the paper is organized as the following sections: In Section 2, some preliminary needs in the paper are presented. In Section 3, multi-objective linear programming problem with fuzzy parameters, i.e. both the multi-objective functions and constraints is introduced as the specific definition and properties. In Section 4, a two-phase approach for solving the problem is given. In Section 5, an illustrative numerical example is given to clarify the obtained results. Finally, some concluding remarks are reported in Section 6.

2. Preliminaries

In order to discuss our problem conveniently, we shall state some necessary results on interval arithmetic and fuzzy numbers ( see [9, 11]).

Let A

aL,aU

:aL,aUR(,),aLaU

denote the set of all closed interval numbers onR, where aL is the left limit and aU is the right limit ofA. Also, the interval A may be denoted by its center and width as

C W C W C W C W

a a a a R a a a a

A , : ,  ,    , where aC is the center and aWis the width ofAwhich may be calculated as aC

aUaL

2 1

, and aW

aUaL

2 1

.

(3)

AB

ab:aA,bB

, and



  

 

 

C C W W

U U L L

b a b a

b a b a B A

,

, ,

)

(

   

C W

U L

ka ka

a k a k A k

, , ,

where

k

R

.

The order relation (LU)between A

aL,aU

,and B

bL,bU

is defined as

B

ALU if and only if aLbL, and aUbU,

B

ALU if and only if ALU B, and AB,

Also, the order relation (CW) between A

aC,aW

, B

bC,bW

is defined as

B

ACW if and only if aCbC, and aWbW,

B

ACW if and only if ACW, and AB.

Proposition 1. If ALU B, and BCW A hold, then

A

B

.

Definition 2. Let R be the set of real numbers, the fuzzy number

a

~

is a mappinga~:R[0,1],with the following properties:

) (

~ x

a

 is an upper semi-continuous membership function;

a

~

is a convex set, i. e. )},

( ), ( { min ) ) 1 (

( 1 2 ~ 1 ~ 2

~ x x a x a x

a    

    for all x1,x2R,0

1;(c)

a

~

is normal, i. e., x0R

for which a~(x)1;Supp(a~){x:~a(x)0}is the support of a fuzzy set

a

~

.

Let F0(R)denote the set of all compact fuzzy numbers onR that is for any gF0(R),g satisfies the following:

; 1 ) (

: 

x R g x for any 01, g [gL,gU] is a closed interval number on

R

.

It is noted that ).

( )

(R F0 R I

R 

Definition 3. The

 level set of the fuzzy number

a

~

is defined as the ordinary set L(a~) for which the degree of their membership function exceeds the level

:

L(a~){a:a~(a)}.

Definition 4. A trapezoidal fuzzy number can be represented completely by a quadruplet

) , , , ( ~

4 3 2 1 a a a

a

A and its interval of confidence at level

is defined by:

(4)

3. Problem Formulation and Solution Concepts

Consider the following fuzzy multi-objective linear programming (F-MOLP) problem (F-MOLP)

where ~ , ,~j n, ,~ mn,

n

i R i d R j A R

c       and b~Rm are fuzzy parameters.

Definition 5. (Fuzzy efficient solution). A point xX~is said to be fuzzy efficient solution to the F-MOLP problem if and only if there does not exist anotherxX~, such that:Zk(x,~c)Zk(x,c~), and

) ~ , ( ) ~ ,

(x dW x, d

Ws s , andZ~k(x,~c)Z~k(x,c~) or Ws(x,d~)Ws(x,d~).

Assuming that these fuzzy parametersc~i(i1,2,...,l),d~j(j1,2,...,r), A(a~ij)mn

~

, and b~iRm are characterized by fuzzy numbers ([2]); let the corresponding membership functions be

n i

ci

ci( ), 1,2,...,

~ 

 ; ~(dj),j 1,2,...,n;

dj

 ~a (a~ij)

ij

 , and ~( i)

bi b

 . We introduce the

-level set of the fuzzy numbers c~,d~,A~ and b~ defined as the ordinary set (~c,d~,~A,b~) in which the degree of their membership functions exceeds level

.

}. ) ( , ) ( ; ..., , 2 , 1 , ) ( ; ..., , 2 , 1 , ) ( : ) , , , ( { ) ~ , ~ , ~ , ~

(  ~   ~   ~  ~ i 

b A

j d j

c c j n d j n A b

b A d c b

A d c

i j

j

For a certain degree of

, the (F-MOLP) problem can be written as in the following non fuzzy form ([14]) as

(

 MOLP)

c x c x c x

k l

c x

Zk( , ) , ,..., l T, 1,2,...,

max  1 2 

d x d x d x

s r

s d x

Ws( , ) , ,..., r T, 1,2,...,

min  1 2

Subject to

 :  , 0

,

X x R Ax b x x

]. 1 , 0 ( , ) ~ , ~ , ~ , ~ ( ) , , ,

(c d Abc d Ab 

Definition 6. (

-efficient solution). A point xXis said to be an

-efficient solution to the

-MOLP problem if and only if there does not exist anotherxX, (c,d,A,b)(~c,d~,A~,b~)such that

) , ( ) , ( ), , ( ) ,

(xcZ xcW x dW xd

Z and Z(x,c)Z(x,c)orW(x,d)W(x,d), where the corresponding values of parameters (c,d,A,b)are called

level optimal parameters.

c x c xc x c x

k l

c x

Z~k( ,~) ~ ,~ ,~ ,...,~l T, 1,2,...,

max  1 2 3

d x d xd x d x

s r d

x

W~s( ,~) ~ , ~ ,~ ,...,~r T, 1,2,...,

min  1 2 3

Subject to

:~ ~, 0

~

X x R Ax b x

(5)

The intervals of confidence corresponding to the c~,d~,A~,b~can be denoted as follows:

L U

 

L U



L U

A A d d c

c , , , , , , and

bL,bU

. So, the ( MOLP) problem can be rewritten as in the following form:

(IV-MOLP)

   

   

   

c c x c c x c c x

k l

c x

Z l U T

L l U

L U

L

k( , ) , , , ,..., , , 1,2,...,

max  1 1 2 2 

   

   

   

d d x d d x d d x

s r

s d x

Ws( , ) L, U , L, U ,..., r L, r U T, 1,2,...,

min  1 2 2 2

Subject to

 

 : ,  , , 0

X x R A A x b b x

x L U L U .

Definition 7.

x

X

is said to be an efficient solution of (IV-MOLP) if and only if there is no xX

which satisfies Z (x,c) Zk(x,c)

LR

k  orZ xc Zk x c k l

CW

k( , ) ( , ), 1,2,...,

  

, and

) , ( )

,

(xdW x d

WsLR s or Ws(x,d)CWWs(x,d),s1,2,...,r.

The (IV-MOLP) problem may be transformed into the following MOLP problem as follows: (MOLP)

   

 

L

T

l L

L L

k xc c x c x c x

Z ( , ) , ,...,

max  1 2

 

 

 

C

T

l C

C C

k x c c x c x c x

Z ( , ) , ,...,

max  1 2

   

 

R

T

l R

R R

s x d d x d x d x

W ( , ) , ,...,

min  1 2

 

 

 

C

T

l C

C C

s x d d x d x d x

W ( , ) , ,...,

min  1 2

Subject to xX

xRn:ALxbL, AUxbU,x0

.

Definition 8.

x

X

is called an efficient solution of MOLP problem if and only if there is no xX

which satisfies Zk(x,c)LCZk(x,c),k1,2,...,l, and Ws(x,d)RCWs(x,d),s1,...,r.

Definition 9. For any two feasible solutions xand y of the MOLP problem, x is said to be more efficient than y if

 

 

 

 

 





s

k

d

y

W

d

x

W

d

y

W

d

x

W

and

c

y

Z

c

x

Z

c

y

Z

c

x

Z

C s

C s

R s

R s

C k

C k

L k

L k

,

;

)

,

(

)

,

(

,

)

,

(

)

,

(

,

)

,

(

)

,

(

,

)

,

(

)

,

(

(6)

 

 

 

 

 



  

   

 

t some for d y W d

x W

d y W d

x W or j some for c y Z c x Z c y Z c x Z

C t

C t

R t

R t

C j C j L j L j

) , ( )

, (

, ) , ( )

, ( , ,

) , ( )

, ( , ) , ( )

, (

.

This is denoted by

x

y

.

4. Two-Phase Approach

Based on the min operator model proposed by Zimmermann [20] for the linear programming having several objectives; the MOLP problem can be viewed as

max Subject to

 

 

. 0 , ,

,..., 2 , 1 ) , ( )

, (

) , ( )

, (

..., , 2 , 1 , ) , ( )

, (

) , ( )

, (

..., , 2 , 1 , ) , ( )

, (

) , ( )

, (

.,..., 2 , 1 , ) , ( )

, (

) , ( )

, (

  

 

 

 

 

 

 

 

 

 

  

 

  

 

  

x b x A b x A

r s

d x W d

x W

d x W d

x W

r s

d x W d

x W

d x W d

x W

l k

c x Z c

x Z

c x Z c x Z

l k

c x Z c

x Z

c x Z c x Z

U U L L

C s C s

C s C s

R s R s

R s R s

C k C k

C k C k

L k L k

L k L k

   

(1)

Where

Zk(x,c)

L,

C k x c

Z ( , ) ,

Ws(x,d)

R,

C s x d

W ( , ) , and

Zk(x,c)

L,

 

C k x c

Z ( , ) ,

R

s x d

W ( , ) ,

Ws(x,d)

Care the ideal and anti-ideal solutions for the (MOLP), respectively.

Assuming that the membership function for each objective of the MOLP problem is equally important, so the model (1) is converted into the following so-called average model as

   

 

 

 

   

l

k

r

s

r

s s s

l

k k k

r

l 1 1 1

'' '

1 '' '

) ( 2

1

max    

Subject to

 

Z x c

Z x c

k l

c x Z c x Z

L k

L k

L k L k

k , 1,2,...,

) , ( )

, (

) , ( )

, (

'

 

 (2)

 

Z xc

Z xc

k l

c x Z c x Z

C k C k

C k C k

k , 1,2,...,

) , ( )

, (

) , ( )

, (

''

 

  

W xd

W xd

s r

d x W d

x W

R s

R s

R s

R s

s , 1,2,...,

) , ( )

, (

) , ( )

, (

1

 

  

 

(7)

The combination of the min operator model (1) with the average operator model (2) results in the two- phase approach. It is easily to see from the following model:

          

    l k r s r s s s l k k k r

l 1 1 1

2 1 1 '' ' ) ( 2 1

max    

Subject to

 

 

 

. 0 , , ..., , 2 , 1 ) , ( ) , ( ) , ( ) , ( ,..., 2 , 1 , ) , ( ) , ( ) , ( ) , ( ..., , 2 , 1 , ) , ( ) , ( ) , ( ) , ( ..., , 2 , 1 , ) , ( ) , ( ) , ( ) , ( 2 1 '' '                                             x b x A b x A r s d x W d x W d x W d x W r s d x W d x W d x W d x W l k c x Z c x Z c x Z c x Z l k c x Z c x Z c x Z c x Z U U L L C s C s C s C s s R s R s R s R s s C k C k C k C k k L k L k L k L k k         (3)

A sufficient condition to find the efficient solution of the MOLP problem by the two-phase approach is to have positive weighted coefficients. The following theorem proves this condition. Before apply the theorem, consider the following model:

Theorem 1. If (y,y) is an optimal solution of the problem (4), then y is an efficient solution for the MOLP problem.

 

W xd

W x d

s r

d x W d x W C s C s C s C s

s 1,2,...,

) , ( ) , ( ) , ( ) , ( 2        . 0 , ,  

b A x b x

x

AL L U U

(8)

Proof. (The proof will be in contra positive direction)

Suppose that there is a feasible solution (x,

x) such that

x

y

. That is

 

 

 

 

 

             s k d y W d x W d y W d x W and c y Z c x Z c y Z c x Z C s C s R s R s C k C k L k L k , ; ) , ( ) , ( , ) , ( ) , ( , ) , ( ) , ( , ) , ( ) , ( , and

 

 

 

 

 

            t some for d y W d x W d y W d x W or j some for c y Z c x Z c y Z c x Z C t C t R t R t C j C j L j L j ) , ( ) , ( , ) , ( ) , ( , , ) , ( ) , ( , ) , ( ) , (

There are two cases:

Case 1: If

Zj(x,c)

 

LZj(y,c)

 

L, Zj(x,c)

 

CZj(y,c)

Cfor some j , then

 

Z x c

 

Z x c

k

c x Z c x Z c y Z c y Z c y Z c y Z L k L k L k L k L k L k L k L k y k                 ; ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , (   ,

 

Z x c

 

Z x c

k

c x Z c x Z c y Z c y Z c y Z c y Z L k L k L k L k C k C k C k C k y k                 ; ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( 

 , and

 

 



              L k L k L k L k L k L k L k L k y j c x Z c x Z c x Z c x Z c y Z c y Z c y Z c y Z ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( 

, for some j

 

 



              L k L k L k L k C k C k C k C k y j c x Z c x Z c x Z c x Z c y Z c y Z c y Z c y Z ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( 

 , for some j

Since,

 

 

 

 

, ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , (                L j L j L j L j x j L j L j L j L j y j c x Z c x Z c x Z c x Z c y Z c y Z c y Z c y Z   and

 

 

 

 

. ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , ( ) , (                C j C j C j C j x j C j C j C j C j y j c x Z c x Z c x Z c x Z c y Z c y Z c y Z c y Z  

The objective value is

. ) ( 2 , 1 ) ( 2 , 1 ) ( 2 1 x j j x i i r l j i i y j j y i i r l j i i i r l i

i        

 

 

       

(9)

Case 2: If

Wt(x,d)

 

RWt(y,d)

 

R, Wt(x,d)

 

CWt(y,d)

Cfor some

t

, the proof is similar to the case 1.

Remark 1. It is noted that the two-phase approach will fail to find an efficient solution in general for some of i's are zero.

5. Numerical Example

Consider the following (F-MOLP) problem

For

0

.

5

, problem (5) becomes

According to MOLP Problem, problem (6) can be written as follows:

 

1 1.5 1 3.5 2 5.5 3 0.5 4 max Z Lxxxx

 

Z1 5x1 4.5x2 6.5x3 1.5x4

C

 

Z2 2.5x1 0.5x2 1.5x3 9.5x4

L

 

Z2 3.5x1 1.5x2 2.5x3 10.5x4

C

 

Z3 8.5x1 2.5x2 0.5x3 1.5x4

L

 

Z3 9.5x1 3.5x2 1.5x3 2.5x4

C

 

1 1.75 1 3.5 2 0.35 3 4.5 4

min W Rxxxx (7)

 

W1 1.25x1 2.5x2 0.2x3 3.5x4

C

 

W2 0.68x1 2.5x2 0.8x3 3.5x4

R

 

W2 0.44x1 1.5x2 0.6x3 2.5x4

C

4 3

2 1

1 (1,2,3,4) (3,4,5,6) (5,6,7,8) (0,1,2,3)

maxZxxxx

4 3

2 1

2 (2,3,4,5)x (0,1,2,3)x (1,2,3,4)x (9,10,11,12)x

Z    

4 3

2 1

3 ((8,9,10,11)x (2,3,4,5)x (0,1,2,3)x (1,2,3,4)x

Z    

4 3

2 1

1 (0.5,1,1.5,2) (1,2,3,4) (0,0.1,0.3,0.4) (2,3,4,5)

minWxxxx (5)

4 3

2 1

2 (0.1,0.3,0.5,0.7)x (0,1,2,3)x (0.3,0.5,0.7,0.9)x (1,2,3,4)x

W    

Subject to

. 0 , , ,

), 200 , 150 , 100 , 50 ( ) 8 , 5 . 7 , 7 , 5 . 6 ( ) 2 , 5 . 1 , 1 , 5 . 0 ( ) 2 , 5 . 1 , 1 , 5 . 0 ( ) 5 , 4 , 3 , 2 (

4 3 2 1

4 3

2 1

 

 

x x x x

x x

x x

4 3

2 1

1 [1.5,3.5] [3.5,5.5] [5.5,7.5] [0.5,2.5]

maxZxxxx

4 3

2 1

2 [2.5,4.5]x [0.5,2.5]x [1.5,3.5]x [9.5,11.5]x

Z    

4 3

2 1

3 [8.5,10.5]x [2.5,4.5]x [0.5,2.5]x [1.5,3.5]x

Z    

4 3

2 1

1 [0.75,1.75] [1.5,3.5] [0.05,0.35] [2.5,4.5]

minWxxxx (6)

4 3

2 1

2 [0.2,0.68]x [0.5,2.5]x [0.4,0.8]x [1.5,3.5]x

W    

Subject to

] 175 , 75 [ ] 75 . 7 , 75 . 6 [ ] 75 . 1 , 75 . 0 [ ] 75 . 1 , 75 . 0 [ ] 5 . 4 , 5 . 2

[ x1x2x3x4

. 0 , , , 2 3 4

(10)

Subject to 175 75 . 7 75 . 1 75 . 1 5 . 4 , 75 75 . 6 75 . 0 75 . 0 5 .

2 x1x2x3x4x1x2x3x4

. 0 , , , 2 3 4

1 x x xx

Problem (7) using the min operator becomes

 max Subject to . 0 , , , ; 175 75 . 7 75 . 1 75 . 1 5 . 4 , 75 75 . 6 75 . 0 75 . 0 5 . 2 ; 1 0 , 150 90 5 . 2 6 . 0 5 . 1 44 . 0 , 250 170 5 . 3 8 . 0 5 . 2 68 . 0 , 250 230 5 . 3 2 . 0 5 . 2 25 . 1 , 350 315 5 . 4 35 . 0 5 . 3 75 . 1 , 150 200 5 . 2 5 . 1 5 . 3 5 . 9 , 50 200 5 . 1 5 . 0 5 . 2 5 . 8 , 150 100 5 . 10 5 . 2 5 . 1 5 . 3 , 50 100 5 . 9 5 . 1 5 . 0 5 . 2 , 450 200 5 . 1 5 . 6 5 . 4 5 , 350 200 5 . 0 5 . 5 5 . 3 5 . 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1                                                              x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x            (8)

The solution of (8) is

 

 

 

 

 

150,

 

250,

 

192.5,

 

135,

 

165,

 

105.

, 200 , 100 , 550 , 5 . 962 ), 0 , 50 , 50 , 0 ( , 5 . 0 2 2 1 1 3 3 2 2 1 1              C R C R C L C L C L W W W W Z Z Z Z Z Z x

Problem (7) according to the average operator model (2) is

22

1 2 2 1 1 1 '' 3 ' 3 '' 2 ' 2 '' 1 ' 1 10 / 1

max            Subject to , 150 100 5 . 10 5 . 2 5 . 1 5 . 3 , 50 100 5 . 9 5 . 1 5 . 0 5 . 2 , 450 200 5 . 1 5 . 6 5 . 4 5 , 350 200 5 . 0 5 . 5 5 . 3 5 . 1 '' 2 4 3 2 1 ' 2 4 3 2 1 '' 1 4 3 2 1 ' 1 4 3 2 1                         x x x x x x x x x x x x x x x x (9) , 50 200 5 . 1 5 . 0 5 . 2 5 .

8 x1x2x3x4

3' 

, 150 200 5 . 2 5 . 1 5 . 3 5 .

(11)

. 0 , , , ; 1 , , , 0 ; 3 , 2 , 1 , 1 , 0 , 175 75 . 7 75 . 1 75 . 1 5 . 4 , 75 75 . 6 75 . 0 75 . 0 5 . 2 , 150 90 5 . 2 6 . 0 5 . 1 44 . 0 , 250 170 5 . 3 8 . 0 5 . 2 68 . 0 , 250 230 5 . 3 2 . 0 5 . 2 25 . 1 , 350 315 5 . 4 35 . 0 5 . 3 75 . 1 4 3 2 1 2 2 1 2 2 1 1 1 '' ' 4 3 2 1 4 3 2 1 2 2 4 3 2 1 1 2 4 3 2 1 2 1 4 3 2 1 1 1 4 3 2 1                                   x x x x i x x x x x x x x x x x x x x x x x x x x x x x x i

i     

   

The solution of problem (9) is

 

 

 

 

 

 

 

 

 

 

. 0 , 1 , 1 , 1 , 0 , 0 , 1 , 1 , 1 , 1 , 60 , 80 , 20 , 35 , 150 , 50 , 250 , 150 , 650 , 550 ), 0 , 100 , 0 , 0 ( , 7 . 0 2 2 1 2 1 2 1 1 '' 3 ' 3 '' 2 ' 2 '' 1 ' 1 2 2 1 1 3 3 2 2 1 1                                  C R C R C L C L C L W W W W Z Z Z Z Z Z x

The two-phase approach model (3) corresponding to the problem (7) becomes

2

2 1 2 2 1 1 1 '' 3 ' 3 '' 2 ' 2 '' 1 ' 1 10 / 1

max            Subject to . 0 , , , , 175 75 . 7 75 . 1 75 . 1 5 . 4 , 75 75 . 6 75 . 0 75 . 0 5 . 2 , 1 , , , 5 . 0 ; 3 , 2 , 1 , 1 , 5 . 0 , 150 90 5 . 2 6 . 0 5 . 1 44 . 0 , 250 170 5 . 3 8 . 0 5 . 2 68 . 0 , 250 230 5 . 3 2 . 0 5 . 2 25 . 1 , 350 315 5 . 4 35 . 0 5 . 3 75 . 1 , 150 200 5 . 2 5 . 1 5 . 3 5 . 9 , 50 200 5 . 1 5 . 0 5 . 2 5 . 8 , 150 100 5 . 10 5 . 2 5 . 1 5 . 3 , 50 100 5 . 9 5 . 1 5 . 0 5 . 2 , 450 200 5 . 1 5 . 6 5 . 4 5 , 350 200 5 . 0 5 . 5 5 . 3 5 . 1 4 3 2 1 4 3 2 1 4 3 2 1 2 2 1 2 2 1 1 1 '' ' 2 2 4 3 2 1 1 2 4 3 2 1 2 1 4 3 2 1 1 1 4 3 2 1 '' 3 4 3 2 1 ' 3 4 3 2 1 '' 2 4 3 2 1 ' 2 4 3 2 1 '' 1 4 3 2 1 ' 1 4 3 2 1                                                                 x x x x x x x x x x x x i x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x i

i     

           (10)

The solution is

(12)

6. Concluding Remarks

In the fuzzy multi-objective linear programming problem, firstly, the problem was converted into a deterministic problem based on the

levels of the fuzzy numbers. Then, a two-phase approach with equal weighted coefficients to the deterministic problem generated an

efficient solution. The major advantage of the proposed method is that proposed approach is as long as the weighted coefficients not necessary equal and generate an efficient solution. These results provide contributions for a social planner who tries to allocate resources efficiently.

Acknowledgments

The author would like to thank the anonymous referees for their valuable suggestions and helpful comments which improved the quality of this paper.

References

[1] Bitran, G. R. (1980). Linear multiple objective problems with interval coefficients. Management

science, 26(7), 694-706.

[2] Dubois, D. J. (1980). Fuzzy sets and systems: Theory and applications. Academic press.

[3] Garg, H. (2015). Multi-objective optimization problem of system reliability under intuitionistic fuzzy set environment using Cuckoo Search algorithm. Journal of intelligent & fuzzy systems, 29(4), 1653-1669. [4] Garg, H. (2018). Some arithmetic operations on the generalized sigmoidal fuzzy numbers and its

application. Granular computing, 3(1), 9-25.

[5] Garg, H. (2018). Arithmetic operations on generalized parabolic fuzzy numbers and its application. Proceedings of the national academy of sciences, India section A: Physical sciences, 88(1), 15-26.

[6] Garg, H. (2018). Analysis of an industrial system under uncertain environment by using different types of fuzzy numbers. International journal of system assurance engineering and management, 9(2), 525-538. [7] Gasimov, R. R., & Yenilmez, K. (2002). Solving fuzzy linear programming problems with linear

membership function. Turkish journal of mathematics, 26(4), 375-396.

[8] Hamadameen, A. O. (2017). A novel technique for solving multiobjective fuzzy linear programming problems. ARO-the scientific journal of Koya university, 5(1), 1-8.

[9] Kaufmann, A., & Gupta, M. M. (1988). Fuzzy mathematical models in engineering and management science. New York, NY, USA: Elsevier Science Inc.

[10] Singh, S. K., & Yadav, S. P. (2017). Intuitionistic fuzzy multi-objective linear programming problem with various membership functions. Annals of operations research, 1-15.

[11] Moore, R. E. (1979). Methods and applications of interval analysis. Siam.

[12] Philip, J. (1972). Algorithms for the vector maximization problem. Mathematical programming, 2(1): 207- 229.

[13] Rani, D., Gulati, T. R., & Garg, H. (2016). Multi-objective non-linear programming problem in intuitionistic fuzzy environment: optimistic and pessimistic view point. Expert systems with applications, 64, 228-238. [14] Sakawa, M., & Yano, H. (1985). Interactive decision making for multi-objective linear fractional

programmingproblems with fuzzy parameters. Cybernetics and system, 16(4), 377-394. [15] Steuer, R. E. (1986). Multiple criteria optimization. Theory, computation and applications.

[16] Shaocheng, T. (1994). Interval number and fuzzy number linear programmings. Fuzzy sets and

systems, 66(3), 301-306.

[17] Veeramani, C., Duraisamy, C., & Nagoorgani, A. (2011). Solving fuzzy multi-objective linear programming problems with linear membership functions. Australian journal of basic and applied sciences, 5(8), 1163-1171.

[18] Wang, F. H., & Wang, L. M. (1996). A decision making procedure of a fuzzy multiobjecttive linear problem.

Journal of the Chinese institute of industrial engineers,13(1), 1-10.

[19] Zadeh, L. A. (1965). Fuzzy sets. Information control, (8) 338- 353.

References

Related documents

Because of the rapid changes, the time range of the moving average method must be set small and the parameter of the exponential smoothing method must be set to a

Ravi Kumar and Dwarakadasa (2000), while investi- gating the effect of matrix strength on the tensile proper- ties of SiC-reinforced Al-Zn-Mg alloy matrix composites, observed that

It is known that adult drivers who are most likely to be involved in motor vehicle accidents are those who are least likely to wear seat belts.’3 We do not know ifthe

This paper was intended to present the enhanced techniques of dark channel prior and transmission map estimation in order to remove dense haze that scattered on a

Our research detected disappearance of ring chromosomes and chromosome frag- mentations in the cultures of the peripheral blood lymphocytes treated with met-enkephalin (.

The effective diameter for GalXM and polydispersity from the two strains varied depending on temperature and medium growth conditions, indicating that GalXM structure can vary within

Twelve of the 15 human studies in infants, children and adults that clearly demonstrate that orally-administered Ig (particularly IgGs), from human and bovine serum as well as

The HO-1 inhibition by ZnPPIX treatment induced higher parasitism in the lungs at 12 dpi in both mouse lineages compared with hemin or vehicle treatment, although the parasitism