For the basic feasible solution to remain optimal

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
• Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal 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
• 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
• Which of the following statements is true with respect to the optimal solution of an LP problem