Unit-II

PART – A
Q. Questions BT
No Level Competence

1 Define Transportation & Transhipment. BTL1 Remembering

2 Differentiate balanced transportation problem & Unbalanced Transportation
BTL2 Understanding
Problem.
3 How would you show your understanding on unbalanced transportation problem? BTL3 Applying
4 Categorize the Phases of transportation model. BTL4 Analyzing
5 Define Feasible solution. BTL5 Evaluating
6 Interpret the need for Optimum solution in transportation. BTL6 Creating
7 What do you mean by Least cost method (LCM)? BTL1 Remembering
8 Compare Vogel approximation method (VAM) & Least Cost Method. BTL2 Understanding
9 How do you identify Degeneracy in transportation problem? BTL3 Applying
10 Analyse rules of travelling salesman Problem BTL4 Analyzing
11 Discuss the meaning of Assignment BTL5 Evaluating
12 Compare Balanced assignment problem & Unbalanced Assignment Problem. BTL6 Creating
13 What example can you give for Unbalanced assignment problem? BTL1 Remembering
14 How will you resolve degeneracy in Transportation Problem? BTL2 Understanding
15 Classify transportation problem. BTL3 Applying
16 Examine the Steps in Hungarian algorithm. BTL4 Analyzing
17 What is Branch and bound algorithm in Assignment? BTL1 Remembering
18 Compare Assignment and transportation Problem. BTL2 Understanding
19 What do you mean by Travelling Salesman Problem. BTL1 Remembering
20 What is Restricted Assignment? BTL1 Remembering

Q. No Questions BT
Level

i) Solve the Transportation Problem and with choice of VAM BTL1 Remembering
for Initial Solution. Which method will you select if you want
to Minimize Cost?(5marks)
1
Destination Supply
1 2 3 4
I 21 16 25 13
 II 17 18 14 23 11
III 32 27 18 41 13
Demand 19
6 10 12 15

ii). Find the Initial Basic Feasible solution for following

TP. Using NW Rule, LCM, and VAM. Which method will
you select if you want to Minimize Cost?(8marks)
Destination Supply
I 10 0 20 11 15
II 12 7 9 20 25
III 0 14 16 18 5
Demand 5 15 15 10
Construct and find allocation for minimizing total BTL2 Understanding
transportation cost

Destination Availability
D1 D2 D3 D4
O1 5 2 4 3 22
2 O2 4 8 1 6 15
O3 4 6 7 5 8
Demand 7 12 17 9

(i) Estimate Initial solution using VAM. (5 Marks)

(ii) Predict the final Solution by using MODI Method
(8 Marks)
 Analyze the transportation problem with unit transportation costs, BTL3 Applying
demand, and supply as given below:

Destination Supply
D1 D2 D3 D4
s1 6 1 9 3 70
3 Source s2 11 5 2 8 55
s3 10 12 4 7 70
Demand 85 35 50 45

(i) Apply VAM for Initial solution.(5 Marks)

Solutio
(ii) Construct the final n by using MODI Method
(8 Marks)
Analyze & solve the following transportation problem to maximize BTL4 Analyzing
profit.

A B C D Supply
1 15 51 42 33 23
Source 2 80 42 26 81 44
4
3 90 40 66 60 33
Demand 23 31 16 30 100
(i) Examine Initial solution using VAM. (5 Marks)
(ii) Analyze and find out the final Solution by using MODI
Method (8 Marks)
A firm has 2 factories X & Y are 3 stores A, B, C. The number of units of a BTL5 Evaluating
product available at factories X & Y are 200 and 300 respectively. While
demanded at retail stores are 100, 150, 250 respectively. The TP cost in
Rs./per unit are given below.
X Y A B C
X 0 8 7 8 9
5 Y 6 0 5 4 3
A 7 2 0 5 1
B 1 5 1 0 4
C 15 14 18 17 0
i)Build the possibility of transhipment. (5 Marks)
ii) Estimate the optimal shipping schedule.(8 Marks)
 i) Solve the transportation problem and decide using BTL6 Creating
VAM for initial solution. (5 Marks)
ii) Evaluate using NWC and Least Cost method for
initial solution? (8 Marks)
6 Destination Supply
1 2 3 4
I 21 16 25 13 11
II 17 15 14 23 13
III 32 27 18 41 19
Demand 610 12 15
BTL1 Remembering
Maximize profit from the following transportation problem.
A B C D Supply
1 40 25 22 33 100
Source 2 44 35 30 30 30
7 3 38 38 28 30 70
Demand 40 20 60 30

