Assignment Practice Problem

1
Q4 1 2 3 4
1 2 3 4

A 1 4 6 3 A 0 3 5 2

B 9 7 10 9 B 2 0 3 2

C 4 5 11 7 C 0 1 7 3

D 8 7 8 5 D 3 2 3 0

Column reduction Row reduction

1 2 3 4
1 2 3 4
A
A 00 3 2 2
B
B 2 0 0 2
0
C
C 0 1 4 3
D
D 3 2 0 0
0

2
Q5
1 2 3 4 5 1 2 3 4 5

A 10 3 3 2 8 A

B 9 7 8 2 7 B

C 7 5 6 2 4 C

D 8 5 8 2 4 D

E 9 10 9 6 10 E

1 2 3 4 5 1 2 3 4 5

A A

B B

C C

D D

E E
3
 1 2 3 4 5

E
1 2 3 4 5

4
Q.6 A company solicits bids on each of the four projects from five contractors.
Only one project can be assigned to any contractor. The bids received (in
thousands) are given the table. Contractor D feels unable to carry out project 3,
therefore submits no bid. Use Hungarian method to find the set of assignments
with the smallest possible total cost

A B C D E
1 18 25 22 26 25
2 26 29 26 27 24
3 28 31 30 -- 31
4 26 28 27 26 29

5
 A B C D E A B C D E
1 18 25 22 26 25 1
2 26 29 26 27 24 2
3 28 31 30 -- 31 3 --
4 26 28 27 26 29 4
5 0 0 0 0 0 5

A B C D E
1
2
3 --
4
5

6
Q.7 The following information is available regarding four different jobs to be performed and
about the clerks capable of performing the jobs. Clerk II cannot be assigned to Job A and Clerk
III cannot be assigned to Job B. you are required to find out optimal assignment schedule and
total time taken to perform the jobs. Also find whether the given problem has more than one
optimal assignment schedule.
A B C D
A B C D clerks
clerks /jobs
/jobs
I
I 4 7 5 6
II -
II - 8 7 4
III -
III 3 - 5 3
IV
IV 6 6 4 2

A B C D A B C D
clerks clerks
/jobs /jobs
I I
II - II -
III - III -
IV IV 7
Q.8 Five workers are available to work with five machines and the respective cost
associated with each worker-machine assignment is given below. A sixth machine is
also available. Determine whether the new machine is accepted or not

M1 M2 M3 M4 M5 M6

W1 12 3 6 - 5 9

W2 4 11 - 5 - 3

W3 8 2 10 9 7 5

W4 - 7 8 6 12 10

W5 5 8 9 4 6 -

8
 M1 M2 M3 M4 M5
W1 12 3 6 - 5
W2 4 11 - 5 -
W3 8 2 10 9 7
W4 - 7 8 6 12
W5 5 8 9 4 6
M1 M2 M3 M4 M5
W1 -
W2 - -
W3
W4 -
M1 M2 M3 M4 M5 W5
W1 -
W2 - -
W3
W4 -
W5
9
 M1 M2 M3 M4 M5 M6 M1 M2 M3 M4 M5 M6
W1 - W1 -
W2 - - W2 - -
W3 W3
W4 - W4 -
W5 - W5 -

M1 M2 M3 M4 M5 M6 M1 M2 M3 M4 M5 M6
W1 - W1 -
W2 - - W2 - -
W3 W3
W4 - W4 -
W5 - W5 -

10
 M1 M2 M3 M4 M5 M6
W1 -
W2 - -
W3
W4 -
W5 -

M1 M2 M3 M4 M5 M6
W1 -
W2 - -
W3
W4 -
W5 -

11
Q.9 The captain of the team has to assign five middle batting positions to five
batsman The average runs scored by each batsman are as follows: find the
assignment of batsman to positions which would give maximum number of runs
Batsman Batting position
I II III IV V
P 40 40 35 25 50
Q 42 30 16 25 27
R 50 48 40 60 50
S 20 19 20 18 25
T 58 60 59 55 53

