While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.

Related MCQs

• 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______.
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are___________.
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal 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 _______.
• While solving a linear programming problem in feasibility may be removed by _________.
• In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
• An assignment problem can be solved by______.
• The Hungarian method used for finding the solution of the assignment problem is also called ___________.