Scribd
Upload
19 views

Hello Students

This document summarizes the steps to solve a balanced assignment problem using the Hungarian method. It explains that the problem involves assigning trash bins (rows) to people (columns) with a given cost matrix. The method involves row reduction by subtracting the minimum value in each row from all elements in that row. Column reduction is then performed by subtracting the minimum value in each column from all elements in that column. Zeros are then selected in each row/column to assign bins to people, striking out corresponding zeros. The total minimum cost is calculated by summing the original cost matrix elements corresponding to the assignments.

Uploaded by

Abdul Adziz Kundaraan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Hello Students

This document summarizes the steps to solve a balanced assignment problem using the Hungarian method. It explains that the problem involves assigning trash bins (rows) to people (columns) with a given cost matrix. The method involves row reduction by subtracting the minimum value in each row from all elements in that row. Column reduction is then performed by subtracting the minimum value in each column from all elements in that column. Zeros are then selected in each row/column to assign bins to people, striking out corresponding zeros. The total minimum cost is calculated by summing the original cost matrix elements corresponding to the assignments.

Uploaded by

Abdul Adziz Kundaraan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Hello students. Now we shall solve an assignment problem.

First, we have
to check whether the given problem is balanced or unbalanced. If the
number of rows is equal to the number of columns, then the problem is said
to be a balanced assignment problem. If they are not equal, then it is an
unbalanced assignment problem. Now in this problem there are four rows
and four columns, so this is a balanced assignment problem. Now we have
to follow the Hungarian method in order to solve this problem. First we
have to do the row reduction. That is, we have to subtract the minimum
entry of each row from all the entries of the respective row in the cost
matrix. Now if we see in this problem in the first row, the minimum element
is 10. Now we have to subtract 10 from all the elements of the first row. So
ten minus ten will be 0,12 minus ten two and here it is 19 minus ten, so
nine and eleven minus ten it is one.
Similarly, the minimum element from second row is five. So if we subtract
five from all the elements of this row, we get 0523.
The minimum element in the third row is eleven so we have to subtract
eleven from all the elements. So twelve minus eleven is one and here it is
three, here two and zero.
Similarly, the minimum element of the last row is eight, so zero, four, three
and one.
Next we have to move on to the next step, which is column reduction. So
in this, we have to consider the matrix that we have obtained in step one.
Now we shall consider the first column. The least element of this column
has to be subtracted from the other elements. The least element is zero, so
we have to subtract zero from all the elements and definitely we will be
getting the same column to be repeated. Now if we see in this, the
minimum element is two, so we have to subtract two from each element of
this column. So zero, three, one and then four minus two, which is two. The
least element of the third column is two so we have to subtract two from all
the other elements. So this becomes 7001 and here the last column, the
minimum element is zero. So obviously one minus Zero is one 30 and you
get one over here.
Now we have to go to step three. So that is we have to start with first row
of the Matrix received in this step and we have to start examine how many
Zeros it has. Now, the idea of the problem is each trashbin has to be
assigned to one person. So now we have to check that each row and
column has 1,0. And so if we see in this row there are two Zeros so let us
not select any of the zero. Now here also in this row again we have two
Zeros. So we shall move on to check the third row. So here also we have
two zeros. And so we shall move on to the last row. So if we can see that in
the last row the only zero available is this zero. So definitely we have to
select this Zero for this row. So we shall select this zero. So once we are
done with that we have to strike out the corresponding zeros of that
column. So after selecting this we have to strike out this zero and this zero.
Now again we have to proceed with the same procedure. We have to
check the first row how many Zeros it has now. Now this zero has been
striken off so it has only one 0. So definitely that zero has to be selected for
this row. Now next we shall move on to the next row. Now again this row
has this single zero. So this has to be selected. Now because we have
selected this zero we have to check out the corresponding column. Now
when we check there is a zero over here. So we have to strike off this zero.
And so the only left out zero is this for the third row.
And if we see trashbin has been assigned to all the persons. Person
A(Erica) has been assigned Trashbin two. Person B(Krystel) has been
assigned Trashbin three. C(Novian) has been assigned Trashbin four and
D(Adriel) has been assigned Trashbin one. So we shall conclude the
problem by calculating the total minimum cost. Okay now Person A-B-C
and D. Now A has been assigned two. B is three, C has been assigned four
and D has been assigned one. Now we have to see the Toque cost value
from the original given matrix. Now in this place the original value given in
the matrix. The cost of that element is twelve. And over here we have
seven and then this. So eleven. So here it is twelve and here it is seven.
And then here it is eleven. And the last one is eight. And so this is eight. So
therefore. And so the total minimum cost. You have to add all this and you
have to find. So when we add all this we get 38 as the total minimum cost.
Hope you all have understood this problem

You might also like