Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number

Dr. Sreelekha Menon Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 2) February 2016, pp.66-74
www.ijera.com 66|P a g e
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy
Number
Dr. Sreelekha Menon
Associate Professor, Department of Mathematics SCMS school of Engineering And Technology, Angamaly,
Ernakulam.
Abstract
In this paper a general fuzzy maximal flow problem is discussed . A crisp maximal flow problem can be solved
in two methods : linear programming modeling and maximal flow algorithm . Here I tried to fuzzify the
maximal flow algorithm using octagonal fuzzy numbers introduced by S.U Malini and Felbin .C. kennedy [26].
By ranking the octagonal fuzzy numbers it is possible to compare them and using this we convert the fuzzy
valued maximal flow algorithm to a crisp valued algorithm . It is proved that a better solution is obtained when
it is solved using fuzzy octagonal number than when it is solved using trapezoidal fuzzy number . To illustrate
this a numerical example is solved and the obtained result is compared with the existing results . If there is no
uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp
maximal flow problems.
Keywords: Fuzzy maximal flow problem , ranking functions , Octagonal fuzzy Number
I. Introduction
In optimization theory maximum flow problems involve finding a feasible amount of flow passing from a
source to a sink which is maximum. It is a special case of more complex network flow problems such as
circulation problems, communication networks, oil pipeline systems, power systems and so on. The maximum
flow problem was first formulated in 1954 by T .E Harris and F.S Ross [17] as a simplified model of Soviet
railway traffic flow. In 1955 Lester .R. Ford jr and Delbert R Fulkerson [15] crated the first known augmenting
path algorithm. Later on various improved solutions to the maximum flow algorithm were discovered. Some of
them are, the shortest augmenting path algorithm of Edmonds and Karp, the blocking flow algorithm of Dinitz ,
the push relabel algorithm of Goldberg and Tarjan and the binary blocking algorithm of Goldberg and Rao . The
electrical flow algorithm of Christiano , kelner ,Mardy and Spielman is useful in finding an approximately
optimal maximal flow of an undirected graph . These are some of the efficient methods to solve crisp maximal
flow algorithms [19].
In conventional maximal flow problems, it is assumed that the decision maker is certain about the flows
between the different nodes . But in real life situations there always exist uncertainty about the parameters such
as cost , capacities and demand of maximal flow problem . In such situations flows may be represented as fuzzy
numbers . The problem of finding the maximum flow between a source and a sink with fuzzy capacities has a
wide range of applications in communication networks, oil pipeline systems , power systems etc .
There are only few number of papers published dealing with fuzzy maximal flow problems .The paper “
Fuzzy Flows on Networks “by K.Kim and Roush [22] is considered as one of the first papers on this subject .
The authors used fuzzy matrices to obtain a fuzzy optimal flow.
Chanas and Kolodziejczyk approached this problem using minimum cuts technique. They presented an
algorithm [4] in 1982 for a graph with crisp structure and fuzzy capacities i.e , the arcs have a membership
function associated in their flow .Later in 1984 they studied this problem in another way in which the flow is a
real number and the capacities have upper and lower bounds with a satisfaction function [5] .In 1986 Chanas
and Kolodziejczyk [6] had also studied the integer flow and proposed an algorithm . Chanas et al. [3] (1995)
studied the maximum flow problem when the underlying associated structure is not well defined and must be
modeled as a fuzzy graph. Diamond(2001) developed interval-valued versions of the max-flow min cut theorem
and Karp-Edmonds algorithm and provide robustness estimates for flows in networks in an imprecise or
uncertain environment[14]. These results are extended to networks with fuzzy capacities and flows.
Liu and Kao (2004) [24] investigated the network flow problems in that the arc lengths of the network are
fuzzy numbers. Ji et al.(2006) [20] considered a generalized fuzzy version of maximum flow problem, in which
arc capacities are fuzzy variables. Hernandes et al. (2007) [18] proposed an algorithm, based on the classic
algorithm of Ford-Fulkerson. The algorithm uses the technique of the incremental graph and representing all the
RESEARCH ARTICLE OPEN ACCESS

