An optimal solution of an assignment problem can be obtained only if

Related MCQs

• The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is
• The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals
• The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that
• 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
• 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
• Using the transportation simplex method, the optimal solution to the transportation problem has been found when
• Which of the following statements is true with respect to the optimal solution of an LP problem
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
• Which of the following is used to come up with a solution to the assignment problem?