Solved Exercises on Graphing Systems of Inequalities in Algebra 1

Master graphing systems of inequalities: solving, shading regions, and finding solution sets through these 3 detailed exercises.

Solution: Exercises 1 to 3
1 Two-variable system
Exercise 1
Graph the system: y ≤ 2x + 1 and y > -x + 3
Definition:

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.

Graphing method:
  1. Graph each inequality separately on the same coordinate plane
  2. Shade the solution region for each inequality
  3. Find the intersection of all shaded regions (the solution set)
Inequality 1
y ≤ 2x + 1
Inequality 2
y > -x + 3
Solution
Intersection
Step 1: Graph y ≤ 2x + 1

Draw line y = 2x + 1 (solid line), shade below the line (since ≤)

Step 2: Graph y > -x + 3

Draw line y = -x + 3 (dashed line), shade above the line (since >)

Step 3: Find intersection

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.

Final answer:

The solution is the region where both shadings overlap (bounded by both lines)

Applied rules:

• Line type: Solid for ≤ or ≥, dashed for < or >

• Shading: Test a point to determine correct side

• Intersection: Solution is where all conditions are met

2 Boundary lines and regions
Exercise 2
Graph the system: x + y ≥ 4 and x - y < 2
Definition:

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.

Inequality 1
x + y ≥ 4
Inequality 2
x - y < 2
Convert
y ≥ -x + 4, y > x - 2
Step 1: Rewrite inequalities

\(x + y \geq 4 \Rightarrow y \geq -x + 4\) and \(x - y < 2 \Rightarrow y > x - 2\)

Step 2: Graph y ≥ -x + 4

Draw line y = -x + 4 (solid), shade above (since ≥)

Step 3: Graph y > x - 2

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).

Final answer:

The solution is the overlapping region above both lines

Applied rules:

• 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

3 Unbounded solution set
Exercise 3
Graph the system: y ≥ x - 1, y ≤ 3, and x ≥ 0
Definition:

Bounded vs Unbounded: A solution region is bounded if it can be enclosed in a circle, unbounded otherwise. This system creates a triangular region.

Constraints
y ≥ x - 1, y ≤ 3, x ≥ 0
Vertices
(0, -1), (0, 3), (4, 3)
Shape
Triangle
Step 1: Graph y ≥ x - 1

Draw line y = x - 1 (solid), shade above

Step 2: Graph y ≤ 3

Draw horizontal line y = 3 (solid), shade below

Step 3: Graph x ≥ 0

Draw vertical line x = 0 (y-axis, solid), shade right

Step 4: Find vertices

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.

Final answer:

The solution is the triangular region with vertices at (0, -1), (0, 3), and (4, 3)

Applied rules:

• Three constraints: Create a polygonal solution region

• Vertex identification: Find intersections of boundary lines

• Feasible region: Area satisfying all constraints

Complete Summary: Graphing Systems of Inequalities
\(\begin{cases} ax + by \leq c \\ dx + ey \geq f \end{cases}\)
System of Linear Inequalities
Key definitions:

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.

Complete methodology:
  1. Graph each inequality: Convert to slope-intercept form if needed, draw boundary line
  2. Determine line type: Solid for ≤ or ≥, dashed for < or >
  3. Shade solution region: Use test point method to determine correct side
  4. Find intersection: The solution is where all shaded regions overlap
  5. Identify vertices: Find corner points of bounded regions
Shading rules: For y > mx + b, shade above; for y < mx + b, shade below. For x > a, shade right; for x < a, shade left.
Test point method: Use (0,0) if it's not on a boundary line. If true, shade containing region; if false, shade opposite.
Bounded vs unbounded: Bounded regions have finite area, unbounded extend infinitely in some direction.
Tip 1: Always use different shading patterns or colors to distinguish between different inequalities.
Tip 2: The solution to a system of n inequalities is the intersection of n individual solution regions.
Tip 3: Systems with parallel boundary lines may have no solution or infinite solutions depending on shading directions.
Tip 4: The intersection point of boundary lines is called a vertex of the solution region.
Key concepts to remember:

• 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

Formulas & Properties
\(\text{Test Point Method}\)
Verification Technique
Linear Inequality
\(ax + by \leq c\)
Standard form
Slope-Intercept
\(y \leq mx + b\)
Graphing form
System
\(\begin{cases} a_1x + b_1y \leq c_1 \\ a_2x + b_2y \geq c_2 \end{cases}\)
Multiple constraints
y ≥ mx + b
Shade above line
y ≤ mx + b
Shade below line
Solid line: Inequalities with ≤ or ≥ include boundary points
Dashed line: Inequalities with < or > exclude boundary points
Intersection: Solution is where ALL individual regions overlap
Feasible region: May be bounded (finite) or unbounded (infinite)
Common mistake: Confusing shading direction based on inequality symbol
Verification: Pick a point in the solution region and check if it satisfies all inequalities
Common Questions & Answers

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:

  1. Choose a test point NOT on the boundary line (usually (0,0) works if it's not on the line)
  2. Substitute the coordinates into the inequality
  3. If the statement is TRUE, shade the side containing the test point
  4. 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:

  1. Test points: Pick a point inside the solution region and verify it satisfies ALL inequalities
  2. Boundary check: Points on solid boundaries should satisfy the corresponding inequality as equality
  3. 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.