The common region determined by all the constraints of an LPP is called the:
Abounded set
Bfeasible region
Ccorner point
Dobjective region
Answer & Solution
Correct answer: B. feasible region
The region satisfying all constraints simultaneously is the feasible region.
Keep practising Linear Programming
Browse all Linear Programming questions for AP Intermediate 2nd Year, or explore more Mathematics topics.
Related questions
Linear programming problems seek to maximise or:If the feasible region is unbounded, an optimum may:Linear programming numbersFeasible or infeasible?If the feasible region R is bounded, Z has:The optimal value of Z occurs at which points of the region?Linear programming problems here are solved by which method?Points within and on the boundary of the feasible region are: