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______.

Related MCQs

• While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
• The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____.
• The calculations of opportunity cost in the MODI method is analogous to a_____.
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are___________.
• In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
• An assignment problem can be solved by______.
• The assignment problem is a special case of transportation problem in which ______.
• In the optimal simplex table, Zj-Cj=0 value indicates _____________.
• If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is___________.