UNIT 2 CHAP 2 ASSIGNMENT By Upasana Dhanda

Let’s learn another quantitative technique for solving

assignment problems
Solve questions
in ‘virtual’ class itself.
HUNGARIAN ASSIGNMENT METHOD (HAM)
QUES 1. TIME TAKEN (MINUTES) BY WORKER ON JOB
Worker/Job A B C D

1 45 40 51 67

2 57 42 63 55

3 49 52 48 64

4 41 45 60 55

Find the optimal assignment of jobs to workers.

QUES 2. COST ON JOB BY EACH MACHINIST
Worker/Job 1 2 3 4 5

A 10 3 3 2 8

B 9 7 8 2 7

C 7 5 6 2 4

D 3 5 8 2 4

E 9 10 9 6 10

Find the optimal assignment of jobs and cost involved.

SPECIAL CASES
UNBALANCED PROBLEMS
➢When no. of rows are equal to no. of columns,
problem is balanced.
➢If not, then problem is unbalanced and we will
add a dummy row/column with cost/value assigned
as 0 to make the problem balanced.
➢And then solve normally.
CONSTRAINT PROBLEMS
➢When a worker cannot a certain job, then to cope
up with such constraint problems, we assign a vey
large number M to that cell and solve normally.
QUES 3. COST ON JOB BY EACH MACHINIST
Worker/Job J1 J2 J3 J4 J5

P1 27 18 --------- 20 21

P2 31 24 21 12 17

P3 20 17 20 ------- 16

P4 22 28 20 18 27

Find the optimal assignment of jobs and cost involved.

QUES 4:
UNIQUE AND MULTIPLE OPTIMAL SOLUTIONS
Worker/Job 1 2 3 4 5

A 25 18 32 20 21

B 34 25 21 12 17

C 20 17 20 32 16

D 20 28 20 16 27
MAXIMIZATION PROBLEMS
➢First, convert it into minimization type by
subtracting each element from maximum element in
table.
➢Solve normally.
 QUES 5: GIVEN SALES REVENUE IN THOUSANDS
OF RUPEES FOR SALESMEN AND DISTRICTS
Salesman D1 D2 D3 D4 D5
/District
S1 40 46 48 36 48

S2 48 32 36 29 44

S3 49 35 41 38 45

S4 30 46 49 44 44

S5 37 41 48 43 47