Question: ( 2 ) Find an optimal solution for the following transportation problem. TO FROM Valley ( V ) Town ( T ) Junction ( J
Find an optimal solution for the following transportation problem.
TO
FROM
Valley
V
Town
T
Junction
J
Burg
B Supply
Macon
M
$ $ $ $
York
Y
$ $ $ $
Perry
P
$ $ $ $
Demand
The above feasible plan is obtained by applying the Northwest Corner Rule eg from M to V etc. and
its total cost $$$$$$ $
Using the SteppingStone method to find an optimal plan. The improvement indices below
TO
FROM
Valley
V
Town
T
Junction
J
Burg
B Supply
are determined as follows:
row M first, then rows Y and P
Macon
M
$ $ $ $
MJ:
MB:
York
Y
$ $ $ $
YV:
PV:
Perry
P
$ $ $ $
PT:
PJ:
Demand the most negative index
We focus on cell PT index Its closed path is: PT to PB to YB to YT and back to PT To increase the quantity in
PT we need to adjust PB down, YB up and YT down. Therefore, the next improved plan is:
TO
FROM
Valley
V
Town
T
Junction
J
Burg
B Supply
Part b Find the indicesshow steps
Row M first, then rows Y and P
Macon
M
$ $ $ $
York
Y
$ $ $ $
Perry
P
$ $ $ $
Demand Asterisk the most negative index
Part a Find the new TC show steps
Part c Determine the next improved plan.
TO
FROM
Valley
V
Town
T
Junction
J
Burg
B Supply
Part e Find the indicesshow steps
Row M first, then rows Y and P
Macon
M
$ $ $ $
York
Y
$ $ $ $
Perry
P
$ $ $ $
Demand Asterisk the most negative index
Part d Find the new TC show steps
Part f Is the current solution optimal? Explain
hint: see Online Module pM
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
