International Journal of Uncertainty,

Fuzziness and Knowledge-Based Systems

Vol. 19, No. 6 (2011) 9991O12
World Scientific Publishing Company
DOI: 10.1142/S021848851100743X

999
DEGENERACY IN FUZZY LINEAR PROGRAMMING
AND ITS APPLICATION
LEILA ALIZADEH SIGARPICH
Department of Mathematics, Islamic Azad University,
Shahr-e Rey Branch, P. O. Box: 18155-144, 1311963651 Tehran, Iran
Le_alizad@yahoo.com
TOFIGH ALLAHVIRANLOO, FARHAD HOSSEINZADEH LOTFI and NARSIS AFTAB KIANI
Islamic Azad University, Science and Research Branch,
P. O. Box: 14515-775, 1477893855 Tehran, Iran

Received 21 October 2008
Revised 19 September 2011

In this paper, by a definite linear function for ranking symmetric triangular fuzzy numbers, in a Fuzzy Linear
Programming problem (FLP) model, we introduced a Fuzzy Degenerate Solution (FDS). In the physical
meaning, occurrence of degeneracy in a Fuzzy Minimal Cost Flow Network is investigated. To prevent of
falling into Cycling phenomenon in optimization process, we defined two new techniques of Cycling prevention
proper to fuzzy environment.

Keywords: Symmetric triangular fuzzy number; fuzzy numbers ranking; fuzzy linear programming; fuzzy
degeneracy; cycling prevention.
1. Introduction
The concept of decision making in fuzzy environment was first proposed by Bellman and
Zadeh.
5
Subsequently, Tanaka et al.
22
made use of this concept in mathematical
programming. A fuzzy linear programming problem (FLP) has various types. One of
them is the full fuzzy linear programming problem. FLP has been studied by many
scholars.
13, 6, 9, 1113,15,1921

We discuss on a fuzzy linear programming problem, which the right hand side of the
coefficient matrix in the constraints and variables are fuzzy numbers. The fuzzy linear
programming problem with fuzzy coefficients was proposed by Negoita.
20
Maleki et al.
introduced a linear programming problem with fuzzy variables and proposed a method
for solving it.
19
Maleki used a certain ranking function to solve fuzzy linear programming
problems.
1
He also introduced a new method for solving linear programming problems
with vagueness in constraints using a linear ranking function.
In this paper we focus on the kind of linear programming problem in which the right
hand side of the constraints and variables are fuzzy numbers. In this field, some papers
have been published.
18

I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1000
In the solving process of a linear programming problem, if some iterations are carried
out in simplex method without any improvement in the objective function, it means that
there is a tie for the minimum ratio to specify the existing variable, so we will have a
degenerate solution.
14,17
We will extend this concept to fuzzy linear programming
problems. An interesting example for the physical meaning of this phenomenon in an
FLP is a special kind of fuzzy minimal-cost network flow problem. The model is called
flow conservation or nodal balance.
17
This kind of problem might arise in a logistics
network, communication systems, oil pipeline systems, distribution problems in the
power networks and various other areas.
In the solving process, when degeneracy occurs, if the same sequence of iterations
appear many times in the simplex method, we shall cycle forever among the bases
1 2 1
, ,....,
t
B B B B without reaching an optimal solution; consequently, we call this
phenomenon "falling into cycling".
Some rules for preventing cycling have been discussed in Refs. 14 and 17. In the
present work, FLPs with fuzzy (R.H.S.) right hand side are considered. We define fuzzy
degeneracy (FD) in an FLP, then the rules that are applied for the prevention of cycling
prevention are shown. One of the rules is "fuzzy perturbation technique" which is used in
FLP; another one is the "lexicographic rule", also applied in a fuzzy environment.
The paper is organized as follows:
In Sec. 2, some definitions of a fuzzy number are discussed. In Sec. 3, several
theorems are explained for proving the equivalence of an FLP to two crisp LPs. In Sec. 4,
fuzzy degeneracy and its occurrence in a fuzzy network is defined and the algorithms for
preventing cycling in the problem are illustrated by solving some numerical examples.
Conclusion is drawn in Sec. 5.
2. Preliminaries
We present an arbitrary fuzzy number by an ordered pair of functions ( ( ), ( )), 0 1, u r u r r
which satisfy the following requirements:
( ) u r

is a bounded left continuous nondecreasing function over [0 , 1].
( ) u r

