Transportation Problem

g
e e rin
g in
En
Transportation Problem
t ems ón
S y s L e
in A. / VincentuBoyer
Dr. M. Angélica Salazar evo
ra m e N
r o gProgram a d (PISIS)
P
Graduate
m
in Systems Engineering
o
u ate Facultad de Ingenierı́a
tón
Mecánica y Eléctrica
d Au
Universidad Autónoma de Nuevo León
Gra da d
rsi
n ive
U
Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Content
g
e e rin
n
E ngi
1 Optimization Model
t ems ón
Sy s L e
in o
2 Balanced Transportation Problem
m N uev
r o gra a de
P m
óno
3 Solution Approaches
u a te ut
d A
Gra s i d ad
iv er
Un

Optimization Model
Agenda
g
e e rin
n
E ngi
t ems ón
Sy s L e
in o
m N uev
r o gra a de
P m
óno
u a te ut
d A
Gra s i d ad
iv er
Un

Optimization Model
Definition
The transportation problem is a special type of LP problem wheregthe ob-

e rina number
jective is to minimize the cost of transportation of a product from
e
gin Each origin
of origins (suppliers) to a number of destinations (customers).
n
has a number of products that it can supply, and
m s Eeach destination has a
demand of products.
y s te L e ón
S d1vo
s1
1 in 1Nue
m
r o gra e
ad .
P .. m
te óno
. ..
d u a ut
A
Gra
si dj
i i ad
d j
s er
iv
Un ..
.
..
.
sm dn
m n

Transportation Problem 1 / 37
Optimization Model
General Model
g
e e rin
n
Decision
Engi
ms to each destination.
Number of products to transport from each origin
e n
o L
Syst
eó
Objective uevin
m N
r o gra cost. a de
Minimize the total transportation
a t eP t ó n om
Constraints u
r a d d Au
G
The origins’ supplyid a
capacity cannot be exceeded.
e rs
iv demand has to be satisfied.
The destinations’
Un

Optimization Model
General Model
Decision Variables
g
erinj.
xij : the number of products sent from origin i to destination
ne
g i
Objective s En
m X n
y s tem L e ón
cij xij , where cij isntheScost of transporting
X
z=
i u e vo one unit of
i=1 j=1
product from origin
am
i rto destination j. de
g
N
Pr o ma
t e n o
Constraints ua
a d A utó
Gr ad X
siOrigin i: d n
Supply Capacityerof xij ≤ si ,
iv
Un j=1
m
X
Demand of destination j: xij ≥ dj .
i=1

Optimization Model
General Model
g
e e rin
n
ngi
The Mathematical Model:
E
m X
n
t ems ón
Min z =
X
cij xij Sy s L e
in o
i=1 j=1 uev
Xn
o g ram d eN
s.t.
em Pxijr ≤ si , ∀i ∈a{1, ..., m},
n om
d u atX
j=1
ut ó
ra dA
≥ dj , ∀j ∈ {1, ..., n},
ida
G x ij
i=1 ers
iv
Unxij ≥ 0, ∀i ∈ {1, ..., m}, ∀j ∈ {1, ..., n}.

Balanced Transportation Problem
Agenda
g
e e rin
n
E ngi
t ems ón
Sy s L e
in o
m N uev
r o gra a de
P m
óno
u a te ut
d A
Gra s i d ad
iv er
Un

Definition
g
e e rin
n
E ngi
t
Definition of a Balanced Transportation Problemems ón
y s L e
n S when theutotal
A transportation problem is said balanced
i e vo number of
m
o g rnam
products that the origins can
d eN
supply is equal to the total demand of the
destinations (i.e. Psri = ma
X X
dj ). o
e n
a d uat i=1 j=1
A utó
Gr sid
ad
iv er
Un

