Lecture 4

b i ll d l i h i bl A
Transportation Pro e bl ms
basically deals with
the problemwhich aims to fin
transpor
d the to
tation problem
best way

,
A
p
demand p fulfill the of using
thecapacitie
oints
y
demand
,
n
sof supplypoints m the capacities of
tryingtofindthe generallya
supply points
best way
.
While
m
trying to find the generally a
variable cost of shipping the p one
l i d d
roduct from
i i il
best way ,

While
a supply point demand po to o int a similar
cons
r
should be taken into con trai side nt ration.
) The Definition of the Transportation Model 1
transportat we present the standard definiti ion model
transportation mod
on of the
the direct sense the seeks the de el termination
, .
,
Now
In

of tran a spo plan of a single from a number of
to a number
rta
of
tion
. source destinations
com
s
modity
of supplyat each and amountof at each
data of the inc mo l de del u
Level
The
dem source

1. and

ppy
. destination
unit cost of the from ea transport ch ation The commod 2. s ity o e urc
to each . destination
there is only one can receive , a Since des comm tination odity
its from one or more
of the model is to determine the amount to be
.
The
sour dem ces
objective
and
shipped from each to each source destina such that the
total costis transportation minimized.
tion
basic assumption of the model is that the
cost on a given route
transportation
directly proportional is to the number of
The
unitstransported
transportation definition of unit of will vary depending
.
The
transported on the
units of and must be consistent with our
.
The
commodi
supp
ty
l e y d mand
transporte definition of a ni d u t.
depicts the model as a network with
and
transportation
.
Figure 1
n destinations
m sources
or is represented by
arc joining and represents the
.
The
a destination
a destination
A s a no ource
a source
de
route through
which the is
amount of at is the at is
transported.
, . The
j i
demand supply source i a destination j b
commodity
unit cost between transportat an o d s i i n . The
ij
source desti c nation j i
Figure 1
) FormulatingTransportation Problems 2
represent the amo transported unt from
to ; thenthe model of
Let
ij
destination j L s
x
ource i P to ; then the model of
the problem is gi trans ven po general rt ly i a a s t on
destination j L source i P
m n
Minimize

= =
m
i i
i 1
n
j j
j 1
c x z =
. , , ,

=
=
i i
n
j
j 1
Subject to
x a i 1 m s
. , , ,

m
i
j 1
j j
b j 1 n x = >
. , for all and
=

i
i
j j
1
ij
x 0 j i >
j
stipulates
cannot e ceed
that the sum of the shipments
from its

i i
n
j
a source supply
x a s
cannot exceed from its
that the sum of the shipments req ires u


.

=
i i
m
j
j 1
a source supply
total sup y pl
b x >
to must satisfy i s t

.

=
j
1
j i
i
a destination demand
b x >
model just described implies that the must at The total supply
least following the that is equal ,

=
i
i 1
LP total dema d n
a .

=
n
j
j 1
m
b >
= i 1
resulting formulation the is called a ,

=
= =
When
j 1
m
i
i
n
j 1 1
j
a b =
differs from the model above only in thefact that all
.
con



It
j
Balanced Transportation Model
straints y
are equations; that is,
and

= = =
m
i i
n
j j ij
b j 1 a i 1 = x x n m . and , , , , , ,

= =
i i j
1
j
j
ij
i 1
b j 1 a i 1 x x n m
has plants in and
( )
, , .

The M Los Angeles Detroit New Orlean G Auto Company s
Standard Transportation Mod Example e 1 l
p
major distribution centers are located in and
capacities of
, ,
.

Its
The
g
Denver Miam
p y
i
the three plants during the next quarter are and , , 1000 1500
cars
quarterly at the two distribution centersare and cars
.
. The demands 2300 1400
1200
cost per car per mile i train transportatio s n The approximately cents
mileage chart between the plants and distribution centers is as follows:
.
The
8
mileagechartcanbetranslatedtocost per car at therate The
Example 1- con
mileage chart can be translated to cost per car at the rate
of cents per mile
yieldsthefollowingcosts( )

