Learn · Algebra I

Overlap of inequality constraints

Find the common feasible region and test complete solutions.

Lesson 4 of 4About 40 minutesTEKS §111.39(c)(3)(H)

Original curriculum. These lessons and questions have not been independently reviewed.

01 · Learn the idea

A solution belongs to both sets

For y≥x+1 and y≤−2x+7, draw both solid boundaries. The feasible region lies above the first and below the second. Boundaries meet where x+1=−2x+7, so at (2,3). The region continues left of that intersection unless extra context restrictions apply.

Point (1,3) works because 3≥2 and 3≤5. Point (3,4) meets the first condition but fails the second because 4≤1 is false. Satisfying one inequality is not sufficient.

02 · Build understanding

Identify impossible or restricted choices

Graph y>x+2 together with y≤x−1. The parallel boundaries leave no overlap: a number cannot be greater than x+2 and at most x−1 at once. A system can be infeasible even though each inequality separately has many solutions.

For a resource context, add restrictions such as nonnegative whole counts only when the quantities require them. A shaded region can contain points that are mathematically valid but impossible as item counts.

03 · Build understanding

Worked example: graph a system and describe the overlap

Graph the system y > x − 4 and y ≤ −0.5x + 2. Graph one inequality at a time, then keep only the part shaded twice. The graph shows both boundaries and the two shaded sides.

Step 1: Graph the first boundary, y = x − 4. It passes through (0, −4) and (4, 0). The symbol > is strict, so draw it dashed, and shade above it.

Step 2: Graph the second boundary, y = −0.5x + 2. It passes through (0, 2) and (4, 0). The symbol ≤ includes the line, so draw it solid, and shade below it.

Step 3: Find where the boundaries meet, because that point is the corner of the overlap. Set x − 4 = −0.5x + 2. Add 0.5x and add 4 to get 1.5x = 6, so x = 4 and y = 0. The corner is (4, 0).

Step 4: Describe the overlap. It is the wedge to the left of (4, 0), above the dashed line and on or below the solid line. On the y-axis, for instance, it runs from just above −4 up to 2.

Step 5: Check points in both original inequalities. For (0, 0): 0 > −4 is true and 0 ≤ 2 is true, so it is a solution. For (0, 3): 3 ≤ 2 is false, so it fails. For (6, 0): 0 > 2 is false, so it fails. The corner (4, 0) fails too, because 0 > 0 is false: it sits on the dashed line. On the graph, an open circle marks a point that is not a solution, such as (4, 0) and (0, −4). The filled point (0, 2) is on the solid line and is a solution.

(4, 0)(0, −4)(0, 2)
  • y = x − 4
  • y = −0.5x + 2
The dashed line y = x − 4 and the solid line y = −0.5x + 2 meet at (4, 0), and the overlap is the wedge to the left of that point.

04 · Build understanding

Worked example: two limits on a garden bed

A garden club is filling a bed with x tomato plants and y pepper plants. The bed holds at most 30 plants. Tomato plants cost $4, pepper plants cost $2, and the club can spend at most $80.

Step 1: Write one inequality per limit. Space: x + y ≤ 30, counted in plants. Money: 4x + 2y ≤ 80, counted in dollars.

Step 2: Graph each solid boundary from its intercepts. The space line joins (30, 0) and (0, 30). The money line joins (20, 0) and (0, 40). Shade toward the origin for each, since 0 plants cost $0 and break neither limit.

Step 3: Find where the boundaries cross. Double the space equation to get 2x + 2y = 60 and subtract it from 4x + 2y = 80. That leaves 2x = 20, so x = 10 and y = 20. Check: 10 + 20 = 30 plants and 4(10) + 2(20) = 80 dollars. On the graph, (10, 20) is where the two lines cross.

Step 4: Test plans against both limits. For 12 tomato and 15 pepper plants, the count is 27 and the cost is 48 + 30 = 78 dollars, so the plan works. For 15 and 12, the count is still 27, but the cost is 60 + 24 = 84 dollars, which is over budget. For 5 and 28, the cost is only 20 + 56 = 76 dollars, but 33 plants do not fit.

Step 5: Apply the context. Plant counts are whole numbers that cannot be negative, so the usable plans are the whole-number points in the overlap with x ≥ 0 and y ≥ 0. The graph shades below both lines everywhere, so read only the part of the shading that is on or above the x-axis and on or to the right of the y-axis.

(10, 20)(0, 30)(20, 0)
  • x + y = 30
  • 4x + 2y = 80
The space line x + y = 30 and the money line 4x + 2y = 80 cross at (10, 20), and the region below both lines is shaded.

05 · Build understanding

Parallel boundaries can still overlap

Parallel boundary lines do not always mean an empty system. Take y > 2x − 3 and y < 2x + 1. Both lines have slope 2, and the second sits 4 units above the first.

The first inequality shades above the lower line and the second shades below the upper line, so the overlap is the strip between the two dashed lines. The origin is in the strip: 0 > −3 is true and 0 < 1 is true. The point (0, 4) is above both lines and fails, because 4 < 1 is false. The point (0, 1) is on the upper dashed line and fails too, because a dashed line is not included: 1 < 1 is false. The graph marks it with an open circle.

Reverse both symbols to y < 2x − 3 and y > 2x + 1 and the shaded sides point away from each other. Then nothing is shaded twice and the system has no solution.

(0, 0)(0, 1)
  • y = 2x − 3
  • y = 2x + 1
The overlap of y > 2x − 3 and y < 2x + 1 is the strip between two dashed parallel lines, with (0, 0) inside it and (0, 1) on its edge.

06 · Build understanding

Three mistakes to watch for

Testing a point in only one inequality. For the system y < x + 1 and y ≥ 4 − x, the point (1, 1) passes the first test, since 1 < 2. It fails the second, since 1 ≥ 3 is false. A point shaded once is not a solution.

Counting the corner without checking it. In that same system the boundaries meet where x + 1 = 4 − x, at (1.5, 2.5). The first inequality is strict, and 2.5 < 2.5 is false, so the corner is not a solution. A corner counts only when both boundaries are solid.

Forgetting to reverse the symbol when you solve for y. To graph x − y ≤ 2, subtract x to get −y ≤ −x + 2, then multiply by −1 and reverse: y ≥ x − 2. Shade above that line, not below. The origin confirms it: 0 − 0 ≤ 2 is true, and 0 ≥ −2 is true.

Apply and explain

Your turn

Graph y≥2x−1 and y<−x+5. Label the boundary intersection and explain whether that point is included. Test (0,0),(1,2),(2,3), and (3,0) in both inequalities. Describe what changes if only nonnegative whole-number coordinates are meaningful.

Use paper or explain your thinking aloud before opening the solution.

Check your reasoning

The boundaries meet at (2,3), but that point is excluded by the strict second inequality. (0,0) and (1,2) work; (2,3) and (3,0) fail. Context restrictions leave only integer lattice points in the first quadrant that meet both original conditions.

  • Both boundaries and overlap clear
  • Mixed strict/non-strict endpoints handled
  • All candidate points tested twice
  • Continuous region distinguished from allowed counts

Ready to practice?

Try the questions, get feedback, and review your reasoning.

Overlap of inequality constraints practice →