Mongcal, Joshua Blaw G.

BUS CAL
Sec 1-MN Prof. Villanueva Jr.

Assignment Method: Maximization

- This particular type of problem can be solved by using Hungarian Method, but two criteria must be
present to be able to use the method:
o Balanced Assignment Problem (same # of rows and columns)
o Minimization
- To convert Maximization problem to Minimization, we perform these steps:

Step 1: Identify the number having the highest value within the matrix. Subtract all the elements from
the number having the highest value. [Now, you can start solving it by using Hungarian Method]

Step 2: Perform Row, then Column subtraction

- Under Row Subtraction, find within the row the number having the lowest value and subtract
all numbers from the lowest value. Perform this on all rows. The new matrix that would appear
would be the basis for the Column Subtraction.

- Using the matrix derived from performing Row subtraction, find the number within the column
having the lowest value and subtract all numbers from that lowest value. Perform this as well
on all columns.

Step 3: Draw the minimum number of lines to cover all zeros (0).

- For each row, find any 0 available. Strike-out the rows or columns that would be using the least
possible lines to cover all zeros (0).
- If the # of lines crossed to cover all zeros = order of the matrix; Proceed to STEP 6.
# of lines crossed to cover all zeros ≠ order of the matrix; Continue to STEP 4.

Step 4: Identify the minimum number that is in undeleted row/column.

- SUBTRACT the minimum undeleted value from all the undeleted values.
- ADD the minimum undeleted value at the intersection points of the present matrix.
- All other values are the same. (Copy to the new matrix)

Step 5: Perform again Step 3

Step 6: Once # of lines crossed to cover all zeros = order of the matrix; Find the optimal assignment.
- Use the zeros’ position from the ORIGINAL matrix in finding optimal solution requested from the given
problem.
EXAMPLE 1:

Step 1: Identify the number having the highest value within the matrix. Subtract all the elements from
the number having the highest value

A B C D

1 140 112 98 154

2 90 72 63 99

3 110 88 77 121

4 80 64 56 88

Step 2: Perform Row, then Column subtraction

- Under Row Subtraction, find within the row the number having the lowest value and subtract all
numbers from the lowest value. Perform this on all rows. The new matrix that would appear
would be the basis for the Column Subtraction.

A B C D A B C D

1 14 42 56 0 1 14 42 56 0

2 64 82 91 55 2 9 27 36 0

3 44 66 77 33 3 11 33 44 0

4 74 90 98 66 4 8 24 32 0

- Using the matrix derived from performing Row subtraction, find the number within the column
having the lowest value and subtract all numbers from that lowest value. Perform on all
columns.

A B C D A B C D
1 14 42 56 0 1 6 18 24 0
2 9 27 36 0 2 1 3 4 0
3 11 33 44 0 3 3 9 12 0
4 8 24 32 0 4 0 0 0 0
Step 3: Draw the minimum number of lines to cover all zeros (0).

- For each row, find any 0 available. Strike-out the rows or columns that would be using the least
possible lines to cover all zeros (0).

A B C D

1 6 18 24 0
0
2 1 3 4

3 3 9 12 0

4 0 0 0 0

STEP 4: The minimum number of lines to cover all zeros is 2, which is less than the order of the matrix,
therefore we cannot make assignments.
- SUBTRACT the minimum undeleted value from all the undeleted values.
- ADD the minimum undeleted value at the intersection points of the present matrix
- All other values are the same.

A B C D A B C D

0
1 6 18 24 1 5 17 23 0
0
2 1 3 4 0 2 0 2 3

3 3 9 12 0 3 2 8 11 0

4 0 0 0 0 4 0 0 0 1

INTERSECTION PT

Since the minimum number of lines A B C D

drawn to cover all zeros is less than the order of the
matrix (4), we cannot, again, make assignment. 1 5 17 23 0
Perform STEP 4 again until the resulting table would 0
2 2 3 0
look like the one shown below
3 2 8 11 0

4 0 0 0 1
 A B C D A B C D

1 5 17 23 0 1 5 15 21 0

2 0 2 3 0 2 0 0 1 0

3 2 8 11 0 3 2 6 9 0

4 0 0 0 1 4 0 0 0 3

Still, the minimum number of lines drawn is less than the order of the matrix (4) Repeat the STEP 4 and
then [STEP 5] perform row and column subtraction as stated in STEP 3 above to arrive at the following
table:

A B C D A B C D

1 5 15 21 0 1 3 13 19 0

2 0 0 1 0 2 0 0 1 2

3 2 6 9 0 3 0 4 7 0

4 0 0 0 3 4 0 0 0 5

STEP 6: Since the number of lines drawn equals the order of the matrix, it is now possible to determine
the optimal solution. Use the original matrix as basis for the amounts to be inputted.

A B C D
1 3 13 19 0
2 0 0 1 2
3 0 4 7 0
4 0 0 0 5

The optimal assignment is shows as follows:

1 D 154
2 B 72
3 A 110
4 C 56
Total 392
EXAMPLE 2:

Hours rendered per services offered by the firm

Accountant A B C D
1 40 60 55 85
2 55 85 88 85
3 28 40 40 60
4 40 60 55 55
Profit ($) per hour 8 3 6 5

Hours rendered per services offered by the firm

Accountant A B C D
1 320 180 330 425
2 440 225 528 425
3 224 120 240 300
4 320 180 330 275
STEP 1: Find the highest value within the matrix and subtract all of the values from that highest value.

Hours rendered per services offered by the firm

Accountant A B C D
1 208 348 198 83
2 88 303 0 103
3 304 408 288 228
4 208 348 198 253
STEP 2: Perform row subtraction and column subtraction
Row subtraction – Find the lowest value within a row and subtract all values to that lowest value.
Perform on all rows.

Hours rendered per services offered by the firm

Accountant A B C D
1 125 265 115 0
2 88 303 0 103
3 76 180 60 0
4 10 150 0 55

Column subtraction - Find the lowest value within each column and subtract all values to that lowest
value.

Hours rendered per services offered by the firm

Accountant A B C D
1 115 115 115 0
2 78 153 0 103
3 66 30 60 0
4 0 0 0 55
Draw the minimum number of lines to cover all zeros within the matrix.

Hours rendered per services offered by the firm

Accountant A B C D
1 115 115 115 0
2 78 153 0 103
3 66 30 60 0
4 0 0 0 55
Since the minimum lines drawn is less than the order of the matrix, we cannot make assignments. We
subtract the lowest uncovered value (= 30) from all uncovered values and add the same to the values lying
on the intersection of the lines drawn.

Hours rendered per services offered by the firm

Accountant A B C D
1 85 85 115 0
2 48 123 0 103
3 36 0 60 0
4 0 0 30 85

Since the minimum lines drawn now equals the order of the matrix, we can now make assignments. The
optimal assignments are given below:

Hours rendered per services offered by the firm

Accountant A B C D
1 85 85 115 0
2 48 123 0 103

3 36 0 60 0

4 0 0 30 85

The optimal assignment is as shown below:

Accountant Hours rendered per service Profit($)

1 D 425
2 C 528
3 B 120
4 A 320
Total USD 1393
Mongcal, Joshua Blaw G. Prof. Villanueva
Sec 1-MN BUSCAL May 15, 2019