.
rounded to the closest dollar ,
The
This
8
yields the following costs( )
which represent in the general
rounded to the closest dollar ,

This
ij
c model:
numericcodesto Using numeric codes to
represent the plants and
distribution centers we let ,
Using
represent the number
of cars from to transported .
j i
dest source i
x
ination j
the sum of the ( Since total supply 100 5 0 1 0 = + )
happens to equal the ( ) the , total demand 2300 140
0 1200 3700
0 3700
+ =
= + =
transportation balan
pp q ( )
resulting model is ced
,
.
this model hasall eq constraints u : ality Hence LP
Example 1- con
this model has all eq constraints u : ality Hence
Minimize
LP
1 2 1 2 1 2 1 1 2 2 3 3
80 215 100 108 102 68
Subject to
x x x x x x z = + + + + +
1 1 12
1000 x x + =
2 2 1 2
1500 Supply Constraints x x + =
2 2
3 3
1 2
1 2
1500 Supply Constraints
1200
2300
x x
x x


+
+ =

1 2 3
1
1 1 1
2 3 2 2 2

2300
Dem
1400
x x x
x x x


+ + =
+ + =
and Constraints
. , for all and
ij
x i 0 j >
li hi d l h ll i
Example 1- con
equality this model has all constraints:
| |
|
|
Hence
1
1
1
2

x
x
LP
( )

T

|
|
|
|

1
2
2
2
80 215 100 108 102 68 Min
x
C X
x
z z = =
| |
|
|
\ .
3
3
1
2
1000
Subj ect to
x
x
| |
| | | |
1 1
1 1 0 0 0 0 1000
x
| |
|
|
1000
1500
1200
= AX
| |
| |
|
|
|
|
|
| |
|
|

1
2
1
1
1
2
1 1 0 0 0 0
0 0 1 1 0 0
0 0 0 0 1 1
1000
1500
1200
x
x
x

|
|
|

\ .
2300
14
1200
0 0
= AX
|
|
|
|
|
|
|
|
|
|
\ .
|
| |
\ .

1
2
1
2
2
3
2300
140
0 0 0 0 1 1
1 0 1 0 1
1200
0
0 1 0 1 0 1 0
x
x
=

\ .
14 0 0
for all and
|
| \ .
\ .
| |
\ .
32
140 0 1 0 1 0 1 0
i
x
x 0 j > for . all and ,
ij
i x 0 j >
f hi d d i
.
Th d LP l
Example 1- con
of thi standar s: d s i
| | | |
| |
The
1000 1000
d LP ual
( )
| |
| |
| |

1 2 3 4 5
T
1500 1500
1200 1200
y y y y y Max w w Y = =
| |
| |
| |
\ . \ .
2300 2300
1400 1400
1 2 4 5 3
2300 140 1000y 1500y 120 y 0 0y y
Subject to
w + + + + =
| |
| |
1 0 0 1 0 80
Subject to
| |
|
|
| |
| |
|
|
|
|
|
|
1
2
1 0 0 1 0 80
1 0 0 0 1 215
0 1 0 1 0 100
y
y
T
A Y
|
|
|

|
|
|
|
|
|
|
|
|

3
4
0 1 0 1 0 100
0 1 0 0 1 108
0 0 1 1 0 102
y
y
C s s
0

|
|
|
\ .
|
|
\ .
\ .
5
0 0 1 1 0 102
0 1 0 1 68
y
transportation model
transportation
more compact method for representing the is to
use what we call the

.
A
tableau
is a matrix form with its rows representing the and its columns
the


It sourc
de
es
stina
elements areinthe of thematrixcell ( )
.
The northeas
t
c i t corner ost c
ions
j elements are in the of the matrix cell ( )
model can thus be summarized as shown in
, .
.
The
The
ij
northeas c i t corner ost c j
Tabl G e 1 M
( )
( )
t t l d t t l l d
Balanced Transportatio Example 2 n Model
< ( )
suppose that the plant capacity is cars
( )