12
Bats Batting position
man
I II III IV V Convert to Minimization
P 20 20 25 35 10
Q 18 30 44 35 33
R 10 12 20 0 10
Bats Batting position
S 40 41 40 42 35 man
T 2 0 1 5 7 I II III IV V
P 10 10 15 25 0
Row reduction Q 0 12 26 17 15
Bats Batting position R 10 12 20 0 10
man S 5 6 5 7 0
I II III IV V T 2 0 1 5 7
P 10 10 14 25 0
Q 0 12 25 17 15
R 10 12 19 0 10
S 5 6 4 7 0 Column reduction
T 2 0 0 5 7
13
Bats Batting position
man
I II III IV V
P 10 10 14 25 0
Q 0 12 25 17 15
R 10 12 19 0 10
S 5 6 4 7 0
Bats Batting position
T 2 0 0 5 7 man
I II III IV V
P 10 10 14 25 0
Bats Batting position
man Q 0 12 25 17 15
I II III IV V R 10 12 19 0 10
P 6 6 10 21 0 S 5 6 4 7 0
Q 0 12 25 17 19 T 2 0 0 5 7
R 10 12 19 0 14
S 1 2 0 3 0
T 2 0 0 5 11
14
 Bats Batting position
man
I II III IV V
P 6 6 10 21 0
Q 0 12 25 17 19
R 10 12 19 0 14
Bats Batting position
man S 1 2 0 3 0
T 2 0 0 5 11
I II III IV V
P 40 40 35 25 50
Q 42 30 16 25 27
R 50 48 40 60 50
S 20 19 20 18 25
T 58 60 59 55 53

Total Runs=50+42+60+20+60=232
15
 TRAVELLING SALESMAN MODEL
Application:
• School bus routing
• Postal delivery

16
1. A B C D E A B C D E

A -- 12 24 25 15 A -- 0 12 13 3

B 6 -- 16 18 7 B 0 -- 10 12 1

C 10 11 -- 18 12 C 0 1 -- 8 2

D 14 17 22 -- 16 D 0 3 8 -- 2

E 12 13 23 25 -- E 0 1 11 13 --

A B C D E

A -- 0 4 5 2

B 0 -- 2 4 0

C 0 1 -- 0 1

D 0 3 0 -- 1

E 0 1 3 5 --
17
 A B C D E A B C D E
2.
A -- 50 90 20 140 A -- 30 70 0 90
B 50 -- 40 80 70 B 10 -- 0 40 30
C 90 40 -- 120 110 C 50 0 -- 80 70
D 20 80 120 -- 65 D 0 40 10 -- 45
0
E 140 70 110 65 -- E 75 5 45 0 --

A B C D E A B C D E A B C D E
A -- 30 70 0 60 A -- 25 65 0 85 A -- 25 25 0 45
B 10 -- 0 40 0 B 10 -- 0 45 0
B 10 -- 0 85 0
C 50 0 -- 80 40 C 50 0 -- 85 40
D 0 40 10 -- 15 C 0 0 -- 85 0
D 0 60 100 -- 15
0
D 0 100 10 -- 15
E 75 5 45 0 -- E 70 0 40 0 -- 0

E 30 0 0 0 18 --
 A B C D E
A B C D E
A -- 25 25 0 45 A -- 25 25 0 45
B 10 -- 0 85 0 B 10 -- 0 85 0
C 0 0 -- 85 0 C 0 0 -- 85 0
D 0 100 100 -- 15 D 0 100 100 -- 15

E 30 0 0 0 -- E 30 0 0 0 --

A B C D E A B C D E
A -- 25 25 0 45 A --
B 10 -- 0 85 0 B --
C 0 0 -- 85 0 C --
D 0 100 100 -- 15
D --
E 30 0 0 0 --
E --

19
 A B C D E A B C D E
3.
A -- 3 6 2 3 A --
B 3 -- 5 2 3 B --

C 6 5 -- 6 4 C --

D 2 2 6 -- 6 D --

E 3 3 4 6 -- E --

A B C D E A B C D E
A -- A --
B -- B --
C -- C --
D -- D --
E -- E --
20
4.
A B C D E A B C D E
A -- 6 12 6 4 A --
B 6 -- 10 5 4 B --
C 8 7 -- 11 3 C --
D 5 4 11 -- 5 D --
E 5 2 7 6 -- E --

A B C D E A B C D E A B C D E
A -- A -- A --
B -- B -- B --
C -- C -- C --
D -- D -- D --
E -- E -- E --

21
5.
A B C D E A B C D E
A -- 4 7 3 4 A --
B 4 -- 6 3 4 B --

C 7 6 -- 7 5 C --

D 3 3 7 -- 7 D --

E 4 4 5 7 -- E --

A B C D E A B C D E
A -- A --
B -- B --
C -- C --
D -- D --
E -- E --
22
 A B C D E A B C D E
6
A -- 2 5 7 1 A --
B 6 -- 3 8 2 B --
C 8 7 -- 4 7 C --
D 12 4 6 -- 5 D --

E 1 3 2 8 -- E --

A B C D E

A --

B --

C --

D --

E --
23