Fall 2023 MTH601

Operation Research Assignment No 2

BC-19020202060
ANSWER.

The given matrix is given that

Job

Person 1 2 3 4

A 42 35 28 21

B 30 25 20 15

C 30 2 20 15

D 24 20 16 12

STEP 1:

The matrix is in the form of nxn hence, we can say that the order of the matrix is 4

Subtract minimum value in rows with each value

Job

Person 1 2 3 4

A 21 14 7 0

B 15 10 5 0

C 28 0 18 13

D 12 8 4 0
STEP 2 :

Subtract the minimum value in colums

Job

Person 1 2 3 4

A 9 14 3 0

B 3 10 1 0

C 16 0 14 13

D 0 8 0 0

So, here is minimum number of line (N) = 3

STEP : 4

Uncovered elements = - x

Intersection elements = +x

Line elements are same

The smallest num of uncover elements is 1, subtract 1 with uncover element

Job

Person 1 2 3 4

A 8 13 2 0

B 2 9 0 0

C 16 0 14 13

D 0 8 0 0

Now n = N, Hence the matrix is optimal

Assign jobs
 PERSON JOBS

A 4

B 3

C 2

D 1

Optimal assignment of job = 21+20+2+24 = 67