All equality constraints can be replaced equivalently by _____________ inequalities

Related MCQs

• 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 ___________.
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• The solution must satisfy all the supply and demand constraints is called_____.
• The area bounded by all the given constraints is called _____________.
• If the constraints of an Linear Programming Problem has an in equation of greater than or equal to type, the variable to be added to are ___________
• An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ___________
• The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____.
• If all aij values in the entering variable column of the simplex table are negative, then _____.
• An optimal solution to a maximization problem is reached if all
• All the basis for a transportation problem is ____________.