Solved Exercises on Graphing Solution Regions in Algebra 1

Master graphing solution regions: linear inequalities, systems, boundary analysis, and feasible regions through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Single Inequality Region
Exercise 1
Graph the solution region for: 2x + 3y ≤ 6
Definition:

Solution region: The area of the coordinate plane that contains all points (x, y) that satisfy the inequality. This region is determined by the boundary line and the shading direction.

Graphing method:
  1. Graph the boundary line (replace inequality with equals)
  2. Determine line type: solid for ≤ or ≥, dashed for < or >
  3. Test a point not on the line to determine shading direction
  4. Shade the region containing points that satisfy the inequality
Boundary
2x + 3y = 6
Line Type
Solid (≤)
Shading
Below line
Step 1: Find intercepts of boundary line

x-intercept: Let y = 0: 2x = 6 → x = 3, point (3, 0)
y-intercept: Let x = 0: 3y = 6 → y = 2, point (0, 2)

Step 2: Draw boundary line

Connect points (3, 0) and (0, 2). Since ≤ includes the boundary, draw a solid line.

Step 3: Test a point

Test point (0, 0): 2(0) + 3(0) ≤ 6 → 0 ≤ 6 ✓

Step 4: Shade the correct region

Since (0, 0) satisfies the inequality, shade the region containing (0, 0)

Step 5: Verify

Points below or on the line satisfy 2x + 3y ≤ 6

Shaded region below solid line 2x + 3y = 6
Final answer:

The solution region is the area below the solid line 2x + 3y = 6 including the line itself

Applied rules:

• Line type: ≤ and ≥ use solid lines, < and > use dashed lines

• Test point method: Any point not on the boundary line can be used

• Shading: Shade the region containing points that satisfy the inequality

2 System of Two Inequalities
Exercise 2
Graph the solution region for: \(\begin{cases} x + y \geq 2 \\ x - y \leq 4 \end{cases}\)
Definition:

System solution region: The intersection of all individual solution regions. A point satisfies the system if and only if it satisfies every inequality in the system.

Inequality 1
x + y ≥ 2
Inequality 2
x - y ≤ 4
Solution
Overlap region
Step 1: Graph first inequality x + y ≥ 2

Draw solid line x + y = 2 (intercepts at (2,0) and (0,2)), shade above line

Step 2: Graph second inequality x - y ≤ 4

Draw solid line x - y = 4 (intercepts at (4,0) and (0,-4)), shade below line

Step 3: Find intersection of regions

The solution region is where both shadings overlap

Step 4: Verify with test point

Test point (3, 1): 3 + 1 ≥ 2 ✓ and 3 - 1 ≤ 4 ✓

Step 5: Identify feasible region

The overlapping area satisfies both inequalities simultaneously

Overlapping region of both inequalities
Final answer:

The solution region is the area where both inequalities are satisfied simultaneously

Applied rules:

• System solution: Intersection of all individual solution sets

• Boundary inclusion: ≥ and ≤ include boundary lines

• Overlapping regions: Only the intersection is the solution

3 Triangular Feasible Region
Exercise 3
Graph the solution region for: \(\begin{cases} x \geq 0 \\ y \geq 0 \\ x + y \leq 3 \end{cases}\)
Definition:

Feasible region: The area of the coordinate plane that satisfies all constraints simultaneously. Often used in optimization problems where variables represent physical quantities that cannot be negative.

Constraint 1
x ≥ 0
Constraint 2
y ≥ 0
Constraint 3
x + y ≤ 3
Step 1: Graph x ≥ 0

Shade to the right of vertical line x = 0 (y-axis), including the line

Step 2: Graph y ≥ 0

Shade above horizontal line y = 0 (x-axis), including the line

Step 3: Graph x + y ≤ 3

Draw solid line x + y = 3 (intercepts at (3,0) and (0,3)), shade below line

Step 4: Find intersection of all regions

The solution region is the triangular area in the first quadrant

Step 5: Identify vertices

Corner points: (0,0), (3,0), and (0,3)

Triangular feasible region in first quadrant
Final answer:

The solution region is a triangle with vertices at (0,0), (3,0), and (0,3)

Applied rules:

• Non-negativity constraints: x ≥ 0 and y ≥ 0 restrict to first quadrant

• Bounded region: Constraints create a finite feasible area

• Vertex points: Corners of feasible region are important for optimization