Mathematical Model
g
e e rin
gi
Mathematical Model of a Balanced Transportation Problem n
s En
m
ste
eón
m X
n
Sy L
X
Min z = cij xij o
i=1 j=1 in uev
n
ra m N
s.t.
X
xijrog de..., m},
= si , ∀i ∈a{1,
e P no m
u a tj=1
m ut ó
d Xx A
Gra ij
i d ad = dj , ∀j ∈ {1, ..., n},
i=1 ers
n
x iv ≥ 0, ∀i ∈ {1, ..., m}, ∀j ∈ {1, ..., n}.
U ij

The PowerCo Problem

PowerCo has three electric power plants that supply the power needs of four
e r ing
cities. Each power plant can supply the following numbers of kilowatt-hours
i
(kwh) of electricity: plant 1, 35 million; plant 2, 50 million;
g ne plant 3, 40
million. The peak power demands in these cities which
s En occur at the same
time (2 p.m.), are as follows (in kwh): city e
city 3, 30 million; city 4, 30 million. Sys
t 1,m45 million; cityLe2,ó20
n million;
The costs of sending 1 million kwh vo to city depend
inof electricity fromueplant
m N
r o gra must travel.a Formulate
on the distance the electricity de an LP to minimize
the cost of meetingP each city’s peak power
o m demand.
ua te u
n
tóTO
r a d d A SUPPLY*
G FROM
rs ida1
City City 2 City 3 City 4
Plant 1 ive $8 $6 $10 $9 35
2n
Plant U $9 $12 $13 $7 50
Plant 3 $14 $9 $16 $5 40
DEMAND* 45 20 30 30
*Million kwh
The PowerCo Problem
g
e e rin
gin
En45
s1
35
ón em
1
Syst
20 L e
2 evo
in
50 u
Plants 2 ram e N 30 Cities
r o g a d
e 40P n om 3
a t 3 t ó
r a du d Au 4
30
G id a
i v ers
Un

The PowerCo Problem
g
45 e e rin
n
ngi
1
35
1 E
t ems 2 20 ón
50
Sy s L e
Plants 2
in u e
30 vo Cities
ram
3
40
o g
3 d eN
e Pr n o ma 30
a t t ó 4
r a du d Au
G a
r
125
e sid = 125
n iv
U BALANCED TP

The PowerCo Problem
Decision Variables eri ng

n e
gi i to City j.
xij : the number of Mkwh of electricity sent fromnPlant
E
ón t ems
Objective y L e s
z = 8x11 + 6x12 + m
nS
10xi13 + 9x14 + uev
o
N
9x21 + 12x
r o g+ra 13x23 + 7x24a+de
22
14x
a t
31e+ P 9x32 + 16x33tó+no5xm34 .
r a du d Au
G a
Constraints sider
n i v
Supply ofUPlants.
Demand of Cities.

The PowerCo Problem
Decision Variables g
e e rin
n
Objective Engi
t ems ón
Sy s L e
in o
Constraints
m uev
Supply of Plant 1: xg11ra
+ x12 + x13 + d e =N 35
x14
Pro
e 2: x21 + x22 + nxo23m+ x24 = 50
Supply of Plant
a
at
duof Plant 3: x31 + Axu32t+ x33 + x34 = 40
Supply
ó
Gra
Demand of City 1:sid
d
a + x21 + x31 = 45
x11
ver
i 2: x12 + x22 + x32 = 20
Demand ofnCity
U
Demand of City 3: x13 + x23 + x33 = 30
Demand of City 4: x14 + x24 + x34 = 30

The PowerCo Problem
The Model g
e e rin
Min z = 8x11 + 6x12 + 10x13 + 9x14 + n
9x21 + 12x22 + 13x23 + 7x24 + E ngi
14x31 + 9x32 + 16x33 + 5x t ems ón
y s 34
S x14 = 35 vo L e
s.t. x11 + x12 + xin
13 +
m N ue
a
o22r 24 de
x21 + xg + x 23 + x = 50
x31 + Pr x32 + x33 + om
a
x34 = 40
e n
d uaxt + x + ux tó A = 45
Gra
11 21 31
x12 + sxid ad
22 + x32 = 20
r
ive x23 +
x13n+ x33 = 30
U
x14 + x24 + x34 = 30
xij ≥ 0, ∀i ∈ {1, 2, 3}, ∀j ∈ {1, 2, 3, 4}

Supply > Demand
g
45 e e rin
n
ngi
1
35
1 E
t ems 2 20 ón
50
Sy s L e
Plants 2
in u e
30 vo Cities
ram
3
40
o g
3 d eN
e Pr n o ma 20
a t t ó 4
r a du d Au
G a
r
125
e sid > 115
n iv
U UNBALANCED TP

Supply > Demand
g
35
1
45
e e rin
1 gi n
n
20
E
50
t em2s ón
Plants 2
Sy s 30
Cities
L e
in o
uev
3
40
o
3
g ram d e N20
e Pr n o ma 4
a d uat A utó 5
10
Virtual City
G r a d
e rsid
iv
Un 125 = 125
BALANCED TP

Supply > Demand

The Model
g
Min z = 8x11 + 6x12 + 10x13 + 9x14 + e e rin
n
9x21 + 12x22 + 13x23 + 7x24 +
E ngi
14x31 + 9x32 + 16x33 + 5x34em
s
y s t L e ón
s.t. x11 + x12 + x13 +S x14 + x15 = o35
in u=ev 50
x21 + x22 + m x + x + N
x
gra x33 + x34a +de x35 = 40
23 24 25
x31 + rox32 +
P om
axt11e+ x21 + xt31ón = 45
d u u Ax
Gra x12 + x22a+d
i d
sx + x
32 = 20
x13 + e r = 30
iv 23 33
Ux14n+ x24 + x34 = 20
x15 + x25 + x35 = 10
xij ≥ 0, ∀i ∈ {1, 2, 3}, ∀j ∈ {1, 2, 3, 4, 5}
Supply < Demand
g
45 e e rin
n
ngi
1
35
1 E
t ems 2 20 ón
50
Sy s L e
Plants 2
in u e
30 vo Cities
ram
3
30
o g
3 d eN
e Pr n o ma 30
a t t ó 4
r a du d Au
G a
r
115
e sid < 125
n iv
U UNBALANCED TP

Supply < Demand
g
1
45
e e rin
n
ngi20
35
1 E
50 t ems 2 n
óCities
Plants 2 Sy s L e
in 3uev
o
30
30
g r3ame N
Pr o m ad 4
30
a te 10 4 utóno
VirtualuPlant
d A
Gra i d ad
rs
n ive 125 = 125
U
BALANCED TP

Supply < Demand

The Model
g
Min z = 8x11 + 6x12 + 10x13 + 9x14 +
e e rin
n
9x21 + 12x22 + 13x23 +
E ngi 7x24 +
14x31 + 9x32 + 16x33 + 5x34 + ms
y
20x41 + 40x42 + 30x43 + 10x s te L e ón
S 44
o
s.t. x11 + x12 + x13i+n x14 = 35 uev
x21 + x22g
m
+ra x23 + e
x24 = d50
N
P r o m a
x31 +
a t e x32+ x33+tónox34 = 30
a u
d x41+ x42+ d A x43u+ x44 = 10
G r x11 + +a x31 +
x21id x41 = 45
s r
+ive x22 +
x12 n x32 + x42 = 20
U
x13 + x23 + x33 + x43 = 30
x14 + x24 + x34 + x44 = 30
xij ≥ 0, ∀i ∈ {1, 2, 3, 4}, ∀j ∈ {1, 2, 3, 4}
Supply < Demand

The Model
g
Min z = 8x11 + 6x12 + 10x13 + 9x14 +
e e rin
n
9x21 + 12x22 + 13x23 +
E ngi 7x24 +
14x31 + 9x32 + 16x33 + 5x34 + ms
y
20x41 + 40x42 + 30x43 + 10x s te → PenalizationLeCost
ón
S 44
o
s.t. x11 + x12 + x13i+n x14 = 35 uev
x21 + x22g
m
+ra x23 + e
x24 = d50
N
P r o m a
x31 +
a t e x32+ x33+tónox34 = 30
a u
d x41+ x42+ d A x43u+ x44 = 10
G r x11 + +a x31 +
x21id x41 = 45
s r
+ive x22 +
x12n x32 + x42 = 20
U
x13 + x23 + x33 + x43 = 30
x14 + x24 + x34 + x44 = 30
xij ≥ 0, ∀i ∈ {1, 2, 3, 4}, ∀j ∈ {1, 2, 3, 4}
Solution Approaches
Agenda
g
e e rin
n
E ngi
t ems ón
Sy s L e
in o
m N uev
r o gra a de
P m
óno
u a te ut
d A
Gra s i d ad
iv er
Un

Solution Approaches
Northwest Corner Method
Cities g
e e rin
1 2 3 4 n
Engi
ms 35
8 6 10 9
1
s t e e ón
Sy o L
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14 9
m a 16
óno
3 40
u a te ut
d A
Gra 45
s i 20ad
d 30 30
e r
iv
Un
z =0

Solution Approaches
Cities g
e e rin
1 2 3 4 n
Engi
ms
8 6 10 9
1 35
s t e 35
0
e ón
Sy o L
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14 9
m a 16
óno
3
u a te ut
40
d A
Gra 45
s i 20ad
d 30 30
e r
iv
Un
z =0

Solution Approaches
Cities g
e e rin
1 2 3 4 n
Engi
ms
8 6 10 9
1 35 e 35
0
y s t L e ón
S o
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14
m
9a 16
óno
3 40
u a te ut
d A
Gra 45 i d
20ad 30 30
ers

10i v
Un
z = 8 × 35

Solution Approaches
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 35 e 35
0
y s t L e ón
S
in evo40
Plants
9 12 13 7
2 10 u
50
ram N

o g de5
Pr
14 9
m a 16
óno
3
u a te ut
40
d A
Gra 45 i d
20ad 30 30
rs

10 i v e
U0n

z = 8 × 35 + 9 × 10

Solution Approaches
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 35 e 35
0
y s t L e ón
S o
in
Plants
2 10
9
20
12 13
uev
50 40
7
20
ram N

o g de5
Pr
14 9
m a 16
óno
3
u a te ut
40
d A
Gra 45 i d
20ad 30 30
rs

10 i v e 0
U0n

z = 8 × 35 + 9 × 10 + 12 × 20

Solution Approaches
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 35 e 35
0
y s t L e ón
S o
in20
Plants
2 10
9
20
12 13
uev
50
7
40 20
0
ram N

o g de5
Pr
14 9
m a 16
óno
3
u a te ut
40
d A
Gra 45

s i d
20ad 30 30
r
10 i v e 0 10
U0n

z = 8 × 35 + 9 × 10 + 12 × 20 + 13 × 20

Solution Approaches
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 35 e 35
0
y s t L e ón
S o
in20
Plants
2 10
9
20
12 13
uev
50
7
40 20
0
ram N

o g de5
3 Pr
14
10 no
9
m a 16
u a te utó
40
30

a d A
Gr 45

s
ad
d20
i 30 30
r

10 i v e 0 10
U0n

0
z = 8 × 35 + 9 × 10 + 12 × 20 + 13 × 20 + 16 × 10

Solution Approaches
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 35 e 35
0
y s t L e ón
S o
in20
Plants
2 10
9
20
12 13
uev
50
7
40 20
0
ram N

o g de5
3 Pr
14
m a
10 no 30
9 16
u a te utó
40

30
0
a d A
Gr 45

s
ad
d20
i 30 30
r

iv
10 e 0 10 0
U0n
0
z = 8 × 35 + 9 × 10 + 12 × 20 + 13 × 20 + 16 × 10 + 5 × 30

Solution Approaches
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 35
s t e 35
0
e ón
Sy o L
in20
Plants
2 10
9
20
12 13
uev
50
7
40 20
0
ram N

o g de5
3 Pr
14
m a
10 no 30
9 16
u a te utó
40

0
30
a d A
Gr 45 s
ad
d20
i 30 30
r

iv
10 e 0 10 0
U0n
0
z = 1180

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
Engi
ms 35
8 6 10 9
1
s t e e ón
Sy o L
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14 9
m a 16
óno
3 40
u a te ut
d A
Gra 45
s i 20ad
d 30 30
e r
iv
Un
z =0

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
Engi
ms 35
8 6 10 9
1 e
y s t L e ón
S o
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14 9
m a 16
óno
3 40
10
u a te ut
30
d A
Gra 45 s i d
20ad 30 30
r

iv e 0
Un
z = 5 × 30

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
Engi
ms
8 6 10 9
1 20 e 35
15
y s t L e ón
S o
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14 9
m a 16
óno
3
u a te ut
30 40
10

d A
Gra 45 s i d
20ad 30 30
r

iv e 0 0
Un
z = 5 × 30 + 6 × 20

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
Engi
ms
8 6 10 9
1 15 20 e 35 15
0 n
y s t
L eó
S o
in
Plants
u50ev
9 12 13 7
2
o g ram de5
N
Pr
14
m
9a 16
óno
3
u a te ut
30 40
10

d A
Gra 45

s i d
20ad 30 30
r

30iv e 0 0
Un
z = 5 × 30 + 6 × 20 + 8 × 15

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 15 20 e 35 15
0 n
y s t
L eó
S
in evo20
Plants
9 12 13 7
2 30 u
50
ram N

o g de5
Pr
14
m a
9 16
óno
3
u a te ut
30 40
10

d A
Gra 45

s i d
20ad 30 30
r

iv
30 e 0 0
U0n
z = 5 × 30 + 6 × 20 + 8 × 15 + 9 × 30

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 15 20 e 35 15
0 n
y s t
L eó
S o
in20
Plants
2 30
9 12 13
uev
50
7
20
0
ram N

o g de5
Pr
14
m a
9 16
óno
3
u a te ut
30 40
10

d A
Gra 45

s i d
20ad 30 30
r

iv
30 e 0 10 0
U0n
z = 5 × 30 + 6 × 20 + 8 × 15 + 9 × 30 + 13 × 20

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 15 20 e 35 15
0 n
y s t
L eó
S o
in20
Plants
2 30
9 12 13
uev
50
7
20
0
ram N

o g de5
3 Pr
14
m a
10 no 30
9 16
u a te utó
40

10
0
a d A
Gr 45

s
ad
d20
i 30 30
r

iv
30 e 0 10 0
U0n
0
z = 5 × 30 + 6 × 20 + 8 × 15 + 9 × 30 + 13 × 20 + 16 × 10

Solution Approaches
Minimum Cost Method
Cities g
e e rin
1 2 3 4 n
E ngi
ms
8 6 10 9
1 15 20
s t e 35
15
0 n
eó
Sy o L
in20
Plants
2 30
9 12 13
uev
50
7
20
0
ram N

o g de5
3 Pr
14
m a
10 no 30
9 16
u a te utó
40

0
10
a d A
Gr 45 s
ad
d20
i 30 30
r

iv
30 e 0 10 0
U0n
0
z = 1080

Solution Approaches
Vogel Approximation Method

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1
t ems 35 ón
Sy s L e
Plants
9 12
in
13
o 7
2
u50ev
g ram e N
3 Pr
14
o m
9
a d5 16
40
u a te ut óno
d 45 A 30
Gra s i
20ad
d 30
r
n ive
U
z =0
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1
t ems 35 ó
8-6=2
n
Sys Le
Plants
9 12
in
13
v o 7
2
u50e 9-7=2
g ram e N
3 Pr
14
o m
9
a d5 16
40 9-5=4
u a te ut óno
d 45 A 30
Gra s i
20ad
d 30
r
n ive
U
9-8=1 9-6=3 13-10=3 7-5=2
z =0
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1
t ems 35 ó
8-6=2
n
Sys Le
Plants
9 12
in
13
v o 7
2
u50e 9-7=2
g ram e N
3
14
Pr o m
9
a30d 5 16
40
10 9-5=4
te óno

u a
d 45 ut
A 30
Gra s i 20ad
d 30

r
n ive 0
U
9-8=1 9-6=3 13-10=3 7-5=2
z = 5 × 30
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1
t ems 35 ó
8-6=2
n
Sys Le
Plants
9 12
in
13
v o 7
2
u50e 12-9=3
g ram e N
3
14
Pr o m
9
a30d 5 16
40
10 14-9=5
te óno

u a
d 45 ut
A 30
Gra s i 20ad
d 30

r
n ive 0
U
9-8=1 9-6=3 13-10=3 -
z = 5 × 30
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1
t ems 35 ó
8-6=2
n
Sys Le
Plants
9 12
in
13
v o 7
2
u50e 12-9=3
g ram e N
3
14
o
Pr 10 m a30d 5
9 16
40 0 14-9=5
10
te óno

u a
d 45 ut
A
Gra s i20
d
ad 30 30

r
n ive 10 0
U
9-8=1 9-6=3 13-10=3 -
z = 5 × 30 + 9 × 10
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1
t ems 35 ó
8-6=2
n
Sys Le
Plants
9 12
in
13
v o 7
2
u50e 12-9=3
g ram e N
3
14
o
Pr 10 m a30d 5
9 16
40 10
0 -
te óno

u a
d 45 ut
A
Gra s i20
d
ad 30 30

r
n ive 10 0
U
9-8=1 12-6=6 13-10=3 -
z = 5 × 30 + 9 × 10
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1 10
t ems 35
25
ó
8-6=2
n
Sys Le
Plants
9 12
in
13
v o 7
2
u50e 12-9=3
g ram e N
3
14
o
Pr 10 m a30d 5
9 16
40 10
0 -
te óno

u a
d 45 ut
A
Gra s i20
d
ad 30 30

r
n ive 10
0
U 0
9-8=1 12-6=6 13-10=3 -
z = 5 × 30 + 9 × 10 + 6 × 10
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
Engi 9
1 10
t ems 35
25 10-8=2
ó n
Sy s L e
Plants
9 12
in
13
o 7
2
u50ev 13-9=4
g ram e N
3
14
o
Pr 10 m a30d 5
9 16
40 10
0 -
te óno

u a
d 45 ut
A
Gra s i20
d
ad 30 30

r
n ive 10
0
U 0
9-8=1 - 13-10=3 -
z = 5 × 30 + 9 × 10 + 6 × 10
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
E ngi 9
1 10
t ems 35
25 10-8=2
ó n
Sy s L e
Plants
evo5
9 12 13 7
2 45 in 50
u
13-9=4
g ram e N
3
14
o
Pr 10 m a30d 5
9 16
40 10
0 -
te óno

u a
d 45 ut
A
Gra
s i20
d
ad 30 30

r
0 ive 10
0
U n
0
9-8=1 - 13-10=3 -
z = 5 × 30 + 9 × 10 + 6 × 10 + 9 × 45
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
E ngi 9
1 10
t ems 35
25
ón
-
Sy s L e
Plants
evo5
9 12 13 7
2 45 in 50
u
-
14
o g 9 ram
16 d e5 N
3
e Pr 10 n o ma30 40
10
0 -
t

a t ó
r a du 45 d Au30
G
rs da
20
i
30

0 ive 10
0
U n
0
- - 13-10=3 -
z = 5 × 30 + 9 × 10 + 6 × 10 + 9 × 45
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
E ngi 9
1 10 25
t ems 35
25
0
ón
-
Sy s L e
Plants
evo5
9 12 13 7
2 45 in 50
u
-
14
o g 9 ram
16 d e5 N
3
e Pr 10 n o ma30 40
10
0 -
t

a t ó
r a du 45 d Au30
G
rs da
20
i

30

0 ive 10
5 0
U n 0
- - 13-10=3 -
z = 5 × 30 + 9 × 10 + 6 × 10 + 9 × 45 + 10 × 25
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
E ngi 9
1 10 25
t ems 35
25
0
ón
Sy s L e
Plants
evo5
9 12 13 7
2 45 in 50
u

g ram e N
3
14
o
Pr 10 m a30d 5
9 16
40 10
0
te óno

u a
d 45 ut
A 30
Gra
s i20
d
ad 30

r
0 ive 10
5 0
U n 0
z = 5 × 30 + 9 × 10 + 6 × 10 + 9 × 45 + 10 × 25
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
E ngi 9
1 10 25
t ems 35
25
0
ón
Sy s L e
Plants
evo5 0
9 12 13 7
2 45 in5 50
u
ram

e N
14
o g a30d 5
9 16
3 Pr 10 m 40 10
0
te óno

u a
d 45 ut
A 30
Gra
s i20
d
ad 30

r
0 ive 10
5 0
U n 0 0
z = 5 × 30 + 9 × 10 + 6 × 10 + 9 × 45 + 10 × 25 + 13 × 5
Solution Approaches

Cities
g
1 2 3 4 e e rin
n
8 6 10
E ngi 9
1 10 25
t ems 35
25
0
ón
Sy s L e
Plants
evo5 0
9 12 13 7
2 45 in5 50
u
ram

e N
o g a30d 5
Pr 10
14 9 16
3 m 40 10
0
te óno

u a
d 45 ut
A 30
Gra
s i20
d
ad 30

r
0 ive 10
5 0
U n 0 0
z = 1020

Transportation Problem

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Transportation Problem

Uploaded by

Copyright:

Available Formats

g

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

The transportation problem is a special type of LP problem wheregthe ob-

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

The PowerCo Problem

The PowerCo Problem

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

The PowerCo Problem

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

The PowerCo Problem

Decision Variables eri ng

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

The PowerCo Problem

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

The PowerCo Problem

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Supply > Demand

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Supply > Demand

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Supply > Demand

Supply < Demand

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Supply < Demand

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Supply < Demand

Supply < Demand

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Northwest Corner Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Minimum Cost Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Minimum Cost Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Minimum Cost Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Minimum Cost Method

Dr. M. Angélica Salazar A. / Vincent Boyer (PISIS-FIME)

Minimum Cost Method