An optimal assignment requires that the maximum number of lines that 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
• The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
• An optimal solution of an assignment problem can be obtained only if
• The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than
• Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
• If an opportunity cost value is used for an unused cell to test optimality, it should be
• The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
• An assignment problem can be solved by