To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are

Related MCQs

• The purpose of a dummy row or column in an assignment problem is to
• The dummy source or destination in a transportation problem is added to
• While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to
• The method used for solving an assignment problem is called
• The Hungarian method for solving an assignment problem can also be used to solve
• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
• An assignment problem is considered as a particular case of a transportation problem because
• Maximization assignment problem is transformed into a minimization problem by
• An assignment problem is a special case of transportation problem, where
• A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is