is a bounded left continuous nonincreasing function over [0 , 1].
( ) u r

and ( ) u r are right continuous in 0.
( ) u r ( ) u r , 0 1 r .
Therefore, the ordered pair ( ( ) , ( )) u r u r

is the conventional parametric form of a
triangular fuzzy number.
A crisp number is simply represented by ( ) u r = ( ) u r = , 0 1 r .
2.1. Definitions
2.1.1. Triangular fuzzy number
( ) (1) (1)
u
C Core u u u
%
% is the most promising value of u
~
(may be in the
economics literature), (0) u is the smallest possible value of u
~
and (0) u

is the largest
possible value of u
~
.
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
Degeneracy in Fuzzy Linear Programming and its Application 1001
( ) u r = (0) u + ( (0)) .
u
C u r
%

( ) u r = ) 0 ( u + ( (0))
u
C u r
%
, 0 1 r (r is a real number).
(0) 0
L
u u
w C u
% %

and (0) 0
R
u u
w u C
% %

are the left and right margins of u% ,
respectively.
2.1.2. Symmetric triangular fuzzy number ( STFN )
If
L R
u u
w w
% %
, it means that the right and left margins of the fuzzy number are equal, then it is
called the symmetric triangular fuzzy number.
2.1.3. A new representation of ( STFN )
We write u
~
, as the following new representation:
( (1 ) , (1 )) ( , ),
u u u u u u
u C w r C w r C w -
% % % % % %
% 0 1, r then ( , )
u u
C w
% %

will be a
STFN. From Definition 2.1.1, we will have (1 ) ( )
u u
C w r u r
% %
and
(1 ) ( )
u u
C w r u r -
% %
where , .
u u
C w R
% %

2.1.4. Fuzzy arithmetics
Let T . S be the set of all STFNs,
1 1 2 2
( , ), ( , ) t C w u C w % and , R k by using the
extension principle in fuzzy arithmetics, we can define:
1. u
~
t = if and only if
2 1
C C = and
2 1
w w = .
2. t u% + =
1 2 1 2
( , ) C C w w - - .
3.
1 1
( , ) kt kC k w .
1

2.1.5. Fuzzy number ranking
To define an ordering on T . S , let = t
~
(
1 1
w , C ) and u
~
= (
2 2
w , C ) be in T . S . We say
u
~
t
~
< if and only if:
1.
2 1
C C <
or
2.
1 2
( ) C C
2 1
( ) w w < .

Suppose
m n
A R

(in a special case we could have n m = ), = X
~

(
1 2
, ,....,
n
T T T )
T
andY
~
= (
1 2
, ,....,
n
U U U )
T
, which means that X
~
, Y
~
T . S . Now we
have Core ( X
~
+Y
~
) = Core ( X
~
) + Core ( Y
~
).
1. Core ( X
~
A ) = ACore ( X
~
).
2. A ( X
~
+Y
~
) = X
~
A + Y
~
A .
13

I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1002
Lemma 1. Let
1 2
, 0, w w then
1 2
w w if and only if for any 0 1 r ,
1 1 2 2
w wr w w r .
Proof. Proof is clear.
Lemma 2. Consider two s STFN = T (
1 1 1 1
, w wr w wr - ) and U = (
2 2
, w w r -

2 2
w w r ) whose cores are zero, then
T U

if and only if
2 2 1 1
w w r w wr , for any 0 1 r .
Proof. Proof is clear.
3. Fuzzy Linear Programming Problems
Consider the following FLP

= =
=

). , (
~
) , (
~
.
~
,
~
0
~
~ ~
.
~
~ ~ ~ ~
b b X X
W C b W C X T S X X
b X A t s
X C Max
(1)
Where 0 (0. ), 0, ( ), ( ), , 0
X X b b
C Core X C Core b W W z z
% % % %
% % %
are the
margins of X
~

and b
~
, respectively and ST X
~
.
m n
A R

,
n
C R

and b
%
is an
arbitrary fuzzy vector. In this model, one of the parameters that affects the feasibility or
infeasibility of the FLP is parameter " "; for feasibility, this parameter must be large
enough (with the definite rank, defining a margin for the fuzzy zero is essential).
In this section, we are going to reduce FLP (1) to two crisp LPs.
Theorem 1. If problem (1) has a feasible solution then b
~
T . S .
Proof. Note that every combination of STFNs is an STFN. We have
1
n
j j
j
a x b

%
% .
b
~
T . S , and the proof is completed. Problem (1) is equivalent to the following
problem:
(2)

=
T S X W C
W C W C A t s
W C C Max
X X
b b X X
X X
.
~
, 0 , 0
) , ( ) , ( .
) , (
~ ~
~ ~ ~ ~
~ ~

where , ,
X X b
C W C
% % %

and
b
W R
%
. By (1), this problem is equivalent to the following
problem:
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
Degeneracy in Fuzzy Linear Programming and its Application 1003

=
. 0 , 0
) , ( ) , ( .
) , (
~ ~
~ ~ ~ ~
~ ~

X X
b b X X
X X
W C
W C W A AC t s
W C CC Max
(3)
Remark 1. Problem. (1) is reduced to problem (
3
). By Definition 2.1.5, the following
two problems (4) and (5) are derived from (
3
):

=
. 0 , 0
.
~ ~
~ ~
~

X X
b X
X
W C
C AC t s
CC Max
(4)
which is a crisp linear programming problem and the constraint " 0
X
W z
%
" is
redundant; and the i -th entry of
b
C
%
is the core of the i -th entry of b
~
.

=
. 0 , 0
.
~ ~
~ ~
~

X X
b X
X
W C
W W A t s
W C Max
(5)
and the constraint " 0
X
C
%
" is redundant.

Proposition 1. We notice that problems (4) and (5) are solved independently from each
other. Then the solution of the original problem is derived by combining those solutions,
in the parametric form of a fuzzy number. The equivalence of problem (2) to (4) and (5)
could be explained by the following simple remark:
Remark 2.
f
X
%
is a feasible solution of (3) if and only if there exist two feasible
solutions
c
f
X and
w
f
X of problems (4) and (5), respectively, such that
f
X
%
=
(
c
f
X ,
w
f
X ).
Proof. Let
f
X
%
be a feasible solution of problem (2). Set:
c
f
X : =
f
X
C
%
.
w
f
X : =
f
X
W
%
.
It is clear that
f
X
%
= (
c
f
X ,
w
f
X ) = (
f
X
C
%
,
f
X
W
%
). Now 0
c
f
X and
c
f
f
X
AX AC
%
= Core (
f
AX
%
) = Core( b
~
) =
b
C
%
.
Moreover 0
w
f
X =
f
X
W
%
and
w
f
f
b
X
A X AW W
%
%

I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1004
( A is the absolute value of the components of matrix A ). So we have two feasible
solutions ,
c w
f f
X X of problems (4) and (5), respectively, where ( , )
c w
f f f
X X X
%
.
Conversely, if we have two feasible solutions ,
c w
f f
X X of problems (4) and (5),
respectively, then , 0
c
f
f
X b
X
AX AC C C
% %
%
and
, 0
w
f
f
b b
X
A X AW W W z
% %
%
,
thus ( . )
X X
A C W
% %
= ( . ).
b b
C W
% %
This means that , b
~
X
~
A = then = X
~
( . )
X X
C W
% %
is the
feasible solution of (2), and the proof is completed.

Corollary 1. Problem (2) is infeasible if and only if either problem (4) or problem (5) is
infeasible.
Theorem 2. If ,
c w
f f
X X

are the optimal solutions of problems (4) and (5),
respectively, then

( , )
c w
f f f
X X X

%
is the optimal solution of (2).
Proof. Suppose ,
c w
f f
X X

are the optimal solutions of problems (4) and (5),
respectively. Let
f
X

%
( , )
c w
f f
X X

and
f
X
%
be a feasible solution of problem (2). By
Remark 2,
c
f
X = Core(
f
X
~
) and ( )
w
f f
X W X
%
are feasible solutions of problems (4)
and (5) , respectively, so
c c
f f
CX CX

w w
f f
C X C X

( C is the absolute value of the components of vector C ). Thus, by Definition 2.1.5 we
have
( , ) ( , )
c w c w
f f f f
CX C X CX C X


So

3 4 *
( , ) ( , ) .
c w
f f f f
CX CX C X CX C X CX


% % % %

Hence,
f
X

%
is the optimal solution of problem (2), and the proof is completed.
Theorem 3. If
f
X

%
is the optimal solution of problem (2), then there exist two optimal
solutions of problems (4) and (5), say, ,
c w
f f
X X

, such that
( , ).
c w
f f f
X X X

%

Proof. Suppose
f
X

%
is the optimal solution of problem (2). Let
c
f
X

= Core (
f
X

%
)
and
w
f
X

= W ( )
f
X

%
. By theorem (2) these are feasible solutions of problems (4) and
(5), respectively.
Now, if
c
f
X and
w
f
X are feasible solutions of problems (4) and (5) , respectively,
we know that ( , )
c w
f f f
X X X
%
is a feasible solution of problem (2). Since
f
X

%
is the
optimal solution of problem (2), so by definition (5) ( )
c
f f
CX Core CX
%

* *
( )
c
f f
Core CX CX
%
, hence
*
c c
f f
CX CX and thus
*
c
f
X is the optimal solution
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
Degeneracy in Fuzzy Linear Programming and its Application 1005
of problem (4). On the other hand, if
*
w w
f f
C X C X > then
2
Y

%

*
( , ) ( , )
c w c w
f f f f f
CX C X CX C X CX

<
%
and (
*
,
c w
f f
X X ) is a feasible solution
of problem (2). But this is a contradiction, so
*
w w
f f
C X C X and hence
*
w
f
X is the
optimal solution of problem (5), and the proof is completed.
Remark 3. Problem (2) is reduced to problems (4) and (5).
Corollary 2.
f
X

%
is the unique optimal solution of problem (2) if and only if each of the
problems (4) and (5) have unique optimal solutions
c
f
X

and
w
f
X

, respectively, such
that
* *
( , ).
c w
f f f
X X X

%
Also
*
w
f
X
o
is an alternative solution of problem (2) if and
only if at least one of the problems (4) or (5) has an alternative solution.

Proof. This is a summary of the previous results.
Remark 4. Problem (2) is unbounded if and only if either (4) or (5) have an unbounded
solution.
Remark 5. The above mentioned proofs are analogue for the minimization case.
4. Fuzzy Degeneracy
Let X

be an optimal solution of problem (4) andY

be an optimal solution of problem

(5) then
( ; ) X X Y

%


This solution could be written in the form
* * *
1 2
( , ..., )
n
X x x x

%
, which is an optimal
solution of problem (2). By this point and concluding from the previous theorems, we are
going to define Fuzzy degeneracy:
4.1. Definitions
4.1.1. Strong degeneracy
A fuzzy linear programming problem has a strongly degenerate basic feasible solution if
the number of the components of the solution in the simplex method of the form ( 0 , 0)
or (0, ) are more than " n m " (n is the number of the variables and m is the rank of the
coefficient matrix in the system of simultaneous fuzzy equations "A". ("A" is the
coefficient matrix in the (1) till (5)) in Sec.3, therefore we have a strongly degenerate
basic feasible solution for fuzzy linear programming problems.
4.1.2. Weak degeneracy
A fuzzy linear programming problem has a weakly degenerate basic feasible solution if
the number of the fuzzy zeroes ( w , 0 ), of any basic feasible solution of the problem are
more than " n m ", therefore we have a weakly degenerate basic feasible solution for
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1006
fuzzy linear programming problems. We know that " w " always satisfies the condition
0 w z .
Notation: In our methodology, related to crisp problems, the original problem has a strongly
degenerate basic feasible solution if both of the crisp problems have degenerate basic feasible
solutions and the (zero, zero) or (zero,

z ), the respective components of the degenerate
solutions of the two crisp problems are corresponding. But if only the problem related to the
core has a degenerate basic feasible solution or the corresponding components of the solutions
of the two crisp problems are not simultaneously (zero, zero) or (zero, z ) , then the original
problem will have a fuzzy solution that is a weakly degenerate basic feasible solution.

4.2. Degeneracy in capacity ascertainment of the electricity transmission network lines
with a limited energy loss
We know that the structure of a network is analogues with a graph. There are some nodes
and arcs in a network. With each node i in G we associate a fuzzy number
i
b
~
, that is, the
available (approximate) fuzzy supply of an item (if 0
i
b >
% %
) or the required (approximate)
fuzzy demand for the item (if 0
i
b <
% %
). In the physical meaning Nodes with ( 0
i
b >
% %
) are
called sources, and nodes with ( 0
i
b <
% %
) are called sinks. If 0 (0 , )
i
b z
% %
, then the

i -th node is neither a source nor a sink , then none of the item is available at node i and
none is required; in this case, node i is called an intermediate (or transshipment) node.
According to the technical design, this kind of node transits energy with a controlled
energy loss, (the physical meaning of z ). Associated with each arc ( j i, ) we let
ij
x
~
be
the amount of flow on the arc (we assume 0
ij
x
%
% ). Positivity is explained as in
Eq. (3.2), and we let
ij
c be the unit shipping cost along the arc.
The minimal-cost network flow problem may be stated as follows:


1 1
,
1 1
. 1,...,
0 , 0 , 1,..., .
ij ij
m m
ij ij
i i
m m
ij ki i
j k
X X
Min c x
s t x x b i m
C W i j m z

'

'


% %
%
%
% % (1)

These constraints are called the fuzzy flow conservation, or nodal balance, and m is the
number of nodes.
This model could be applied in electric flow networks, when
ij
x
~
is the fuzzy amount
of electricity out of node i into node j and
ki
x
~
is the fuzzy amount of electricity out of
node k into node . i z could be defined as the maximum amount of wastage of energy in
the power line (electricity). In most real problems, the number of nodes that are sources
or sinks is very small, which means that many of them are in the transit position. For
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
Degeneracy in Fuzzy Linear Programming and its Application 1007
every node there is a constraint in the model. For these kinds of nodes, the right hand side
of constraints with a limited waste are fuzzy zero. So, the basic feasible solution will be
degenerate and the grade of degeneracy (the number of zero basic feasible solutions) is
high.
5. Cycling in Fuzzy Degeneracy
5.1. Definitions
5.1.1. Cycling in a fuzzy problem
In a fuzzy linear programming problem if a basic feasible solution (BFS) of the problem is
degenerate, then the problem may fall into cycling and without reaching an optimal solution
the same BFS will repeat over and over.
To overcome this problem, we propose the following algorithm:
5.1.2. Cycling prevention with a fuzzy perturbation parameter
For preventing cycling, we make a perturbation in the right hand side of the constraints of the
problem. This technique specifies the variable leaving the basis, such that if the simplex
minimum ratio test produces several candidates, then it will guarantee no cycling.
We enter a small perturbation parameter into vector b
%
(right hand side of the FLP),
then the perturbed problem is in the following form:

X
~
C min
. . ( ) s t AX b e
% %
%
*
0 X
% %
.

b
~
(% ) is replaced by b
~
+ % , where % = (
c
,
w
),
c
e = (
1 2
, ,...,
n
c c c
) and
w
=
(
1 2
, ,...,
n
w w w
e e e ) are crisp vectors and {
i
c
e } and {
i
w
e } are decreasing sequences with
small positive numbers and large differences from each other. We may set
c
=
(
c
.
2
,...,
n
c c
e e ) and
w
= (
w
.
2
,...,
n
w w
e e ).
This kind of perturbation parameter selection, guarantees non-cycling in the solving
process of the problem.
Theorem 4. For every b
~

m
E there exist % such that for , 0 < < % , the
following problem

X
~
C min
. . ( ) s t AX b e
% %
%
*
0 X
% %
.

is not degenerate.
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1008
Proof. We know that this problem is equivalent to the following two crisp problems ((1) and
(2)) (the reference are problems (3), (4), (5) in Sec. 3):

. .
0 .
X
c
X b
X
Min C C
s t AC C
C
e

-
'

'
%
% %
%
(1)

which is a crisp linear programming problem.
m n
A R

,
n
R C and b
~
T . S and the
i -th entry of
b
C
%
is the core of the i -th entry of b
~
and the i -th entry of
c
e is the core
of the i -th entry of .

. .
0 .
X
w
X b
X
Max C W
s t A W W
W
e
z

-
'

'
%
% %
%
(2)

where
m n
A R

,
n
R C and b
~
T . S and we know that the perturbation theorem for
the existence of a very small "" is satisfied for these crisp problems, then the existence
of the % for the original problem is proved.
For preventing the degeneracy, the perturbation parameter, % , is selected in the form
(
c
,
w
) in the strong degeneracy and in the form ( , 0
c
), in the weak state, and the
proof is completed.

6. Numerical Examples
We are going to solve some examples and determine their solutions.

6.1. Example
Consider the following FLP problem, because of falling into cycling, we must use a
cycling prevention technique to obtain the optimal solution:

3 1
4 5 6 7
4 2
1
1 4 5 6 7
4
1 1
2 4 5 6 7
2 2
3 6
*
min 20 6
. . 8 9 ( 1 ,1 )
12 3 ( 2 2 , 2 2 )
( , 2 )
0 , 1...7, 0 (0, 5).
i
x x x x
s t x x x x x r r
x x x x x r r
x x r r
x i

- -

- - -

- - -
'

'
% % % %
% % % % %
% % % % %
% %
% %
%

I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
Degeneracy in Fuzzy Linear Programming and its Application 1009
Now consider the following problem
3 1
4 5 6 7
4 2
1
1 4 5 6 7
4
1 1
2 4 5 6 7
2 2
3 6
max 20 6
. . 8 9 0
12 3 0
1
0 , 1...7.
i
x x x x
s t x x x x x
x x x x x
x x
x i

- -

- -

- -
'

'

This problem falls into cycling after 6 iterations. By using the Lexicographic rule we
obtain the optimal solution after 2 iteration. Lexicographic rule for selecting the exiting
variable is as follows: The index r of the variable
Br
x , Leaving the basis is determined as
follows, we define:
1 1
2
1 2
{ : min { }};
rj ij
j
rk ik
y y
j i I j
y y
I r if I

is singleton, namely
1
{ },
j
I r

then
Br
x leaves the basis, otherwise form
j
I . In general
j
I

is formed from
1 j
I

as follows:
1
{ : min { }}
rj ij
j
rk ik
y y
j i I
y y
I r

eventually for some m j will be a singleton if

{ },
j
I r then
Br
x leaves the basis.
* 3
4
0 0 1 0 1 0
T
X (

.
Therefore by using this rule we obtain a nondegenerate solution of the first crisp problem.
Now consider the other problem:
3 1
4 5 6 7
4 2
1
1 4 5 6 7
4
1 1
2 4 5 6 7
2 2
3 6
max 20 6
. . 8 9 1
12 3 2
1
0 5, 1...7.
i
y y y y
s t y as y y y y
y y y y y
y y
y i
- - -

- - - -

- - - -
'

'

Then
[ ]
*
0 0 1 4 0 0 0
T
Y .
This is the degenerate solution of the second crisp problem. Therefore
* 3 3
4 4
( , ) (0 , 0) ( 1 , 1 ) ( 3 4 , 5 4 ) (0 , 0) (1, 1) (0 , 0)
I T
X r r r r ( - -


is a nondegenerate solution.

I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1010
6.2. Example
Electrical Distribution Network (E. D. N.)

The representation as a linear programming problem as follows:





Graph of the E. D. N.


where [ 1 1 1 1 1 1]
T
C ,


1 1 0 0 1 0 ( 4 , 0.5)
1 0 1 1 0 0 ( 0 , 0.1)
, ,
0 1 1 0 0 1 ( 0 , 0.01)
0 0 0 1 1 1 ( 4 , 0.6)
A b

( (
( (

( (

( (
( (


%

The first problem is related to the Core of the solution:

12 13 23 24 41 43
12 13 41
23 24 12
23 13 43
41 43 24
12 13 41 23 24 43
min
. 4
0
0
4
, , , , , 0 , 0 (0 , 0.5).
x x x x x x
s t x x x
x x x
x x x
x x x
x x x x x x
- - - -

'

'
%

The degenerate solution of this problem is
[ ] 0 0 4 0 0 4 =
*
X .


3 4
2
1
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
Degeneracy in Fuzzy Linear Programming and its Application 1011
The second problem is related to the margin of the solution:
12 13 23 24 41 43
12 13 41
23 24 12
23 13 43
41 43 24
12 13
41 23
24 43
max
. 0.5
0.1
0.01
0.6
0 0.5, 0 0.5
0 0.5, 0 0.5
0 0.5, 0 0.5.
y y y y y y
s t y y y
y y y
y y y
y y y
y y
y y
y y
- - - - -

- -

- -

- -

'
- -

'

The solution is
[ ] 005 0 5 0 095 0 005 0 0 0 . . . . Y
*
= .
Therefore, the parametric form of the solution is
*I
X
[(4, 4) (0, 0) ( 0.005 0.005 , 0.005 0.005 )
(3.905 0.095 , 4.095 0.095 ) ( 0.5 0.5 , 0.5 05 ) ( 0.005 0.005 , 0.005 0.005 )].
r r
r r r r r r
- + -
+ - - + - - + -

This is the weak degenerate solution of the original problem.
7. Conclusion
In this paper, two kinds of fuzzy degeneracy were defined and then the perturbation theorem
for a fuzzy degenerate problem for preventing cycling was proved. Also its related technique
was applied to a degenerate fuzzy programming problem. Moreover, the lexicographic rule as
another cycling preventing rule was explained. A concrete example in power network showed
that this phenomenon occurs in real life, as well.

References
1. H. R. Maleki, Ranking functions and their applications to fuzzy linear programming, Far
East J. Appl. Math. 4 (2002) 283301.
2. D. C. Luenberger, Linear and Nonlinear Programming (Addison-Wesley 1984).
3. N. Mahdavi-Amiri and S. H. Nasseri, Duality in fuzzy number linear programming by use of
a certain linear ranking function, Appl. Math. Comput. 180 (2006) 206216.
4. M. S. Bazaraa, J. J. Jarvis and H. D. Sherali, Linear Programming and Network Flows (John
Wiley & Sons, New York, 1990).
5. R. A. Bellman and L. A. Zadeh, Decision-making in a fuzzy environment, Management
Sciences, Ser. B 17 (1970) 141164.
6. J. J. Bukley, Fuzzy programming and the pareto optimal set, Fuzzy Sets and Systems 10(1)
(1983) 5763.
I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.
L. A. Sigarpich et al. 1012
7. D. Butnariu, E. P. Klement and S. Zafrany, On triangular norm-based propositional fuzzy
logics, Fuzzy Sets and Systems 69 (1995) 241255.
8. D. Butnariu and E. P. Klement, Triangular Norm-Based Measures and Game with Fuzzy
Coalitions (Kluwer, Dordrecht, 1993).
9. M. Delgado, J. L. Verdegay and M. A. Vila, A general model for fuzzy linear programming,
Fuzzy Sets and Systems 29 (1989) 2129.
10. R. Fuller, Neural Fuzzy Systems (1995).
11. K. Ganesan and P. Veeramani, Fuzzy linear programs with trapezoidal fuzzy numbers, Ann.
Oper. Res. 143 (2006) 305315.
12. C. Garcia-Aguado and J. L. Verdegay, On the sensitivity of membership functions for fuzzy
linear programming problems, Fuzzy Sets and Systems 56 (1993) 4749.
13. F. Herrera, and J. L. Verdegay, Approaching fuzzy linear programming problems, Interactive
Fuzzy Optimization (Springer-Verlag, Berlin, 1991).
14. G. R. Jahanshahloo, Operations Research 2 (Payamenoor University, Tehran, 2002).
15. Ch. Li, X. Liao and J. Yu, Tabu search for fuzzy optimization and applications, Inform. Sci.
158 (2004) 313.
16. T. Allahviranloo, Numerical methods for fuzzy system of linear equations, Appl. Math.
Comput. 155 (2004) 493502.
17. M. S. Bazaraa, J. J. Jarvis and H. D. Sherali, Linear Programming and Network Flows (John
Wiley & Sons, New York, 2004).
18. T. Allahviranloo, K H. Shamsolkotabi, N. A. Kiani and L. Alizadeh, Fuzzy integer linear
programming problems, Int. J. Contemp. Math. Sci. 2(4) (2007) 167181.
19. H. R. Maleki, M. Tata and M. Mashinchi, Linear programming with fuzzy variables, Fuzzy
Sets and Systems 109 (2002) 2133.
20. C. V. Negoita, Fuzziness in Management (OPSA/ TIMS, Miami, 1970).
21. H. Rommelfanger, Fuzzy linear programming and applications, European J. Oper. Res. 92
(1996) 512527 .


I
n
t
.

J
.

U
n
c
.

F
u
z
z
.

K
n
o
w
l
.

B
a
s
e
d

S
y
s
t
.

2
0
1
1
.
1
9
:
9
9
9
-
1
0
1
2
.

D
o
w
n
l
o
a
d
e
d

f
r
o
m

w
w
w
.
w
o
r
l
d
s
c
i
e
n
t
i
f
i
c
.
c
o
m
b
y

8
5
.
7
4
.
8
4
.
1
3
4

o
n

1
0
/
2
3
/
1
2
.

F
o
r

p
e
r
s
o
n
a
l

u
s
e

o
n
l
y
.