In an LPP, the feasible region represented by the set off constraints , , , is

In an LPP, the feasible region represented by the set off constraints , , , is
Solution
The feasible region must satisfy ALL four constraints simultaneously.
Each constraint represents:
- points below or on the line
- points below or on the line
- points on or to the right of the y-axis
- points on or above the x-axis
For line :
When :
Point:
When :
Point:
For line :
When :
Point:
When :
Point:
Comparing the intercepts:
Line cuts y-axis at (lower)
Line cuts y-axis at (higher)
Line cuts x-axis at (lower)
Line cuts x-axis at (higher)
Line is more restrictive and creates a smaller region closer to the origin.
The feasible region satisfying all constraints:
Located in the first quadrant due to
Bounded by the line
Vertices: , , and
This triangular region is Region A.
Region B or C violate the constraint
Region A ∪ B includes points that don't satisfy all constraints
Therefore, the feasible region is Region A.
Related questions:
2024: 16 May Shift 1
2025: 29 May Shift 2
2024: 16 May Shift 1