System of inequalities: A set of two or more inequalities that must be satisfied simultaneously. The solution is the intersection of all individual solution regions.
- Graph each inequality separately on the same coordinate plane
- Shade the solution region for each inequality
- Find the intersection of all shaded regions (the solution set)
Draw line y = 2x + 1 (solid line), shade below the line (since ≤)
Draw line y = -x + 3 (dashed line), shade above the line (since >)
The overlapping shaded area is the solution to the system
Shading rule: For y ≤ mx + b, shade below the line. For y > mx + b, shade above the line.
The solution is the region where both shadings overlap (bounded by both lines)
• Line type: Solid for ≤ or ≥, dashed for < or >
• Shading: Test a point to determine correct side
• Intersection: Solution is where all conditions are met
Boundary line: The line that separates the solution region from the non-solution region. Points on the boundary may or may not be included depending on the inequality symbol.
\(x + y \geq 4 \Rightarrow y \geq -x + 4\) and \(x - y < 2 \Rightarrow y > x - 2\)
Draw line y = -x + 4 (solid), shade above (since ≥)
Draw line y = x - 2 (dashed), shade above (since >)
Test point method: Use (0,0) to verify shading. For y ≥ -x + 4: 0 ≥ 4? No, so shade opposite side of (0,0).
The solution is the overlapping region above both lines
• Conversion: Solve for y to easily graph
• Test point: Use (0,0) if it's not on the line
• Intersection: Only points satisfying both inequalities
Bounded vs Unbounded: A solution region is bounded if it can be enclosed in a circle, unbounded otherwise. This system creates a triangular region.
Draw line y = x - 1 (solid), shade above
Draw horizontal line y = 3 (solid), shade below
Draw vertical line x = 0 (y-axis, solid), shade right
Intersections: (0, -1), (0, 3), (4, 3) form the triangle
Corner points: The vertices of the feasible region often contain optimal solutions in linear programming.
The solution is the triangular region with vertices at (0, -1), (0, 3), and (4, 3)
• Three constraints: Create a polygonal solution region
• Vertex identification: Find intersections of boundary lines
• Feasible region: Area satisfying all constraints
System of inequalities: Multiple inequalities that must all be satisfied simultaneously.
Solution region: The area where all inequalities in the system are true.
Boundary line: The line that represents the equality version of an inequality.
Feasible region: The solution region in optimization problems.
- Graph each inequality: Convert to slope-intercept form if needed, draw boundary line
- Determine line type: Solid for ≤ or ≥, dashed for < or >
- Shade solution region: Use test point method to determine correct side
- Find intersection: The solution is where all shaded regions overlap
- Identify vertices: Find corner points of bounded regions
• Line type matters: Solid includes boundary, dashed excludes it
• Intersection principle: Solution satisfies ALL inequalities simultaneously
• Optimization connection: Linear programming uses these regions to find maximum/minimum values
• Real-world applications: Constraints in business, economics, and engineering
Sample Problems Progression
Basic: y > x and y < 2
Intermediate: x + y ≤ 6 and x - y ≥ 2
Advanced: 2x + 3y ≤ 12, x ≥ 0, y ≥ 0
Question: How do I decide which side to shade when graphing an inequality? I always get confused about whether to shade above or below the line.
Answer: The test point method is foolproof for determining shading direction:
- Choose a test point NOT on the boundary line (usually (0,0) works if it's not on the line)
- Substitute the coordinates into the inequality
- If the statement is TRUE, shade the side containing the test point
- If FALSE, shade the opposite side
Example: For y > 2x + 1, test (0,0): 0 > 2(0) + 1 → 0 > 1 is FALSE, so shade the side NOT containing (0,0).
Alternative quick rule: For y > mx + b, shade above; for y < mx + b, shade below.
Question: What happens if the boundary lines of two inequalities are parallel? Does the system still have a solution?
Answer: It depends on the direction of the inequalities:
- Possibility 1: Parallel lines with compatible directions (both shading toward each other) → Solution exists between lines
- Possibility 2: Parallel lines with incompatible directions (shading away from each other) → No solution
- Possibility 3: One inequality completely encompasses the other → Solution is the smaller region
Example: y > x + 1 and y < x + 3 have parallel boundary lines and a solution band between them.
Example: y > x + 1 and y < x - 1 have parallel lines with no overlapping region → No solution.
Question: How can I verify that my solution to a system of inequalities is correct?
Answer: There are multiple verification methods:
- Test points: Pick a point inside the solution region and verify it satisfies ALL inequalities
- Boundary check: Points on solid boundaries should satisfy the corresponding inequality as equality
- Visual inspection: Ensure the shaded region represents the intersection of all individual solution regions
Example: For system y ≤ x + 2 and y ≥ -x + 1, pick point (1, 2): 2 ≤ 1 + 2 ✓ and 2 ≥ -1 + 1 ✓
Also verify that points outside the solution region fail at least one inequality.