,
d f
In
total deman total s pl d up y
1300 Example 1
<
( )
situation
instead of .
The
1500
is said to be unbalanced because the total supply
( ) is strictly than the total ( )
istoreformulatethe ina
less
transportationmodel
.
Our
demand 3 3500
objective
700 = =
is to reformulate the in a
manner that will distribu
transportation mode
te
l Our objective
the shortage quantity(
) amongthedistributioncenters
-
optimally

cars
3700
200
3500 =
= ) among the distribution centers
exceeds a fictitious or dummy
( ) b dd d ithit
optimally
it l t
cars .
,
l
Since
200
deman supply sour d
0
ce
20
=
( )can be added with its capacity equal to plant 0 20 cars
is allowed under normal conditions to ship
.
, , The dummy plant
its productionto all distribution ce s nter .
( )
this model becomesas: Hence
total dem total su ly and pp
LP
Example 2 - con <
this model becomes as: Hence
Minimize
LP
1 2 1 1 1 2 2 3 3 2 2 1
80 215 100 108 102 68
Subject to
x x x x x x z = + + + + +
1 1 12
x x +
2 2 1 2
1000
1300 Supply Constraints x x


=
+ =
2 2
3 3
1 2
1 2
1300 Supply Constraints
120
230
0
0
x x
x x


+
+ =
s

1 2 3
1
1 1 1
2 2 2
230

0

x x x
x x x


+ +
+ +
s

2 3
Demand Constraints
1400 s
. , for all and
j i
x i j 0 >
summarizesthe under thenewcapacityrestriction balancedmodel Table 2
Example 2 - con
summarizes the under the new capacity restriction
of the
the does not exist no physical shipping will occur and the
balanced model
i di

.
, Since
Detroit
Tabl
plan
pla
e 2
t
nt
i i corres unit ponding is zero
( ) has a capacity
transportationc
of car
os
s
t .
shown by a tint overlay . The dummy pla t 2 n 00

Table 2
the exceeds the we can add a destination
.
, If sup demand dummy ply
Example 2 - con
that will absorb the difference
example, that the at drops to cars
.
. For
p
demand 1
y p y
suppose 900 Denver
cars shipp Any
surplus
ed from a plant to a added distribution center
represent a qua
it t t ti t
ntity at that plant
i t d i

.
Th
dummy
unit transportation cost associated is zero . The
Table 3
itever benecessarytoaddbotha anda ( ) Will source dummy dummy a
Exercise 1
it ever be necessary to add both a and a
to p balanced transportation roduce a ?[ ]
thesolutionin if t
model
henu
( )
( )


Will
Interpret
source
destina

Ans.
dummy dummy
tion
Tabl
No
e 2
.
a
b mber of cars from shipped the solution in if the nu ( ) Interpret Table 2 b mber of cars from
the to and are and respectively
[ ]
shipped
, .
orders at and will be and cars short.
Denver Miami
Ans. T
150 50
150 he Denver Mia
dummy pla
5
nt
mi 0
each of the following ca ( ) In c ses indicate whether a or
should be added to the model balance
,
. destination
source dummy
( ) , , , and , , , .
[

. a with capac
1 2 3 4 1 2 3 4
b 10 b a 10 a 5 a 5 1 4 a 6
dummy so
b
u

Ans rc d
7 9
e
b
Ad
= = = = = = = =
] ity of units. 6 [ . a with capac dummy sou Ans rc d e Ad ]
( ) , and , , .
[ ]
ity of units.

a with units
1 2 1 2 3
b 25 b 30 b 10
destinat
2
6
a 30 a 4
ion deman

Ans d 9 A dummy
4
dd
= = = = =
[ ] . a with units. destination deman Ans d 9 A dummy dd
) Basic feasible solution for transportation model 3
other problems a
with supply points and demand points is easier to solve
balanced transportation model ,
,
Unlike LP
m

n
although it h equalit as m n + yconstraints
basicmethods balanced tofindthe for a
.
Three bfs TP basic methods balanced
)
)
to find the for a Three bfs TP
1 Northwest Corner Method
2 L

C M h d

)
)
'
2 Least - Cost Method
3 Vogel s Method
manufactures office - The Executive Furniture Corporation
Example 3
desks at three locations:
, ,
p
Des Moines Evansville Fort Lauderdale
firm distributes the desks through regiona - The l
located in:
warehouses
Boston Albuquerque Cleveland
of the monthly production of each factory
andthedesks ateachwarehouseareshownin
, ,
- Estimates s
Boston Albuquerque Cleveland
d
uppl
emand Fi
y
gure 1. and the desks at each warehouse are shownin demand Figure 1
costs are the same at the three factories so the only
relevantcostsareshippingfromeach toeach
.

.
- Production
s d ource estination relevant costs are shipping from each to each
ar constant e no matter the quantity shipped
.
. -
-
Costs
The
s d

ource estinat
tra
ion
nspo isselectingtheshippingroutesand rtation problem - The transpo is selecting the shipping routes and
the number of desks on each route to
.
rtation problem
minimize total transportation
cost. cost
. Example 3 - con
Des Moines
Cleveland
(200 units)
'
Locations of factories and warehouses Executive Furniture
Des Moines
(100 units)
supply
(200 units)
demand
Boston
Albuquerque
(300 it )
Boston
(200 units)
demand
Evansville
(300 units)
supply
(300 units)
demand
supply
Ft. Lauderdale
(300 units)
supply
Figure 1
per deskoneachrouteisshownasfollowing
.
Transportation costs
Example 3 - con
per desk on each route is shown as following Transportation costs
From To Albuquerque Boston Cleveland
D M i $5 $4 $3 Des Moines $5 $4 $3
Evansville $8 $4 $3
Ft. Lauderdale $9 $7 $5
Table 4 Tab le 4
this model has equality six constraints:
.
Hence LP
Example 3- con
this model has equality six constraints: Hence
5 4 3 8 4 3 9 7 5
Minimize
LP

1 1 1 2 2 2 3 3 3 1 2 3 1 2 3 1 2 3
5 4 3 8
Supply
4 3 9
Constr t
7
ain s
5
Subject to
x x x x x x x x x z = + + + + + + + +
11 1
Supply Constr t ain s
x x

+
2 3
1 2 3
1
2 2 2
100
300
x
x x x


+ =
+ + =
1 2 3
1 2 3
2 2 2
3 3 3
300
300
x x

x
x x x
+ + =
+ + =

1 2 3 1 1 1
Demand Constraints
300 x x x + + =

2 2 1 2 2 3
200

x x x + + =
1 2 3 3 3 3
200 x x x + + =
. , for all and
1 2 3 3 3
j i
3
j i x 0 >
and Total demand Example 3 - con. Total supply
To
From
Albuquerque Boston Cleveland
Factory
Supply
Des Moines
Factory
x
11
$5 x
12
$4 x
13
$3
100
Evansville
Factory
x
21
$8 x
22
$4 x
23
$3
300
y
Ft Lauderdale
Factory
x
31
$9 x
32
$7 x
33
$5
300
y
Warehouse
Demand
300 200 200 700

Balanced
Transportation Table 5
Model
) the by Find bfs Northwest Corner Method 1
in and allocate units to shipping
routes as follows:
northwest corner Begin
the of each row before movingdown to
thenext row
- Exhaust supply
the next row
the
.
- Exhaust of each column before moving to demand
the next column
toensurethatall and aremet
.
- Check demands supplies to ensure that all and are met
it take initial s to make the
.
,
- Check
For f Exam ive ste
demands
ple
sup
p 3 s
plies
shipping assignme ts n
,
.
f p p
in setting as as possible.
i ( ) it f t
large : Begin
W
1 1
Alb D M i
x
100
Step 1
assign ( ) units from to .
exhaust the from but leaves
d k h t


We
This
1 1
Albuquerque
Albuquerque
200
Des Moines
supply D
100 x
es Moines
=
desks short.
move We
200
to the in the secon same d ro co . mn w lu
From To
Albuquerque Boston Cleveland
Supply
$5 $4 $3
Des Moines
x
11
$5 x
12
$4 x
13
$3
100
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
Ft Lauderdale
x
31
$9 x
32
$7 x
33
$5
300
Demand
300 200 200 700
to the in the .
i ( ) it f t
second row same column : Moving
We Alb E ill

200
St ep 2
assign ( ) units from to
meets
.
.
'
We
This
1 2
Albuq Evansville uerque
Albuquerque s d
2
em d
x
a
00
n
=
ha units remaining so we move to s Evansville 100
nextcolumn
the right to
the o second f the row.
From To
Albuquerque Boston Cleveland
Supply
$5 $4 $3
Des Moines
x
11
$5 x
12
$4 x
13
$3
100
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
200
Ft Lauderdale
x
31
$9 x
32
$7 x
33
$5
300
Demand
300 200 200 700
to the in the .
assign ( ) unitsfrom to
sam secondcol er umn ow : Moving
We Evansville Boston 0 x

10
Step 3
= assign ( ) units from to
has now been exhausted
shor
but s
still units t
.
i
We
The
2 2
Evansville
Evansv
Boston
B ille supp osto l n
100
0 x
y
10 =
shor still units
mo
t
ve
.
We
100
next ro down vertically to the in colum the n w . Boston
From To
Albuquerque Boston Cleveland
Supply
x $5 x $4 x $3
Des Moines
x
11
$5 x
12
$4 x
13
$3
100
100
x $8 x $4 x $3
Evansville
x
21
$8 x
22
$4 x
23
$3
300
200 100
$9 $7 $5
Ft Lauderdale
x
31
$9 x
32
$7 x
33
$5
300
D d
300 200 200 700
Demand
300 200 200 700
vertically to the in the . colum
i ( ) it f t
third row n : Down
W F t L d d l 100
Boston
B t
Step 4
assign ( ) units from to
fulfills and still has
i i
.

'
We
This
22
Fort Lauderdale
Fort Lauderda
100 x Boston
Bo le
200
ston s demand
=
l bl units avai 200 lable.
From To
Alb B t Cl l d
S l
From To
Albuquerque Boston Cleveland
Supply
Des Moines
x
11
$5 x
12
$4 x
13
$3
100
Des Moines
100
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
Evansville
300
200 100
Ft L d d l
x
31
$9 x
32
$7 x
33
$5
300
Ft Lauderdale
300
100
Demand
300 200 200 700
Demand
300 200 200 700
assign ( ) unitsfrom to
:
We Fort Lauderdale Cleveland 200 x
Step 5
= assign ( ) units from to .
and .

s exhaust s s
' '
We
This
32
Fort Lauderdale
Fort Lauder
Cleveland
Cleveland demand
200 x
dale su ly

pp
=
. The initial shipment schedule is now complete
From To
Alb B t Cl l d
S l
From To
Albuquerque Boston Cleveland
Supply
Des Moines
X
11
$5 x
12
$4 x
13
$3
100
Des Moines
100
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
Evansville
300
200 100
Ft L d d l
x
31
$9 x
32
$7 x
33
$5
300
Ft Lauderdale
300
100 200
Demand
300 200 200 700
Demand
300 200 200 700
we will have the following which is: ) , , Finally
1 2 2 3 3 1 1 2 2 3
100 200 100 100 200
bfs
x x x x x
1 - con.
= = = = =
and
of thisshippingas total signment o t s s i c

.
, , , ,
The
1 2 2 3 3 1 1
1 1 2 3
2 2 3
2 3 3 1
100 200 100 100 200
0
x x x x x
x x x x = = = =
of this shipping as total signment o t s s i c

The
1 2 1 1 2 2

