Feasible region: The area of the coordinate plane that satisfies all inequalities in the system simultaneously.
Corner point: A vertex of the feasible region formed by the intersection of boundary lines.
- Graph each boundary line
- Determine shading for each inequality
- Identify the intersection of all shaded regions
- Mark corner points where boundaries intersect
Boundary line: \(y = 2x + 4\) (solid line)
Slope = 2, y-intercept = 4
Test point (0, 0): \(0 \leq 2(0) + 4 = 4\) ✓
Shade below the line
Boundary line: \(y = -x + 2\) (solid line)
Slope = -1, y-intercept = 2
Test point (0, 0): \(0 \geq -0 + 2 = 2\) ✗
Shade above the line
Boundary line: \(x = 0\) (the y-axis, solid line)
Shade to the right of the y-axis
The feasible region is the intersection of all three shaded areas
This is the area that is simultaneously below the first line, above the second line, and to the right of the y-axis
Find intersections of boundary lines:
Intersection of \(y = 2x + 4\) and \(y = -x + 2\):
\(2x + 4 = -x + 2\)
\(3x = -2\)
\(x = -\frac{2}{3}\), \(y = -(-\frac{2}{3}) + 2 = \frac{8}{3}\)
However, since \(x \geq 0\), this point is not in the feasible region.
Intersection of \(y = 2x + 4\) and \(x = 0\): \((0, 4)\)
Intersection of \(y = -x + 2\) and \(x = 0\): \((0, 2)\)
Intersection of \(y = 2x + 4\) and \(y = -x + 2\) with \(x \geq 0\): Need to find where the lines cross the feasible region.
Corner points of the feasible region:
• \((0, 2)\): intersection of \(x = 0\) and \(y = -x + 2\)
• \((0, 4)\): intersection of \(x = 0\) and \(y = 2x + 4\)
• Find where \(y = -x + 2\) intersects \(y = 2x + 4\):
\(-x + 2 = 2x + 4\)
\(-3x = 2\)
\(x = -\frac{2}{3}\) (negative, so not in feasible region)
Instead, find where the lines intersect the boundary of the feasible region.
Actually, let me recalculate: The intersection point \((-\frac{2}{3}, \frac{8}{3})\) is not in the feasible region because \(x \geq 0\).
The feasible region is bounded by: \(x = 0\), \(y = -x + 2\), and the intersection of \(y = 2x + 4\) with the positive region.
Wait, let me recalculate the corner points properly:
Corner points: \((0, 2)\), \((0, 4)\), and the point where \(y = -x + 2\) intersects with the line from \((0, 4)\) in the positive x direction.
The actual corner points are: \((0, 2)\) and \((0, 4)\), and potentially other points depending on the shape.
For \(x \geq 0\), the feasible region extends indefinitely in the positive x direction, bounded below by \(y = -x + 2\) and above by \(y = 2x + 4\).
The feasible region is bounded by \(x = 0\), \(y = -x + 2\), and \(y = 2x + 4\), with corner points at \((0, 2)\) and \((0, 4)\).
• Intersection: The feasible region is the intersection of all individual solution regions
• Corner points: Found at intersections of boundary lines within the feasible region
• Verification: Test points in the region to confirm accuracy
Bounded feasible region: A region that can be enclosed within a finite area.
Convert: \(y \leq -x + 6\)
Boundary: \(y = -x + 6\)
Intercepts: (0, 6) and (6, 0)
Test (0, 0): \(0 + 0 = 0 \leq 6\) ✓
Shade below the line
Convert: \(y \leq -2x + 8\)
Boundary: \(y = -2x + 8\)
Intercepts: (0, 8) and (4, 0)
Test (0, 0): \(2(0) + 0 = 0 \leq 8\) ✓
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 in the first quadrant, bounded by all four constraints
It's a quadrilateral bounded by the axes and the two constraint lines
• Origin: \((0, 0)\)
• Intersection of \(x = 0\) and \(x + y = 6\): \((0, 6)\)
• Intersection of \(y = 0\) and \(2x + y = 8\): \((4, 0)\)
• Intersection of \(x + y = 6\) and \(2x + y = 8\):
From first: \(y = 6 - x\)
Substitute into second: \(2x + (6 - x) = 8\)
\(x + 6 = 8\), so \(x = 2\), \(y = 4\)
Point: \((2, 4)\)
Check \((2, 4)\):
\(x + y = 2 + 4 = 6 \leq 6\) ✓
\(2x + y = 4 + 4 = 8 \leq 8\) ✓
\(x = 2 \geq 0\) ✓, \(y = 4 \geq 0\) ✓
The feasible region is a quadrilateral with corner points at \((0, 0)\), \((0, 6)\), \((2, 4)\), and \((4, 0)\).
• Bounded region: Finite area with defined boundaries
• Corner points: Critical for optimization problems
• Verification: Check each corner point satisfies all constraints
Unbounded feasible region: A region that extends infinitely in at least one direction.
Boundary line: \(y = x - 2\) (solid line)
Slope = 1, y-intercept = -2
Test point (0, 0): \(0 \geq 0 - 2 = -2\) ✓
Shade above the line
Boundary line: \(y = -\frac{1}{2}x + 4\) (solid line)
Slope = -1/2, y-intercept = 4
Test point (0, 0): \(0 \leq -\frac{1}{2}(0) + 4 = 4\) ✓
Shade below the line
The feasible region is the intersection of both shaded areas
This is the area above the first line and below the second line
Find intersection point: \(x - 2 = -\frac{1}{2}x + 4\)
\(x + \frac{1}{2}x = 4 + 2\)
\(\frac{3}{2}x = 6\)
\(x = 4\), so \(y = 4 - 2 = 2\)
Intersection: \((4, 2)\)
Since the slope of the upper bound \((-1/2)\) is less than the slope of the lower bound \((1)\), the region extends infinitely downward
This creates an unbounded feasible region
Point (4, 2): \(2 \geq 4 - 2 = 2\) ✓ and \(2 \leq -\frac{1}{2}(4) + 4 = 2\) ✓
Point (0, 0): \(0 \geq 0 - 2 = -2\) ✓ and \(0 \leq -\frac{1}{2}(0) + 4 = 4\) ✓
Point (10, -5): \(-5 \geq 10 - 2 = 8\) ✗
The feasible region is unbounded, located between the lines \(y = x - 2\) and \(y = -\frac{1}{2}x + 4\), extending infinitely in the direction of decreasing y-values.
• 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 determine shading
- Identify intersection: Find area satisfying all constraints
- 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 = 3x + 1\) (dashed line)
Slope = 3, y-intercept = 1
Test point (0, 0): \(0 > 3(0) + 1 = 1\) ✗
Shade above the line
Boundary line: \(y = 3x - 2\) (dashed line)
Slope = 3, y-intercept = -2
Test point (0, 0): \(0 < 3(0) - 2 = -2\) ✗
Shade below the line
Both lines have the same slope (3) but different y-intercepts (1 and -2)
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: \(3x + 1 < y < 3x - 2\)
This implies: \(3x + 1 < 3x - 2\)
Simplifying: \(1 < -2\), which is false
Therefore, no solution exists
When graphing, we see two parallel lines with no overlapping shaded regions
The feasible region is empty
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 batches of Type A cookies, y = number of batches of Type B cookies
Flour constraint: \(2x + y \leq 20\) (2 cups for A + 1 cup for B ≤ 20 cups)
Sugar constraint: \(x + 3y \leq 21\) (1 cup for A + 3 cups for B ≤ 21 cups)
Non-negativity constraints: \(x \geq 0, y \geq 0\)
Convert: \(y \leq -2x + 20\)
Boundary: \(y = -2x + 20\)
Intercepts: (0, 20) and (10, 0)
Test (0, 0): \(2(0) + 0 = 0 \leq 20\) ✓
Shade below the line
Convert: \(y \leq -\frac{1}{3}x + 7\)
Boundary: \(y = -\frac{1}{3}x + 7\)
Intercepts: (0, 7) and (21, 0)
Test (0, 0): \(0 + 3(0) = 0 \leq 21\) ✓
Shade below the line
\(x \geq 0\): Shade to the right of y-axis
\(y \geq 0\): Shade above x-axis
• Origin: \((0, 0)\)
• Intersection of \(x = 0\) and \(2x + y = 20\): \((0, 20)\)
• But check: \(x + 3y = 0 + 3(20) = 60 \not\leq 21\), so \((0, 20)\) is not feasible
• Intersection of \(x = 0\) and \(x + 3y = 21\): \((0, 7)\)
• Intersection of \(y = 0\) and \(2x + y = 20\): \((10, 0)\)
• Intersection of \(y = 0\) and \(x + 3y = 21\): \((21, 0)\)
• But check: \(2(21) + 0 = 42 \not\leq 20\), so \((21, 0)\) is not feasible
• Intersection of \(2x + y = 20\) and \(x + 3y = 21\):
From first: \(y = 20 - 2x\)
Substitute: \(x + 3(20 - 2x) = 21\)
\(x + 60 - 6x = 21\)
\(-5x = -39\)
\(x = \frac{39}{5} = 7.8\), \(y = 20 - 2(7.8) = 4.4\)
Point: \((7.8, 4.4)\)
Feasible corner points: \((0, 0)\), \((0, 7)\), \((7.8, 4.4)\), \((10, 0)\)
Check \((7.8, 4.4)\):
\(2(7.8) + 4.4 = 15.6 + 4.4 = 20 \leq 20\) ✓
\(7.8 + 3(4.4) = 7.8 + 13.2 = 21 \leq 21\) ✓
The feasible region is a quadrilateral with vertices at \((0,0)\), \((0,7)\), \((7.8,4.4)\), and \((10,0)\), representing all possible production combinations that satisfy the constraints.
• Variable definition: Clearly define what each variable represents
• Constraint identification: Translate each practical limitation into an inequality
• Verification: Check that corner points satisfy all constraints
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: Test points in the feasible 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 Graphing Systems:
- 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