I

-
AS~G NME NTPR OBLE MS
• Q6
ment techniques. (06M)
I. What is assig!1ment problem? Mention the areas of application of assign (06M/08M)
m.
2. Differentiate between transportation problem and assignment proble (06M/08M)
3. Write a short note on travelling salesman problem.
to be performed. The
4. A departmental head has four subordinates and four tasks
their intrinsic difficulty.
subordinates differ in efficiency and the tasks differ in
to perform each task is
His estimates of the times that each man would take
given in the matrix below:
Tasks
I II ID IY
c. "'
•;j• A 8 26 17 11
~ B 13 28 4 26
'E 15
.B::, C 38 19 18
II)
D 19 26 24 10

to mm1m1ze the total

How should the tasks be allocated to subordinates so as (12M/14M)
man-hours?
The cost (in .rupees) of
5. Four jobs are to be done on four different machines.
producing ith job on the jlh machine is given below:
Machines
t1., ~I ~f ~1-~
- ' •
JI 15 11 13 15
I..\ Jobs J, 17 12 12 13

- J3
J~
14
16
15
13
10
11
14
17

cost. (12M /14M)

Assign the jobs to different machines so as to minimize the total
and e. A customer requires a car
6. A car hire company has one car at each of 5 depots a, b, c, d
depots (origins) and towns
in each town namely, A, B, C, D and E. Distance (in kms) between
(destinations) are given in the following distance matrix.
Dq,ot s
a b c d e
A 160 130 175 190 ~00
To"u~ B 135 120 130 160 175
G C HO 110 1S5 170 1S5
D 50 80 110 80
~---tsr 50

- E 55 35 70 so 105
How should cars be assigned so as to minimize the distance travel
led. (12M /14M)
 7

ns to perform. Dete rmin e the optim al

7. An ABC comp any has 5 tasks and 5 perso (12M/14M)
assig nmen t that mini mize s the total cost.
l\Iach ines
A B C D E

~,-
1-\
er.
.s::,
p
Q
6
7
7
5
5
10
9
9
6
...
6
5
....
0 R 5 4 3
s s 3 5 6 4
T ... 7 5 6 6

road repairs on main four arter ies

8. A city corpo ratio n has decided to carry out
make a special grant of Rs. 50 lakhs
of the city. The gove rnme nt has agreed to
repairs must be done at the lowest
towa rds the cost with a condition that the
lementary token grant will also be
cost. If cond ition s warrant, then the supp
floated tenders and five .cont racto rs
cons idere d favorably. The corporation has
, one road will be awarded to only
have sent their bids. In orde r to expe dite work
x is in lakhs of Rs in table
one contractor. The cost given in matri
r work to the contr actor s and the
i) Find the best way of assigning the repai
costs.
s, then what shou ld be the amou nt
ii). Is it nece ssary to seek supplementary grant
soug ht? (14M)
ful in his bid?
iii). Which of the five contr actor s will be unsuccess
Road
R R. R

2
.. Ci
C
9
7
H
17
19
10
15
19
~
.: c, 9 1S 11 18
E
0
;.., C~ 10 12 18 19
cs 10 15 :'.!l 16
(12M/14M)
- 9. Solv e the follo wing assig nmen t prob lem for maximiza
tion.
Area
A, A. A-.:
A"1
;; Si 200 150 170 ::!.:!O
~ s, 160 120 150 140
G ('t\0.'f- . ~
;;
er. S3 190 195 190 200
_ \(:::-10 s~ 180 175 160 190
MO .so\Y)
avail able to assig n to jobs for the day. Five
I 0. The owne r of a small mach ine has four mach inists
inist on each job as follows: Find using
jobs are offered with expe cted profi t for each mach
to jobs that will resul t in a maxi mum
assig nmen t meth od, the assig nmen t of mach inist (12M/14M)
property.

-
 Job'>
A B C D E
l 6.:! 78 50 101 82
.:! 71 S4 61 73 59
G 3 S7 92 111 71 Sl
➔ -lS 6➔ S7 77 so

11. Find the minimum cost solution for the 5 x 5 assignme nt problem whose cost
co-efficie nt are given below: (12M/14M )
B
3 4 s
-., -4 -S -6 -1
G 0 -9 -5 -5 -➔
< . 3 -3 -S 0 -2 -6
-t -4 -3 -1 0 -3
5 -9 -5 -8 -9 -5

3
12. A college athletic conferenc e has 6 basketbal I officials. It must assign to
conferenc e games. Two officials must be assigned to each game. The conferenc e
office desires to assign the officials such that the total distance travelled by all the six officials
will be minimize d. The distance each official would have to travel to each game are given

- below:

1 2
Officials
3 4 5 6
"' A
E 20 40 60 00 70 so
;j B 45 90 70 60 15 25
C 10 70 30 40 50 35
The conferenc e office has decided not to assign the official 4 to game A because of the
previous conflicts with one of the coaches. Determin e the optimal assignme nt. (12M/14M )

13. A travelling salesman has to visit 5 cities. He wishes to start from a particular
city, visit each city once and return to his starting point. Find the least cost
route. (12M/14M )

A B C D E
A -r.J 4 10 14 2
B 12 ,x 6 10 4
C 16 14 :£.• 8 14
D 24 8 12 00 10
E '.)
6 4 16 er~

14. A travelling salesman has to visit five cities. He wishes to start from a particular city, visit
each city once and then return to his starting point. The travelling cost
(in '000 Rs) of each city from a particular city is given below: (12M/14M)
V
To ciry
A B C D E
A 7J 2 5 7 1
2
...>-
-~
B 6 •f.; 3 8

r.:
C s 7 L -t 7
,:;
\... D 1~ -t 6 L 5
L.:..
E 1 3 2 8 "f_

,..
imum?
of the salesman so that the cost is min
What should be the sequence of visit
be as
y has a salesman who sho uld visit 6 cities and the cost would
15. A compan (12M/14M)
given below.
To city
3 -t 5 6

20 23 _1-
/ ]9 3--l
1 -::t:..

19 26 31 24
2:-- 2 21 ':IJ
' !'.j
26 28 00 15 36 26
E 3
0
...
!.J.. 4 r_) 16 25 ~ 13 18
40 23 31 :f _1 10
5 23
6 27 18 1.? 35 16 "f..

the optimum
cities once and only once. Determine
The salesman can visit each of the d?
ce to minimize the total distance travelled. What is the total distance travelle
sequen