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

Related MCQs

• 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_________.
• Maximization assignment problem is transformed into a minimization problem by_________.
• The assignment problem is a special case of transportation problem in which ______.
• The similarity between assignment problem and transportation problem is _______.
• The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________.
• In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
• An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______.
• The assignment algorithm was developed by ____________.
• The calculations of opportunity cost in the MODI method is analogous to a_____.