parameters as fuzzy numbers. Kumar et al. (2009) [23] proposed a new algorithm to find fuzzy maximal flow
between source and sink by using ranking function.
In this paper an algorithm is given to find the fuzzy maximal flow between the source and the sink for a directed
graph by representing all the parameters as octagonal fuzzy numbers . To illustrate the algorithm a numerical
example is solved and the obtained result is compared with the existing result . Also the numerical problem is
converted to one in which all the parameters are taken as trapezoidal fuzzy numbers and both the results are
compared . A ranking using α-cut is introduced on octagonal fuzzy numbers. Using this ranking the fuzzy
maximal flow problem is converted to a crisp valued problem, which can be solved using maximal flow
algorithm. The optimal solution can be got either as a fuzzy number or as a crisp number
II. Octagonal Fuzzy Numbers : Basic Definitions
Octagonal fuzzy numbers are proposed by Malini .S.U and kennedy Felbin .C in 2013 [26] [27] . We
recall the required definitions and results .
Definition 2.1:
An octagonal fuzzy number denoted by 𝐴 𝜔 is defined to be the ordered quadruple
𝐴 𝜔 = 𝑙1 𝑟 , 𝑠1 𝑡 , 𝑠2 𝑡 , 𝑙2 𝑟 for 𝑟 ∈ 0, 𝑘 𝑎𝑛𝑑 𝑡 ∈ 𝑘, 𝜔 where
1. 𝑙1 𝑟 is a bounded left continuous non decreasing function over 0, 𝜔1 , 0 ≤ 𝜔1 ≤ 𝑘
2.𝑠1 𝑡 is a bounded left continuous non decreasing function over 𝑘, 𝜔2 , 𝑘 ≤ 𝜔2 ≤ 𝜔
3 𝑠2 𝑡 is a bounded left continuous non increasing function over 𝑘, 𝜔2 , 𝑘 ≤ 𝜔2 ≤ 𝜔
4. 𝑙2 𝑟 is a bounded left continuous non increasing function over 0, 𝜔1 , 0 ≤ 𝜔1 ≤ 𝑘
Remark 2.1 :
If  =1 then the above defined number is called a normal octagonal fuzzy number .
Definition 2.2 :
A fuzzy number 𝐴 is a normal octagonal fuzzy number 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 is given by
Where 0 ≤ k ≤ 1
Remark 2.2:
If k=0 , the octagonal fuzzy number reduces to trapezoidal fuzzy number ( a3,a4,a5,a6) and if k =1 it reduces
to trapezoidal fuzzy number ( a1,a4,a5,a8)
Remark 2.3 : According to the above mentioned definition , octagonal fuzzy number 𝐴 𝜔 is the ordered
quadruple 𝑙1 𝑟 , 𝑠1 𝑡 , 𝑠2 𝑡 , 𝑙2 𝑟 where 𝑟 ∈ 0, 𝑘 and 𝑡 ∈ 𝑘, 𝜔 where

𝑙1 𝑟 = 𝑘
𝑟−𝑎1
𝑎2−𝑎1
𝑠1 𝑟 = 𝑘 + 1 − 𝑘
𝑡−𝑎3
𝑎4−𝑎3
𝑠2 𝑟 = 𝑘 + 1 − 𝑘
𝑎6−𝑡
𝑎6−𝑎5
and 𝑙2 𝑟 = 𝑘
𝑎8−𝑟
𝑎8−𝑎7
Remark 2.4 :
Membership function 𝜇 𝐴 𝑥 are continuous functions
Graphical representation of an octagonal fuzzy number for k = 0.5 is
S1(t) S2(t)
l1(r) l2(r)
a8a1 a2 a3 a4 a5 a6 a7
0
0.2
0.4
0.6
0.8
1
1.2
Remark 2.5:
If 𝐴 be an octagonal fuzzy number, then the α – cut of 𝐴 is
𝐴 𝛼
= 𝑥/𝐴(𝑥) ≥ 𝛼
The octagonal fuzzy number is convex as their α – cuts are convex sets in the classical sense.
Remark 2.6:
The collection of all octagonal fuzzy numbers from ℛ to I is denoted by ℛ(I) and if  =1 the collection of all
normal octagonal fuzzy number is denoted by ℛ(I).
Remark 2.7:
A fuzzy number is called positive ( negative ) , denoted by 𝐴 > 0 (𝐴 < 0)if its membership function 𝜇 𝐴 𝑥
satisfie 𝜇 𝐴 𝑥 = 0 ∀ 𝑥 ≤ 0 (∀𝑥 ≥ 0)
Remark 2.8:
Two octagonal fuzzy numbers 𝐴 = (a1,a2,a3,a4,a5,a6,a7,a8) & 𝐵 = (b1,b2,b3,b4,b5,b6,b7,b8) are said to be equal if
and only if a1=b1, a2=b2, a3=b3, a4=b4, a5=b5, a6=b6, a7=b7,a8=b8.
Remark 2.9 :
Using interval arithmetic given by Kaufmann [21] .A we obtain α – cuts , addition , subtraction and
multiplication of two octagonal fuzzy numbers as follows
 α – cut of an octagonal fuzzy number : To find the α – cut of a normal octagonal fuzzy number 𝐴 =
