Transportation & Assignment Problem (LPP Approach)
Transportation & Assignment Problem (LPP Approach)
Transportation & Assignment Problem (LPP Approach)
2. A manufacturer has distribution centers at Agra, Allahabad and Kolkatta. His retail outlets are
at A, B, C and D. The transport cost in rupees per unit between each center-outlet is given
below.
A B C D Supply
Agra 60 40 40 50 40
Allahabad 35 30 100 45 20
Kolkatta 40 60 95 35 40
Demand 25 10 20 45
Districts
A B C D E
S1 42 48 50 38 50
S2 50 34 38 31 46
Salesman S3 51 37 43 40 47
S4 32 48 51 46 46
S5 39 43 50 45 49
Develop Excel Model and find the assignment of salesman to districts that will result in
maximum sales.
4. Five workers are available to work with the machines and the respective costs in rupees
associated with each worker-machine are given below. A sixth machine is available to replace
one of the existing ones and the associated costs of that machine are also given below.
Machines
M1 M2 M3 M4 M5 M6
W1 12 3 6 15 5 9
W2 4 11 16 5 14 8
Workers W3 8 2 10 9 7 5
W4 20 7 8 6 12 10
W5 5 8 9 4 6 1
6. A firm owns facilities at seven places. It has manufacturing plants at places A, B, and C with a
daily production capacity 600, 400 and 300 units respectively. It has warehouses at places P,
Q, R and S, with daily requirements of 230, 200, 450 and 420 units respectively. Per unit
transportation cost on different route combinations are given below. Solve this as a
transportation problem to minimize the total transportation cost.
Warehouses
Plants
P Q R S
A 12 10 12 13
B 7 11 8 14
C 6 16 11 7