Graphing Linear Inequalities in Two Variables

Master graphing linear inequalities in two variables: understanding boundary lines, shading regions, and solution sets through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic Linear Inequality
Exercise 1
Graph the inequality y > 2x - 3. Identify the boundary line, determine whether it's included in the solution, and shade the correct region.
Definition:

Linear Inequality in Two Variables: An inequality that can be written in the form Ax + By < C, Ax + By > C, Ax + By ≤ C, or Ax + By ≥ C.

Graphing Method:
  1. Graph the boundary line (dashed for < or >, solid for ≤ or ≥)
  2. Choose a test point not on the line (usually origin if not on line)
  3. Substitute the test point into the inequality
  4. Shade the region that satisfies the inequality
Boundary
y = 2x - 3
Line Type
Dashed (>)
Shading
Above line
Step 1: Identify the boundary line

The boundary line is y = 2x - 3. Since the inequality is y > 2x - 3, the boundary line is dashed (not included in the solution).

Step 2: Graph the boundary line

Plot the line y = 2x - 3 using slope = 2 and y-intercept = -3. Draw as a dashed line.

Step 3: Choose a test point

Use the origin (0, 0) since it's not on the line: 0 ≠ 2(0) - 3 = -3

Step 4: Test the point

Substitute (0, 0) into y > 2x - 3: 0 > 2(0) - 3 → 0 > -3 ✓

Step 5: Shade the correct region

Since (0, 0) satisfies the inequality, shade the region containing the origin (above the line).

Dashed line y = 2x - 3, shaded above
Final answer:

The graph shows the dashed boundary line y = 2x - 3 with the region above the line shaded. The dashed line indicates that points on the line are not part of the solution set.

Applied rules:

• Dashed Line: For strict inequalities (< or >)

• Solid Line: For inclusive inequalities (≤ or ≥)

• Test Point Method: Determines which side of the boundary to shade

2 Inequality with Less Than or Equal To
Exercise 2
Graph the inequality 3x + 2y ≤ 6. Rewrite in slope-intercept form, identify the boundary line, and shade the correct region.
Definition:

Slope-Intercept Form: Rewriting inequalities as y = mx + b allows for easier graphing and interpretation of the boundary line.

Rewrite
y ≤ -1.5x + 3
Line Type
Solid (≤)
Shading
Below line
Step 1: Rewrite in slope-intercept form

3x + 2y ≤ 6 → 2y ≤ -3x + 6 → y ≤ -1.5x + 3

Step 2: Identify the boundary line

The boundary line is y = -1.5x + 3. Since the inequality is ≤, the line is solid (included in the solution).

Step 3: Graph the boundary line

Plot the line y = -1.5x + 3 using slope = -1.5 and y-intercept = 3. Draw as a solid line.

Step 4: Choose and test a point

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

Step 5: Shade the solution region

Since (0, 0) satisfies the inequality, shade the region containing the origin (below the line).

Solid line y = -1.5x + 3, shaded below
Final answer:

The graph shows the solid boundary line y = -1.5x + 3 with the region below the line shaded. The solid line indicates that points on the line are part of the solution set.

Applied rules:

• Standard to Slope-Intercept: Solve for y to identify slope and y-intercept

• Solid Boundary: For ≤ or ≥ inequalities (includes boundary line)

• Shading Direction: Test point determines which side to shade

3 Horizontal and Vertical Lines
Exercise 3
Graph the inequalities x > -2 and y ≤ 4 on the same coordinate plane. Describe the solution region formed by both inequalities.
Definition:

Horizontal Line: An equation of the form y = k, where k is a constant. Vertical Line: An equation of the form x = k, where k is a constant.

x > -2
Vertical, dashed, right
y ≤ 4
Horizontal, solid, below
Intersection
Right and below
Step 1: Graph x > -2

Draw a vertical dashed line at x = -2. Since x > -2, shade the region to the right of the line.

Step 2: Graph y ≤ 4

Draw a horizontal solid line at y = 4. Since y ≤ 4, shade the region below the line.

Step 3: Find the intersection

The solution region is where both conditions are satisfied: to the right of x = -2 AND below y = 4.

Step 4: Identify the overlapping region

The solution is the unbounded region to the right of the vertical line and below the horizontal line.

Step 5: Verify with test points

Test (0, 0): x = 0 > -2 ✓ and y = 0 ≤ 4 ✓. The point (0, 0) satisfies both inequalities.

Vertical dashed x = -2 (right), Horizontal solid y = 4 (below), intersection shaded
Final answer:

The solution region is the area to the right of the vertical dashed line x = -2 and below the horizontal solid line y = 4. This represents all points where x > -2 AND y ≤ 4.

Applied rules:

• Vertical Lines: x = k, shade left (x < k) or right (x > k)

• Horizontal Lines: y = k, shade below (y < k) or above (y > k)

• System of Inequalities: Solution is intersection of individual solution regions

Key Concepts and Methods
Ax + By \lt C \text{ or } Ax + By \gt C
Standard Form
Boundary Line
Ax + By = C
Line separating solution regions
Line Type
Dashed vs Solid
Dashed for < or >, Solid for ≤ or ≥
Test Point
(x_0, y_0)
Determines shading direction
Solution Region
\text{Shaded area}
All points satisfying the inequality
Key Definitions:

Linear Inequality in Two Variables: 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 and A and B are not both zero.

Boundary Line: The line formed by replacing the inequality symbol with an equals sign. It separates the coordinate plane into two half-planes.

Solution Region: The set of all ordered pairs (x, y) that satisfy the inequality. This is represented by the shaded area on the graph.

Test Point Method: A method for determining which side of the boundary line contains the solutions by substituting a point not on the line into the inequality.

System of Linear Inequalities: A set of two or more linear inequalities in the same variables. The solution is the intersection of all individual solution regions.

Graphing Strategy:
  1. Identify the Boundary Line: Replace inequality with equality
  2. Determine Line Type: Dashed for < or >, solid for ≤ or ≥
  3. Graph the Boundary Line: Use slope and y-intercept or intercepts
  4. Select a Test Point: Choose a point not on the boundary line
  5. Test the Point: Substitute coordinates into the original inequality
  6. Shade the Solution Region: Shade the side containing points that satisfy the inequality
Tip 1: Always use a test point to determine which side of the boundary line to shade.
Tip 2: Use the origin (0, 0) as a test point when it's not on the boundary line.
Tip 3: Remember: dashed line for strict inequalities, solid line for inclusive inequalities.
Common Applications: Linear programming, constraint problems, optimization, budget constraints, resource allocation.
Graphical Properties: Unbounded regions, corner points, feasible regions, intersection of constraints.
Essential Rules:

• Line Type: Strict inequality (< or >) → Dashed line; Inclusive inequality (≤ or ≥) → Solid line

• Shading Direction: Test point determines which side of the boundary to shade

• Test Point: Any point not on the boundary line works, origin is convenient when available

• System Solutions: Intersection of all individual solution regions

• Verification: Check that points in shaded region satisfy the original inequality

Solution: Exercises 4 to 5
4 System of Inequalities
Exercise 4
Graph the system of inequalities: y ≥ x - 2 and y < -x + 4. Find the solution region and identify at least one point that satisfies both inequalities.
Definition:

System of Linear Inequalities: A set of two or more linear inequalities in the same variables. The solution is the intersection of all individual solution regions.

Ineq 1
y ≥ x - 2 (solid, above)
Ineq 2
y < -x + 4 (dashed, below)
Solution
Intersection
Step 1: Graph first inequality y ≥ x - 2

Draw solid line y = x - 2 (slope = 1, y-intercept = -2). Test (0, 0): 0 ≥ 0 - 2 → 0 ≥ -2 ✓. Shade above the line.

Step 2: Graph second inequality y < -x + 4

Draw dashed line y = -x + 4 (slope = -1, y-intercept = 4). Test (0, 0): 0 < 0 + 4 → 0 < 4 ✓. Shade below the line.

Step 3: Find intersection of regions

The solution is the area that satisfies both conditions: above y = x - 2 AND below y = -x + 4.

Step 4: Identify a solution point

Test (1, 1): y ≥ x - 2 → 1 ≥ 1 - 2 → 1 ≥ -1 ✓ and y < -x + 4 → 1 < -1 + 4 → 1 < 3 ✓

Step 5: Describe the solution region

The solution region is the bounded area between the two lines, including the solid line y = x - 2 but not including the dashed line y = -x + 4.

Solution: Region above y = x - 2 AND below y = -x + 4
Final answer:

The solution region is the intersection of the area above the solid line y = x - 2 and below the dashed line y = -x + 4. Point (1, 1) satisfies both inequalities and lies in the solution region.

Applied rules:

• System Solution: Intersection of all individual solution regions

