Scribd
Upload
24 views19 pages

Modified Distribution Method Explained

This document discusses the modified distribution method for solving transportation problems. It begins by introducing the modified distribution method, which calculates evaluations for all unoccupied cells simultaneously and traces a single path for the most negative cell, providing time savings over other methods. It then outlines the steps for using the modified distribution method to find an optimal solution, which involves determining an initial basic feasible solution, calculating opportunity costs, and tracing closed paths to shift units until reaching an optimal solution. The document provides an example problem demonstrating the application of the North-West Corner method to find an initial solution and then optimizing it using the u-v method as part of the modified distribution method.

Uploaded by

alok gogoi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
24 views19 pages

Modified Distribution Method Explained

This document discusses the modified distribution method for solving transportation problems. It begins by introducing the modified distribution method, which calculates evaluations for all unoccupied cells simultaneously and traces a single path for the most negative cell, providing time savings over other methods. It then outlines the steps for using the modified distribution method to find an optimal solution, which involves determining an initial basic feasible solution, calculating opportunity costs, and tracing closed paths to shift units until reaching an optimal solution. The document provides an example problem demonstrating the application of the North-West Corner method to find an initial solution and then optimizing it using the u-v method as part of the modified distribution method.

Uploaded by

alok gogoi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

PRESENTED BY

ALOK JYOTI GOGOI


BCA 6TH SEMESTER
ROLL NO 16BC020
INTRODUCTION
 In modified distribution method ,cell evaluations of
all the unoccupied cells are calculated simultaneously
and only one closed path for the most negative cell is
traced. Thus it provides considerable time saving over
the stepping stone method
 It provides a new means of finding the unused route
with the largest negative improvement index.
FINDING THE OPTIMAL SOLUTION
 Once an initial solution has been found ,the next steps
is to test that solution for optimality. The following
two methods are widely used for testing the solution:
 Stepping stone Method
 Modified distribution method
 The two method differ in their computational
approach but give exactly the same results and use the
same testing procedure.
STEPS FOR MODI METHOD
1. Determine an initial basic feasible solution using any
one of the three method given below:
a) North-West corner method
b) Lest cost method
c) Vogel’s approximation method
2) Determine the values of dual variables, ui and vj ,
using ui+vj=cij
3) Compute the opportunity cost using Cij –(ui +Vj).
4) Check the sign of each opportunity cost. If the
opportunity costs of all the unoccupied cells are either
positive or zero , the given solution is the optimal
solution . On the other hand, if one or more unoccupied
sale has negative opportunity cost, the given solution is
not an optimal solution and further savings
transportation cost are possible.
5)Select the unoccupied cell with the smallest negative
opportunity cost as the cell to be included in the next
solution.
6)Draw a closed path or loop for the unoccupied cell
selected in the previous state.
7)Assign alternate plus and minus signs at the
unoccupied cells on the corner points of the close path
with a plus sign at the cell being evaluated.
8)Determine the maximum number of units that should
be shift to this unoccupied cell . The smallest value with
a negative position on the closed path indicates the
number of units that can be shift to the entering cell.
9)Now , at this quantity to all the cells on the corner
points of the closed path marked with plus signs , and
subtract it from those cells marked with minus signs. In
this way , and unoccupied cell becomes and occupied
cell.
10)Repeat the whole procedure until and optimal
solution is obtained.
Special Cases
 Balanced problem
 Unbalanced problem
 Non-degeneracy
 Degeneracy occurs in initial basic solution
Problem 1: Find the initial basic feasible solution of the folowing
transportation problem by North-west Corner cell method and then
optimize solution using u-v method.

1 2 3 4 supply
1 3 1 7 4 250
2 2 6 5 9 350
3 8 3 3 2 400
Demand 200 300 350 150
Solution- Finding initial basic feasible solution using North west
corner cell method:
1 2 3 4 supply
200 50
1 3 1 7 4
250 50 0
2 250 100
2 6 5 9 350 100 0
3
8 3 250 150
3 2 400 150 0

Demand 200 300 350 150 1000

0 250 250 0
0 0
 So , Total cost is
=200x3 + 50x1 + 100x5 + 250x3 + 150x2
=3700
1. Application of U-V method to optimize the solution:

V1=3 V2=1 V3=0 V4=-1


Ui + Vi = Cij
U1=0 200 50
- 3 + 1 7 4
1
U2=5 250 100 m+n-1=6
+ 2 - 6 5 9 3+4-1=6

250 150
U3=3 8 3 3 2
Pij = Ui + Vi -Cij
2.
C13= 0+0-7=-7
C14= 0-1-4=-5
C21=5+3-2=6
C24=5-1-9=-5
C31=3+3-8=-2
C32=3+1-3=1
Now we have to see that if there are any positive value
Then we have to take this and again we have to do same
formula.
Ui + Vj = Cij
V1 =-3 V2=-1 V3= 0 V4= -1

250
U1=0 3 1 7 4

200 50 - 100
U2=2 2 6 + 5 9

250 150
U3=3 8 + 3 - 3 2
Pij= Ui + Vj – Cij
C11= 0-3-3=-6
C13= 0+0-7=-7
C14= 0-1-4=-5
C24= 5-1-9=-5
C31= 3-3-8=-8
C32= 3+1-3=1
Ui+Vj =Cij
V1=2 V2=1 V3=1 V4=0

U1=0 250
3 1 7 4

200 150
U2=4 2 6 5 9

50 200 150
8 3 3 2
U3=2
Pij= Ui +Vj - Cij
C11=0-2-3=-5
C13=0+1-7=-6
C14=0+0-4=-4
C22=4+1-6=-1
C24=4+0-9=-5
C31=2-2-8=-8

Total Cost = 250x1+200x2+150x50x3+200x3+150x2


= 2450
THANK YOU

You might also like