System of linear inequalities: A set of two or more linear inequalities with the same variables.
Feasible region: The area of the coordinate plane that satisfies all inequalities in the system.
- Graph each inequality separately
- Identify the region that satisfies all inequalities
- The intersection of all regions is the feasible region
Boundary line: \(y = x + 2\) (solid line)
Slope = 1, y-intercept = 2
Test point (0, 0): \(0 \leq 0 + 2 = 2\) ✓
Shade below the line
Boundary line: \(y = -x + 1\) (solid line)
Slope = -1, y-intercept = 1
Test point (0, 0): \(0 \geq -0 + 1 = 1\) ✗
Shade above the line
The feasible region is where both conditions are satisfied
This is the intersection of both shaded regions
The feasible region is the area above \(y = -x + 1\) and below \(y = x + 2\)
Point (0, 1.5): \(1.5 \leq 0 + 2 = 2\) ✓ and \(1.5 \geq -0 + 1 = 1\) ✓
Point (0, 0): \(0 \leq 0 + 2 = 2\) ✓ but \(0 \geq -0 + 1 = 1\) ✗
The feasible region is the area above \(y = -x + 1\) and below \(y = x + 2\), including the boundary lines.
• System solution: Intersection of all individual solution regions
• Feasible region: Contains all points satisfying all constraints
• Verification: Check with points in the region
Non-negative constraints: Inequalities of the form \(x \geq 0\) and \(y \geq 0\).
Boundary line: \(x = 0\) (the y-axis)
Since \(x \geq 0\), shade to the right of the y-axis
Boundary line: \(y = 0\) (the x-axis)
Since \(y \geq 0\), shade above the x-axis
Convert to slope-intercept: \(y \leq -2x + 6\)
Boundary line: \(y = -2x + 6\) (solid line)
Test point (0, 0): \(2(0) + 0 = 0 \leq 6\) ✓
Shade below the line
The feasible region must satisfy all three constraints:
• \(x \geq 0\) (right of y-axis)
• \(y \geq 0\) (above x-axis)
• \(2x + y \leq 6\) (below line)
The feasible region is a triangle in the first quadrant bounded by:
• x-axis (\(y = 0\))
• y-axis (\(x = 0\))
• Line \(2x + y = 6\)
Point (1, 1): \(1 \geq 0\) ✓, \(1 \geq 0\) ✓, \(2(1) + 1 = 3 \leq 6\) ✓
Point (-1, 1): \(-1 \not\geq 0\) ✗
Point (2, 3): \(2 \geq 0\) ✓, \(3 \geq 0\) ✓, \(2(2) + 3 = 7 \not\leq 6\) ✗
The feasible region is a triangle in the first quadrant bounded by the axes and the line \(2x + y = 6\).
• Non-negative constraints: Restrict to first quadrant
• Multiple constraints: Intersection of all regions
• Verification: Check multiple points in different areas
Unbounded feasible region: A region that extends infinitely in some direction.
Boundary line: \(y = x - 1\) (solid line)
Slope = 1, y-intercept = -1
Test point (0, 0): \(0 \geq 0 - 1 = -1\) ✓
Shade above the line
Boundary line: \(y = 2x + 3\) (solid line)
Slope = 2, y-intercept = 3
Test point (0, 0): \(0 \leq 2(0) + 3 = 3\) ✓
Shade below the line
The feasible region is where both conditions are satisfied
This is the area above \(y = x - 1\) and below \(y = 2x + 3\)
The lines intersect at: \(x - 1 = 2x + 3\)
\(-1 - 3 = 2x - x\)
\(-4 = x\), so \(y = -4 - 1 = -5\)
Intersection point: (-4, -5)
The feasible region is unbounded - it extends infinitely upward between the two lines
Since the slope of the upper bound (2) is greater than the lower bound (1), the region opens upward
Point (-3, 0): \(0 \geq -3 - 1 = -4\) ✓ and \(0 \leq 2(-3) + 3 = -3\) ✗
Point (-3, -1): \(-1 \geq -3 - 1 = -4\) ✓ and \(-1 \leq 2(-3) + 3 = -3\) ✗
Point (0, 0): \(0 \geq 0 - 1 = -1\) ✓ and \(0 \leq 2(0) + 3 = 3\) ✓
The feasible region is unbounded, located between the lines \(y = x - 1\) and \(y = 2x + 3\), extending infinitely upward.
• Unbounded region: Extends infinitely in one or more directions
• Direction: Determined by the slopes of the boundary lines
• Verification: Test points in different areas of the plane
Feasible region: The set of all points that satisfy all inequalities in the system.
Corner point: A vertex of the feasible region where boundary lines intersect.
Bounded region: A region that can be enclosed within a finite area.
- Graph each inequality: Draw boundary lines and shade appropriate regions
- Identify intersection: Find area satisfying all inequalities
- Determine boundedness: Check if region is finite or infinite
- Find corner points: Calculate intersections of boundary lines
- Verify solution: Test points in the feasible region
Empty feasible region: A system with no solution because the constraints contradict each other.
Boundary line: \(y = 2x + 1\) (dashed line)
Slope = 2, y-intercept = 1
Test point (0, 0): \(0 > 2(0) + 1 = 1\) ✗
Shade above the line
Boundary line: \(y = 2x - 3\) (dashed line)
Slope = 2, y-intercept = -3
Test point (0, 0): \(0 < 2(0) - 3 = -3\) ✗
Shade below the line
Both lines have the same slope (2) but different y-intercepts (1 and -3)
This means the lines are parallel
The first inequality wants points above the first line
The second inequality wants points below the second line
Since the lines are parallel and the first line is above the second line, there is no region that is simultaneously above the first line and below the second line
The system has no solution
For a point to satisfy both: \(2x + 1 < y < 2x - 3\)
This implies: \(2x + 1 < 2x - 3\)
Simplifying: \(1 < -3\), which is false
Therefore, no solution exists
The system has no solution because the constraints are contradictory (parallel lines with no overlapping region).
• Parallel lines: Same slope, different y-intercept → no intersection
• Contradictory constraints: May result in empty feasible region
• Verification: Check algebraically when graphing suggests no solution
Real-world constraints: Practical limitations that translate to mathematical inequalities.
Let x = number of units of Product A, y = number of units of Product B
Labor constraint: \(2x + y \leq 100\) (2 hours for A + 1 hour for B ≤ 100 hours)
Machine time constraint: \(x + 2y \leq 80\) (1 hour for A + 2 hours for B ≤ 80 hours)
Non-negativity constraints: \(x \geq 0, y \geq 0\)
Convert: \(y \leq -2x + 100\)
Boundary: \(y = -2x + 100\)
Intercepts: (0, 100) and (50, 0)
Test (0, 0): \(2(0) + 0 = 0 \leq 100\) ✓
Shade below the line
Convert: \(y \leq -\frac{1}{2}x + 40\)
Boundary: \(y = -\frac{1}{2}x + 40\)
Intercepts: (0, 40) and (80, 0)
Test (0, 0): \(0 + 2(0) = 0 \leq 80\) ✓
Shade below the line
\(x \geq 0\): Shade to the right of y-axis
\(y \geq 0\): Shade above x-axis
The feasible region is the intersection of all four constraints
It's a quadrilateral in the first quadrant bounded by all four lines
Corner points: (0, 0), (0, 40), (intersection point), (50, 0)
Find intersection of \(y = -2x + 100\) and \(y = -\frac{1}{2}x + 40\):
\(-2x + 100 = -\frac{1}{2}x + 40\)
\(-2x + \frac{1}{2}x = 40 - 100\)
\(-\frac{3}{2}x = -60\)
\(x = 40\), so \(y = -2(40) + 100 = 20\)
Intersection: (40, 20)
The feasible region is a quadrilateral with vertices at (0,0), (0,40), (40,20), and (50,0), representing all possible daily production combinations that satisfy the constraints.
• Variable definition: Clearly define what each variable represents
• Constraint identification: Translate each practical limitation into an inequality
• Non-negativity: Include physical constraints (cannot produce negative amounts)
System of linear inequalities: A collection of linear inequalities that must all be satisfied simultaneously.
Feasible region: The intersection of all solution regions of the individual inequalities.
Corner point: A vertex of the feasible region formed by the intersection of boundary lines.
- Graph each inequality: Draw boundary lines and determine shading
- Find intersection: Identify region satisfying all constraints
- Determine boundedness: Check if region is finite or infinite
- Calculate corner points: Find intersections of boundary lines
- Verify solution: Check with test points in the region
• Intersection: Feasible region is intersection of all individual regions
• Corner points: Critical for optimization problems
• Bounded/unbounded: Determines solution space characteristics
• Verification: Always test points in the feasible region
Key Properties of Systems of Inequalities:
- Feasible Region: Intersection of all constraint regions
- Corner Points: Vertices of the feasible region
- Bounded/Unbounded: Finite or infinite solution space
- Multiple Constraints: Each adds a restriction to the solution space