6 8 9 3 Supply
0 7
 +
0 50 20 70
6 1 9 3
8 12 0

5 55 + 55
11 5 2 8
+ 9 
4 30 35 25 90
10 12 4 7
Demand 85 35 50 45
Maximum value of is 25
Step 2
18 20 9 3 Supply
12 19  Here you should be clear on how to get a closed loop.
0 + 25 45 70 1. The loop must start from and end at the entering cell
6 1 9 3 2. The loop must consist of connected horizontal and vertical li
 8 12 Step 2 is quite tricky in the sense that a horizontal line intersec
+
7 30 25 55 a vertical line, which does not violate the above two requireme
11 5 2 8
3 12
+ 
8 55 35 90
10 12 4 7
Demand 85 35 50 45
Maximum value of is 25
Step 3
1 1 10 3 Supply
7 19
0 25 45 70
6 1 9 3
 8 7
12 5 + 50 55
11 5 2 8
3 7
+ 
+
11 80 10  90
10 12 4 7
Demand 85 35 50 45
Maximum value of is 5
Step 4
1 1 2 3 Supply
7 11
+ 
0 25 45 70
6 1 9 3
8 1
4 5 50 55
11 5 2 8
5 7
 +
11 85 5 90
10 12 4 7
Demand 85 35 50 45
Maximum value of is 5
Step 5
6 1 2 3 Supply
0 11
0 30 40 70
6 1 9 3
1 1
4 5 50 55
11 5 2 8
7 2
4 85 5 90
10 12 4 7
Demand 85 35 50 45
Now all c(i,j) bar are nonnegative, hence this is the optimal solution
The total cost = 1160 (check it)
ow to get a closed loop.
d end at the entering cell
nnected horizontal and vertical lines only
se that a horizontal line intersects
violate the above two requirements