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 that can be drawn through squares with zero opportunity cost be equal to the number of
• The method used for solving an assignment problem is called
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
• The Hungarian method for solving an assignment problem can also be used to solve
• An assignment problem is considered as a particular case of a transportation problem because
• 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
• An assignment problem is a special case of transportation problem, where
• While solving LP problem graphically, the area bounded by the constraints is called
• While solving an LP problem infeasibility may be removed by