• Multiple Shading: Solution is where all shaded regions overlap

• Verification: Check that solution points satisfy all inequalities in the system

5 Real-World Application
Exercise 5
A company produces two products with constraints: labor hours (2x + y ≤ 100) and material costs (x + 3y ≤ 150), where x = units of product A and y = units of product B. Graph the feasible region and find the corner points.
Definition:

Feasible Region: The area defined by all constraints in a linear programming problem. It represents all possible combinations of variables that satisfy all constraints.

Constraint 1
2x + y ≤ 100
Constraint 2
x + 3y ≤ 150
Corner Points
(0,0), (0,50), (30,40), (50,0)
Step 1: Graph constraint 2x + y ≤ 100

Boundary line: y = -2x + 100. Intercepts: (0, 100) and (50, 0). Solid line, shade below.

Step 2: Graph constraint x + 3y ≤ 150

Boundary line: y = -x/3 + 50. Intercepts: (0, 50) and (150, 0). Solid line, shade below.

Step 3: Consider non-negativity constraints

We also have x ≥ 0 and y ≥ 0, so the feasible region is in the first quadrant only.

Step 4: Find corner points

Intersections: (0, 0), (0, 50), (50, 0), and intersection of boundary lines: 2x + y = 100 and x + 3y = 150 → x = 30, y = 40

Step 5: Identify the feasible region

The feasible region is the quadrilateral with vertices at (0, 0), (0, 50), (30, 40), and (50, 0).

Corner points: (0,0), (0,50), (30,40), (50,0)
Final answer:

The feasible region is bounded by the constraints and non-negativity conditions. The corner points are (0, 0), (0, 50), (30, 40), and (50, 0). These represent the possible production combinations that satisfy all constraints.

Applied rules:

• Linear Programming: Real-world constraints form a feasible region

• Corner Points: Optimal solutions occur at vertices of the feasible region

• Non-negativity: Often required in real-world applications (x ≥ 0, y ≥ 0)

Comprehensive Summary: Graphing Linear Inequalities in Two Variables
Ax + By \lt C \text{ or } Ax + By \leq C
Standard Form
Key Definitions:

Linear Inequality in Two Variables: 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 and A and B are not both zero.

Boundary Line: The line formed by replacing the inequality symbol with an equals sign. It separates the coordinate plane into two half-planes.

Solution Region: The set of all ordered pairs (x, y) that satisfy the inequality. This is represented by the shaded area on the graph.

Test Point Method: A method for determining which side of the boundary line contains the solutions by substituting a point not on the line into the inequality.

Feasible Region: The area defined by all constraints in a linear programming problem. It represents all possible combinations of variables that satisfy all constraints.

System of Linear Inequalities: A set of two or more linear inequalities in the same variables. The solution is the intersection of all individual solution regions.

Corner Points: The vertices of the feasible region where boundary lines intersect. These are important in optimization problems.

Complete Graphing Process:
  1. Identify the Inequality: Determine the form and which variable to solve for if needed
  2. Graph the Boundary Line: Convert to equation and graph using slope-intercept or intercepts
  3. Determine Line Type: Use solid line for ≤ or ≥, dashed line for < or >
  4. Select Test Point: Choose a point not on the boundary line (origin if available)
  5. Test the Point: Substitute coordinates into the original inequality
  6. Shade Solution Region: Shade the side containing points that satisfy the inequality
  7. Verify Solution: Check that points in shaded region satisfy the original inequality
Tip 1: Always use the test point method to determine shading direction, never guess.
Tip 2: Remember: dashed for strict inequalities, solid for inclusive inequalities.
Tip 3: For systems, the solution is the intersection of all individual solution regions.
Tip 4: In real-world problems, non-negativity constraints (x ≥ 0, y ≥ 0) often apply.
Common Applications: Linear programming, optimization problems, budget constraints, resource allocation, production planning.
Graphical Properties: Unbounded regions, bounded regions, corner points, intersection of constraints, feasible regions.
Essential Properties and Rules:

Line Type Rules:

• Dashed Line: For strict inequalities (< or >) - boundary line not included

• Solid Line: For inclusive inequalities (≤ or ≥) - boundary line included

Shading Rules:

• Test Point Method: If test point satisfies inequality, shade that side

• y > mx + b: Shade above the line

• y < mx + b: Shade below the line

• x > k: Shade to the right of vertical line

• x < k: Shade to the left of vertical line

