Page 147 - DCOM303_DMGT504_OPERATION_RESEARCH
P. 147
Operations Research
Notes Inference
Therefore, the minimum man hours required to complete the assignment are 41.
Task Show that the optimal solution of an assignment problem is unchanged if we add
or subtract the same constant to the entries of any row or column of the cost matrix.
7.4 Hungarian Approach
The systematic procedure to be followed while solving assignment problems under Hungarian
Approach is picturized in the chart shown below:
Figure 5.1: Diagrammatic Representation of Hungarian Approach
The credit of developing an algorithm goes to Hungarian mathematician D. Konig and later on,
it became popular as Hungarian method. This technique is used to solve more typical problems,
viz., assignment of chines to jobs, assignment of salesmen to sales territories, assignment of
workers to various tasks, vehicles to routes, contracts to bidders, etc.
142 LOVELY PROFESSIONAL UNIVERSITY
