\(y \leq 2x + 1\)
\(y > -x + 3\)
System of inequalities: A set of inequalities with the same variables. The solution is the set of all points that satisfy all inequalities simultaneously.
- Graph each inequality separately
- Determine which side of each line to shade
- Find the intersection of all shaded regions
- Verify by testing a point in the feasible region
Draw solid line y = 2x + 1 (≤ means solid line)
Test point (0,0): 0 ≤ 2(0) + 1 → 0 ≤ 1 ✓
Shade below the line
Draw dashed line y = -x + 3 (> means dashed line)
Test point (0,0): 0 > -(0) + 3 → 0 > 3 ✗
Shade above the line
The feasible region is where both shadings overlap
Point (1, 3) is in the feasible region:
y ≤ 2x + 1: 3 ≤ 2(1) + 1 → 3 ≤ 3 ✓
y > -x + 3: 3 > -(1) + 3 → 3 > 2 ✓
The solution is the region where y ≤ 2x + 1 and y > -x + 3 overlap.
• Line type: Solid for ≤ or ≥, dashed for < or >
• Shading rule: Test a point to determine correct shading side
• Intersection: Solution is where all regions overlap
\(x + y \leq 6\)
\(x - y \geq 2\)
\(x \geq 0, y \geq 0\)
Feasible region: The area on a graph where all constraints of a system of inequalities are satisfied.
Draw solid line x + y = 6
Test (0,0): 0 + 0 ≤ 6 → 0 ≤ 6 ✓
Shade below the line
Draw solid line x - y = 2
Test (0,0): 0 - 0 ≥ 2 → 0 ≥ 2 ✗
Shade above the line
Shade to the right of y-axis and above x-axis
The feasible region is where all four conditions overlap
Point (3, 2) is in the feasible region:
x + y ≤ 6: 3 + 2 ≤ 6 → 5 ≤ 6 ✓
x - y ≥ 2: 3 - 2 ≥ 2 → 1 ≥ 2 ✗ (Not in region)
Try (4, 1): 4 + 1 ≤ 6 → 5 ≤ 6 ✓, 4 - 1 ≥ 2 → 3 ≥ 2 ✓
The solution is the triangular region bounded by the three constraints.
• Multiple constraints: Each inequality adds a boundary condition
• Non-negative constraints: x ≥ 0, y ≥ 0 restrict to first quadrant
• Feasible region: Always convex polygon when bounded
\(y \geq x - 2\)
\(y \leq 3x + 1\)
Unbounded region: A feasible region that extends infinitely in one or more directions.
Draw solid line y = x - 2
Test (0,0): 0 ≥ 0 - 2 → 0 ≥ -2 ✓
Shade above the line
Draw solid line y = 3x + 1
Test (0,0): 0 ≤ 3(0) + 1 → 0 ≤ 1 ✓
Shade below the line
The feasible region is between the two lines
The region extends infinitely upward and downward
Point (0, 0) is in the feasible region:
y ≥ x - 2: 0 ≥ 0 - 2 → 0 ≥ -2 ✓
y ≤ 3x + 1: 0 ≤ 0 + 1 → 0 ≤ 1 ✓
The solution is the unbounded region between the two lines.
• Unbounded solutions: Some systems have solutions extending infinitely
• Region between lines: When inequalities bound the same variable
• Verification: Test points still apply to unbounded regions
System of inequalities: Two or more inequalities with the same variables
Solution to system: Set of all points that satisfy all inequalities simultaneously
Feasible region: The area containing all possible solutions
Bounded region: A region that can be enclosed in a circle
Unbounded region: A region that extends infinitely in one or more directions
Corner points: Vertices of the feasible region where constraints intersect
- Graph each boundary line: Convert each inequality to an equation
- Determine line type: Solid for ≤ or ≥, dashed for < or >
- Test a point: Use a test point to determine which side to shade
- Shade appropriately: Shade the correct half-plane for each inequality
- Find intersection: The feasible region is where all shadings overlap
- Verify solution: Test points in the feasible region
• Line type rule: ≤ or ≥ → solid line, < or > → dashed line
• Shading verification: Always test a point to confirm correct shading
• Intersection principle: Solution is where all individual regions overlap
• Feasibility: Points in the feasible region satisfy all constraints
• Corner points: Important for optimization problems
Linear programming constraints: Inequalities that represent limitations on resources in optimization problems.
Let x = number of units of product A, y = number of units of product B
Labor constraint: 2x + y ≤ 100
Machine time constraint: x + 3y ≤ 90
Non-negativity: x ≥ 0, y ≥ 0
2x + y ≤ 100: Solid line 2x + y = 100, shade below
x + 3y ≤ 90: Solid line x + 3y = 90, shade below
x ≥ 0: Shade right of y-axis
y ≥ 0: Shade above x-axis
(0,0), (0,30), (42,16), (50,0)
Point (20, 20): 2(20) + 20 = 60 ≤ 100 ✓, 20 + 3(20) = 80 ≤ 90 ✓
The company can produce any combination of products A and B that lies within the feasible region.
• Constraint modeling: Translate resource limitations into inequalities
• Non-negativity: Production levels cannot be negative
• Feasible region: Intersection of all constraints
Investment constraints: Inequalities that represent limitations on investment allocations based on risk, minimums, and ratios.
Let x = dollars invested in Stock X, y = dollars invested in Stock Y
Total investment: x + y ≤ 10000
Minimum in X: x ≥ 2000
Minimum in Y: y ≥ 3000
Ratio constraint: x ≤ 2y
x + y ≤ 10000: Solid line x + y = 10000, shade below
x ≥ 2000: Solid line x = 2000, shade right
y ≥ 3000: Solid line y = 3000, shade above
x ≤ 2y: Solid line x = 2y, shade left
Intersections of constraint boundaries
Point (4000, 4000): 4000 + 4000 = 8000 ≤ 10000 ✓
4000 ≥ 2000 ✓, 4000 ≥ 3000 ✓, 4000 ≤ 2(4000) = 8000 ✓
The investor can choose any investment combination within the feasible region.
• Investment modeling: Translate financial requirements into mathematical constraints
• Ratio constraints: Represent proportional relationships between investments
• Minimum requirements: Represent minimum investment thresholds
System of linear inequalities: Two or more linear inequalities with the same variables
Solution to a system: The set of all ordered pairs that satisfy all inequalities in the system
Feasible region: The area containing all possible solutions to the system
Bounded region: A region that can be enclosed in a finite area
Unbounded region: A region that extends infinitely in one or more directions
Corner points: The vertices of the feasible region where constraint boundaries intersect
- Identify constraints: List all inequalities in the system
- Graph boundary lines: Convert each inequality to an equation and graph the line
- Determine line type: Use solid lines for ≤ or ≥, dashed lines for < or >
- Test points: Choose a test point (often (0,0)) to determine which side to shade
- Shade regions: Shade the appropriate half-plane for each inequality
- Find intersection: The feasible region is where all individual shaded regions overlap
- Identify corner points: Find intersection points of constraint boundaries
- Verify solutions: Test points in the feasible region to confirm they satisfy all constraints
- Interpret results: Connect the mathematical solution back to the problem context
• Line type rule: ≤ or ≥ → solid line, < or > → dashed line
• Shading verification: Always test a point to confirm correct shading direction
• Intersection principle: The solution is the intersection of all individual solution sets
• Feasibility: Points in the feasible region satisfy all constraints simultaneously
• Corner point theorem: For optimization, optimal solutions often occur at corner points
• y ≤ 2x + 1: shaded below solid line
• y > -x + 3: shaded above dashed line
• Feasible region: intersection of both
Analysis: The chart demonstrates how inequality regions overlap to form the feasible region.
- Each inequality creates a half-plane
- Feasible region is the intersection of all half-planes
- Corner points are where constraint boundaries intersect