Maximization assignment problem

Presented by :

Aradhna Singh - 04
Sita pun - 30
Priyanka Kumari -33
Manti Kumari - 73
 Assignment Problem
★ Assignment Problem is a special type of linear programming problem where
the objective is to minimise the cost or time of completing a number of jobs
by a number of persons.

★ Assignment Problem is a problem solving techniques used to solve the

problem arising while distributing /Assigning the work to their various
problems.

★ Assigning activities / task to the workers.

★ Maximizing profit, sales and minimizing the cost.

 Assignment Problem
For example,

★ The head of the department may have 6 people available for

assignment and 6 jobs to fill.

★ Here the head may like to know which job should be assigned to
which person so that all tasks can be accomplished in the shortest
time possible.
 Maximization Problem

★ Maximization Problem is the problem certain facilities have to be

assigned to a number of jobs so as to maximise the overall
performance of the assignment.

★ Main objective for maximization assignment problem is to find the

optimum assignment which gives the maximum revenue / profits.

★ The problem can be converted into a maximization Problem and

solved by using “the Hungarian method “
 Practical Steps Involved Solving In
Maximisation
Step 1:

★ See whether Number of Rows is equal to Number of Columns. If yes,

problem is a balanced one;

★ if not, then adds a Dummy Row or Column to make the problem a

balanced one by allotting zero value or specific value (if any given) to
each cell of the Dummy Row or Column, as the case may be
 Practical Steps Involved Solving In
Maximisation
Step 2:
Derive Loss Matrix by deducting all elements from the largest element.
Step 3:
Row Subtraction: Subtract the minimum element of each row from all
elements of that row.
Note: If there is zero in each row, there is no need for row subtraction.
Step 4:
Column Subtraction: Subtract the minimum element of each column from all
elements of that column.

Note: If there is zero in each column, there is no need for column subtraction.
 Practical Steps Involved Solving In
Maximisation
Step 5:
Draw minimum number of Horizontal and/or Vertical Lines to cover all
zeros.
To draw minimum number of lines the following procedure may be
followed:
1. Select a row containing exactly one uncovered zero and draw a
vertical line through the column containing this zero and repeat the
process till no such row is left.
2. Select a column containing exactly one uncovered zero and draw a
horizontal line through the row containing the zero and repeat the
process till no such column is left.
 Practical Steps Involved Solving In
Maximisation
Step 6:
★ If the total lines covering all zeros are equal to the size of the
matrix of the Table, we have got the optimal solution; if not,
subtract the minimum uncovered element from all uncovered
elements and add this element to all elements at the intersection
point of the lines covering zeros.
Step 7:
★ Repeat Steps 5 and 6 till minimum number of lines covering all
zeros is equal to the size of the matrix of the Table.
 Practical Steps Involved Solving In
Maximisation
Step 8:
Assignment:
★ To make the assignment, select the single zero from each row and
circle this zero to make the assignment,then mark a cross(×) over
all zeros if lying in the column of the circled zero, showing that they
can't be considered for future assignment.

★ Continue in this manner until all the zeros have been examined.
Repeat the procedure for column also.
Note:
If there is more than one unmarked zero in any row or column, it
indicates that an alternative solution exists. In this case, select
anyone arbitrarily the answer will be same.
 Practical Steps Involved Solving In
Maximisation
Step 9:
★ Add up the value attributable to the allocation, which shall be the
minimum value.

Step 10:

★ Alternate Solution: If there are more than one unmarked zero in any
row or column, select the other one (i.e., other than the one
selected in Step 8) and then do the step 9 to get the optimal
assignment.
 Example of Maximisation Problem
Q.) The owner of a small machine shop has four
mechanics available to assign jobs for the day. Five jobs
are offered with expected profit for each mechanic on each
job which are as follows :
JOB
A B C D E
1 62 78 50 111 82
MECHANIC

2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
Find by using the assignment method,
the assignment of mechanics to the job
that will result in a maximum profit.
Which job should be declined?

SOLUTION →
STEP – 1

The given profit matrix is not a balanced problem as the number of

jobs is not equal to the number of mechanics. Hence we introduce a
Dummy mechanic 5 with all the elements 0

JOB
A B C D E
1 62 78 50 111 82
MECHANIC

2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
5 0 0 0 0 0
STEP – 2

Now we convert this profit matrix into loss matrix by subtracting

all the elements from the highest element 111

JOB
A B C D E
1 49 33 61 0 29
MECHANIC

2 40 27 50 38 52
3 24 19 0 40 30
4 63 47 24 34 31
5 111 111 111 111 111
STEP – 3

We subtract the smallest element from all the elements in the

respective row.

JOB
A B C D E
1 49 33 61 0 29
MECHANIC

2 13 0 23 12 25
3 24 19 0 40 30
4 39 23 0 10 7
5 0 0 0 0 0
STEP – 4

Since, Each column has minimum element as zero, we draw

minimum number of lines to cover all zeros.

JOB
A B C D E
1 49 33 61 0 29
MECHANIC

2 13 0 23 12 25
3 24 19 0 40 30
4 39 23 0 10 7
5 0 0 0 0 0
STEP – 5

We form the 2nd modified matrix by subtracting the smallest uncovered

elements from the remaining uncovered element and add to the element
which is at the point of intersection of lines.

JOB
A B C D E
1 49 40 68 0 29
MECHANIC

2 6 0 23 5 18
3 17 19 0 33 23
4 32 23 0 3 0
5 0 7 7 0 0
STEP – 6

Now, we make the assignment

JOB
A B C D E
1 49 40 68 0 29
MECHANIC

2 6 0 23 5 18
3 17 19 0 33 23
4 32 23 0 3 0
5 0 7 7 0 0
So, the optimum assignment is :

❖ A→ 5
❖ B→ 2 JOB MECHANIC
❖ C→ 3
❖ D→ 1 A 0
❖ E→ 4
B 84
❖ Since the 5th mechanic is a
Dummy. Job A is assigned to the C 111
5th mechanic, this job is declined.
D 111
❖ The maximum profit is given by :
84+111+111+80= Rs. 386 E 80