System of linear inequalities: A set of two or more linear inequalities with the same variables. The solution is the intersection of all individual solution sets.
- Graph each inequality separately
- Shade the solution region for each inequality
- Find the intersection of all shaded regions
- This intersection is the solution to the system
Draw solid line y = x + 2 (slope 1, y-intercept 2), shade below line
Draw dashed line y = -x + 1 (slope -1, y-intercept 1), shade above line
The solution is where both shadings overlap
Test point (0, 1.5): 1.5 ≤ 0 + 2 ✓ and 1.5 > -0 + 1 ✓
The overlapping area satisfies both inequalities simultaneously
The solution is the region where both inequalities are satisfied simultaneously
• System solution: Intersection of all individual solution sets
• Line types: ≤ uses solid line, > uses dashed line
• Feasible region: Area satisfying all constraints
Constraints: Restrictions that limit the possible solutions. 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 = 4 (intercepts at (4,0) and (0,4)), shade below line
The solution is the triangular region in the first quadrant bounded by x + y = 4
Test point (1, 1): 1 ≥ 0 ✓, 1 ≥ 0 ✓, 1 + 1 ≤ 4 ✓
The solution is a triangular region with vertices at (0,0), (4,0), and (0,4)
• 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
Feasible region: The area of the coordinate plane that satisfies all constraints simultaneously. This region may be bounded (finite area) or unbounded (infinite area).
Draw solid line y = 2x (passes through origin with slope 2), shade below line
Draw solid line y = -x + 3 (slope -1, y-intercept 3), shade above line
Draw solid vertical line x = 4, shade to the left of the line
The solution is where all three shaded areas overlap
The resulting region is a polygon bounded by all three constraints
The solution is a polygonal region bounded by all three 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
System of linear inequalities: A collection of two or more linear inequalities with the same variables. The solution is the set of all ordered pairs that satisfy every inequality in the system.
Feasible region: The area of the coordinate plane that satisfies all constraints simultaneously. This region may be bounded or unbounded.
Constraint: An inequality that limits the possible solutions to a system.
Corner point (vertex): A point where boundary lines of the feasible region intersect.
Bounded region: A region that can be enclosed within a circle (finite area).
Unbounded region: A region that extends infinitely in one or more directions.
- Graph each inequality: Draw boundary lines and shade appropriate regions
- Determine line types: Solid for ≤ or ≥, dashed for < or >
- Determine shading: Test a point to decide which side to shade
- Find intersection: Identify where all shaded regions overlap
- Identify feasible region: The overlapping area is the solution
- Verify solution: Test a point in the feasible region
Compound inequality: An inequality that combines two inequalities using "and". The system 1 ≤ x ≤ 3 is equivalent to x ≥ 1 AND x ≤ 3.
1 ≤ x ≤ 3 becomes x ≥ 1 AND x ≤ 3
2 ≤ y ≤ 4 becomes y ≥ 2 AND y ≤ 4
Draw solid vertical line x = 1, shade to the right
Draw solid vertical line x = 3, shade to the left
Draw solid horizontal line y = 2, shade above
Draw solid horizontal line y = 4, shade below
The solution is the rectangular region between these boundaries
The solution is a rectangle with vertices at (1,2), (3,2), (3,4), and (1,4)
• Compound inequalities: Can be split into separate constraints
• Bounded rectangle: Four constraints create rectangular feasible region
• Intersection principle: All constraints must be satisfied simultaneously
Unbounded feasible region: A solution region that extends infinitely in one or more directions. The region is still constrained by the inequalities but has infinite area.
Draw solid line y = x - 1 (slope 1, y-intercept -1), shade above line
Draw solid line y = -x + 3 (slope -1, y-intercept 3), shade below line
Draw solid horizontal line y = 0 (x-axis), shade above line
The solution is where all three shaded areas overlap
The region is bounded on the top but extends infinitely downward
The solution is an unbounded region with a vertex at (2,1) extending downward
• Unbounded regions: Some constraints may allow infinite extension
• Intersection principle: Solution must satisfy ALL constraints
• Vertex identification: Important points where boundary lines meet
System of linear inequalities: A set of two or more linear inequalities with the same variables. The solution is the intersection of all individual solution sets.
Feasible region: The set of all points that satisfy all constraints in the system simultaneously. This is the solution to the system.
Constraint: An inequality that restricts the possible solutions to the system.
Corner point (vertex): A point where boundary lines of the feasible region intersect. These points are important for optimization problems.
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.
Empty solution set: When constraints are contradictory and no points satisfy all inequalities.
- Identify all constraints: List each inequality in the system
- Graph each boundary line: Convert each inequality to an equation and graph the line
- 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 feasible region is where all shadings overlap
- Verify solution: Test a point in the feasible region to ensure it satisfies all constraints
• Intersection principle: System solution is intersection of all individual solution sets
• Line type rule: ≤ and ≥ use solid lines, < and > use dashed lines
• Shading rule: Test a point to determine which side to shade
• Feasible region: Must satisfy all constraints simultaneously
• Contradictory constraints: May result in empty solution set