An optimal solution to a maximization problem is reached if all

Related MCQs

• Maximization assignment problem is transformed into a minimization problem by_________.
• An Linear Programming Problem have ____________ optimal solution
• If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is___________.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• If all the constraints of the primal problem in equations are of type less than or equal to then the constraints in the dual problem is ___________.
• A feasible solution to a linear programming problem _____.
• The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that__________.
• One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that_______.
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.