(a1,a2,a3,a4,a5,a6,a7,a8) for α[0,1]
𝐴 𝛼
=
[𝑎1 +
𝛼
𝑘
𝑎2 − 𝑎1 , 𝑎8 −
𝛼
𝑘
𝑎8 − 𝑎7 ] 𝑓𝑜𝑟 𝛼 ∈ 0, 𝑘
[𝑎3 +
𝛼−𝑘
1−𝑘
𝑎4 − 𝑎3 , 𝑎6 −
𝛼−𝑘
1−𝑘
𝑎6 − 𝑎5 ] 𝑓𝑜𝑟 𝛼 ∈ 𝑘, 1
 Addition of octagonal fuzzy numbers : Let 𝐴 = (a1,a2,a3,a4,a5,a6,a7,a8) & 𝐵 = (b1,b2,b3,b4,b5,b6,b7,b8) be two
octagonal fuzzy numbers . We add the α – cuts of 𝐴 and 𝐵 using interval arithmetic

𝐴 𝛼
+ 𝐵 𝛼 =
[𝑎1 +
𝛼
𝑘
𝑎2 − 𝑎1 , 𝑎8 −
𝛼
𝑘
𝑎8 − 𝑎7 ]
+[𝑏1 +
𝛼
𝑘
𝑏2 − 𝑏1 , 𝑏8 −
𝛼
𝑘
𝑏8 − 𝑏7 ] 𝑓𝑜𝑟 𝛼 ∈ 0, 𝑘
[𝑎3 +
𝛼−𝑘
1−𝑘
𝑎4 − 𝑎3 , 𝑎6 −
𝛼−𝑘
1−𝑘
𝑎6 − 𝑎5 ]
+[𝑏𝑎3 +
𝛼−𝑘
1−𝑘
𝑏4 − 𝑏3 , 𝑎6 −
𝛼−𝑘
1−𝑘
𝑏6 − 𝑏5 ] 𝑓𝑜𝑟 𝛼 ∈ 𝑘, 1
 Subtraction of two octagonal fuzzy numbers :
Let 𝐴 = (a1,a2,a3,a4,a5,a6,a7,a8) & 𝐵 = (b1,b2,b3,b4,b5,b6,b7,b8) be two octagonal fuzzy numbers . We subtract the
α – cuts of 𝐴 and 𝐵 using interval arithmetic
𝐴 𝛼
− 𝐵 𝛼 =
[𝑎1 +
𝛼
𝑘
𝑎2 − 𝑎1 , 𝑎8 −
𝛼
𝑘
𝑎8 − 𝑎7 ]
−[𝑏1 +
𝛼
𝑘
𝑏2 − 𝑏1 , 𝑏8 −
𝛼
𝑘
𝑏8 − 𝑏7 ] 𝑓𝑜𝑟 𝛼 ∈ 0, 𝑘
[𝑎3 +
𝛼−𝑘
1−𝑘
𝑎4 − 𝑎3 , 𝑎6 −
𝛼−𝑘
1−𝑘
𝑎6 − 𝑎5 ]
−[𝑏𝑎3 +
𝛼−𝑘
1−𝑘
𝑏4 − 𝑏3 , 𝑎6 −
𝛼−𝑘
1−𝑘
𝑏6 − 𝑏5 ] 𝑓𝑜𝑟 𝛼 ∈ 𝑘, 1
 Fuzzy Marix : A matrix 𝐴 = 𝑎𝑖𝑗 if each element of 𝐴 is a fuzzy number . A fuzzy matrix 𝐴 will be
positive and denoted by𝐴 >0 if each element of 𝐴 is positive .

