Scribd
Upload
26 views

Hungarian Assignment Method

Topic of operation Research

Uploaded by

Payal Singh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

Hungarian Assignment Method

Topic of operation Research

Uploaded by

Payal Singh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Hungarian Assignment Method:

The assignment method- (Hungarian mathematician D. Konig).


Step 1- Determine the cost table from the given problem.
(a) If the number of sources is equal to number of destination, go to step 3.
(b) The number of sources is not equal to number of destinations, go to step 2.
Step 2- Add a dummy source or dummy destination, so that the cost table becomes a square matrix
. The cost entries of dummy source/destinations are always zero.
Step 3- Locate the smallest element in each row of the given cost matrix and then subtract the same
from each element of that row.
Step 4- In the reduced matrix obtained in step 3 locate the smallest element of each column & then
subtract the same from each element of that column. Each column & row now have at least one
zero.
Step 5- In the modified matrix obtained in step 4 search for an optimal assignment as follows-
(a) Examine the rows successively until a row with signal zero is found. Enrectangle () this
zero & cross off (x) all other zeros in its column. Continue in this manner until all the rows
have been taken care of.
(b) Repeat the procedure for each column of the reduced matrix.
(c) If a row and/or column has two or more zero’s and one cannot be chosen by inspection then
a arbitrary any one of these zeros and cross off all other zeros of that row/column.
(d) Repeat (a) through (c) above successively untill the chain of assigning () or cross (x) ends.
Step 6- If the number of assignments () are equal to n (order of the cost matrix) an optimum
solution is reached the number of assignments are less than n (order of the matrix) go to the next
step.
Step 7- Draw a minimum number of horizontal and/or vertical lines to cover all the zeros of the
reduced matrix. This can be conveniently done by using a simple procedure.
(a) Mark () rows that do not have any assigned zero.
(b) Mark () columns that have zero’s in the marked rows.
(c) Mark() rows that have assigned zero’s in the marked columns.
(d) Repeat (b) & (c) until chain of marking is completed. .
(e)Draw lines through all the unmarked rows & marked columns. This gives us the desired
minimum number of lines.
Step 8- Develop the new revised cost matrix as follows.
(a) Find the smallest element of the reduced matrix not covered by any of the lines.
(b) Subtract this element from all the uncovered elements and add the same to all the elements
lying at the intersection of any two lines.
Step 9- Go to step 9 & repeat the procedure until an optimum solution is attained.

You might also like