The region satisfying all constraints is called:
AUnbounded limit
BFeasible region
CInfeasible area
DObjective value
Answer & Solution
Correct answer: B. Feasible region
1. Some points satisfy every constraint at once.
2. They form a region on the graph.
3. That is the feasible region.
4. So the answer is the feasible region.
_Source: syllabus Mathematics, Ch 12 'Linear Programming'_
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: