Tutorial Sheet

Subject: Operations research (KOE-075)

Unit-II: Introduction about Transportation and Assignment problems.

Q1- A department head has four subordinates and four tasks have to be performed. Subordinates
differ in efficiency and tasks differ in their intrinsic difficulty. Time each man would take to
perform each task is given in the effectiveness matrix. How the tasks should be allocated to each
person so as to minimize the total man hours?

Subordinates
I II III IV
A 8 26 d 17 11

B 13 28 4 26

C 38 19 18 15

D 19 26 24 10
Ans-
Optimal A→I B→III C→II D→IV
assignment:
Man power: 8 4 19 10

Q2- Solve the following transportation problem for minimum cost.

To ai

15 10 17 18 2

From 16 13 12 13 6

12 17 20 11 7

bj 3 3 4 5

Ans-174
Q3- Describe the degeneracy in transportations problems?
Q4- Solve the following transportation problem:

To Supply

From 6 1 9 8 70
21

11 5 2 8 55

10 12 4 7 90

Demand 85 35 50 45

Ans-1265
Q5- A marketing manager has 5 salesmen and 5 sales districts. Considering the capabilities of the
salesman and the nature of districts, the marketing manager estimates that sales per month
(In hundred rupees) for each salesman in each district would be as follows:

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

Find the assignment of salesman to districts that will result in maximum sale. (Ans-191)

Q6- Use Vogel’s Approximation method. Find the initial basic feasible solution for the
following transportation problem.
To
A B C Availability
From a 2 7 4 5

b 3 3 1 8

c 5 4 7 7

d 1 6 2 14 Ans- 80(10+8+20+2+12+28)

Requirement 7 9 18 3434
Q7- Using Least Cost Rule, find the initial basic feasible solution of the following
transportation problem.
To
D1 D2 D3 D4 Availability
From A 2 2 2 1 21
7

B 10 8 5 4 9

C 7 6 6 8 C
18

Requirement 5 8 7 14

Ans-158(7+28+10+30+48+35)

Q8- Determine an initial basic feasible solution to the following transportation problem by
using North-West corner rule.

To Supply
D1 D2 D3 D4 D5
From A 2 11 10 3 7 4

B 1 4 7 2 1 8

C 3 9 4 8 12 9

Demand 3 3 4 5 6 21

Ans- 153(6+11+8+28+4+24+72)
Q9- Explain Vogel’s Approximation method of solving a transportation method.
Q10- Explain North-West corner rule of solving a transportation method.

Q11- Explain the lowest cost entry method for obtaining an initial basic solution of a
Transportation problem.
Q12- Find the optimal solution of the following transportation problem using Vogel’s
Approximation Method and find the initial basic feasible solution.

D1 D2 D3 D4 Availability
From A 19 30 50 10 7

B9 70 30 40 60

40 8 70 20 18

Requirement 5 8 7 14 Ans-743, 779

Q13- Five jobs are performed first on machine X and then on machine Y. The time taken in hours
by each job on each machine is given below.
Job A B C D E
Machine X 6 2 10 4 11
Machine Y 3 7 8 9 5
Determine the optimal sequence of jobs that minimizes the total elapsed time to complete the Job.
Ans: B D C E A

Minimum total elapsed time is 36 hours.

Q14- There are five jobs of which are to be processed through 3 machines A, B and C in the order
ABC. Processing time in hours is
Job 1 2 3 4 5
Machine A 3 8 7 5 4
Machine B 4 5 1 2 3
Machine C 7 9 5 6 10
Determine the optimal sequence for the five jobs and minimum elapsed time.
Ans: Optimal sequence is
4 1 5 2 3

Minimum total elapsed time is 44 hours.

Q15- Find an optimal sequence for the following sequencing problem of four Jobs
and six machines when passing is not allowed of which processing time (in hours)
is given below.
M1 M2 M3 M4 M5 M6
Job A 18 8 7 2 10 25
Job B 17 6 9 6 8 19
Job C 11 5 8 5 7 15
Job D 20 4 3 4 8 12
also find total elapsed time.
Ans: Optimal sequence is
C A B D

Total elapsed time = 112.