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

• The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals
• For the basic feasible solution to remain optimal
• 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 to an LP problem
• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
• Which of the following is used to come up with a solution to the assignment problem?
• Which method usually gives a very good solution to the assignment problem?
• An optimal solution of an assignment problem can be obtained only if
• In linear programming problem if all constraints are less than or equal to, then the feasible region is