i) How will you convert maximization problem to minimization (5

Marks)
ii) Find the maximu m profit (8 Marks)
BTL2 Understanding

A company has one surplus truck in each of the cities A, B, C, D, & E,

and one deficit trucks in each of the cities 1,2,3,4,5,6. The distance
between the cities in kms is shown in the matrix below. Can you select
the assignment of trucks from cities in surplus to cities in deficit so that
total distance covered by the vehicles is minimum?

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

A company is faced with the problem of assigning 4 machines to 6

different jobs. The Profit are estimated as follows. Solve the problem to
maximize total profits. Which is the best way to assign using Hungarian
9 Algorithm?
Machines
Jobs A B C D
1 3 6 2 6
BTL3 Applying
 2 7 1 4 4
3 3 8 5 8
4 6 4 3 7
5 5 2 4 3
6 5 -7 6 4
i) Manipulate the maximization problem to minimization (5
Marks)
ii) Calculate the maximu m profit (8 Marks)

Can you analyse the assignment represented by the following BTL4 Analyzing
matrix to minimize cost?

1 2 3 4 5 6
A 9 22 58 11 19 27
B 43 78 72 50 63 48
10 C 41 28 91 37 45 33
D 74 42 27 49 39 32
E 36 11 57 22 25 18
F 3 56 53 31 17 28

A machine shop purchased a drilling machine and two lathes of different BTL1 Remembering
capacities. The Positioning of the machines among 4 possible locations on
the shop floor is important forms the standard of materials handling. Given
the cost estimate per unit time of materials below, find the optimum
location of the machines.

Location
1 2 3 4
11
Lathe1 12 9 12 9
Drill 15 not suitable 13 20
Lathe2 4 8 10 6

BTL2 Understanding
12
For the given travelling salesman problem, Minimize the total cost.
 To
A B C D E
A - 3 6 2 3
B 3 - 5 2 3
From C 6 5 - 6 4
D 2 2 6 - 6
E 3 3 4 6 -
i) Interpret the above travelling salesman problem so as to minimize the
cost per cycle. (8 Marks)
ii) Explain whether path is satisfied. (5 Marks)

BTL4 Analyzing

The processing time in hours for the jobs when allocated to the different
machines is indicated below. Select the best assignment of the machines
for the jobs so that the total processing time is Minimum.
Machines
M1 M2 M3 M4 M5
J1 9 22 58 11 19
13
J2 43 78 72 50 63
Jobs J3 41 28 91 37 45
J4 74 42 27 49 39
J5 36 11 57 22 25

BTL1 Remembering

For the given travelling salesman problem, Minimize the total cost.
To
A B C D
14 From A - 46 16 40
B 41 - 50 40
C 82 32 - 60
D 40 40 36 -
 i) Observe the above travelling salesman problem and find out
minimize the cost per cycle.(8 Marks)
ii) Find whether path is satisfied.(5 Marks)

PART C

Question
Q. No s BT Level Competence

Assume that you are an OR specialist. Identify the procedure for each of the Remembering
following Method to the employees in order to help them achieve solution to
Transportation Problems.

1 a) Northwest Corner Cell Method (3 marks) BTL 1

b) Least Cost cell Method (4 marks)
c) Vogel’s Approximation Method (4 marks)
d) U V Method. (4 marks)
Solve the following transportation problem, in which a i is the availability at Origin Understanding
Oi and bj is the requirement at the destination D j and cell entries are unit costs of
transportation from any origin to any destination:
D1 D2 D3 D4 D5 ai
O1 4 7 3 8 2 4
2 BTL 2
O2 1 4 7 3 8 7
O3 7 2 4 7 7 9
O4 4 8 2 4 7 2
bj 8 3 7 2 2
Predict the allocation to minimize the cost.
A company has a team of 4 Salesman and the company wants to do Applying
business in 4 districts. Considering the capabilities of salesmen and nature
of the district, the company has estimated the profit per day in Rs. For each
salesmen in each district as follows.
Districts
BTL 3
3 Salesmen 1 2 3 4
A 16 10 14 11
B 14 11 15 15
C 15 15 13 12
D 13 12 14 15

Develop the best assignment schedule and analyze the total cost.
 Five operators have to be assigned to Five Machines. The assignment costs are Analyzing
given in the table below: Machine
I II III IV V
A 5 5 - 2 6
B 7 4 2 3 4
BTL 4
4 Operator C 9 3 5 - 3
D 7 2 6 7 2
E 6 5 7 9 1
Analyse using Hungarian algorithm & find out the assignment to minimize the
cost.