The solution must satisfy all the supply and demand constraints is called_____.

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 area bounded by all the given constraints is called _____________.
• All equality constraints can be replaced equivalently by _____________ inequalities
• An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ___________
• When the total demand is equal to supply then the transportation problem is said to be _________
• When the total demand is not equal to supply then it is said to be __________.
• At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the index numbers are non-negative, the current solution is_____.
• The critical path satisfy the condition that _____.
• 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 ___________