Rules and methods, laws,...
\(\text{Solution Region: } \{(x,y) | \text{all constraints satisfied}\}\)
Definition of Solution Region
Boundary Analysis
Line type and inclusion
Solid vs dashed lines
Shading Direction
Test point method
Which side to shade
Intersection Principle
All constraints must be met
System solution concept
Key definitions:

Solution region: The set of all points (x, y) that satisfy a given inequality or system of inequalities. Graphically represented as a shaded area in the coordinate plane.

Boundary line: The line formed by replacing the inequality symbol with an equals sign. It separates the coordinate plane into regions.

Feasible region: The solution region for a system of constraints, often used in optimization problems.

Corner point (vertex): A point where boundary lines of the solution region intersect.

Bounded region: A region that can be enclosed within a circle, having finite area.

Unbounded region: A region that extends infinitely in one or more directions.

Complete methodology:
  1. Identify constraints: List all inequalities in the system
  2. Graph boundary lines: Draw each line by converting inequalities to equations
  3. Determine line types: Solid for ≤ or ≥, dashed for < or >
  4. Test points for shading: Choose a test point for each inequality
  5. Shade individual regions: Shade the appropriate side of each boundary line
  6. Find intersection: The solution region is where all shadings overlap
  7. Verify solution: Test a point in the solution region
Tip 1: Always use the origin (0,0) as a test point when it's not on the boundary line.
Tip 2: For y-form inequalities, remember: > shades above, < shades below.
Tip 3: The solution region is the darkest area where all shadings overlap.
Tip 4: Corner points occur where boundary lines intersect; find by solving systems.
Common errors: Using wrong line type, shading wrong direction, not considering all constraints, forgetting to verify solution.
Exam preparation: Practice different forms, master line type rules, learn to identify corner points.
Solution: Exercises 4 to 5
4 Quadrilateral Region
Exercise 4
Graph the solution region for: \(\begin{cases} x \geq 1 \\ y \geq 1 \\ x + y \leq 5 \\ x \leq 4 \end{cases}\)
Definition:

Quadrilateral feasible region: A four-sided polygonal region formed by four linear constraints. Each constraint adds a boundary to the region.

Constraint 1
x ≥ 1
Constraint 2
y ≥ 1
Constraint 3
x + y ≤ 5
Constraint 4
x ≤ 4
Step 1: Graph x ≥ 1

Draw solid vertical line x = 1, shade to the right of the line

Step 2: Graph y ≥ 1

Draw solid horizontal line y = 1, shade above the line

Step 3: Graph x + y ≤ 5

Draw solid line x + y = 5 (intercepts at (5,0) and (0,5)), shade below line

Step 4: Graph x ≤ 4

Draw solid vertical line x = 4, shade to the left of the line

Step 5: Find intersection of all regions

The solution region is where all four shadings overlap

Step 6: Identify vertices

Find intersections of boundary lines to determine corner points

Quadrilateral feasible region with 4 vertices
Final answer:

The solution region is a quadrilateral bounded by all four constraints

Applied rules:

• Multiple constraints: Each adds a boundary to the feasible region

• Intersection principle: Solution must satisfy ALL constraints

• Polygonal regions: Linear constraints create polygonal feasible regions

5 Unbounded Region
Exercise 5
Graph the solution region for: \(\begin{cases} y \geq x - 2 \\ y \leq -x + 4 \\ x \geq 0 \end{cases}\)
Definition:

Unbounded solution region: A region that extends infinitely in one or more directions while still being constrained by some boundaries. The region is still defined by the constraints but has infinite area.

Constraint 1
y ≥ x - 2
Constraint 2
y ≤ -x + 4
Constraint 3
x ≥ 0
Step 1: Graph y ≥ x - 2

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

Step 2: Graph y ≤ -x + 4

Draw solid line y = -x + 4 (slope -1, y-intercept 4), shade below line

Step 3: Graph x ≥ 0

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

Step 4: Find intersection of all regions

The solution region is where all three shadings overlap

Step 5: Analyze the region

The region is bounded on the right by the intersection of the lines but extends infinitely downward

Unbounded triangular region
Final answer:

The solution region is unbounded, extending infinitely in the negative y-direction

Applied rules:

• Unbounded regions: Some constraints may allow infinite extension

• Intersection principle: Solution must satisfy ALL constraints

• Constraint analysis: Identify which boundaries are restrictive

Graphing Solution Regions: Comprehensive Summary
\(\text{Region: } \bigcap_{i=1}^{n} \{(x,y) | \text{inequality}_i \text{ is satisfied}\}\)
Solution Region as Intersection
Key definitions:

