The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is

Related MCQs

• An optimal solution of an assignment problem can be obtained only if
• In applying Vogel's approximation method to a profit maximization problem, row and column penalties are determined by:
• 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
• 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
• 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
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is: