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.
- Graph the boundary line (dashed for < or >, solid for ≤ or ≥)
- Choose a test point not on the line (usually origin if not on line)
- Substitute the test point into the inequality
- Shade the region that satisfies the inequality
The boundary line is y = 2x - 3. Since the inequality is y > 2x - 3, the boundary line is dashed (not included in the solution).
Plot the line y = 2x - 3 using slope = 2 and y-intercept = -3. Draw as a dashed line.
Use the origin (0, 0) since it's not on the line: 0 ≠ 2(0) - 3 = -3
Substitute (0, 0) into y > 2x - 3: 0 > 2(0) - 3 → 0 > -3 ✓
Since (0, 0) satisfies the inequality, shade the region containing the origin (above the line).
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.
• Dashed Line: For strict inequalities (< or >)
• Solid Line: For inclusive inequalities (≤ or ≥)
• Test Point Method: Determines which side of the boundary to shade
Slope-Intercept Form: Rewriting inequalities as y = mx + b allows for easier graphing and interpretation of the boundary line.
3x + 2y ≤ 6 → 2y ≤ -3x + 6 → y ≤ -1.5x + 3
The boundary line is y = -1.5x + 3. Since the inequality is ≤, the line is solid (included in the solution).
Plot the line y = -1.5x + 3 using slope = -1.5 and y-intercept = 3. Draw as a solid line.
Test (0, 0): 3(0) + 2(0) ≤ 6 → 0 ≤ 6 ✓
Since (0, 0) satisfies the inequality, shade the region containing the origin (below the line).
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.
• 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
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.
Draw a vertical dashed line at x = -2. Since x > -2, shade the region to the right of the line.
Draw a horizontal solid line at y = 4. Since y ≤ 4, shade the region below the line.
The solution region is where both conditions are satisfied: to the right of x = -2 AND below y = 4.
The solution is the unbounded region to the right of the vertical line and below the horizontal line.
Test (0, 0): x = 0 > -2 ✓ and y = 0 ≤ 4 ✓. The point (0, 0) satisfies both inequalities.
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.
• 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
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.
- Identify the Boundary Line: Replace inequality with equality
- Determine Line Type: Dashed for < or >, solid for ≤ or ≥
- Graph the Boundary Line: Use slope and y-intercept or intercepts
- Select a Test Point: Choose a point not on the boundary line
- Test the Point: Substitute coordinates into the original inequality
- Shade the Solution Region: Shade the side containing points that satisfy the inequality
• 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
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.
Draw solid line y = x - 2 (slope = 1, y-intercept = -2). Test (0, 0): 0 ≥ 0 - 2 → 0 ≥ -2 ✓. Shade above the line.
Draw dashed line y = -x + 4 (slope = -1, y-intercept = 4). Test (0, 0): 0 < 0 + 4 → 0 < 4 ✓. Shade below the line.
The solution is the area that satisfies both conditions: above y = x - 2 AND below y = -x + 4.
Test (1, 1): y ≥ x - 2 → 1 ≥ 1 - 2 → 1 ≥ -1 ✓ and y < -x + 4 → 1 < -1 + 4 → 1 < 3 ✓
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.
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.
• 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
Feasible Region: The area defined by all constraints in a linear programming problem. It represents all possible combinations of variables that satisfy all constraints.
Boundary line: y = -2x + 100. Intercepts: (0, 100) and (50, 0). Solid line, shade below.
Boundary line: y = -x/3 + 50. Intercepts: (0, 50) and (150, 0). Solid line, shade below.
We also have x ≥ 0 and y ≥ 0, so the feasible region is in the first quadrant only.
Intersections: (0, 0), (0, 50), (50, 0), and intersection of boundary lines: 2x + y = 100 and x + 3y = 150 → x = 30, y = 40
The feasible region is the quadrilateral with vertices at (0, 0), (0, 50), (30, 40), and (50, 0).
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.
• 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)
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.
- Identify the Inequality: Determine the form and which variable to solve for if needed
- Graph the Boundary Line: Convert to equation and graph using slope-intercept or intercepts
- Determine Line Type: Use solid line for ≤ or ≥, dashed line for < or >
- Select Test Point: Choose a point not on the boundary line (origin if available)
- Test the Point: Substitute coordinates into the original inequality
- Shade Solution Region: Shade the side containing points that satisfy the inequality
- Verify Solution: Check that points in shaded region satisfy the original inequality
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
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
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.
- Identify Variables: Determine what x and y represent in the context
- Formulate Constraints: Translate word constraints into mathematical inequalities
- Graph Inequalities: Create the feasible region by graphing all constraints
- Find Corner Points: Determine vertices of the feasible region
- Optimize Objective: If applicable, evaluate objective function at corner points
- Interpret Solution: Connect mathematical results back to the real-world context
• 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:
- Choose any point NOT on the boundary line (the origin (0,0) is easiest if it's not on the line)
- Substitute the coordinates of your test point into the original inequality
- If the inequality is true, shade the side containing your test point
- 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.