Mathwords logoMathwords

Feasible Region — Definition & Example

A feasible region is the part of a graph where every constraint in a problem holds at the same time. It is the overlap of all the shaded inequality regions.

For a system of linear inequalities in xx and yy, the feasible region is the solution set of the system. Each inequality defines a half-plane, and the region is the intersection of those half-planes. The half-planes are closed for ≤\le or ≥\ge and open for << or >>. The region is always convex. It may be empty, which makes the system infeasible. It may also be unbounded. If it is nonempty and bounded, it is a convex polygon, possibly a degenerate one (a single point or a line segment). Each of its vertices lies where two boundary lines intersect.

Worked Example

Problem: Maximize P=3x+4yP = 3x + 4y subject to x+y≤6x + y \le 6, x+2y≤8x + 2y \le 8, x≥0x \ge 0, and y≥0y \ge 0.
Step 1: Graph each boundary line and shade the side that satisfies its inequality. The overlap is a four-sided region. Find the corner where the two slanted lines cross by solving them as a system. Substitute x=6−yx = 6 - y into the second equation.
x+y=6x+2y=8  ⇒  y=2,  x=4\begin{aligned} x + y &= 6 \\ x + 2y &= 8 \end{aligned} \;\Rightarrow\; y = 2,\; x = 4
Step 2: Find the corners on the axes. Each one must satisfy every constraint. (6,0)(6, 0) works because 6+2(0)=6≤86 + 2(0) = 6 \le 8. (0,4)(0, 4) works because 0+4=4≤60 + 4 = 4 \le 6. The axis intercepts (0,6)(0, 6) and (8,0)(8, 0) are not corners, because each one breaks the other constraint.
Vertices: (0,0), (6,0), (4,2), (0,4)\text{Vertices: } (0,0),\ (6,0),\ (4,2),\ (0,4)
Step 3: Evaluate the objective function at each vertex. On a closed, bounded, nonempty feasible region, a linear objective always has a maximum and a minimum, and each occurs at a vertex.
P(0,0)=0,P(6,0)=18,P(4,2)=20,P(0,4)=16P(0,0)=0,\quad P(6,0)=18,\quad P(4,2)=20,\quad P(0,4)=16
Answer: The maximum value is P=20P = 20, at the vertex (4,2)(4, 2).

Why It Matters

Feasible regions are the core of linear programming. You meet linear programming in Algebra 2, precalculus, and finite math courses through profit-maximization and cost-minimization word problems. The same idea runs operations research. Airlines use it to schedule crews, factories to plan production mixes, and dietitians to meet nutrient requirements at minimum cost.

Common Mistakes

Mistake: Treating every intersection of boundary lines as a corner of the feasible region. In the example, a student might test (0,6)(0, 6) or (8,0)(8, 0).
Correction: Check each candidate point against all of the constraints. In the example, (0,6)(0, 6) gives x+2y=12>8x + 2y = 12 > 8, so it lies outside the region. Only points that satisfy every inequality count as vertices.

Related Terms