Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.

Related MCQs

• In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
• While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.
• A feasible solution to a linear programming problem _____.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• A set of feasible solution to a Linear Programming Problem is ___________
• The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________.
• The Hungarian method used for finding the solution of the assignment problem is also called ___________.
• 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 _______.