MTH601 Assignment#02 fall 2023/2024

Section Incharge : Saima Kanwal

Last date: 18-01-2024

Solved By: @OneStepToSucess

For paid Ms Word File contact On WhatsApp: 03191470250

Note: Don’t just copy paste; take idea from this file you can follow same
procedure make sure to check all calculations before submitting. If you found
any mistake correct it yourself.
Question:

Find maximum solution of the following Assignment problem.

30 37 40 28 40
40 24 27 21 36
40 32 33 30 35
25 38 40 36 36
29 62 41 34 39

Solution:

Here the problem is of Maximization type and convert it into minimization by subtracting
it from maximum value 62.

32 25 22 34 22
22 38 35 41 26
22 30 29 32 27
37 24 22 26 26
33 0 21 28 23

Here Given problem is balanced.

Step#01:

Find out the each row minimum element and subtract it from that row.

10 3 0 12 0 (-22)
0 16 13 19 4 (-22)
0 8 7 10 5 (-22)
15 2 0 4 4 (-22)
33 0 21 28 23 (-0)

Step-2:

Find out the each column minimum element and subtract it from that column.

10 3 0 8 0
0 16 13 15 4
0 8 7 6 5
15 2 0 0 4
33 0 21 24 23
(-0) (-0) (-0) (-4) (-0)

Iteration # 01:

Step #03:

a. Identify rows with exactly one unmarked 0. Make an assignment to this single 0 by make
a square ( [0] ) around it and cross off all other 0 in the same column.
b. Identify columns with exactly one unmarked 0. Make an assignment to this single 0 by
make a square ( [0] ) around it and cross off all other 0 in the same rows.
c. If a row and/or column has two or more unmarked 0 and one cannot be chosen by
inspection, then choose the cell arbitrarily.
d. Continue this process until all 0 in rows/columns are either assigned or cross off ( 0 ).

Row-wise & column-wise assignment shown in table:

10 3 [0] 8 0
[0] 16 13 15 4
0 8 7 6 5
15 2 0 [0] 4
33 [0] 21 24 23

Step-4:

Number of assignments = 4, number of rows = 5

which is not equal, so solution is not optimal.
Step-05:

Draw a set of vertical and horizontal line to cover all zeros.

10 3 [0] 8 0
[ 0] 16 13 15 4
0 8 7 6 5
4
1 2 0 [0]
35 [0] 21 24 23
3

Step-6:

Develop the new revised table by selecting the smallest element, among the cells not covered by
any line (which is 4)
Subtract 4 from every element in the cell not covered by a line.
Add 4 to every element in the intersection cell of two lines.

14 3 0 8 0
0 12 9 11 0
0 4 3 2 1
19 2 0 0 4
37 0 21 24 23

Iteration #02:

Repeating Step # 03:

Row-wise & column-wise assignment shown in table:

Row-wise & column-wise assignment shown in table.

14 3 [0] 8 0
0 12 9 11 [0]
[0] 4 3 2 1
19 2 0 [0] 4
37 [0] 21 24 23

Step-4:
Number of assignments = 5, number of rows = 5
which is equal, so solution is optimal

So, the Maximum or optimal Solution is:

= 40+36+40+36+62

= 214