Solution region: The area of the coordinate plane that contains all points (x, y) that satisfy a given inequality or system of inequalities. This is the visual representation of the solution set.

Boundary line: The line formed by replacing the inequality symbol with an equals sign. This line divides the coordinate plane into two regions.

Feasible region: The solution region for a system of constraints, commonly used in optimization problems where variables represent physical quantities.

Corner point (vertex): A point where boundary lines of the solution region intersect. These points are significant in optimization problems.

Bounded region: A region that can be enclosed within a circle, having finite area. All boundary lines converge to form a closed shape.

Unbounded region: A region that extends infinitely in one or more directions. The region is still constrained but has infinite area.

Empty solution set: Occurs when constraints are contradictory and no points satisfy all inequalities simultaneously.

Complete graphing procedure:
  1. Identify all constraints: List each inequality in the system
  2. Graph each boundary line: Convert inequalities to equations and graph the lines
  3. Determine line types: Use solid lines for ≤ or ≥, dashed lines for < or >
  4. Test points for shading: Choose a test point for each inequality to determine shading direction
  5. Shade solution regions: Shade the appropriate side of each boundary line
  6. Find intersection: The solution region is where all shadings overlap
  7. Identify vertices: Find corner points where boundary lines intersect
  8. Verify solution: Test a point in the solution region to ensure all constraints are satisfied
Tip 1: The solution region is always the darkest area where all constraints overlap.
Tip 2: Use different colors or patterns to distinguish different inequality shadings initially.
Tip 3: Always verify that a point in your solution region satisfies all original constraints.
Tip 4: Corner points occur where boundary lines intersect; find by solving systems of equations.
Tip 5: For optimization problems, important solutions often occur at corner points.
Common error patterns: Using wrong line type, shading the wrong direction, not considering all constraints, forgetting to include boundary for ≤ or ≥, misidentifying intersection points.
Key concepts to remember: Solution region is intersection of all individual solutions; boundary lines divide the plane; corner points are significant for optimization; verify solutions by testing points.
Important rules:

• Line type rule: ≤ and ≥ use solid lines; < and > use dashed lines

• Shading rule: Test a point to determine which side to shade

• Intersection principle: System solution is intersection of all individual solution sets

• Boundary inclusion: Solid lines include boundary points, dashed lines exclude them

• Feasible region: Must satisfy all constraints simultaneously

Questions & Answers

Question: How do I determine if a solution region is bounded or unbounded?

Answer: The key differences are:

Bounded region:

  • Finite area that can be enclosed within a circle
  • All boundary lines converge to form a closed shape
  • Occurs when all variables are constrained in all directions
  • Common in practical problems with limited resources

Unbounded region:

  • Extends infinitely in one or more directions
  • Infinite area
  • At least one direction is not restricted by constraints
  • Occurs when some variables aren't fully constrained

To identify: Look at your graph. If you can draw a circle large enough to contain the entire solution region, it's bounded. If the region extends indefinitely in any direction, it's unbounded.

For example, a system with only x ≥ 0 and y ≥ 0 creates an unbounded region extending infinitely in the positive x and y directions.

Question: What are corner points and why are they important in solution regions?

Answer: Corner points (vertices) are crucial for several reasons:

  • Boundary definition: They mark the extreme limits of the solution region
  • Intersection points: They occur where constraint boundary lines intersect
  • Optimization: In linear programming, optimal solutions often occur at corner points
  • Verification: Testing corner points helps verify the solution region

To find corner points, solve the system of equations formed by the intersecting boundary lines. For example, if y = x + 1 and y = -x + 3 intersect, solve: x + 1 = -x + 3 to find x = 1, then y = 2, giving the corner point (1, 2).

In practical applications, corner points often represent critical scenarios like maximum profit or minimum cost situations.

Question: How do I know if a system of inequalities has no solution?

Answer: A system of inequalities has no solution when the constraints are contradictory and there's no region where all constraints overlap. This occurs when:

  • Two constraints require incompatible conditions (e.g., x > 5 AND x < 3)
  • Parallel boundary lines with opposite shading directions
  • Constraints that exclude each other's solution regions
  • Geometrically, when the shaded regions never intersect

For example, the system {x > 2, x < 1} has no solution because no number can be both greater than 2 and less than 1.

When graphing, if you find that the shaded regions never overlap, the system has no solution (empty solution set). This is called an inconsistent system.