Solution Region: The area on the coordinate plane that contains all points satisfying the inequality. The boundary line separates the solution region from the non-solution region.
- Graph the boundary line (solid for ≤ or ≥, dashed for < or >)
- Choose a test point not on the boundary line
- Substitute the test point into the original inequality
- If true, shade the region containing the test point
- If false, shade the opposite region
For 2x + 3y = 12: x-intercept (y=0): 2x = 12 → x = 6, so (6, 0)
y-intercept (x=0): 3y = 12 → y = 4, so (0, 4)
Since the inequality is ≤, draw a solid line through (6, 0) and (0, 4).
Use (0, 0) since it's not on the boundary line.
Substitute (0, 0) into 2x + 3y ≤ 12: 2(0) + 3(0) ≤ 12 → 0 ≤ 12 ✓
Since the test point satisfies the inequality, shade the region containing (0, 0), which is below the line.
Test (1, 1): 2(1) + 3(1) = 5 ≤ 12 ✓ (in shaded region)
Test (5, 3): 2(5) + 3(3) = 19 ≤ 12 ✗ (not in shaded region)
The solution region is the area below and including the line 2x + 3y = 12. The boundary line is solid because the inequality includes equality (≤). All points in the shaded region satisfy 2x + 3y ≤ 12.
• Line Type: Solid for ≤ or ≥, dashed for < or >
• Test Point Method: Determines which side of boundary to shade
• Verification: Check that points in shaded region satisfy original inequality
Feasible Region: The intersection of all individual solution regions in a system of inequalities. It represents all points that satisfy all constraints simultaneously.
Boundary line: x + y = 6. Intercepts: (6, 0) and (0, 6). Solid line. Test (0, 0): 0 + 0 ≤ 6 ✓. Shade below.
Boundary line: 2x - y = 2. Rewrite as y = 2x - 2. Intercepts: (1, 0) and (0, -2). Solid line. Test (0, 0): 2(0) - 0 ≥ 2 → 0 ≥ 2 ✗. Shade above the line.
Solve system: x + y = 6 and 2x - y = 2. Adding equations: 3x = 8 → x = 8/3. Then y = 6 - 8/3 = 10/3. Intersection: (8/3, 10/3).
The feasible region is where both conditions are satisfied: below x + y = 6 AND above 2x - y = 2.
Corner points occur where boundary lines intersect each other and axes. For this system: (8/3, 10/3) is one corner point.
The feasible region is unbounded above and to the right, but bounded by the two constraint lines and the axes if considering non-negative constraints.
The feasible region is the area that satisfies both inequalities simultaneously. It's bounded by the lines x + y = 6 and 2x - y = 2. One corner point is at (8/3, 10/3), where the two lines intersect.
• System Solution: Intersection of individual solution regions
• Corner Points: Intersections of boundary lines
• Verification: Points in feasible region satisfy all constraints
Bounded Region: A feasible region that is enclosed and finite in area. Unbounded Region: A feasible region that extends infinitely in at least one direction.
Boundary line: y = x - 2. Solid line. Test (0, 0): 0 ≥ -2 ✓. Shade above the line.
Boundary line: y = -x + 2. Solid line. Test (0, 0): 0 ≥ 2 ✗. Shade above the line.
Boundary line: x = 0 (y-axis). Solid line. Shade to the right of the y-axis.
Lines y = x - 2 and y = -x + 2 intersect when: x - 2 = -x + 2 → 2x = 4 → x = 2, y = 0. Point: (2, 0)
Line y = -x + 2 intersects y-axis (x = 0) at: y = -0 + 2 = 2. Point: (0, 2)
The region is above both slanted lines and to the right of the y-axis. It forms a triangular region with vertices at (0, 2) and (2, 0).
The region extends infinitely upward (as x increases, y can increase without bound), making it unbounded. The corner points are (0, 2) and (2, 0).
The feasible region is unbounded. It has corner points at (0, 2) and (2, 0). The region extends infinitely upward and to the right, satisfying all three constraints but having infinite area.
• Unbounded Detection: Region extends infinitely in any direction
• Vertex Calculation: Intersections of active constraints
• Feasibility: Region still valid even if unbounded
Solution Region: The set of all points (x, y) that satisfy a given inequality or system of inequalities.
Boundary Line: The line that separates the solution region from the non-solution region. It's formed by replacing the inequality symbol with an equals sign.
Feasible Region: The area defined by all constraints in a system of inequalities. It represents all possible solutions that satisfy all conditions.
Corner Point (Vertex): A point where two or more boundary lines intersect in a feasible region.
Bounded Region: A region that is enclosed and has finite area.
Unbounded Region: A region that extends infinitely in at least one direction.
Test Point Method: A technique for determining which side of a boundary line to shade by substituting coordinates of a point not on the line into the original inequality.
System of Inequalities: A set of two or more inequalities that must all be satisfied simultaneously.
- Identify the Inequality: Determine the form and variables
- Graph Boundary Line: Convert to equation and graph using intercepts or slope-intercept form
- Determine Line Type: Solid for ≤ or ≥, dashed for < or >
- Choose Test Point: Select a point not on the boundary line
- Test Point Substitution: Substitute coordinates into original inequality
- Shade Solution Region: Shade the side containing points that satisfy the inequality
- For Systems: Find intersection of all individual solution regions
• Line Type Rule: Solid for inclusive inequalities (≤, ≥), dashed for strict inequalities (<, >)
• Shading Rule: If test point satisfies inequality, shade that side; otherwise, shade opposite side
• System Rule: Solution is intersection of all individual solution regions
• Verification: Always check that points in shaded region satisfy original inequality
Constraint Modeling: Translating real-world limitations into mathematical inequalities to define a feasible region for optimization problems.
Let x = units of Product A, y = units of Product B
Labor constraint: 2x + y ≤ 100
Machine constraint: x + 3y ≤ 150
Non-negativity: x ≥ 0, y ≥ 0
For 2x + y ≤ 100: Boundary line through (0, 100) and (50, 0), shade below
For x + 3y ≤ 150: Boundary line through (0, 50) and (150, 0), shade below
For x ≥ 0: Shade right of y-axis
For y ≥ 0: Shade above x-axis
Intersection of 2x + y = 100 and x + 3y = 150:
From first equation: y = 100 - 2x
Substitute: x + 3(100 - 2x) = 150 → x + 300 - 6x = 150 → -5x = -150 → x = 30
Then y = 100 - 2(30) = 40. Point: (30, 40)
The feasible region is a quadrilateral with vertices at: (0, 0), (0, 50), (30, 40), and (50, 0).
The feasible region is bounded and represents all possible production combinations that satisfy all resource constraints.
The feasible region is a bounded quadrilateral with corner points at (0, 0), (0, 50), (30, 40), and (50, 0). These represent the possible production combinations that satisfy all resource constraints: 100 labor hours and 150 machine hours.
• Constraint Translation: Convert word constraints to mathematical inequalities
• Non-negativity: Include x ≥ 0 and y ≥ 0 for real-world problems
• Vertex Calculation: Solve systems of boundary equations
Inconsistent System: A system of inequalities with no solution. This occurs when the solution regions do not overlap.
Boundary line: y = x + 3 (dashed). Test (0, 0): 0 > 3 ✗. Shade above the line.
Boundary line: y = x - 1 (dashed). Test (0, 0): 0 < -1 ✗. Shade below the line.
Both lines have the same slope (1) but different y-intercepts. They are parallel lines: y = x + 3 and y = x - 1.
For a point to satisfy both inequalities: y > x + 3 AND y < x - 1. This would require y > x + 3 > x - 1 + 4 = x + 3, which is impossible.
Since the solution regions do not overlap (the "above" region is completely separated from the "below" region), there is no solution to the system. This is an inconsistent system.
There is no solution to this system. The inequalities represent regions on opposite sides of parallel lines, so there is no overlap between the solution regions. This is an inconsistent system.
• Parallel Lines: Same slope, different intercepts → no intersection
• Impossible Combination: y > a and y < b when a ≥ b
• Consistency Check: Verify if solution regions have any overlap
Solution Region: The set of all points (x, y) that satisfy a given inequality or system of inequalities. It represents the area on the coordinate plane where the inequality holds true.
Boundary Line: The line formed by replacing the inequality symbol with an equals sign. It separates the solution region from the non-solution region.
Feasible Region: The area defined by all constraints in a system of inequalities. It represents all possible solutions that satisfy all conditions simultaneously.
Corner Point (Vertex): A point where two or more boundary lines intersect in a feasible region. These are critical in optimization problems.
Bounded Region: A feasible region that is enclosed and finite in area. All variables are constrained within finite bounds.
Unbounded Region: A feasible region that extends infinitely in at least one direction.
Consistent System: A system that has at least one solution (feasible region is not empty).
Inconsistent System: A system that has no solution (feasible region is empty).
- Identify the Inequality: Determine the form and variables involved
- Graph the Boundary Line: Convert inequality to equation and graph using intercepts or slope-intercept form
- Determine Line Type: Solid line for ≤ or ≥, dashed line for < or >
- Choose a Test Point: Select a point not on the boundary line (often origin if available)
- Test the Point: Substitute coordinates into original inequality
- Shade the Solution Region: Shade the side containing points that satisfy the inequality
- For Systems: Find intersection of all individual solution regions
- Identify Corner Points: Find intersections of boundary lines
Line Type Rules:
• Solid Line: For inequalities with ≤ or ≥ (boundary included in solution)
• Dashed Line: For inequalities with < or > (boundary not included in solution)
Shading Rules:
• Test Point Method: If test point satisfies inequality, shade that side
• Direction: Positive slope patterns, negative slope patterns
System Rules:
• Intersection: Solution is intersection of all individual solution regions
• Consistency: Check if intersection is non-empty
• Corner Points: Occur at intersections of boundary lines
Simple Case: Single inequality y > x (half-plane)
System: Two inequalities forming a wedge
Bounded: Three or more inequalities creating a polygon
Unbounded: Region extending infinitely in one direction
Inconsistent: Parallel constraints with no overlap
Identity: Constraint that doesn't limit the region
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.
Corner Point Theorem: If a linear programming problem has an optimal solution, it occurs at one or more corner points of the feasible region.
Redundant Constraints: Constraints that don't affect the feasible region because they're already implied by other constraints.
- Model Formulation: Translate real-world problem into mathematical constraints
- Feasible Region Analysis: Identify vertices and determine boundedness
- Objective Function: Define what needs to be maximized or minimized
- Corner Point Evaluation: Calculate objective function at each vertex
- Optimal Solution: Select vertex that gives best value of objective function
- Sensitivity Analysis: Examine how changes in constraints affect the solution
• 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 determine if a solution region is bounded or unbounded?
Answer: A solution region is:
- Bounded: If it can be enclosed within a circle of finite radius. All variables have both minimum and maximum possible values.
- Unbounded: If it extends infinitely in at least one direction. At least one variable can increase or decrease without bound.
To check:
- Look for constraints in all directions (left, right, up, down)
- If there's no constraint in some direction, the region extends infinitely in that direction
- Count the number of corner points - bounded regions have a finite number of vertices
For example, if you have constraints x ≥ 0, y ≥ 0, and x + y ≤ 10, the region is bounded because it's confined to the first quadrant and limited by the line x + y = 10.
Question: What's the difference between a solid line and a dashed line in solution regions?
Answer: The line type indicates whether the boundary is included in the solution:
- Solid Line: Used for ≤ or ≥ inequalities. Points on the line are included in the solution region.
- Dashed Line: Used for < or > inequalities. Points on the line are NOT included in the solution region.
For example:
- y ≥ 2x + 1: Solid line, shade above (including the line)
- y > 2x + 1: Dashed line, shade above (excluding the line)
This distinction is crucial because it affects which points satisfy the inequality.
Question: How do I know which side to shade when graphing an inequality?
Answer: Use the test point method:
- Choose a point that is NOT on the boundary line (the origin (0,0) is often convenient)
- Substitute the coordinates of the test point into the original inequality
- If the inequality is true, shade the side containing the test point
- If the inequality is false, shade the opposite side
For example, for y > 2x - 3:
- Test point (0,0): Is 0 > 2(0) - 3? → Is 0 > -3? ✓
- Since true, shade the side containing (0,0)
This method always works regardless of the inequality form.