TRANSPORTATION PROBLEMS

INITIAL BASIC FEASIBLE SOLUTION

1) Determine the basic feasible solution to the following transportation problems using.
a) North –West Corner Rules
b) Least Cost Method or Matrix Minima Method
c) Vogel’s Approximation Method
To W1 W2 W3 W4 Units
From available
F1 6 4 1 5 14
F2 8 9 2 7 16
F3 4 3 6 2 5
Units 6 10 15 4 35
Required

2)
D1 D2 D3 D4 Suppliers
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14 34

3) A dairy firm has three plants located in a state. The dairy milk production at each plant is as
follows: -
Plant 1: 6 million liters
Plant 2: 1 million liters
Plant 3: 10 million liters
The firm must fulfill the needs of its four distributions Centre’s Minimum requirement at
each center is as follows: -
Distributions Centre 1: 7 million liters
Distributions Centre 2: 5 million liters
Distributions Centre 3: 3 million liters
Distributions Centre 4: 2 million liters
Cost in hundreds of rupees of shipping one million liter from each plant to each distribution
Centre is given in the following to be.
D1 D2 D3 D4
P1 2 3 11 7
P2 1 0 6 1
P3 5 8 15 9

4) OPTIMAL SOLUTION BY MODI (Modified Distribution Method) METHOD VAM & MODI
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14 34
5) NWC & MODI

W1 W2 W3 Supply
F1 16 20 12 200
F2 14 8 18 160
F3 26 24 16 90
Demand 180 120 150 450
1
6) Dummy Row Insertion

Market M1 M2 M3 M4 Supply (in units)

Warehouse
W1 50 150 70 60 50
W2 80 70 90 10 60
W3 15 87 79 81 40
Demand(in units) 30 80 50 10 170/150

7) Dummy Column Insertion

X Y Z Supply
A 2 7 4 5
B 3 3 1 8
C 5 4 7 7
D 1 6 2 14
Requirement 7 9 14 34
30

8) Degeneracy at the Initial Solution

X Y Z Supply
A 8 7 3 60
B 3 8 9 70
C 11 3 5 80
Requirement 50 80 80 210
210

2
 ASSIGNMENT MODEL

1) Solve the following assignment problem.

1 2 3 4 5
A 10 5 13 15 16
B 3 9 18 13 6
C 10 7 2 2 2
D 7 11 9 7 12
E 7 9 10 4 12

1) Solve the following assignment problem.

I II III IV V
A 6 12 3 11 15
d
B 4 2 7 1 10
C 8 11 10 7 11
D 16 19 12 23 21
E 9 5 7 6 10

2) Solve the following assignment problem. [Maximization Problem and Alternate Solutions]

I II III IV
A 42 35 28 21
B 30 25 20 15
C 30 25 20 15
D 24 20 16 12

3) Solve the following assignment problem. [Maximization Problem and Alternate Solutions]

A B C D E
1 32 38 40 28 40
2 40 24 28 21 36
3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 35 39

3
 4) Solve the following assignment problem. [Travelling Salesman Problem]

A B C D E
A ∞ 2 5 7 1
B 6 ∞ 3 8 2
C 8 7 ∞ 4 7
D 12 4 6 ∞ 5
E 1 3 2 8 ∞

5) Solve the following assignment problem. [Travelling Salesman Problem]

1 2 3 4
1 ∞ 4 9 5
2 6 ∞ 4 8
3 9 4 ∞ 9
4 5 8 9 ∞

6) [Assignment of Swimming Style]

Five swimmers are eligible to compete in a relay team which is to consist of four swimmers swimming
four different swimming styles; back stroke, breast stroke, free style and butterfly. The time taken for
the five swimmers – Anand, Bhaskar, Chandru, Dorai and Easwar – to cover a distance of 100 meters
in various swimming styles are given below in minutes: seconds. Anand swims the back stroke in 1:
09, the breast stroke in 1: 15, and has never competed in the free style or butterfly. Bhaskar is a free
style specialist averaging 1: 01 for the 100 meters but can also swim the breast stroke in 1:16 and
butterfly in 1: 20. Chandru swims all styles – back stroke 1: 10, butterfly 1: 12, free style 1: 05 and
breast stroke 1: 20. Dorai swims only the butterfly 1: 11 while Easwar swims the back stroke 1: 20, the
breast stroke 1: 16, the free style 1: 06 and the butterfly 1: 10. Which swimmer should be assigned to
which swimming style? Who will not be in the relay?