in

Agurchand Manmull Jain College 14. Determine an initial basic feasible solution to be the following
transportation problem using NWCR.
Department of Mathematics Destination
D1 D2 D3 D4 Supply
Operation Research III - Transportation and Assignment Model
O1 6 4 1 5 14
Origin O2 8 9 2 7 16
PART A
O3 4 3 6 2 5
Required 6 10 15 4 35
1. Write the meaning of unique solution.

Ja
15. Bring out the difference between transportation problem and
2. Define the term basic feasible solution.
assignment problem.
3. What do you understand by feasible solution.
16. Solve the following assignment problem.
4. Expand the terms VAM and NWCM. 9 26 17 11
13 28 4 26
5. Which is the most preferred transportation solution method?
38 19 18 15
6. Give the meaning of unbalanced transportation problem. 19 26 24 10
7. Give the meaning of balanced transportation problem. 17. Solve the assignment problem.
8. Mention any two methods for determination of an initial basic 10 12 19 11
feasible solution. 5 10 7 8
12 14 13 11
9. Give the meaning of assignment problem. 8 15 11 9
10. Why dummy is added in assignment problem.

PART B M
11. What are the basic assumptions of the transportation model?
12. Explain the algorithm for Vogel’s Approximation Method.
13. Determine an initial basic feasible solution to be the following
18. Solve the following assignment problem.

I
A B C D
1 4 6 3
II 9 7 10 9
III 4 5 11 7
IV 8 7 8 5
19. Construct the problem of assigning 5 jobs to 5 persons. The costs
are given as below. Solve the following assignment problem.
transportation problem using Least cost entry method. Jobs
Destination 1 2 3 4 5
D1 D2 D3 D4 Availability A 8 4 2 6 1
O1 1 2 1 4 20 B 0 9 5 5 4
Origin O2 3 3 2 1 40 Persons C 3 8 9 2 6
O3 4 2 5 9 20 D 4 3 1 0 3
O4 5 3 6 10 20 E 9 5 8 9 5
Requirement 20 40 30 10 Find out minimum cost.
 in
20. Solve the following minimal assignment problem by Hungarian D1 D2 D3 D4 Supply
method. Q1 11 13 17 4 250
Operators Origin Q2 16 18 14 10 300
1 2 3 4 5 q3 21 24 13 10 400
A 30 25 33 35 36 Demand 200 225 275 250 950
B 23 29 38 23 26 24. Solve the transportation problem for the maximum cost.
Machines C 30 27 22 22 22 Requirement
D 25 31 29 27 32 15 51 42 33 23

Ja
E 27 29 30 24 32 80 42 26 81 44
90 40 66 60 33
PART C Capacity 23 31 16 30
25. Solve the following assignment problem.
Men
21. At the beginning of a sowing season, there will be surplus of 6, 9, 7 M1 M2 M3 M4
and 5 tractors in four villages A, B, C and D while other three A 18 26 17 11
villages X, Y and Z will require 8, 7 and 12 tractors respectively Task B 13 28 14 26
for farming purposes. The cost of moving tractors is directly C 38 19 18 15
proportional to the distance between the surplus and deficit village, D 19 26 24 10
and the distance is kms are given as:
DeficitVillages 26. A company is faced with the problem of assigning five jobs to five
X Y Z machines; each jobs must be done on only one machine; the cost
A 26 22 28 of processing each job on each machine is given below (in Rupees).
Surplus Villages B 19 27 16 Machines
C 39 21 32
D 18 24 23
M
Determine the optimal scheme for delivery of tractors from surplus
villages to deficit villages. Use VAM only.
22. Determine an initial basic feasible solution to be the following
transportation problem using VAM and hence obtain an optimal
solution.
Destination
J1 7
J2 9
Jobs J3 8
J4 7
J5 4
M1 M2 M3 M4 M5
5
12
5
3
6
Calculate minimum cost.
27. Solve the following
Method.
9
7
4
6
7
8
11 10
6
9
5
11

9
5
11

minimal assignment problem by Hungarian

D1 D2 D3 D4 Supply 1 2 3 4
F1 3 3 4 1 100 A 1 26 17 11
Factory F2 4 2 4 2 125 B 13 28 4 26
F3 1 5 3 2 75 C 38 19 18 15
Demand 120 80 75 25 300 D 19 26 24 10
23. Solve the following transportation problem VAM.
Destination