5 2 4 3 30

6 4 9 5 40
2 3 8 1 55

15 20 40 50

0 0 30 0 30 30
0 20 10 10 40 40
15 0 0 40 55 55
15 20 40 50
15 20 40 50 410

D1 D2 D3 D4 D1 D2 D3 D4
S1 0 0 30 0 S1 0 0 30 0
S2 10 20 10 0 S2 0 20 10 10
S3 5 0 0 50 S3 15 0 0 40
TP 1 Destinations
1 2 3 4 Supply
A 5 2 4 3 30
Sources B 6 4 9 5 40
C 2 3 8 1 55
Demand 15 20 40 50 125
Demand=supply
m*n 12
m+n-1 6
Algorithms
a) North-West Corner Rule Initial-basic feasible solution, firther test optimality using m
b) Least Cost Method
c) Vogel's approximate method

TP 2
1 2 3 4 Supply
A 5 9 13 2 50
B 11 18 20 3 50
C 14 13 16 3 50
Demand 30 40 55 25
 1 2 3 4 Supply
A 1 2 3 4 30
B 7 6 2 5 50
C 4 3 2 7 35
Demand 15 30 25 45 115
Demand=supply

ther test optimality using modified difference method

Problem 1 Least Cost Method
1 2 3 4
A 5 2 4 3
B 6 4 9 5
C 2 3 8 1
Demand 15 20 40 50
10 30
Steps 1 Demand=Supply
Least cost 2 SC-D4 50 units shipped
Next least c 3 SC-D1
4 SA-D2
5 SA-D3

Total Cost 470

Modified Difference Method

Vogel's approximate method

 Destinations
1 2 3 4 Penalty = Difference of 2 lea
A 5 2 4 3 1
B 6 4 9 5 1
C 2 3 8 1 1
Demand 15 20 40 50
10 10
Penalty 3 1 4 2
Penalty 2 4 1 1 4

Steps 1 Calculate Penalty

