Solution region: The area of the coordinate plane that contains all points satisfying the inequality.
- Graph the boundary line (replace inequality with equality)
- Determine if the line is solid (≤ or ≥) or dashed (< or >)
- Choose a test point not on the boundary line
- Substitute the test point into the original inequality
- Shade the side of the line that contains points satisfying the inequality
Find intercepts: when x=0, y=4 → point (0,4); when y=0, x=6 → point (6,0)
Since the inequality is ≤ (includes equals), draw a solid line to indicate points on the line are part of the solution.
Use the origin (0,0) as it's not on the boundary line: 2(0) + 3(0) = 0
Is 0 ≤ 12? Yes, so (0,0) satisfies the inequality.
Shade the side of the line containing (0,0), which is below the line.
Test (1,1): 2(1) + 3(1) = 5 ≤ 12 ✓
The solution region is the area below the solid line 2x + 3y = 12, including the line itself.
• Solid Line: Use for ≤ or ≥ (includes boundary points)
• Test Point Method: Determines which side of the boundary to shade
• Half-Plane: The solution region is one of the two half-planes divided by the boundary
System solution region: The intersection of all individual solution regions in the system.
Solid line y = x - 1, shade above the line
Solid line y = -x + 3, shade below the line
The solution is where both shaded regions overlap - between the two lines
Test (1,1): For y ≥ x - 1: 1 ≥ 1 - 1 → 1 ≥ 0 ✓
For y ≤ -x + 3: 1 ≤ -1 + 3 → 1 ≤ 2 ✓
Intersection of y = x - 1 and y = -x + 3: x - 1 = -x + 3 → 2x = 4 → x = 2, y = 1
Vertex: (2, 1)
The region is bounded by the two lines and extends infinitely downward
The solution is the intersection of the regions y ≥ x - 1 and y ≤ -x + 3, forming a wedge shape.
• Intersection: Solution is where ALL individual solution regions overlap
• Multiple Constraints: Each inequality adds a constraint to the solution
• Convexity: The intersection of convex regions is convex
Feasible region: The solution region of a system of inequalities, often bounded by coordinate axes and other constraints.
Solid line x + y = 4, shade below the line
Solid vertical line x = 0 (y-axis), shade to the right
Solid horizontal line y = 0 (x-axis), shade above
The solution is where all three shaded regions overlap - a triangle in the first quadrant
Intersection points: (0,0) - axes intersection
(0,4) - y-axis and x + y = 4
(4,0) - x-axis and x + y = 4
Test interior point (1,1): x + y = 2 ≤ 4 ✓, x = 1 ≥ 0 ✓, y = 1 ≥ 0 ✓
The solution is the triangular region in the first quadrant bounded by the coordinate axes and the line x + y = 4.
• Multiple Constraints: Each inequality adds a boundary to the region
• First Quadrant: x ≥ 0 and y ≥ 0 restrict to non-negative coordinates
• Vertices: Corner points are intersections of boundary lines
Solution region: The set of all points that satisfy the inequality or system of inequalities.
Boundary line: The line that separates the solution region from the non-solution region.
Feasible region: The solution region of a system of inequalities.
Vertex: A corner point of a polygonal solution region.
- Identify boundary: Convert inequality to equation to find boundary line
- Determine line type: Solid for ≤ or ≥, dashed for < or >
- Choose test point: Select a point not on the boundary line
- Test inequality: Substitute point into original inequality
- Shade region: Shade side containing points that satisfy the inequality
- For systems: Find intersection of all individual solution regions
Single inequality: Divides plane into two half-planes, one of which is shaded.
System of inequalities: Solution is intersection of all individual solution regions.
Vertex identification: Intersection points of boundary lines that form the corners of the region.
Bounded vs Unbounded: Bounded regions have finite area, unbounded extend infinitely.
- Pattern method: Use different shading patterns for each inequality in a system
- Layering: Overlay multiple shaded regions to visualize intersection
- Vertex calculation: Find intersection points algebraically
- Verification: Test points in the final region against all constraints
• Intersection: System solution is intersection of all individual solution regions
• Convexity: The solution region is always a convex set
• Boundary Inclusion: Solid lines include boundary, dashed exclude it
• Consistency: All inequalities must be satisfied simultaneously
Definitions of Key Concepts:
Solution Region: The area of the coordinate plane that contains all points satisfying a given inequality or system of inequalities.
Boundary Line: The line obtained by replacing the inequality symbol with an equals sign, which separates the solution region from the non-solution region.
Feasible Region: The solution region of a system of inequalities, representing all points that satisfy all constraints simultaneously.
Test Point: A point used to determine which side of the boundary line contains the solutions to the inequality.
Vertex: A corner point of a polygonal solution region, located at the intersection of two or more boundary lines.
Half-Plane: One of the two regions created when a line divides the coordinate plane.
Core Rules and Principles:
Line Type Rule: Use a solid line for ≤ or ≥ (includes boundary points), and a dashed line for < or > (excludes boundary points).
Shading Rule: After testing a point, shade the half-plane that contains points satisfying the inequality.
Intersection Rule: For systems of inequalities, the solution is the intersection of all individual solution regions.
Convexity Rule: The solution region of linear inequalities is always a convex set.
Step-by-Step Methods and Procedures:
- Identify the boundary line: Replace the inequality symbol with an equals sign to get the boundary equation.
- Determine line type: Draw a solid line for ≤ or ≥, dashed for < or >.
- Graph the boundary line: Use intercepts or slope-intercept form to plot the line.
- Select a test point: Choose a point not on the boundary line (often (0,0) if it's not on the line).
- Substitute and evaluate: Plug the test point into the original inequality to see if it's true or false.
- Shade appropriately: If the test point satisfies the inequality, shade that side of the line; otherwise, shade the other side.
- For systems: Repeat for each inequality and find the intersection of all shaded regions.
- Verify: Check that a point in the shaded region satisfies the original inequality.
Examples from Simple to Advanced:
Simple Example: y < x + 2 - Boundary: y = x + 2 (dashed line) - Test (0,0): 0 < 0 + 2 → 0 < 2 ✓ - Shade below the line
Intermediate Example: \(\begin{cases} y \geq -x + 1 \\ y \leq x + 3 \end{cases}\) - Two boundary lines: y = -x + 1 (solid) and y = x + 3 (solid) - Test point (0,0): satisfies first (0 ≥ 1 ✗) but not second (0 ≤ 3 ✓) - Solution is the intersection of both regions
Advanced Example: \(\begin{cases} 2x + 3y \leq 12 \\ x \geq 0 \\ y \geq 0 \\ x + y \geq 2 \end{cases}\) - Four constraints creating a quadrilateral region - Requires finding intersection points of all boundary lines - Solution is the area satisfying all four constraints
Tips, Tricks, and Common Pitfalls:
Tips:
- Always use (0,0) as a test point unless it's on the boundary line
- For y < mx + b, remember "less than means shade low"
- For x < a, shade to the left of the vertical line
- Check your work by verifying that points in the shaded region satisfy the inequality
- For systems, use different colors or patterns to distinguish each inequality's region
Common Pitfalls:
- Using the wrong line type (solid vs dashed)
- Shading the wrong side of the boundary line
- Forgetting to consider all constraints in a system
- Choosing a test point that lies on the boundary line
- Mistaking union for intersection in systems
Tricks:
- For y > mx + b, shade the side containing higher y-values
- For x > a, shade to the right of the vertical line
- Remember that the boundary line is part of the solution only for ≤ and ≥
- Use the origin test when possible as it simplifies calculations
- Sketch the final region clearly after considering all constraints
Key Notes for Memorization:
Line Types: ≤ and ≥ → Solid line, < and > → Dashed line
Shading Direction: For y < mx + b → shade below, y > mx + b → shade above
System Solutions: Always intersection (AND) not union (OR)
Test Point Strategy: If test point satisfies inequality → shade that side
Convexity: Solution regions of linear inequalities are always convex
Learning Strategies:
Start by mastering the basic shading procedure with single inequalities. Focus on understanding why we use solid vs dashed lines. Practice with various forms of inequalities (slope-intercept, standard form, vertical/horizontal lines). Connect the algebraic representation to the geometric representation. Use the test point method consistently to develop reliable habits.
For systems, practice identifying how multiple constraints interact. Work on finding vertices by solving systems of equations. Connect the graphical solution to the algebraic solution by verifying that points in the region satisfy all inequalities. Pay attention to bounded versus unbounded regions and their characteristics.
Questions & Answers
Question: How do I know which side of the boundary line to shade when dealing with inequalities in standard form?
Answer: The test point method works regardless of the form of the inequality. Here's how:
- Graph the boundary line: Convert the inequality to an equation and graph it (solid for ≤ or ≥, dashed for < or >)
- Choose a test point: Pick a point not on the boundary line (the origin (0,0) is often easiest if it's not on the line)
- Substitute: Plug the coordinates of the test point into the original inequality
- Evaluate: If the statement is true, shade the side containing the test point; if false, shade the opposite side
For example, with 2x + 3y < 6, test (0,0): 2(0) + 3(0) < 6 → 0 < 6 ✓, so shade the side containing (0,0).
Alternatively, you can convert to slope-intercept form (y < -⅔x + 2) to see the direction more clearly.
Question: What should I do if the origin (0,0) is on the boundary line?
Answer: If the origin is on the boundary line, you need to choose a different test point. Here are good alternatives:
- (1, 0): A point on the positive x-axis
- (0, 1): A point on the positive y-axis
- (-1, 0): A point on the negative x-axis
- (0, -1): A point on the negative y-axis
For example, if graphing y ≤ 2x (which passes through (0,0)), test (1,0): 0 ≤ 2(1) → 0 ≤ 2 ✓
Choose any point that is clearly not on the boundary line. The important thing is that the point is easy to substitute into the inequality.
Remember: the test point must be off the boundary line to determine which side contains the solutions.
Question: How do I handle systems with more than two inequalities? It gets confusing trying to shade everything.
Answer: When dealing with multiple inequalities, here are strategies to keep things organized:
- Shade sequentially: Start with one inequality, then add the next, finding the intersection at each step
- Use different patterns: Hatch with different angles, dots, or colors for each inequality
- Focus on intersection: The final solution is where ALL regions overlap
- Verify systematically: Test a point in the final region against all inequalities
For example, with three inequalities A, B, and C: first find A ∩ B, then (A ∩ B) ∩ C.
The solution region gets smaller with each added constraint. If at any point the intersection becomes empty, the system has no solution.
It's often helpful to sketch the final region separately once you've determined its boundaries.