The area bounded by all the given 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 solution must satisfy all the supply and demand 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 ___________
• 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 ___________
• In a given system of m simultaneous linear equations in n unknowns (m<n) there will be ________.
• If the given Linear Programming Problem is in its canonical form then primal-dual pair is ___________.
• If the given Linear Programming Problem is in its standard form then primal-dual pair is ____________.
• The customers of high priority are given service over the low priority customers is____________.