Penalty Function Method For Solving Fuzzy Nonlinear Programming Problem

International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 1, Issue 1, pp: (1-13), Month: April - June 2014, Available at: www.paperpublications.org
Page | 1
Paper Publications
Penalty Function Method For Solving Fuzzy
Nonlinear Programming Problem
1
A.F.Jameel and 2
Radhi.A.Z
1
School of Mathematical Sciences, 11800 USM, University Science Malaysia, Penang, Malaysia
2
Department of Mathematics, College of Science, the University of AlMustansiriyah Iraq Baghdad
Abstract: In this work, the fuzzy nonlinear programming problem (FNLPP) has been developed and their result have
also discussed. The numerical solutions of crisp problems and have been compared and the fuzzy solution and its
effectiveness have also been presented and discussed. The penalty function method has been developed and mixed
with Nelder and Mend’s algorithm of direct optimization problem solutionhave been used together to solve this
FNLPP.
Keyword: Fuzzy set theory, fuzzy numbers, decision making, nonlinear programming, Nelder and Mend’s algorithm,
penalty function method.
I. Introduction
Fuzzy nonlinear programming problem (FNLPP) is useful in solving problems which are difficult, impossible to solve due to
the imprecise, subjective nature of the problem formulation or have an accurate solution. In this paper, we will discuss the
concepts of fuzzy decision making introduced by [2] and the maximum decision [20] that is used in NLPP to find the optimal
decision (solution). This decision making was used in fuzzy linear and nonlinear programming problems [1],[8], [9] and [15].
Furthermore, these problemshave fuzzy objective function and fuzzy variables in the constraints [5], [10], [11] and[17] where
the fuzzy left and right hand side coefficients on constraints [18]. In addition, the fuzzy NLPP is used in quadratic
programming [6], [12] and [16] which hasa fuzzy multi objective function and fuzzy parameters on constraints so in our
NLPP that have fuzzy properties on.However, the fuzzy nonlinear programming problem is not just an alternative or even a
superior way of analyzing a given problem, it's useful in solving problems in which difficult or impossible to use due to the
inherent qualitative imprecise or subjective nature of the problem formulation or to have an accurate solution.The outline of
this study is as follows: In section two we introduce some important definitions that are useful in our problem. Section3 we
state the general nonlinear programming problem in fuzzy environment by transforming the crisp problem into the fuzzy
problem. Section 4 we present and develop the regular penalty function method and mixed it with Nelder and Mend’s
algorithm in order to solve FNLPP. Finally, in section 5, we show the efficiency of our study by present numerical example
involving FNLPP.
II. Primetimes
1. Fuzzy Set [20]:
If x is a collection of objects denoted generally by X, then a fuzzy set A
~
in X is a set of order pairs: A
~
 {(x, )x(A
~ ) | x
X},where )x(A
~ : x [0, 1] is called the membership function or grade of membership (also degree of compatibility

Page | 2
Paper Publications
or degree of truth) of x in A
~
which maps x to the membership range M (when M contains only the two points 0 and 1), A
~
is a nonfuzzy and )x(A
~ is identical to the characteristic function of crisp set. The range of membership function is a
subset of the non-negative real numbers whose supremum is finite. Elements with a zero degree of membership are normally
not listed.
2. Fuzzy Numbers with Linear Member Ship Function [3]:
The function L: X [0, 1] is a function with two parameters defined as:
1,
( ; , ) ,
0,
L x
if x
x
if x
if x

 
    


 

 
   

 
Where L is called the trapezoidal linear membership function.
Fig. 1 L-Function.
3. Fuzzy Decision Making [2]:
Assume that we are given a fuzzy goal (fuzzy objective function) G
~
and fuzzy constraints C
~
in a space of alternatives X.
The G
~
and C
~
combine to form a decision, D
~
, which is a fuzzy set resulting from intersection of G
~
andC
~
. In symbols,
D
~
C
~
is, correspondingly, the membership function of D
~
can be defined as:
D
~  Min {
G
~ ,
C
~ }.More generally, suppose that we have n goals n21 G
~
,...,G
~
,G
~
and m constraints
m21 C
~
,...,C
~
,C
~
. The, the resultant decision is defined as:
D
~
 1G
~
 2G
~
 …  nG
~
 1C
~
 2C
~
 …  mC
~
and correspondingly:
D
~  Min {min {
1G
~ ,
2G
~ , …,
nG
~ }, min {
1C
~ ,
2C
~ , …,
mC
~ }}
 Min {
1G
~ ,
2G
~ , …,
nG
~ ,
1C
~ ,
2C
~ , …,
mC
~ }  Min {
jG
~ ,
jC
~ }
for j  1, 2,…, n and i  1, 2, …, m.
4. Maximum Decision Maker [20]:
If the decision-maker wants to have “crisp” decision proposal, it seems appropriate to suggest to him the divided which has
the highest degree of membership in the fuzzy set “decision”. Let us call this the maximizing decision, defined by:
  x
(x)
1
0
0.5
α +

Page | 3
Paper Publications
Xmax  )x(),x(MinMax)x(MMax
ij C
~
D
~
x
D
~
x
 ,
where jD and iC are in the definition (3) for i  1, 2, …, m; j 1, 2, …, n.
III. Penalty Function Method
There are survival methods used in fuzzy reliability problems, such as a novel approach for solving unconstrained model
mechanical structure [7], also the numerical integration algorithm in the fuzzy general strength model [13]. The penalty
method [19] belongs to the first attempts to solve constrained optimization problems satisfactorily. The basic idea is to
construct a sequence of unconstrained optimization problems and solve them by standard minimize or maximize of the
unconstrained problems converge to the solution of the constrained one. To simplify the notation, we consider the following
two NLPP:
(1)
(2)
To construct the unconstrained problems, so-called penalty terms are added to the objective function which penalizes f(x)
whenever the feasibility region is left. A factor k controls the degree of penalizing f(x).
Proceeding from a sequence {k} with k for k  0, 1… penalty function can be defined by [4]:
1. Min/Max (x,)  f(x) + k (3)
for problem (1).
2. Min/Max (x, )  f(x) + k (4)
for problem (2)
The unconstrained nonlinear programming problems are solved by any standard technique, e.g., Nelder and Mead [14]
method combined with a line search. However, the line search must be performed quite accurately due to this step,
narrow valleys created by the penalty terms, respectively. The technique of solving a sequence of minimization
(maximization) problems of by using a penalty function method is as follows:
1. Choose a sequence {k}.
2. For each finding a local minimizer (maximizer) x(k) say, .By any steeple optimization
method.
i
n
(A)Min/Maxf(x)
Subject to:
g (x) ( )0,
i 1,2,...,m andx 0, x R
 
   
i
n
(B)Min/Maxf(x)
Subject to:
g (x) 0,
i 1,2,...,m andx 0, x R

   
2
1


m
1i
2
i )))x(g,0(min(
2
1


m
1i
2
i ))x(g(
k ),x()max(min k
xx


Page | 4
Paper Publications
3. Stop when the penalty terms ok, or k is zero and the constraints satisfies the solution at once
when the penalty terms is zero.
4. The convergence of the solution of (NLPP) is using the penalty function method and its properties can be found in [4].
5. Use this formula (3-4) in Nelderand Mead’s [14] algorithm for the direct solution of the optimization problem.
IV. Fuzzy Nonlinear Programming Problem
Consider the crisp NLPP below:
Min/Max f(x)
Subject to:


n
1j
jijxa  () bi, i  1, 2… m; j  1, 2… n (5)
For all xj 0 and xj Rn
.
Now, the fuzzy version for problem (1) is as follows:
xa~M/ni
~
M f(xj)
Subject to:


n
1j
jijxa~  () ib
~
, i  1, 2, …, m; j  1, 2, …, n (6)
For all xj 0 and xj Rn
.
Note that, the i-th constraint of problem (2) is called fuzzy technological constraint with fuzzy technological coefficients and
fuzzy right hand side numbers, where ija~ is the fuzzy technological coefficient and ib
~
is the fuzzy right hand side
numbers, where i1, 2, …, m and j1, 2, …, n.This problem can be solved using fuzzy decision making properties by using
definition (3) and (4) in section II as follows:
1. To fuzzify the objective function, calculate the lower and the upper bounds z and zu receptively of the optimal values are
obtained by solving the crisp NLPP as follows:
z1 Min/Max f(xj)
Subject to:


n
1j
jijxa  () bi (7)
 xj 0, xj Rn
and i  1, 2, …, m; j 1, 2, …, n.
z2 Min/Max f(xj)
Subject to:
2
1
2
1


m
1i
2
i ))x(g(

Page | 5
Paper Publications


n
1j
jijxa  () bi + pi (8)
and i  1, 2, …, m; j 1, 2, …, n.
z3 Min/Max f(xj)
Subject to:



n
1j
jijij x)da(  () bi+ pi (9)
and i  1, 2, …, m; j 1, 2, …, n.
and
z4 Min/Max f(xj)
Subject to:



n
1j
jijij x)da(  () bi (10)
and i  1, 2, …, m; j 1, 2, …, n.
Where, ip , ijd >0 are any chosen constants represented the limits of ib and ija .Whenever the objective function takes the
value between z1, z2, z3 and z4 by letting z min (z1, z2, z3, z4) and zu max (z1, z2, z3, z4). Let M
~
be the fuzzy set
representing the objective function f(xj), such that:
M
~
 {(x, )x(M
~ ) | x  Rn
}
Where:
1, ( )
( )
( ) , ( )
0, ( )
if z f xu j
f x zj
x if z f x zj uM z zu
if f x zj




  

 


 


This represents the satisfaction of the aspiration level of the objective.Note that, pi and dij are any chosen constant represented
the limits of bi and dij and can be found as follows:
)x(a~
ij {(x, )x(ija~ ) | x  R}
Where:
1,
( ) ,
0,
if x aij
a d xij ij
x if a x a da ij ij ijij dij
if x a dij ij

 

 
   

  

See Fig.1

Page | 6
Paper Publications
Fig. 2Membership function of ijaμ (x).
Also:
)x(b
~
i {(x, )x(
ib
~ ) | x  R}
where:
1,
( ) ,
0,
if x bi
b p xj i
x if b x b pi i ibi pi
if x b pi i



 
   

  

See Fig.4.
Fig.3The membership functionof 
ibμ (x).
Note that if any ija~ and ib
~
is negative, say ija~ , then:
 ija~  {(x, )x(ija~ ) | x  R}
where
1, ( )
( )
( ) , ( )
0,
if x a dij ij
x a dij ij
x if a d x aa ij ij ijij dij
if x aij

   

 
     

  

1
0
x
(the degree of fyziness)
(x)μ ija~
ij
ijij
d
xda 
aij dij aij+bij
1
0
bi pi pi+bi x
(x)μ
ib
~
i
ii
p
xpb 
(the degree of fyziness)

Page | 7
Paper Publications
Fig. 4 Membership function of ij-aμ (x).
Similarly, use the same way in ib
~
.
2.Now, to fuzzify the i-th constraints


n
1j
jijxa~  ()
i
~b , i  1, 2, …, m
Let iC
~
be the fuzzy set for i-th constraints, such that:
iC
~
{(x, )x(
iC
~ ) | x  Rn
}
)x(
iC
~ can be defined by
1
1
1 1
1
1
0,
( ) , ( )
1, ( )
i
n
i ij j
j
n
i ij j n n
j
ij j i ij ij j inC
j j
ij j i
j
n
i ij ij j i
j
if b a x
b a x
x if a x b a d x p
d x p
if b a d x p


 








     
 


   



 



Then we have the following crisp NLPP problem:
Max 
Subject to:
1g :  )x(M
~  0
2g :  )x(
1C
~  0 (11)

1mg  :  )x(
mC
~  0
Where x  0, 0  1 and x  Rn
, which is equivalent to the problem (12):
Min ()
Subject to:
1
0x
(x)μ ija~
ij
ijij
d
)da(x 
-(aij+dij) dij -aij

Page | 8
Paper Publications
1g :


zz
z)x(f
u
j


 0
2g : b1 [(a11 + d11)x1 + … + (a1n + d1n)xn] p1 0 (12)

1mg  : bm [(am1 + dm1)x1 + … + (amn + dmn)xn] pm 0
 xj (x1, x2, …, xn)  0, xj Rn
and 0  1.
The penalty function for problem (8) is given by:
Min (xj, , )  +  



1m
1i
2
i)g,0(Min
2
1 , j 1, 2, …, n.
V. Numerical Example
Consider the following crisp nonlinear programming problem:
Min z  x1 + x2 x1x2
Subject to:
g1: 8x13x26 (13)
g2: 3x1 + 6x2 4
x1, x2 0
The solution of the crisp problem by using the penalty function method:
Min (x1, x2, )  x1 + x2 x1x2 +  


2
1i
2
i)g,0(Min
2
1
in algorithm (2.7.1), we get the following optimal results:
At 75104
the penalty term  


2
1i
2
i)g,0(Min
2
1 equal to zero, for any given points x11.5, x2 2, we have:
*
1x  0.16437888, and
*
2x  0.58449170,
Therefore z*
 0.6279249 which satisfy the constraints:
*
1g  2.931 and
*
2g  8.684105
The fuzzy version of the above problems:
ni
~
M x1 + x2 x1x2 z
Subject to:
g1:  8
~
x1 3
~
x2 6
~
(14)
g2: 3
~
x1 + 6
~
x2 4
~
x1, x2.0

Page | 9
Paper Publications
1. Let M
~
be the fuzzy set of the objective function z, such that M
~
{(x, )x(M
~ ) | x  R}, where )x(M
~
can be defined as:
0, 1 2 1 2
1 2 1 2( ) , 1 2 1 2
1, 1 2 1 2
if x x x x z
x x x x z
x if z x x x x zuM z zu
if x x x x zu

   

  
    

   


 

First, we find the chosen coefficients dij and pi then we obtain :
aij 




 
63
38
, dij 





34
21
, then aij + dij 




 
97
17
bi 





4
6
, pi 





4
1
, then bi + pi 





8
5
, where i  1, 2 and j  1, 2.
and the lower and upper bounds z and zu for the optimal values can be found by solving four crisp NLPP as follows:
z1 Min x1 + x2 x1x2
Subject to:
g1: 8x13x26 (15)
g2: 3x1 + 6x2 4
x1, x2 0.
z1 have the same solution of z in (13).
z2 Min x1 + x2 x1x2
Subject to:
g1: 8x13x25
g2: 3x1 + 6x2 8 (16)
x1, x2 0.
Using algorithm in section IV, we get the following optimal results:
At  1107


2
1i
2
i)g,0(Min
2
1 equal to zero, we get the results:
*
1x  0.15383577 and
*
2x  1.25643698,
Therefore z2 1.2169878 ,
*
1g  2.9106
and
*
2g  1.291104
z3 Min x1 + x2 x1x2
Subject to:
g1: 7x1 x25 (17)
g2: 7x1 + 9x2 8

Page | 10
Paper Publications
x1, x2 0.
By using the algorithm method in section IV, the penalty term  


2
1i
2
i)g,0(Min
2
1 equal to zero at  1105
, so we get
the optimal results:
*
1x  0.43310236 and
*
2x  0.55203368.
Therefore z30.74604895 that satisfies the constraintsg11.416 andg2 1.963103
Finally, z4 Min x1 + x2 x1x2
Subject to:
g1 : 7x1 x26 (18)
g2 : 7x1 + 9x2 4
x1, x2 0.
Also, by using the algorithm section IV, the penalty term  


2
1i
2
i)g,0(Min
2
1 equal to zero at  1108
, with the
optimal results:
*
1x  0.42857293,and
*
2x  0.14166517,
Therefore z4 0.33426089That satisfy the constraintsg1 3.674,and g2 3.999.
Hence z4 Max {z1, z2, z3, z4}1.21698780 and z Min {z1, z2, z3, z4}  0.33426089. Therefore:













33426089.0xxxxif,0
21698780.1xxxx33426089.0if,
33426089.021698780.1
33426089.0xxxx
xxxx216980.1if,1
)x(
2121
2121
2121
2121
M
~
2-also let 1C be the fuzzy set for the first constraint g1, such that:
1 2
1 2
1 2 1 2C1
1 2
1 2
0, if 6 8x 3x
6 ( 8x 3x )
(x) , if 8x 3x 6 7x 1x 1
4x 3x 4
1, if 4 7x 9x 4
    

   
         
 
   

And let 2C be the set for the second constraint g2, such that:

Page | 11
Paper Publications
2
1 2
1 2
1 2 1 2C
1 2
1 2
0, if 4 3x 6x
4 (3x 6x )
(x) , if 3x 6x 4 7x 9x 4
4x 3x 4
1, if 4 7x 9x 4
  

 
      
 
   

1.By using fuzzy decision making as in problem (12), we have the following crisp NLPP:
Max 
Subject to:
1g :  )x(M
~  0
2g :  )x(
1C
~  0
3g :  )x(
mC
~  0
Where x  0, 0  1 and x  R2
, which is equivalent to the problem below:
Min ()
Subject to:
1g :
33426098.02169878.1
33426098.0xxxx 2121


 0
2g :
1x2x
x3x8x6
21
221

  0 (19)
3g : 1 2
1 2
4 3x 6x
4x 3x 4
 
 
 0
x1, x2 0, 0  1
The penalty function of the above problem is:
Min (x1, x2, , )  +  


3
1i
2
i)g,0(Min
2
1
Table I Result of problem (13)
 x1 x2 
10 1.5 2 0.5
100 0.84819258 0.06900019 0.34780614
1000 0.80510498 0.00681909 0.23532029
1104
0.80037352 0.00049138 0.22322137
1105
0.80228107 0.00009775 0.22153426
25104
0.79977446 00000580 0.22114719
5105
0.79977446 00000580 0.22114719
75105
0.79975981 0.00000066 0.22115274
1106
0.79975981 0.00000066 0.22115274
25105
0.79975981 0.00000066 0.22115274
5106
0.79975981 0.00000066 0.22115274
75105
0.79975981 0.00000066 0.22115274

Page | 12
Paper Publications
1107
0.79975981 0.00000047 0.22115274
25106
0.79975981 0.00000047 0.22115274
5107
0.79975981 0.00000047 0.22115274
75106
0.79974898 0.00001033 0.2114567
1108
0.79974898 0.00001033 0.2114567
At  1108


2
1i
2
i)g,0(Min
2
1 equal to zero, so we have the optimal solutions:
*
1x  0.79974898,
*
2x  0.00001033 and *
 0.2114567,
that satisfiesapproximately the constraints g1 3.061101
, g2 6.42106
and g3 1.202103
and zAf 0.79975104, such that z< zAf< zu , wherezAfis the solution after the fuzziness .
VI. Conclusion
In this work, the a numerical method of fuzzy nonlinear programming problem is presented. Furthermore, it is proposed that
the results solutionof fuzzy optimization is a generalization of the solution of the crisp optimization problem. In our work, the
penalty function mixed with Nelder and Mend’s algorithm have been successfully employed to solve numerical problems in
fuzzy environment with fuzzy objective function and fuzzy technological constraints. The numerical results of our proposed
method satisfied the fuzzy set theory properties.
REFERENCES
[1]. F. J Ali 5and S. Amir, “Solving Nonlinear Programming Problem in Fuzzy Environment”, Int. J. Contemp. Math.
Sciences, Vol. 7, no. 4, pp. 159 – 170, 2012.
[2]. R. E. Bellman and L.A. Zadeh,” Decision-making in a fuzzy environment”, Management Sci, Vol. 17, No. 4, pp. 141-
164, 1970.
[3]. D. Drinkov, H. Hellendoorn and M. Roinfrank, “An Introduction to fuzzy Control”, Norosa Publishing House, (1996).
[4]. R. Fletcher, “Directional Methods of Optimization”, John Wiley and Sons, 1987.
[5]. P. Iyengar, “Non-Linear Programming; Introduction”, IEOR, Handout 19, 16 October 2002.
[6]. B. Kheirfamand F. Hasani, “Sensitivity analysis for fuzzy linear Programming problems with Fuzzy variables”,
Advanced Model and Optimization, Vol. 12, No. 2, pp. 1878-1888, 2010.
[7]. B. Li, Zhu. M and Xu. K,” A Practical Engineering Method for Fuzzy Reliability Analysis of Mechanical Structures”.
Reliability Engineering and System Safety, Vol. 67, pp. 311–315, 2000.
[8]. S. H. Nasseri, E. Ardil, A. Yazdani and R. Zaefarian, “Simplex method for solving linear programming problems with
fuzzy numbers”, Transactions on Engineering, Computing and Technology, Vol. 10, pp. 284-288, 2005.
[9]. S. H. Nasseri, “ Fuzzy nonlinear optimization, ” The Journal of Nonlinear Analysis and its Applications, Vol. 1, No. 4,
pp. 230-235, 2008.
[10]. J. Nayakand K.B. Sanjaya, ” Optimal Solution of Fuzzy Nonlinear Programming Problems with Linear Constraints”,
International Journal of Advances in Science and Technology, Vol. 4, No. 4, pp. 43-52, 2012.
[11]. V. Pandian, R. Nagarajan, and S. Yaacob, “Fuzzy Linear Programming: A Modern Tool for Decision Making”,
JurnalTeknologi, Vol. 37, pp. 31-44, 2004.
[12]. Z. Preitl, J. K. Tar and M. Takács, “Use of Multi-parametric Quadratic Programming in Fuzzy Control Systems”,
ActaPolytechnicaHungarica, Vol. 3, No. 3, pp. 29-43, 2006.
[13]. J. Qimiand C. Chun-Hsien,” A Numerical Algorithm of Fuzzy Reliability”, Reliability Engineering and System Safety,
Vol. 80, pp. 299–307, 2003.
[14]. S. F. Shu-Kai and Z. Erwie,” Simulation Optimization using An Enhanced Nelder-Mead Simplex Search Algorithm”.
Proceedings of the Fifth Asia Pacific Industrial Engineering and Management Systems Conference 2004.

Page | 13
Paper Publications
[15]. Y. Song, Y. Chen and X. Wu, “A Method for Solving Nonlinear Programming Models with All Fuzzy Coefficients
Based on Genetic Algorithm”, Advances in Natural Computation, Vol. 36, No. 11, pp 1101-1104, 2005.
[16]. H. C. Wu, “Duality Theory In Fuzzy Optimization Problems Formulated By The Wolfe's Primal And Dual Pair”, Fuzzy
Optimization and Decision Making, Vol. 6, pp. 179-198, 2007.
[17]. H. C. Wu, “Duality Theory in Fuzzy Optimization Problems”, Fuzzy Optimization and Decision Making, Vol. 3, pp.
345-365, 2004.
[18]. M. Yenilmez, N. Rafail and K. Gasimor, Solving Fuzzy Liner Programming Problems with Linear Membership
Function, Turk H. Math, TUBITAK, Vol. 26, pp. 375-369, 2002.
[19]. M. Zhiqing, Qiying. H and Chuangyin. D, “A Penalty Function Algorithm with Objective Parameters For Nonlinear
Mathematical Programming”, Journal Of Industrial And Management Optimization, Volume 5, Number 3, pp. 585–601,
2009.
[20]. H.J. Zimmermann, “ Fuzzy Sets :Decision Making and Expert Systems”, Kluwer-Nijhoﬀ Publishing, Boston (1987).

Penalty Function Method For Solving Fuzzy Nonlinear Programming Problem

More Related Content

What's hot (19)

Viewers also liked (15)

Similar to Penalty Function Method For Solving Fuzzy Nonlinear Programming Problem (20)

Recently uploaded (20)

Penalty Function Method For Solving Fuzzy Nonlinear Programming Problem