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.
- Graph the boundary line (replace inequality with equals)
- Determine line type: solid for ≤ or ≥, dashed for < or >
- Test a point not on the line to determine shading direction
- Shade the region containing points that satisfy the inequality
x-intercept: Let y = 0: 2x = 6 → x = 3, point (3, 0)
y-intercept: Let x = 0: 3y = 6 → y = 2, point (0, 2)
Connect points (3, 0) and (0, 2). Since ≤ includes the boundary, draw a solid line.
Test point (0, 0): 2(0) + 3(0) ≤ 6 → 0 ≤ 6 ✓
Since (0, 0) satisfies the inequality, shade the region containing (0, 0)
Points below or on the line satisfy 2x + 3y ≤ 6
The solution region is the area below the solid line 2x + 3y = 6 including the line itself
• 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
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.
Draw solid line x + y = 2 (intercepts at (2,0) and (0,2)), shade above line
Draw solid line x - y = 4 (intercepts at (4,0) and (0,-4)), shade below line
The solution region is where both shadings overlap
Test point (3, 1): 3 + 1 ≥ 2 ✓ and 3 - 1 ≤ 4 ✓
The overlapping area satisfies both inequalities simultaneously
The solution region is the area where both inequalities are satisfied simultaneously
• System solution: Intersection of all individual solution sets
• Boundary inclusion: ≥ and ≤ include boundary lines
• Overlapping regions: Only the intersection is the solution
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.
Shade to the right of vertical line x = 0 (y-axis), including the line
Shade above horizontal line y = 0 (x-axis), including the line
Draw solid line x + y = 3 (intercepts at (3,0) and (0,3)), shade below line
The solution region is the triangular area in the first quadrant
Corner points: (0,0), (3,0), and (0,3)
The solution region is a triangle with vertices at (0,0), (3,0), and (0,3)
• 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
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.
- Identify constraints: List all inequalities in the system
- Graph boundary lines: Draw each line by converting inequalities to equations
- Determine line types: Solid for ≤ or ≥, dashed for < or >
- Test points for shading: Choose a test point for each inequality
- Shade individual regions: Shade the appropriate side of each boundary line
- Find intersection: The solution region is where all shadings overlap
- Verify solution: Test a point in the solution region
Quadrilateral feasible region: A four-sided polygonal region formed by four linear constraints. Each constraint adds a boundary to the region.
Draw solid vertical line x = 1, shade to the right of the line
Draw solid horizontal line y = 1, shade above the line
Draw solid line x + y = 5 (intercepts at (5,0) and (0,5)), shade below line
Draw solid vertical line x = 4, shade to the left of the line
The solution region is where all four shadings overlap
Find intersections of boundary lines to determine corner points
The solution region is a quadrilateral bounded by all four constraints
• 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
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.
Draw solid line y = x - 2 (slope 1, y-intercept -2), shade above line
Draw solid line y = -x + 4 (slope -1, y-intercept 4), shade below line
Draw solid vertical line x = 0 (y-axis), shade to the right of the line
The solution region is where all three shadings overlap
The region is bounded on the right by the intersection of the lines but extends infinitely downward
The solution region is unbounded, extending infinitely in the negative y-direction
• Unbounded regions: Some constraints may allow infinite extension
• Intersection principle: Solution must satisfy ALL constraints
• Constraint analysis: Identify which boundaries are restrictive
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.
- Identify all constraints: List each inequality in the system
- Graph each boundary line: Convert inequalities to equations and graph the lines
- Determine line types: Use solid lines for ≤ or ≥, dashed lines for < or >
- Test points for shading: Choose a test point for each inequality to determine shading direction
- Shade solution regions: Shade the appropriate side of each boundary line
- Find intersection: The solution region is where all shadings overlap
- Identify vertices: Find corner points where boundary lines intersect
- Verify solution: Test a point in the solution region to ensure all constraints are satisfied
• 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