III. Ranking of fuzzy octagonal numbers
Fuzzy maximal flow problem have received much attention in the recent years .Yager’s ranking method [
32] is one of the robust ranking techniques which is used to solve fuzzy maximal flow problems involving
triangular and trapezoidal numbers .A similar measure for a fuzzy octagonal number is introduced by S.U
Malini et al .In this paper this method is used to convert the octagonal fuzzy numbers to crisp values .
Definition 3.1 :
A measure of normal octagonal fuzzy number 𝐴 is a function 𝑀 𝛼 : ℛ(𝐼) → ℛ+
which assigns a non-negative
real number 𝑀 𝛼 𝐴 that express the measure of 𝐴 , 𝑀 𝛼
𝑜𝑐𝑡
𝐴 =
1
2
𝑙1 𝑟 + 𝑙2 𝑟 𝑑𝑟 +
1
2
𝑠1 𝑡 +
1
𝑘
𝑘
𝛼
𝑠2𝑡𝑑𝑡 where 0< k < 1
Definition 3.2 :
Let 𝐴 be a normal octagonal fuzzy number . The value 𝑀 𝛼
𝑜𝑐𝑡
𝐴 , called the measure of 𝐴 is calculated as
follows :
𝑀 𝛼
𝑜𝑐𝑡
𝐴 =
1
4
𝑎1 + 𝑎2 + 𝑎7 + 𝑎8 𝑘 + 𝑎3 + 𝑎4 + 𝑎5 + 𝑎6 1 − 𝑘
IV. Mathematical Formulation of a fuzzy maximal Flow Problem
In this section , we consider a pipe network used to transfer fluid ( oil, water etc ) from one location to
another . The maximum flow of fluid in each pipe will be limited to a particular value depending on the
diameter or the slope of the pipe in that segment . We consider the pipe segment between any two locations i
and j usually called as the arc from i – j of the network will have maximum flow of fluid per unit time from
node i to node j which we are considering as a fuzzy number . We try to solve this problem to determine the
maximum flow of liquid from a given source to a given destination using the fuzzy maximal flow algorithm
V. Procedure to Solve Fuzzy Maximal Flow Problem ( FMFP) algorithm
The objective of this problem is to find a maximal flow from a given source to a given destination using
octagonal fuzzy number . The algorithm is as follows
Step 1:
Prepare a fuzzy capacity matrix 𝐴 for the given flow network. Let 𝑎𝑖𝑗 be the flow from the node i to the
node j ( i = 1,2,3,……n; j = 1,2,3,…n , where n is the total number of nodes ) Set the iteration k = 1 ,
cumulative flow 𝑋 = 0
Step 2:
Find a directed path starting from the given source to the given destination directly or passing through some
intermediate nodes which will have some feasible quantity of flow.
Step 3:
If such a path exist then go to next step , otherwise go to step 7

Step 4:
Find the minimum of the capacities of the various paths traced in step 2 . Let it be 𝑄 𝑘 . Set 𝑋 = 𝑋 + 𝑄 𝑘
Step 5:
Obtain the next flow matrix as :
a) Subtract 𝑄 𝑘 from all 𝑎𝑖𝑗 values corresponding to forward path traced
b) Add 𝑄 𝑘 to all 𝑎𝑖𝑗 values corresponding to backward path traced
Step 6: Set k = k+1 and go to step 2
Step 7:
Obtain a new flow matrix 𝐶 by subtracting the elements of the flow matrix 𝐵 in the last iteration from the
corresponding elements of the starting fuzzy capacity matrix 𝐴
𝑐𝑖𝑗 = 𝑎𝑖𝑗 − 𝑏𝑖𝑗 , 𝑖𝑓 𝑎𝑖𝑗 < 𝑏𝑖𝑗 for all values of i and j
= 0, otherwise
Step 8 :
a) The cell entries of the fuzzy matrix 𝐶 represent the flows in various arcs .
b) The maximal flow from the source node to the destination node is 𝑋
c) Map the cell entries on to the corresponding arcs of the network showing the fuzzy flow s in various
arcs to get the maximal flow 𝑋.
VI. 6. Illustrative Example .
Consider the directed flow network shown below with fuzzy flow capacities between various pairs of
location . Find the maximal flow from node 1 to node 5.
First we convert the fuzzy values into the crisp values using ranking function which is also given in the
following table
Node i-j Fuzzy capacities Crisp values using ranking function
1-2 (1,2,3,5,6,7,8,10) 5.25
1-3 (4,5,7,8,11,12,14,15) 9.5
1-4 (4,5,7,8,10,13,14,15) 9.5
2-3 (1,2,3,4,5,6,7,8) 4.5
3-4 (1,2,3,4,5,6,7,8,11) 5.5
3-5 (4,5,7,8,10,12,13,15) 9.25
4-5 (0,1,3,4,5,6,7,10) 4.5
Step 1: Fuzzy capacity Matrix using ranking function :