System Rules:

• Intersection: Solution is intersection of all individual solution regions

• Feasible Region: Bounded by all constraints in a system

• Corner Points: Important for optimization problems

Example Progression

Basic Inequality: y > x + 1 → Dashed line, shade above

Standard Form: 2x + 3y ≤ 6 → Rewrite as y ≤ (-2/3)x + 2, solid line, shade below

Vertical Line: x ≥ 3 → Solid vertical line at x = 3, shade right

Horizontal Line: y < 2 → Dashed horizontal line at y = 2, shade below

System: y ≥ x and y ≤ -x + 4 → Intersection of both regions

Application: x + y ≤ 10 and x ≥ 0, y ≥ 0 → Feasible region in first quadrant

Advanced Applications and Problem-Solving Strategies
\text{Optimization: } z = ax + by \text{ subject to } Ax + By \leq C
Linear Programming
Advanced Concepts:

Linear Programming: Optimization of a linear objective function subject to linear inequality constraints. The optimal solution occurs at a corner point of the feasible region.

Feasible Region Properties: Convex polygon (or unbounded region) formed by intersection of half-planes defined by inequality constraints.

Corner Point Theorem: If an optimal solution exists, it occurs at one or more corner points of the feasible region.

Advanced Problem-Solving Steps:
  1. Identify Variables: Determine what x and y represent in the context
  2. Formulate Constraints: Translate word constraints into mathematical inequalities
  3. Graph Inequalities: Create the feasible region by graphing all constraints
  4. Find Corner Points: Determine vertices of the feasible region
  5. Optimize Objective: If applicable, evaluate objective function at corner points
  6. Interpret Solution: Connect mathematical results back to the real-world context
Tip 1: Always include non-negativity constraints (x ≥ 0, y ≥ 0) in real-world applications.
Tip 2: The feasible region is the intersection of all constraint regions.
Tip 3: If the feasible region is unbounded, check if the objective function has a maximum or minimum.
Tip 4: Always verify that your solution makes sense in the context of the problem.
Common Pitfalls: Forgetting to shade, wrong line type, incorrect shading direction, missing constraints.
Best Practices: Use test points, check all constraints, verify corner points, interpret results in context.
Critical Success Factors:

• Accurate Graphing: Precisely draw boundary lines with correct slope and intercepts

• Correct Line Type: Dashed for strict inequalities, solid for inclusive inequalities

• Proper Shading: Use test points to ensure correct shading direction

• System Integration: For systems, identify intersection of all solution regions

• Context Awareness: Consider real-world constraints and implications

• Verification: Check that solution points satisfy all original constraints

Questions & Answers

Question: How do I know which side of the boundary line to shade? Sometimes I get confused about the direction.

Answer: The foolproof method is the test point method:

  1. Choose any point NOT on the boundary line (the origin (0,0) is easiest if it's not on the line)
  2. Substitute the coordinates of your test point into the original inequality
  3. If the inequality is true, shade the side containing your test point
  4. If the inequality is false, shade the opposite side

For example, for y > 2x + 1, test (0,0): 0 > 2(0) + 1 → 0 > 1 is false, so shade the opposite side of the line from (0,0).

Never try to remember rules like "shade above for >" - the test point method always works.

Question: Why do we use dashed lines for some inequalities and solid lines for others?

Answer: The line type indicates whether points ON the boundary line are included in the solution:

  • Dashed Line: Used for strict inequalities (< or >) - points on the line are NOT part of the solution
  • Solid Line: Used for inclusive inequalities (≤ or ≥) - points on the line ARE part of the solution

For example, in y > x + 1, the line y = x + 1 is dashed because points on the line don't satisfy y > x + 1 (they satisfy y = x + 1). But in y ≥ x + 1, the line y = x + 1 is solid because points on the line DO satisfy the inequality.

The line type tells you whether the boundary itself is part of the solution set.

Question: When graphing a system of inequalities, how do I find the solution? Is it where the shaded areas overlap?

Answer: Yes, exactly! For a system of inequalities:

  • Graph each inequality individually (with correct line type and shading)
  • The solution to the system is the intersection of all individual solution regions
  • This means the solution is where ALL the shaded regions overlap
  • Any point in this overlapping region satisfies ALL the inequalities in the system

For example, if you have y > x and y < -x + 4, the solution is the lens-shaped region where both conditions are true simultaneously.

The system's solution region represents all points that satisfy every single inequality in the system.