Graphing Systems of Inequalities - Complete Guide

Master graphing systems of inequalities: feasible regions, corner points, and applications through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic Feasible Region
Exercise 1
Graph the system: \( \begin{cases} y \leq 2x + 4 \\ y \geq -x + 2 \\ x \geq 0 \end{cases} \)
Definition:

Feasible region: The area of the coordinate plane that satisfies all inequalities in the system simultaneously.

Corner point: A vertex of the feasible region formed by the intersection of boundary lines.

Graphing method:
  1. Graph each boundary line
  2. Determine shading for each inequality
  3. Identify the intersection of all shaded regions
  4. Mark corner points where boundaries intersect
Inequality 1
\(y \leq 2x + 4\)
Inequality 2
\(y \geq -x + 2\)
Inequality 3
\(x \geq 0\)
Step 1: Graph first inequality \(y \leq 2x + 4\)

Boundary line: \(y = 2x + 4\) (solid line)

Slope = 2, y-intercept = 4

Test point (0, 0): \(0 \leq 2(0) + 4 = 4\) ✓

Shade below the line

Step 2: Graph second inequality \(y \geq -x + 2\)

Boundary line: \(y = -x + 2\) (solid line)

Slope = -1, y-intercept = 2

Test point (0, 0): \(0 \geq -0 + 2 = 2\) ✗

Shade above the line

Step 3: Graph third inequality \(x \geq 0\)

Boundary line: \(x = 0\) (the y-axis, solid line)

Shade to the right of the y-axis

Step 4: Find the feasible region

The feasible region is the intersection of all three shaded areas

This is the area that is simultaneously below the first line, above the second line, and to the right of the y-axis

Step 5: Identify corner points

Find intersections of boundary lines:

Intersection of \(y = 2x + 4\) and \(y = -x + 2\):

\(2x + 4 = -x + 2\)

\(3x = -2\)

\(x = -\frac{2}{3}\), \(y = -(-\frac{2}{3}) + 2 = \frac{8}{3}\)

However, since \(x \geq 0\), this point is not in the feasible region.

Intersection of \(y = 2x + 4\) and \(x = 0\): \((0, 4)\)

Intersection of \(y = -x + 2\) and \(x = 0\): \((0, 2)\)

Intersection of \(y = 2x + 4\) and \(y = -x + 2\) with \(x \geq 0\): Need to find where the lines cross the feasible region.

Step 6: Calculate actual corner points

Corner points of the feasible region:

• \((0, 2)\): intersection of \(x = 0\) and \(y = -x + 2\)

• \((0, 4)\): intersection of \(x = 0\) and \(y = 2x + 4\)

• Find where \(y = -x + 2\) intersects \(y = 2x + 4\):

\(-x + 2 = 2x + 4\)

\(-3x = 2\)

\(x = -\frac{2}{3}\) (negative, so not in feasible region)

Instead, find where the lines intersect the boundary of the feasible region.

Actually, let me recalculate: The intersection point \((-\frac{2}{3}, \frac{8}{3})\) is not in the feasible region because \(x \geq 0\).

The feasible region is bounded by: \(x = 0\), \(y = -x + 2\), and the intersection of \(y = 2x + 4\) with the positive region.

Wait, let me recalculate the corner points properly:

Corner points: \((0, 2)\), \((0, 4)\), and the point where \(y = -x + 2\) intersects with the line from \((0, 4)\) in the positive x direction.

The actual corner points are: \((0, 2)\) and \((0, 4)\), and potentially other points depending on the shape.

For \(x \geq 0\), the feasible region extends indefinitely in the positive x direction, bounded below by \(y = -x + 2\) and above by \(y = 2x + 4\).

Feasible region: unbounded region in first quadrant
Final answer:

The feasible region is bounded by \(x = 0\), \(y = -x + 2\), and \(y = 2x + 4\), with corner points at \((0, 2)\) and \((0, 4)\).

Applied rules:

• Intersection: The feasible region is the intersection of all individual solution regions

• Corner points: Found at intersections of boundary lines within the feasible region

• Verification: Test points in the region to confirm accuracy

2 Bounded Region
Exercise 2
Graph the system: \( \begin{cases} x + y \leq 6 \\ 2x + y \leq 8 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Definition:

Bounded feasible region: A region that can be enclosed within a finite area.

Constraint 1
\(x + y \leq 6\)
Constraint 2
\(2x + y \leq 8\)
Constraints 3&4
\(x \geq 0, y \geq 0\)
Step 1: Graph first constraint \(x + y \leq 6\)

Convert: \(y \leq -x + 6\)

Boundary: \(y = -x + 6\)

Intercepts: (0, 6) and (6, 0)

Test (0, 0): \(0 + 0 = 0 \leq 6\) ✓

Shade below the line

Step 2: Graph second constraint \(2x + y \leq 8\)

Convert: \(y \leq -2x + 8\)

Boundary: \(y = -2x + 8\)

Intercepts: (0, 8) and (4, 0)

Test (0, 0): \(2(0) + 0 = 0 \leq 8\) ✓

Shade below the line

Step 3: Graph non-negativity constraints

\(x \geq 0\): Shade to the right of y-axis

\(y \geq 0\): Shade above x-axis

Step 4: Find the feasible region

The feasible region is in the first quadrant, bounded by all four constraints

It's a quadrilateral bounded by the axes and the two constraint lines

Step 5: Calculate corner points

• Origin: \((0, 0)\)

• Intersection of \(x = 0\) and \(x + y = 6\): \((0, 6)\)

• Intersection of \(y = 0\) and \(2x + y = 8\): \((4, 0)\)

• Intersection of \(x + y = 6\) and \(2x + y = 8\):

From first: \(y = 6 - x\)

Substitute into second: \(2x + (6 - x) = 8\)

\(x + 6 = 8\), so \(x = 2\), \(y = 4\)

Point: \((2, 4)\)

Step 6: Verify corner points

Check \((2, 4)\):

\(x + y = 2 + 4 = 6 \leq 6\) ✓

\(2x + y = 4 + 4 = 8 \leq 8\) ✓

\(x = 2 \geq 0\) ✓, \(y = 4 \geq 0\) ✓

Bounded quadrilateral with vertices (0,0), (0,6), (2,4), (4,0)
Final answer:

The feasible region is a quadrilateral with corner points at \((0, 0)\), \((0, 6)\), \((2, 4)\), and \((4, 0)\).

Applied rules:

• Bounded region: Finite area with defined boundaries

• Corner points: Critical for optimization problems

• Verification: Check each corner point satisfies all constraints

3 Unbounded Region
Exercise 3
Graph the system: \( \begin{cases} y \geq x - 2 \\ y \leq -\frac{1}{2}x + 4 \end{cases} \)
Definition:

Unbounded feasible region: A region that extends infinitely in at least one direction.

Inequality 1
\(y \geq x - 2\)
Inequality 2
\(y \leq -\frac{1}{2}x + 4\)
Result
Unbounded region
Step 1: Graph first inequality \(y \geq x - 2\)

Boundary line: \(y = x - 2\) (solid line)

Slope = 1, y-intercept = -2

Test point (0, 0): \(0 \geq 0 - 2 = -2\) ✓

Shade above the line

Step 2: Graph second inequality \(y \leq -\frac{1}{2}x + 4\)

Boundary line: \(y = -\frac{1}{2}x + 4\) (solid line)

Slope = -1/2, y-intercept = 4

Test point (0, 0): \(0 \leq -\frac{1}{2}(0) + 4 = 4\) ✓

Shade below the line

Step 3: Find the feasible region

The feasible region is the intersection of both shaded areas

This is the area above the first line and below the second line

Step 4: Analyze the region

Find intersection point: \(x - 2 = -\frac{1}{2}x + 4\)

\(x + \frac{1}{2}x = 4 + 2\)

\(\frac{3}{2}x = 6\)

\(x = 4\), so \(y = 4 - 2 = 2\)

Intersection: \((4, 2)\)

Step 5: Determine boundedness

Since the slope of the upper bound \((-1/2)\) is less than the slope of the lower bound \((1)\), the region extends infinitely downward

This creates an unbounded feasible region

Step 6: Verify with test points

Point (4, 2): \(2 \geq 4 - 2 = 2\) ✓ and \(2 \leq -\frac{1}{2}(4) + 4 = 2\) ✓

Point (0, 0): \(0 \geq 0 - 2 = -2\) ✓ and \(0 \leq -\frac{1}{2}(0) + 4 = 4\) ✓

Point (10, -5): \(-5 \geq 10 - 2 = 8\) ✗

Unbounded feasible region extending downward
Final answer:

The feasible region is unbounded, located between the lines \(y = x - 2\) and \(y = -\frac{1}{2}x + 4\), extending infinitely in the direction of decreasing y-values.

Applied rules:

• Unbounded region: Extends infinitely in one or more directions

• Direction: Determined by the slopes of the boundary lines

• Verification: Test points in different areas of the plane

Graphing Techniques & Properties
\( \begin{cases} a_1x + b_1y \, \text{operator}_1 \, c_1 \\ a_2x + b_2y \, \text{operator}_2 \, c_2 \\ \vdots \\ a_nx + b_ny \, \text{operator}_n \, c_n \end{cases} \)
General System of Linear Inequalities
Feasible Region
Intersection of all regions
All points satisfying all constraints
Corner Points
Vertices of feasible region
Intersections of boundary lines
Bounded/Unbounded
Finite/infinite area
Depends on constraint directions
Key Definitions:

Feasible region: The set of all points that satisfy all inequalities in the system.

Corner point: A vertex of the feasible region where boundary lines intersect.

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

Graphing Process:
  1. Graph each inequality: Draw boundary lines and determine shading
  2. Identify intersection: Find area satisfying all constraints
  3. Determine boundedness: Check if region is finite or infinite
  4. Find corner points: Calculate intersections of boundary lines
  5. Verify solution: Test points in the feasible region
Solution: Exercises 4 to 5
4 Empty Feasible Region
Exercise 4
Graph the system: \( \begin{cases} y > 3x + 1 \\ y < 3x - 2 \end{cases} \)
Definition:

Empty feasible region: A system with no solution because the constraints contradict each other.

Inequality 1
\(y > 3x + 1\)
Inequality 2
\(y < 3x - 2\)
Result
No solution
Step 1: Graph first inequality \(y > 3x + 1\)

Boundary line: \(y = 3x + 1\) (dashed line)

Slope = 3, y-intercept = 1

Test point (0, 0): \(0 > 3(0) + 1 = 1\) ✗

Shade above the line

Step 2: Graph second inequality \(y < 3x - 2\)

Boundary line: \(y = 3x - 2\) (dashed line)

Slope = 3, y-intercept = -2

Test point (0, 0): \(0 < 3(0) - 2 = -2\) ✗

Shade below the line

Step 3: Analyze the situation

Both lines have the same slope (3) but different y-intercepts (1 and -2)

This means the lines are parallel

The first inequality wants points above the first line

The second inequality wants points below the second line

Step 4: Determine feasibility

Since the lines are parallel and the first line is above the second line, there is no region that is simultaneously above the first line and below the second line

The system has no solution

Step 5: Verify with algebra

For a point to satisfy both: \(3x + 1 < y < 3x - 2\)

This implies: \(3x + 1 < 3x - 2\)

Simplifying: \(1 < -2\), which is false

Therefore, no solution exists

Step 6: Conclusion

When graphing, we see two parallel lines with no overlapping shaded regions

The feasible region is empty

No solution (empty feasible region)
Final answer:

The system has no solution because the constraints are contradictory (parallel lines with no overlapping region).

Applied rules:

• Parallel lines: Same slope, different y-intercept → no intersection

• Contradictory constraints: May result in empty feasible region

• Verification: Check algebraically when graphing suggests no solution

5 Real-World Application
Exercise 5
A bakery makes two types of cookies. Type A requires 2 cups of flour and 1 cup of sugar per batch. Type B requires 1 cup of flour and 3 cups of sugar per batch. If the bakery has 20 cups of flour and 21 cups of sugar available, write and graph the system of inequalities representing possible production levels.
Definition:

Real-world constraints: Practical limitations that translate to mathematical inequalities.

Define variables
\(x = \text{Type A batches}, y = \text{Type B batches}\)
Set up system
\( \begin{cases} 2x + y \leq 20 \\ x + 3y \leq 21 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Feasible region
Quadrilateral in first quadrant
Step 1: Define variables

Let x = number of batches of Type A cookies, y = number of batches of Type B cookies

Step 2: Set up constraints

Flour constraint: \(2x + y \leq 20\) (2 cups for A + 1 cup for B ≤ 20 cups)

Sugar constraint: \(x + 3y \leq 21\) (1 cup for A + 3 cups for B ≤ 21 cups)

Non-negativity constraints: \(x \geq 0, y \geq 0\)

Step 3: Graph first constraint \(2x + y \leq 20\)

Convert: \(y \leq -2x + 20\)

Boundary: \(y = -2x + 20\)

Intercepts: (0, 20) and (10, 0)

Test (0, 0): \(2(0) + 0 = 0 \leq 20\) ✓

Shade below the line

Step 4: Graph second constraint \(x + 3y \leq 21\)

Convert: \(y \leq -\frac{1}{3}x + 7\)

Boundary: \(y = -\frac{1}{3}x + 7\)

Intercepts: (0, 7) and (21, 0)

Test (0, 0): \(0 + 3(0) = 0 \leq 21\) ✓

Shade below the line

Step 5: Graph non-negativity constraints

\(x \geq 0\): Shade to the right of y-axis

\(y \geq 0\): Shade above x-axis

Step 6: Find corner points

• Origin: \((0, 0)\)

• Intersection of \(x = 0\) and \(2x + y = 20\): \((0, 20)\)

• But check: \(x + 3y = 0 + 3(20) = 60 \not\leq 21\), so \((0, 20)\) is not feasible

• Intersection of \(x = 0\) and \(x + 3y = 21\): \((0, 7)\)

• Intersection of \(y = 0\) and \(2x + y = 20\): \((10, 0)\)

• Intersection of \(y = 0\) and \(x + 3y = 21\): \((21, 0)\)

• But check: \(2(21) + 0 = 42 \not\leq 20\), so \((21, 0)\) is not feasible

• Intersection of \(2x + y = 20\) and \(x + 3y = 21\):

From first: \(y = 20 - 2x\)

Substitute: \(x + 3(20 - 2x) = 21\)

\(x + 60 - 6x = 21\)

\(-5x = -39\)

\(x = \frac{39}{5} = 7.8\), \(y = 20 - 2(7.8) = 4.4\)

Point: \((7.8, 4.4)\)

Step 7: Verify corner points

Feasible corner points: \((0, 0)\), \((0, 7)\), \((7.8, 4.4)\), \((10, 0)\)

Check \((7.8, 4.4)\):

\(2(7.8) + 4.4 = 15.6 + 4.4 = 20 \leq 20\) ✓

\(7.8 + 3(4.4) = 7.8 + 13.2 = 21 \leq 21\) ✓

Feasible region: quadrilateral with vertices (0,0), (0,7), (7.8,4.4), (10,0)
Final answer:

The feasible region is a quadrilateral with vertices at \((0,0)\), \((0,7)\), \((7.8,4.4)\), and \((10,0)\), representing all possible production combinations that satisfy the constraints.

Applied rules:

• Variable definition: Clearly define what each variable represents

• Constraint identification: Translate each practical limitation into an inequality

• Verification: Check that corner points satisfy all constraints

Comprehensive Graphing Systems Summary
\( \begin{cases} a_1x + b_1y \, \text{operator}_1 \, c_1 \\ a_2x + b_2y \, \text{operator}_2 \, c_2 \end{cases} \)
General System of Two Linear Inequalities
Key definitions:

System of linear inequalities: A collection of linear inequalities that must all be satisfied simultaneously.

Feasible region: The intersection of all solution regions of the individual inequalities.

Corner point: A vertex of the feasible region formed by the intersection of boundary lines.

Complete graphing approach:
  1. Graph each inequality: Draw boundary lines and determine shading
  2. Find intersection: Identify region satisfying all constraints
  3. Determine boundedness: Check if region is finite or infinite
  4. Calculate corner points: Find intersections of boundary lines
  5. Verify solution: Test points in the feasible region
Tip 1: Always include non-negativity constraints in real-world problems.
Tip 2: Corner points are critical in optimization problems.
Tip 3: Parallel boundary lines may result in no solution.
Tip 4: The feasible region contains infinitely many solutions.
Common errors: Incorrect shading direction, missing constraints, forgetting non-negativity, wrong line type for boundary.
Exam preparation: Practice with various constraint types, master corner point calculation, focus on real-world applications.
Important properties:

• Intersection: Feasible region is intersection of all individual regions

• Corner points: Critical for optimization problems

• Bounded/unbounded: Determines solution space characteristics

• Verification: Always test points in the feasible region

Graphing Systems Properties Visualization

Key Properties of Graphing Systems:

  • Feasible Region: Intersection of all constraint regions
  • Corner Points: Vertices of the feasible region
  • Bounded/Unbounded: Finite or infinite solution space
  • Multiple Constraints: Each adds a restriction to the solution space

Questions & Answers

Question: How do I efficiently determine which side to shade for each inequality?

Answer: Use the test point method consistently:

  1. Choose a test point: Usually (0,0) if it's not on the boundary line
  2. Substitute coordinates: Into the original inequality
  3. Evaluate: If true, shade the side containing the test point
  4. Reverse: If false, shade the opposite side

For example: For \(y > 2x + 1\), test (0,0): \(0 > 2(0) + 1 = 1\) is false, so shade away from (0,0).

For \(y \leq -x + 3\), test (0,0): \(0 \leq -0 + 3 = 3\) is true, so shade toward (0,0).

Question: What happens when corner points have fractional coordinates?

Answer: Fractional corner points are completely valid and common:

  • Mathematically valid: All real number coordinates are acceptable
  • Real-world interpretation: May represent partial units or continuous quantities
  • Verification: Always check that fractional points satisfy all constraints

Example: If a corner point is \((\frac{3}{2}, \frac{5}{4})\), substitute into all constraints to verify it's feasible.

In optimization problems, fractional solutions are mathematically correct even if they represent partial units.

Question: How do systems of inequalities apply to optimization problems?

Answer: Systems of inequalities define the feasible region for optimization:

Linear Programming Structure:

  • Constraints: Inequalities that limit the solution space
  • Objective Function: A function to maximize or minimize (e.g., profit, cost)
  • Feasible Region: Defined by the system of constraints
  • Optimal Solution: Occurs at a corner point of the feasible region

Example:

Maximize: \(P = 5x + 4y\) (profit function)

Subject to: \( \begin{cases} 2x + 3y \leq 12 \text{ (resource A)} \\ x + y \leq 5 \text{ (resource B)} \\ x \geq 0, y \geq 0 \end{cases} \)

The maximum profit occurs at one of the corner points of the feasible region.

This is the foundation of operations research and business optimization.