Now no more flow is possible from node 1 to node 5

Final flow matrix
The maximal flow from node 1 to node 5 is 13.75
Hence by maximal flow algorithm the optimum solution is
1-2 (1,2,3,4,5,6,7,8) 4.5
1-3 (4,5,7,8,10,12,13,15) 9.25
2-3 (1,2,3,4,5,6,7,8) 4.5
3-4 (1,2,3,4,5,6,7,8) 4.5
3-5 (4,5,7,8,10,12,13,15) 9.25
4-5 (1,2,3,4,5,6,7,8) 4.5
Total flow at node 1 (5,7,10,12,15,18,20,23) 13.75
Remark 6.1:
So we are getting the same value when we assume that the network is having crisp and fuzzy
capacities.
Remark 6.2:
When we convert the octagonal fuzzy maximal flow problem to trapezoidal fuzzy maximal flow problem
1-2 (1,5,6,10) 5.5
1-3 (4, 8,11,15) 9.5
1-4 (4,8,10, 15) 9.25
2-3 (1,4,5,8) 4.5
3-4 (1,5,6,11) 5.75
3-5 (4,8,10,12,15) 9.25
4-5 (0,4,5,10) 4.75

When this problem is solved using the above algorithm the optimal solution is as follows
The crisp value of the optimum fuzzy maximal flow and the corresponding fuzzy flow are the same . But it
is slightly greater than the value obtained when octagonal fuzzy number is used .
VII. Conclusion
In this paper an algorithm is proposed for finding the fuzzy optimal flow of the fuzzy maximal flow
problem using octagonal fuzzy number . The result is also compared using trapezoidal fuzzy number . A
numerical example is solved to illustrate the proposed result . The concept of finding the fuzzy optimal solution
of fuzzy maximal flow problems presented in this paper, is quite general in nature and can be extended to solve
the other network flow problems like shortest path problems, critical path method etc
References
[1] Amit Kumar and Manoj kaur , An Algorithm for Solving Fuzzy Maximal Flow Problems Using
Generalized Trapezoidal Fuzzy Numbers, International Journal of Applied Science and Engineering
2010. 8, 2: 109-118
[2] Amit Kumar and Manoj kaur, An Improved Algorithm for Solving Fuzzy Maximal Flow Problems,
International Journal of Applied Science and Engineering 2012. 10, 1: 19-27.
[3] Chanas, S., Delgado, M., Verdegay, J.L., and Vila, M. 1995. Fuzzy optimal flow on imprecise
structures. EuropeanJournal of Operational Research, 83: 568-580.
[4] Chanas, S.,Kolodziejczyk, W. 1982.Maximum flow in a network with fuzzy arc capacities. Fuzzy Sets
andSystems, 8: 165-173.
1-2 (1,4,5,8) 4.5
1-3 (4, 8,11,15) 9.5
2-3 (1,4,5,8) 4.5
3-4 (0,4,5,10) 4.75
3-5 (4,8,10,12,15) 9.25
4-5 (0,4,5,10) 4.75
Total flow at node 1 (5,12,16,23) 14
2