5 8 4 7 x x x x z = + + + .
2 3 3 3
5 $4200 x + =
Route
Units
Shipped
Per unit
Cost ($) =
Total
Cost ($) From To
D A
100 5 500
E A
200 8 1 600
E A
200 8 1,600
E B
100 4 400
F B
100 7 700
F C
200 5 1,000
F C
200 5 1,000
4,200
( ) ) the by Find Lowest Cost bfs Least - cost Met hod 2
the cell with the
asmanyunitsaspossibletothatcell without
lowest cost . Identify
Allocate
Step 1.
Step 2. as many units as possible to that cell without
exceeding or
Allocate Step 2.
d supply ema ; then cross out the or
( ) thatisexhaustedbythisassignment colum
r
n
ow
or both .
nd
( ) that is exhausted by thisassignment
the cell with the lowest co from s the remaining
cells
colum
t
n or both .
Find Step 3.
cells
a
.
Repeat Step 4. step 2 nd until all units have been allocated. 3
i th ll hi it f l t t
)
Fi t $3 10
Least - Cost Method
0
2 - con.
is the cell so ship units fro lowest cost
cross
m
to and the first as
i
ro
i fi d
w off
,

First
Cl
$3 10
Des Moines eveland
0
issatisfied.

Des Mo s ine

From To
Albuquerque Boston Cleveland
Supply
D M i
X
11
$5 x
12
$4 x
13
$3
100
Des Moines
11 12 13
100
100
E ill
x
21
$8 x
22
$4 x
23
$3
300
Evansville
21 22 23
300
Ft L d d l
x
31
$9 x
32
$7 x
33
$5
300
Ft Lauderdale
300
Demand
300 200 200 700
Demand
300 200 200 700
) Least - Cost Method 2 - con.
is again the cell so ship u
column
lowest cos nits
from to and
t
cross o ff
,

Second
Evan Cleveland 3 sv
$3 100
ille
as is satisfi d e Cleveland
From To
Albuquerque Boston Cleveland
Supply
Des Moines
X
11
$5 x
12
$4 x
13
$3
100
Des Moines
100
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
Evansville
300
100
Ft Lauderdale
x
31
$9 x
32
$7 x
33
$5
300
Ft Lauderdale
300
Demand
300 200 200 700
i th ll hi it f l t t
)
Thi d
Least - Cos
$4 20
t Method
0
2 - con.
is the cell so ship units from
to and
d i fi
lowest cost
cross off r column
d
ow
,
and
Third
Evansville
2 ill
Boston 2
$4 200
as and are satisfied 2 Evansville Boston
F T
Alb B Cl l d
S l
From To
Albuquerque Boston Cleveland
Supply
Des Moines
x
11
$5 x
12
$4 x
13
$3
100
100
Des Moines
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
200 100 200 100
Ft Lauderdale
x
31
$9 x
32
$7 x
33
$5
300
Demand
300 200 200 700
hi it f t
)
Fi ll
Least - C
Alb
ost Met
200 F L d d l
d o h 2 - con.
ship units from to
as this is the only remaining cell to complete the allocations
, Finally Albu 200 Fort Laud q erd uerqu al e e
$3 100 $4 200 $3 100 $9 3 00 $4100 - + - + - + - =
F T
Alb B Cl l d
S l
From To
Albuquerque Boston Cleveland
Supply
Des Moines
x
11
$5 x
12
$4 x
13
$3
100
100
Des Moines
100
Evansville
x
21
$8 x
22
$4 x
23
$3
300
200 100 200 100
Ft Lauderdale
x
31
$9 x
32
$7 x
33
$5
300
300
t aude dale
300
Demand
300 200 200 700
Demand
300 200 200 700
pen column computingineach andeach ; =th alty edifferent row
) the by .
'
Penal e ty th
Find Step 1 3 Vogel s Method b fs
pen column computing in each and each ; th alty
smallest costs the
e different
between the and in the or . next
ro
smallest cost colum
w
n row
Penal e ty th
Column Opportunity Column
penalty 3 = 8-5 0 = 4-4 0 = 3-3
Opportunity
cost
To
Albuque
Boston Cleveland
Total Row
From
q
rque
Boston Cleveland
otal
Supply
ow
penalty
Des Moines
$5 $4 $3
100 1 = 4-3 Des Moines 100 1 = 4-3
Evansville
$8 $4 $3
300 1 = 4-3 Evansville 300 1 = 4-3
Ft Lauderdale
$9 $7 $5
300 2 = 7-5 Ft Lauderdale 300 2 7-5
Total Demand
300 200 200 700
greatest
opportunity
the or with the
( ). cost
column row
)