2 Pick highest penalty Shipped 30 Resource exhausted (row de
Shipped 50 Column 4 gone
SC Row 3 gone

Total Cost 410

Supply
30 10 0
40
55 5 0
125

Put Theeta in most positive (non-basic) cell

Make a loop Dotted cells are basic/occupied cells
Penalty Supply
30 0
2 40
1 55 5

column penalty chsanged

Problem 2
1 2 3 4 Supply
A 5 9 13 2 50
B 11 18 20 3 50
C 14 13 16 3 50
Demand 30 40 55 25
5 0 0
0
Least Cost Method
Total Cost 750 1810
25 0
45
19
 Maximzation to Minimization

Problem: Unbalanced, maximization and degeneracy

Profit Max. Retail outlets

1 2 3 4
Warehous A 90 90 100 100 .=, <=
B 50 70 130 85 .=, <=
<= <= <= <=
Demand 75 100 100 30

1 2 3 4
Warehous A 40 40 30 30 .=, <=
B 80 60 0 45 .=, <=
Dummy 0 0 0 0
<= <= <= <=
Demand 75 100 100 30
Degeneracy - When demand and supply are simultaneously satisfied
 MinZ= CijXij
Cij per unit cost of transportaion
Xij= no. units shipped from ith source to jth destination

X11 X12 X13 X14 <= 30

Supply X21 X22 X23 X24 <= 40
200 X31 X32 X33 X34 <= 55
100 >= >= >= >=
300 15 20 40 50
305
Demand
Transportation Algo.
Initial basic feasible sol. 1. North west corner rule
2. Least cost method
3. Vogel's approximation method
Supply Optimality
200 Modified defference Method MODI Method
100 (u-V method
5

305
h destination

Supply
If Demand > Supply, then dummy row will be addded
If Demand < Supply, then dummy column will be adde

Destination
D1 D2 Supply
Source S1 2 (100) 4 100
S2` 4 (100) 6 (150) 250
Dummy 0 0 (50) 50
Demand 200 200 400
100 150
Penalty 2 4
2 2

Cost 1500
Penalty
2
2 D1 D2 Supply
0 S1 2 4 100
S2` 4 6 250
Demand 200 200

S1 S2
S1 0 1
S2 1 0

D1 D2
D1 0 2
D2 2 0

S1 S2 D1 D2 Supply
S1 0 1 2 4 100+400
S2 1 0 4 6 250+400
D1 1000 1000 0 2 400
D2 1000 1000 2 0 400
Demand 400 400 200+400 200+400

S1 S2 D1 D2 .= Supply
S1 150 0 200 150 500 500
S2 250 400 0 0 650 650
D1 0 0 400 0 400 400
D2 0 0 0 400 400 400
<= 400 400 600 550
Demand 400 400 600 600 1250
 Courses
3424 3434 3444 3454 4434 4444
1 2 4 1 3 2 5
2 3 3 4 1 2 5
3 2 3 2 1 3 4
4 1 4 2 5 1 3
Faculty 5 1 1 4 4 2 3
6 1 3 1 5 4 1
7 3 1 2 5 3 1
8 3 4 3 5 5 1
9 4 1 3 2 2 5
10 4 3 1 5 2 3

Demand 2 3 3 1 3 3

3424 3434 3444 3454 4434 4444

1 0 0 2 0 0 0
2 0 0 0 0 2 0
3 0 0 1 1 0 0
4 1 0 0 0 1 0
5 1 1 0 0 0 0
6 0 0 0 0 0 2
7 0 0 0 0 0 1
8 0 0 0 0 0 0
9 0 2 0 0 0 0
10 0 0 0 0 0 0
2 3 3 1 3 3

Demand 2 3 3 1 3 3
4454 4464 Supply
5 5 2
5 4 2
4 4 2
2 2 2
3 5 2
1 2 2
1 1 2
1 3 2
5 5 2
3 1 2

3 2

4454 4464 Supply

0 0 2 2
0 0 2 2
0 0 2 2
0 0 2 2
0 0 2 2
0 0 2 2
1 0 2 2
2 0 2 2
0 0 2 2
0 2 2 2
3 2

3 2 23
 Waste Disposal Site
Plant Whitewater Los Canos Duras
Kingsport 12 15 17
Danville 14 9 10
Macon 13 20 11
Selma 17 16 19
Coloumbus 7 14 12
Allentown 22 16 18

Plant Waste per week

Kingsport 35
Danville 26
Macon 42
Selma 53
Coloumbus 29
Allentown 38

Plant Kingsport Danville Macon Selma Coloumbus Allentown

Kingsport 6 4 9 7 8
Danville 6 11 10 12 7
Macon 5 11 3 7 15
Selma 9 10 3 3 16
Coloumbus 7 12 7 3 14
Allentown 8 15 16 14

Whitewater Los Canos Duras

Whitewater 12 10
Los Canos 12 15
Duras 10 15
 Kingsport Danville Macon Selma Coloumbus Allentown
Kingsport 0 6 4 9 7 8
Danville 6 0 11 10 12 7
Macon 5 11 0 3 7 15
Selma 9 10 3 0 3 16
Coloumbus 7 12 7 3 0 14
Allentown 8 7 15 16 14 0
Whitewater 1000 1000 1000 1000 1000 1000
Los Canos 1000 1000 1000 1000 1000 1000
Duras 1000 1000 1000 1000 1000 1000
SUM 3035 3046 3040 3041 3043 3060
Demand 250 250 250 250 250 250

Kingsport Danville Macon Selma Coloumbus Allentown

Kingsport 250 16 19 0 0 0
Danville 0 196 0 0 0 0
Macon 0 0 214 0 0 0
Selma 0 0 17 250 36 0
Coloumbus 0 0 0 0 214 0
Allentown 0 38 0 0 0 250
Whitewater 0 0 0 0 0 0
Los Canos 0 0 0 0 0 0
Duras 0 0 0 0 0 0
SUM 250 250 250 250 250 250
Demand 250 250 250 250 250 250
<=
Whitewater Los Canos Duras SUM Supply
12 15 17 78 35+250
14 9 10 79 26+250
13 20 11 85 42+250
17 16 19 93 53+250
7 14 12 76 29+250
22 16 18 116 38+250
0 12 10 6022 250
12 0 15 6027 250
10 15 0 6025 250
107 117 112
65+250 80+250 105+250

250 213

Whitewater Los Canos Duras SUM Supply

0 0 0 285 285
0 80 0 276 276
0 0 78 292 292
0 0 0 303 303
65 0 0 279 279
0 0 0 288 288
250 0 0 250 250
0 250 0 250 250
0 0 250 250 250
315 330 328 .=
315 330 355 2630
 Test Module Scores
Applicant Carding Spinning Weaving Inspection Shipping
Roger Acuff 68 75 72 86 78
Melissa Ball 73 82 66 78 85
Angela Coe 92 101 90 79 74
Maureen Dav 87 98 75 90 92
Fred Evans 58 62 93 81 75
Bob Frank 93 79 94 92 96
Ellen Gantry 77 92 90 81 93
David Harper 79 66 90 85 86
Mary Inchave 91 102 95 90 88
Marilu Jones 72 75 67 93 93
Distribution Goat Jackets Lamb Jackets
Indiana 1000 780
North Carolin 1400 950
Pennsylvania 1600 1150

Tanning FactoGoat Lamb

Mende 4000 4400
Foggia 3700 5300
Saragosa 6500 4650
Fiera 5100 6850
El Tigre 3600 5700

Plant Capacity
Madrid 7800
Naples 5700
Limoges 8200
Sao Paulo 7600
Caracas 6800

Plant
Tanning FactoMadrid Naples Limoges Sao Paulo Caracas
Mende 24 22 16 21 23
Foggia 31 17 22 19 22
Saragosa 18 25 28 23 25
Fiera 16 18
El Tigre 14 15

Port
Plant Lisbon Marseilles Caracas
Madrid 0.75 1.05
Naples 3.45 1.35
Limoges 2.25 0.6
Sao Paulo 1.15
Caracas 0.2
Capacity 8000 5500 9000

US Port
Port New Orleans Jacksonville Savannah
Lisbon 2.35 1.9 1.8
Marseilles 3.1 2.4 2
Caracas 1.95 2.15 2.4
Capacity 8000 5200 7500

Distribution Center
US Port Indiana North CarolinPennsylvania
New Orleans 0.65 0.52 0.87
Jacksonville 0.43 0.41 0.65
Savannah 0.38 0.54 0.5
 1 4 1000 1000 150
3 2 1000 1000 250
0 1 6 1000 400
3 0 5 8 400
1000 1000 0 1 400
400 400 500 300

150 0 0 0 150 150

0 250 0 0 250 250
250 150 0 0 400 400
0 0 400 0 400 400
0 0 100 300 400 400
400 400 500 300
400 400 500 300 3100