System of linear inequalities: A set of two or more linear inequalities with the same variables. The solution is the intersection of all solution regions.
- Graph each inequality separately
- Draw boundary lines (solid for ≤ or ≥, dashed for < or >)
- Shade appropriate regions for each inequality
- Identify the intersection of all shaded regions
Boundary line: y = 2x + 3 (solid line)
Slope = 2, y-intercept = 3
Test point (0,0): 0 ≤ 2(0) + 3 → 0 ≤ 3 (true)
Shade below the line (including the line)
Boundary line: y = -x + 1 (dashed line)
Slope = -1, y-intercept = 1
Test point (0,0): 0 > -(0) + 1 → 0 > 1 (false)
Shade above the line (excluding the line)
The solution region is where both conditions are satisfied
It's the area that is shaded by both inequalities
Choose a point in the overlapping region, e.g., (1, 3)
y ≤ 2x + 3: 3 ≤ 2(1) + 3 → 3 ≤ 5 ✓
y > -x + 1: 3 > -(1) + 1 → 3 > 0 ✓
The solution region is the area where both inequalities are satisfied. It is bounded by the intersection of the two half-planes.
• Line type: Solid for ≤ or ≥, dashed for < or >
• Shading direction: Test a point to determine which side to shade
• Intersection: Solution is where all regions overlap
Feasible region: The area where all constraints of the system are satisfied simultaneously. For bounded systems, it often forms a polygon.
Boundary: y = x - 2 (solid line)
Test (0,0): 0 ≥ 0 - 2 → 0 ≥ -2 (true)
Shade above the line
Boundary: y = -x + 4 (solid line)
Test (0,0): 0 ≤ -0 + 4 → 0 ≤ 4 (true)
Shade below the line
Boundary: x = 0 (the y-axis, solid line)
Shade to the right of the y-axis
Intersection of y = x - 2 and y = -x + 4:
x - 2 = -x + 4 → 2x = 6 → x = 3, y = 1
Point: (3, 1)
Intersection of y = x - 2 and x = 0:
y = 0 - 2 = -2
Point: (0, -2)
Intersection of y = -x + 4 and x = 0:
y = -0 + 4 = 4
Point: (0, 4)
Check (3, 1): 1 ≥ 3-2 ✓, 1 ≤ -3+4 ✓, 3 ≥ 0 ✓
Check (0, -2): -2 ≥ 0-2 ✓, -2 ≤ 0+4 ✓, 0 ≥ 0 ✓
Check (0, 4): 4 ≥ 0-2 ✓, 4 ≤ 0+4 ✓, 0 ≥ 0 ✓
The solution region is a triangle with vertices at (0, -2), (0, 4), and (3, 1).
• Vertex calculation: Find intersection points of boundary lines
• Feasible region: Polygon formed by intersecting half-planes
• Verification: Test vertices in all original inequalities
Inconsistent system: A system of inequalities with no common solution region. This occurs when the regions defined by the inequalities do not overlap.
Boundary: y = 2x + 1 (dashed line)
Test (0,0): 0 > 2(0) + 1 → 0 > 1 (false)
Shade above the line
Boundary: y = 2x - 3 (dashed line)
Test (0,0): 0 < 2(0) - 3 → 0 < -3 (false)
Shade below the line
Both lines have the same slope (m = 2)
They are parallel lines
First inequality: y > 2x + 1 (above the line)
Second inequality: y < 2x - 3 (below the line)
Since both lines have the same slope, they are parallel
The first line (y = 2x + 1) is above the second line (y = 2x - 3)
There is no region that is simultaneously above the first line and below the second line
The solution regions do not overlap
Therefore, the system has no solution
The system has no solution because the boundary lines are parallel and the shaded regions do not overlap.
• Parallel lines: Same slope means no intersection
• Empty solution: When no region satisfies all inequalities
• Visualization: Graph helps identify impossible constraints
An inequality that can be written in the form ax + by < c, ax + by ≤ c, ax + by > c, or ax + by ≥ c, where a, b, and c are constants.
A set of two or more linear inequalities with the same variables. The solution consists of all ordered pairs that satisfy every inequality in the system.
The set of all points that satisfy all inequalities in the system simultaneously. It is the intersection of all individual solution regions.
• Line type: Use solid lines for ≤ or ≥, dashed lines for < or >
• Test point: Use a point not on the boundary line to determine which side to shade
• Intersection: The solution is where all individual regions overlap
• Feasible region: For bounded systems, often forms a polygon
• Parallel boundaries: May result in no solution if constraints conflict
- Convert to slope-intercept form: Write each inequality as y < mx + b, y ≤ mx + b, etc.
- Graph boundary lines: Draw each line (solid for ≤ or ≥, dashed for < or >)
- Test points: Choose a test point and substitute into the original inequality
- Shade regions: Shade the appropriate side of each line based on the test
- Identify solution: Find the intersection of all shaded regions
- Verify: Test a point in the solution region to ensure it satisfies all inequalities
System: y ≤ x + 1 and y ≥ -x + 1
Both lines intersect at (0, 1)
Solution region: Area between the lines forming a V-shape
System: x ≥ 0, y ≥ 0, y ≤ -x + 5
Forms a triangle in the first quadrant
Vertices: (0,0), (0,5), (5,0)
System: y ≥ 2x - 1, y ≤ -x + 4, x ≥ 1, y ≥ 0
Creates a quadrilateral region
Requires intersection of four constraints
For each inequality:
- Graph the boundary line
- Determine if line is solid or dashed
- Choose and test a point
- Shade the appropriate half-plane
For the system:
- Find intersection of all shaded regions
- Identify vertices of bounded regions
- Verify solution with test points
Graphing Process
Steps:
• Graph each boundary
• Determine line type
• Test and shade
• Find intersection
Line Types
Rules:
• Solid includes boundary
• Dashed excludes boundary
• Test point method
• Intersection is solution
• Boundary lines: Solid for ≤ or ≥, dashed for < or >
• Test points: Use points not on boundary lines
• Shading: Shade the side that satisfies the inequality
• Solution: Intersection of all individual solution regions