.
in this example
Identify
Step 2
column 1
3 - con.
pp y ( )
as as possible to the
inthe or
lowest- cost
square col
many un
r u
its
sel n e m c ow
p

.
Assign
Step 3
ted in the or square col r u sel n e m c ow ted.
Column
penalty 3 = 8-5 0 = 4-4 0 = 3-3
Opportunity
cost p y
To
From
Albuquer
que
Boston Cleveland
Total
Supply
Row
penalty
Des Moines
$5 $4 $3
100 1 = 4-3
100
Evansville
$8 $4 $3
300 1 = 4-3
Ft
Lauderdale
$9 $7 $5
300 2 = 7-5
Total Demand
300 200 200 700
or which has been
complete
colum
lysatisfie
row
( )
n
d
)
in this example
Eliminate
row1
Step 4 3 - con.
completely satisfie ( ) d. in this example row1
Column Opportunity Column
penalty 3 = 8-5 0 = 4-4 0 = 3-3
Opportunity
cost
To
Albuque
Boston Cleveland
Total Row
From
q
rque
Boston Cleveland
Supply penalty
Des Moines
100
$5

$4

$3
100 1 = 4-3 Des Moines
100
100 1 4-3
Evansville
$8 $4 $3
300 1 = 4-3 Evansville 300 1 = 4-3
Ft
$9 $7 $5
300 2 = 7-5
Lauderdale
300 2 7-5
Total Demand
300 200 200 700
to
li i t di th

l i t (
s ro
)
w ) , Repeat omitting Step 5 Step 1 Step 4
1
3 - con.
or eliminated in the pr column evio s us step ( ) . row1
Column
penalty 1 = 9-8 3 = 7-4 2 = 5-3
Opportunity
cost penalty 1 9 8 3 7 4 2 5 3 cost
To
From
Albuqu
erque
Boston Cleveland
Total
Supply
Row
penalty q pp y p y
Des Moines
100
$5

$4

$3
100
Evansville
$8 $4 $3
300 1 = 4-3

Ft
Lauderdale
$9 $7 $5
300 2 = 7-5
Total Demand
300 200 200 700
Step of Second 1 Run
to omitting
or eliminatedinthepreviousstep
,
col ( ) u
r w
m
o s
ns
) . Repeat Step 5 Step 1 Step
ow r 1
4 3 - con.
or eliminated in the previous step col ( ) um ns . ow r 1
Column
penalty 1 = 9-8 3 = 7-4 2 = 5-3
Opportunity
cost penalty 1 9-8 3 7-4 2 5-3 cost
To
From
Albuque
rque
Boston Cleveland
Total
Supply
Row
penalty q pp y p y
Des Moines
100
$5

$4

$3
100
Evansville
$8 $4 $3
300 1 = 4-3
200

Ft
Lauderdale
$9 $7 $5
300 2 = 7-5
Total Demand
300 200 200 700
, of Second Run Step 2 Step 3
to
or eliminatedinthe

col mns pre io sste )
o s
p (
r w ) . , Repeat omitting Step 5 Step 1 Step
w ro 1
4 3 - con .
or eliminated in the columns previous ste ) p ( . w ro 1
Column
penalty 1 = 9-8 3 = 7-4 2 = 5-3
Opportunity
cost penalty 3 cost
To
From
Albuque
rque
Boston Cleveland
Total
Supply
Row
penalty
Des Moines
100
$5

$4

$3
100
Evansville
$8
200
$4 $3
300 1 = 4-3
Ft
Lauderdale
$9

$7 $5
300 2 = 7-5

Total Demand
300 200 200 700
of Second Run Step 4
to or
eliminatedinthepreviousstep

co
rows
ns ) m ( lu
) . , Repeat omitting Step 5 Step 1 Step 4
column w1 2 ro
3 - con.
eliminated in the previous step co ns ) m ( lu . ,column w1 2 ro
Column
penalty 1 = 9-8 2 = 5-3
Opportunity
cost penalty cost
To
From
Albuque
rque
Boston Cleveland
Total
Supply
Row
penalty
Des Moines
100
$5

$4

$3
100
Evansville
$8
200
$4 $3
300 5 = 8-3

Ft
Lauderdale
$9

$7 $5
300 4 = 9-5
f Thi d R S 1
Total Demand
300 200 200 700
of Third Run Step 1
to or
eliminatedinthepr

columns eviousste
row
p
s
) (
) . , Repeat omitting Step 5 Step 1 Step 4
column 2 row1
3 - con.
eliminated in the pr columns evious step ) ( . ,column 2 row1
Column
penalty 1 = 9-8 2 = 5-3
Opportunity
cost penalty 1 9 8 2 5 3 cost
To
From
Albuque
rque
Boston Cleveland
Total
Supply
Row
penalty q pp y p y
Des Moines
100
$5

$4

$3
100
Evansville
$8
200
$4 $3
300 5 = 8-3
100

Ft
Lauderdale
$9

$7 $5
300 4 = 9-5
Total Demand
300 200 200 700
, of Third Run Step 2 Step3
to or
eliminatedinthepreviousstep

co
rows
ns ) m ( lu
) . , Repeat omitting Step 5 Step 1 Step 4
column row1 2
3 - con.
eliminated in the previous step co ns ) m ( lu . ,column row1 2
Column
penalty 1 = 9-8 2 = 5-3
Opportunity
cost p y
To
From
Albuque
rque
Boston Cleveland
Total
Supply
Row
penalty
Des Moines
100
$5

$4

$3
100
Evansville
$8
200
$4 $3
300 5 = 8-3
100

Ft
Lauderdale
$9

$7 $5
300 4 = 9-5
Total Demand
300 200 200 700
Step 4 of Th ird Run
to or
eliminatedinthepreviousstep ( ) colum
w
ns
ro s ) . , Repeat omitting
row1 r
Step 5 Step 1 Step 4
column ow2 2
3 - con.
eliminated in the previous step ( ) columns . , , , row1 r column ow2 2
Column
penalty
Opportunity
cost
To
From
Albuque
rque
Boston Cleveland
Total
Supply
Row
penalty
$ $ $
Des Moines
100
$5

$4

$3
100
Evansville
$8
200
$4
10
0
$3
300

0
Ft
Lauderdale
$9

$7 $5
300 4 = 9-5
of Four Run Step 1
Lauderdale
Total Demand
300 200 200 700
of Four Run Step 1
only is not eliminated we finally assignments row to
)
,
'
Since 3
Vogel s Meth 3 - con

. od
y y g
bala and as following: nce row suppl column demand y
Column Opportunity Column
penalty
Opportunity
cost
To
F
Albuque
Boston Cleveland
Total Row
From
rque
Boston Cleveland
Supply penalty
Des Moines
100
$5

$4

$3
100 Des Moines
100
100
Evansville
$8
200
$4
10
0
$3
300 Evansville 200
0
300
Ft
L d d l
200
$9

$7
10
0
$5
300
Lauderdale
200
0
300
Total Demand
300 200 200 700
) 3 - con.
we will have the following which is: , , Finally
100 20
bf
0 200
s
x x x x x
and
, ,
1 3 3 2 1 1 2 3 2 3
100 200 200 x x x x x = = = = =
l

i
.
2 3 1 1 2 3 1 2
0 x x x x = = = =
total costis The
11 2 3 2 3 33 2 1
5 4 3 9 5 $3900 x x x x z x = + + + + =
i
.
This
11 2 3 2 3 33 2 1
5 4 3 9 5 $3900 x x x x z x = + + + + =
s the of the thre best solutio e solu n tions.
and Using Northwest Corner method Least - Cost method
Tutorial 5
and
find the of the following:
, Using Northwest Corner method Least - Cost method
Vogel's method bfs
. Transportation Tabl eau
From To A B C Supply pp y
D
x
11
6 x
12
8 x
13
10
150
E
x
21
7 x
22
11 x
23
11
175
F
x
31
4 x
32
5 x
33
12
275
Demand
200 100 300 600