Feasible Region definition
The feasible region is the set of all points that satisfy a system of constraints.
Feasible Region in a picture
How it works
To graph a system in two variables, find the points allowed by each constraint and keep their intersection. Include a boundary when all the relevant constraints allow equality there. A feasible region may be bounded, unbounded, empty, or lower-dimensional.
Worked examples
Describe the region satisfying x ≥ 0 and y ≥ 0.
It is the first quadrant together with the two nonnegative axes.
What happens when x ≥ 5 and x ≤ 2 must both hold?
The feasible region is empty.
Does the graph of x + y < 4 include the line x + y = 4?
No. The strict inequality excludes that boundary.
Common mistake
Use the overlap of all constraint sets. Points that satisfy only one inequality may fall outside the feasible region.
Quick check
Can a feasible region extend infinitely far?
Show answer
Yes. It may be unbounded.
Can one point be the entire feasible region?
Show answer
Yes, if it is the only point satisfying all the constraints.
Sources
Flashcard
Feasible Region
Reveal the definition
The feasible region is the set of all points that satisfy a system of constraints.
Effortless Math. “Feasible Region.” Math Dictionary.
