The feasible region represented by the constraints 4x+y ≥ 80, x+5y ≥ 115, 3x +2y ≤150, x,y ≥ 0 of an LPP is:
Correct Answer :
Region C
Solution :
Correct Answer: Region C
To determine which of the labeled regions (Region A, Region B, Region C, or Region D) represents the feasible region for the given Linear Programming Problem (LPP), we analyze each constraint one by one by identifying its boundary line and corresponding half-plane in the provided graph.
1. Constraint 1:
The boundary line is
, which passes through the points
and
as labeled on the axes.
Testing the origin
:
(False).
Therefore, the feasible region lies on or above/to the right of this line (away from the origin). This excludes Region D and Region A, which lie to the left/below this line.
2. Constraint 2:
The boundary line is
, which passes through the points
and
as shown in the graph.
Testing the origin
:
(False).
Thus, the feasible region must lie on or above this boundary line (away from the origin). This excludes Region B and Region A, which lie below this line.
3. Constraint 3:
The boundary line is
, which passes through the points
and
on the graph.
Testing the origin
:
(True).
Thus, the feasible region must lie below or to the left of this boundary line (towards the origin).
4. Non-negativity Constraints:
restrict the region to the first quadrant.
Intersection of All Regions:
Taking the intersection of the half-planes:
- Above
(excludes A and D)
- Above
(excludes A and B)
- Below
This leaves the shaded Region C (bounded by the corner points
,
, and
) as the only region satisfying all constraints simultaneously.
Access expert-curated educational resources and study materials—completely free.
Create, conduct, and manage professional online assessments with Mindyard. Perfect for teachers and institutes.
Copyright © 2026 Mindyard. All Rights Reserved.