The Hungarian method used for finding the solution of the assignment problem is also called ___________.

Related MCQs

• For finding an optimum solution in transportation problem ____________ method is used.
• 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 _______.
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.
• 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 _______.