[5] Chanas, S. and Kolodziejczyk, W. 1984.Real-valued flows in a network with fuzzy arc capacities.
Fuzzy Sets andSystems, 13: 139-151.
[6] Chanas, S. and Kolodziejczyk, W. 1986.Integer flows in network with fuzzy capacity constraints.
Networks, 16:17-31.
[7] Chang. P. T. and Lee, E. S. 1994. Ranking of fuzzy Sets based on the concept of existence. Computers
and Mathematics with Applications, 27: l-21.
[8] Cheng, C. H. 1998. A new approach for ranking fuzzy numbers by distance method. Fuzzy Sets and
Systems, 95:307-317.
[9] Chen, S. H. and Li, G. C. 2000. Representation, ranking and distance of fuzzy number with exponential
membership function using graded mean integration Int. J. Appl. Sci. Eng., 2010. 8, 2 117method.
Tamsui Oxford Journal of Mathematical Sciences, 16: 125-131.
[10]. Chen, S. J. and Chen, S. M. 2007.Fuzzy risk analysis on the ranking of generalized trapezoidal fuzzy
numbers. Applied Intelligence, 26: 1-11.
[11] Chen, S. M. and Chen, J. H. 2009.Fuzzy risk analysis based on the ranking generalized fuzzy numbers
withdifferent heights and different spreads. Expert Systems with Applications, 36:6833-6842.
[12] Chen, S. M. and Wang, C. H. 2009.Fuzzy risk analysis based on rankingfuzzy numbers using alpha-
cuts, belieffeatures and signal/noise ratios. Expert Systems with Applications, 36: 5576-5581.
[13] Chu, T. C. and Tsao, C. T. 2002. Rankingfuzzy numbers with an area between the centroid point and
originalpoint. Computers and Mathematics with Applications, 43: 111-117.
[14] Diamond P 2001 A fuzzy max-flow min-cut theorem. Fuzzy Sets and Systems 119: 139–148
[15] Ford, L. R. and Fulkerson, D. R. 1956.Maximal flow through a network. Canadian Journal of
Mathematics, 8:399-404.
[16] Fulkerson, D. R. and Dantzig, G. B.1955. Computation of maximum flow in network. Naval Research
Logisics Quarterly, 2: 277-283.
[17] Hariss T E , Ross F S 1955: Fundamentals of a method for Evaluating rail Net Capacities Research
Memorandum RM -1573 The RAND Corporation Santa Monica California
[18] Hernandes, S, Lamata. F, Takahashi, M. T., Yamakami, A., and Verdegay,J. L. 2007. An algorithm for
the fuzzy maximum flow problem. In: Proceeding of IEEE International Fuzzy Systems Conference: 1-
6.
[19] Hsieh, C. H. and Chen, S. H. 1999.Similarity of generalized fuzzy numbers with graded mean
integration representation. In: Proceedings of the Eighth International Fuzzy System Association
World Congress, Taipei, Taiwan, Republic of China, 2: 551-555.
[20] Ji, X., Yang L., and Shao, Zhen. 2006.Chance constrained maximum flow problem with arc capacities.
“Lecture Notes in Computer Science”. Springer-Verlag; Berlin, Heidelberg, 4114: 11-19.
[21]. Kaufmann, A., Gupta, M. M. 1985. “Introduction to fuzzy arithmetic theory and applications”. Van
Nostr and Reinhold; New York.
[22] Kim, K. and Roush, F. 1982. Fuzzy flows on network. Fuzzy Sets and Systems,8: 35-38.
[23] Kumar, A., Bhatia, N. and Kaur, M.2009. A new approach for solving fuzzy maximal flow problems.
Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg,5908: 278-286.
[24] Liou, T. S. and Wang, M. J. 1992.Ranking fuzzy numbers with integral value.
Fuzzy Sets and ystems, 50:247-255.
[25] Liu, S. T. and Kao, C. 2004. Network flow problems with fuzzy are lengths. IEEE Transactions on
Systems, Manand Cybernetics, 34: 765-769.
[26] Malini .S.U , kennedy Felbin .C , An Approach for solving fuzzy assignment problem Using octagonal
Fuzzy numbers , International J of math. Sci. & Engg Appls 7(3) (2013): 441-449.
[27] Malini .S.U, kennedy Felbin .C, An Approach for solving fuzzy transportation problem Using
octagonal Fuzzy numbers, Applied mathematical Sciences 7(54) (2013) 2661-2673
[28] Ravindran .A, Don T Philip, James J Solberg; Operations Research – Principles and Practice, Second
Edition
[29] Paneerselvam .R, Operations research, Prentice –Hall of India, New Delhi
[30] Jyotiprasad Medhi, Stochastic Models in Queuing Theory, Second Edition
[31] Taha, H. A. 2003. “Operational Research: An Introduction”. Prentice-Hall, New Jersey
[32] Yager.R.,(1979) On Solving Fuzzy Mathematical relationships, Information control,41,29-55.
[33] Zadeh, L. A. 1965. Fuzzy sets. Information and Control, 8: 338-353.
[34] Zimmermann, H. J,(1996) Fuzzy Set Theory and its Applications, Third Edition, Kluwer Academic
Publishers, Boston, Massachusetts.

Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number

More Related Content

What's hot (18)

Viewers also liked (20)

Similar to Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number (20)

Recently uploaded (20)

Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number