System of Inequalities: A set of two or more inequalities with the same variables that must all be satisfied simultaneously
Solution Region: The area of the coordinate plane that satisfies all inequalities in the system
Feasible Region: The overlapping region where all constraints are met
1. Graph each inequality separately on the same coordinate plane
2. For each inequality, determine the correct side of the boundary line to shade
3. The solution region is the intersection of all shaded areas
4. Verify with test points in different regions
Boundary line: y = x + 2
Type: Solid line (≤ includes boundary)
Slope: 1, y-intercept: 2
Shading: Below the line (test point (0,0): 0 ≤ 0 + 2 ✓)
Boundary line: y = -x + 1
Type: Dashed line (> excludes boundary)
Slope: -1, y-intercept: 1
Shading: Above the line (test point (0,0): 0 > -0 + 1 → 0 > 1 ✗)
Since (0,0) fails, shade the opposite side (above the line)
The solution region is where both conditions are satisfied
This is the area that is shaded for BOTH inequalities
Visually, it's the overlapping shaded area
Test point in solution region: (0,1.5)
For y ≤ x + 2: 1.5 ≤ 0 + 2 → 1.5 ≤ 2 ✓
For y > -x + 1: 1.5 > -0 + 1 → 1.5 > 1 ✓
Points on y = x + 2 ARE included (solid line)
Points on y = -x + 1 are NOT included (dashed line)
The solution is the wedge-shaped region bounded by both lines
It extends infinitely in the direction where both inequalities are satisfied
Includes: y ≤ x + 2 region
Excludes: y = -x + 1 boundary
The solution to the system is the region where both inequalities are satisfied, which is the overlapping area of the two individual solution regions. This region is bounded by the lines y = x + 2 (included) and y = -x + 1 (excluded).
• Intersection Rule: Solution is intersection of all individual solution regions
• Line Type: ≤, ≥ → solid; <, > → dashed
• Shading: Use test point method for each inequality
Constraints: Conditions that must be satisfied in the system
Corner Points: Vertices of the solution region where boundaries intersect
Bounded Region: A solution region that is enclosed and finite
1. Graph each inequality individually
2. Identify the region that satisfies ALL inequalities
3. Find corner points of the bounded region
4. Verify with test points in each potential region
Boundary line: x = 0 (the y-axis)
Type: Solid line (≥ includes boundary)
Shading: Right of y-axis (positive x-values)
Boundary line: y = 0 (the x-axis)
Type: Solid line (≥ includes boundary)
Shading: Above x-axis (positive y-values)
Convert to slope-intercept: y ≤ -2x + 6
Boundary line: y = -2x + 6
Type: Solid line (≤ includes boundary)
Shading: Below the line (test point (0,0): 2(0) + 0 ≤ 6 → 0 ≤ 6 ✓)
First quadrant: x ≥ 0 AND y ≥ 0
Below the line: 2x + y ≤ 6
Combined: First quadrant portion below the line y = -2x + 6
Intersection of x = 0 and y = 0: (0, 0)
Intersection of x = 0 and y = -2x + 6: (0, 6)
Intersection of y = 0 and y = -2x + 6: 0 = -2x + 6 → x = 3, so (3, 0)
Test point (1, 1): x ≥ 0? ✓, y ≥ 0? ✓, 2(1) + 1 ≤ 6? ✓
Test point (2, 3): x ≥ 0? ✓, y ≥ 0? ✓, 2(2) + 3 ≤ 6? 7 ≤ 6 ✗
This confirms the region is bounded by the three constraints
Shape: Triangle
Region: First quadrant below y = -2x + 6
The solution to the system is a triangular region in the first quadrant bounded by the axes and the line 2x + y = 6. The corner points are (0,0), (0,6), and (3,0).
• Non-negativity: x ≥ 0, y ≥ 0 restricts to first quadrant
• Corner Points: Found by intersecting boundary lines
• Feasible Region: Intersection of all constraints
Linear Programming: Optimization using systems of linear inequalities
Decision Variables: Variables representing quantities to be determined
Constraints: Limitations that restrict the possible solutions
1. Define decision variables
2. Write constraints based on resource limitations
3. Include non-negativity constraints
4. Graph the system to find feasible region
5. Interpret the solution in context
Let x = number of units of product A
Let y = number of units of product B
Product A: 2 hours per unit
Product B: 1 hour per unit
Total labor: 2x + y ≤ 12
Product A: 1 hour per unit
Product B: 3 hours per unit
Total machine time: x + 3y ≤ 15
Cannot produce negative units: x ≥ 0 and y ≥ 0
2x + y ≤ 12 (labor constraint)
x + 3y ≤ 15 (machine time constraint)
x ≥ 0 (non-negativity)
y ≥ 0 (non-negativity)
2x + y ≤ 12: Solid line y = -2x + 12, shade below
x + 3y ≤ 15: Solid line y = -x/3 + 5, shade below
x ≥ 0: Solid line x = 0, shade right
y ≥ 0: Solid line y = 0, shade up
The solution is the quadrilateral bounded by all four constraints
Corner points: (0,0), (0,5), (3,6), (6,0)
Note: (3,6) is intersection of 2x + y = 12 and x + 3y = 15
Feasible region: Quadrilateral with corner points (0,0), (0,5), (3,6), (6,0)
The system of inequalities is: 2x + y ≤ 12, x + 3y ≤ 15, x ≥ 0, y ≥ 0. The feasible region is a quadrilateral with corner points at (0,0), (0,5), (3,6), and (6,0).
• Resource Constraints: Total usage ≤ available resources
• Non-negativity: Decision variables ≥ 0
• Feasible Region: Intersection of all constraints
Convex Region: If any two points in the region are connected, the line segment between them is entirely within the region
Corner Points: Vertices of the feasible region where constraints intersect
Boundary Lines: Lines forming the edges of the solution region
System of Linear Inequalities: A collection of linear inequalities that must all be satisfied simultaneously. The solution is the set of all ordered pairs that satisfy every inequality in the system.
Solution Region (Feasible Region): The area of the coordinate plane where all inequalities in the system are satisfied. This is the intersection of all individual solution regions.
Corner Point (Vertex): A point where boundary lines of the feasible region intersect. These points are important in optimization problems.
- Graph each inequality: Plot each boundary line and shade the appropriate region
- Identify intersections: Find where boundary lines intersect
- Determine solution region: Find area satisfying all inequalities
- Find corner points: Calculate vertices of feasible region
- Verify solution: Test points in different regions
- Interpret results: Apply to real-world context if applicable
Question: How do I know if a system of inequalities has no solution?
Answer: A system of inequalities has no solution when the solution regions of the individual inequalities do not overlap:
Visual clue: When you graph all inequalities, there is NO area that is shaded by ALL inequalities.
Example: Consider y > x + 2 and y < x - 1
- The first inequality shades above the line y = x + 2
- The second inequality shades below the line y = x - 1
- Since y = x + 2 is always above y = x - 1, there's no overlap
Algebraic clue: When constraints contradict each other (e.g., x > 5 AND x < 3).
If you find no overlapping region after graphing, the system has no solution.
Question: How do I find corner points of a feasible region?
Answer: Corner points (vertices) occur where boundary lines intersect:
Method: Solve pairs of boundary equations simultaneously
Steps:
- Identify which boundary lines intersect at each corner
- Set the equations equal to each other
- Solve the resulting system of equations
- Verify the point satisfies all inequalities in the system
Example: For y ≤ -x + 4 and y ≥ x - 2, find intersection:
-x + 4 = x - 2 → -2x = -6 → x = 3
Substitute: y = 3 - 2 = 1
Corner point: (3, 1)
Always verify that corner points satisfy all constraints!
Question: What does it mean when a solution region is unbounded?
Answer: An unbounded solution region extends infinitely in at least one direction:
Characteristics:
- The feasible region has no finite boundary in some direction
- There are infinitely many solutions
- The region continues indefinitely
Example: The system y ≥ x and y ≥ -x has an unbounded feasible region extending upward infinitely.
Real-world implications:
- May indicate unrealistic assumptions in a model
- Could suggest missing constraints
- Still mathematically valid, but may need additional conditions for practical applications
Unbounded regions are still valid solutions to the system of inequalities.
Systems of Inequalities Guide
Intersection of all individual regions
Area where all constraints are satisfied
May be bounded or unbounded
Includes corner points
≤ or ≥: Solid lines (included)
< or >: Dashed lines (excluded)
Visual distinction
Boundary inclusion
Intersection of boundaries
Vertices of feasible region
Solve simultaneous equations
Key for optimization
All constraints must hold
Intersection method
Test point verification
Real-world context