Machine-translated by Google. Questions are authored in English.
Top

Discussion

The Hungarian method for the assignment problem is based on the fact that :

  • A.The optimal assignment is not affected if a constant is subtracted from any row or column
  • B.The value of the objective function is not affected by adding or subtracting a constant from any row or column
  • C.The optimal assignment is not affected by adding or subtracting a constant from any row or column
  • D.The optimal assignment is not affected if each entry in the cost matrix is treated separately to obtain sufficient number of zeros

Answer: C

The Hungarian method rests on the fact that the optimal assignment is not affected by adding or subtracting a constant from any row or column.

Adding or subtracting a constant from every entry of a row (or column) changes the cost of every complete assignment by exactly that constant, because every assignment uses exactly one cell in each row and column. The ranking of assignments, and so the optimum, stays the same. The method uses this to reduce rows and columns until enough zeros appear.

Option A states only the subtraction half of the theorem. Option B is wrong because the objective value does change, by the constant. Option D misdescribes the procedure: entries are reduced row by row and column by column, not one at a time.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.