The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

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
• An optimal solution of an assignment problem can be obtained only if
• Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
• The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is
• Using the transportation simplex method, the optimal solution to the transportation problem has been found when
• LP theory states that the optimal solution to any problem will lie at
• To find the optimal solution to a linear programming problem using the graphical method
• For the basic feasible solution to remain optimal
• Which of the following statements is true with respect to the optimal solution of an LP problem
• If an iso-profit line yielding the optimal solution coincides with a constaint line, then