To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
A) n
B) 2n
C) n-1
D) 2n-1

Question

Quizplus · Accepted Answer

In the MODI (Modified Distribution) method for solving an assignment problem, the number of dummy allocations needed to be added is n-1 to ensure that there are exactly n allocations (assignments) for an n x n cost matrix. This is necessary for the initial feasible solution to be a basic feasible solution, which requires exactly n allocations.

To Proceed with the MODI Algorithm for Solving an Assignment