Solved Exercises on Solving Systems of Inequalities in Algebra 2

Master solving systems of inequalities: basic inequalities, advanced systems, and real-world applications through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic System of Inequalities
Exercise 1
Solve the system of inequalities by graphing:
\(y \leq 2x + 1\)
\(y > -x + 3\)
Definition:

System of inequalities: A set of inequalities with the same variables. The solution is the set of all points that satisfy all inequalities simultaneously.

Graphing method for inequalities:
  1. Graph each inequality separately
  2. Determine which side of each line to shade
  3. Find the intersection of all shaded regions
  4. Verify by testing a point in the feasible region
Inequality 1
y ≤ 2x + 1
Inequality 2
y > -x + 3
Feasible Region
Intersection of both
Step 1: Graph y ≤ 2x + 1

Draw solid line y = 2x + 1 (≤ means solid line)

Test point (0,0): 0 ≤ 2(0) + 1 → 0 ≤ 1 ✓

Shade below the line

Step 2: Graph y > -x + 3

Draw dashed line y = -x + 3 (> means dashed line)

Test point (0,0): 0 > -(0) + 3 → 0 > 3 ✗

Shade above the line

Step 3: Find intersection

The feasible region is where both shadings overlap

Step 4: Verify with test point

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 ✓

Feasible region: Area above y = -x + 3 AND below y = 2x + 1
Final answer:

The solution is the region where y ≤ 2x + 1 and y > -x + 3 overlap.

Applied rules:

• 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

2 Three Inequalities System
Exercise 2
Solve the system of inequalities by graphing:
\(x + y \leq 6\)
\(x - y \geq 2\)
\(x \geq 0, y \geq 0\)
Definition:

Feasible region: The area on a graph where all constraints of a system of inequalities are satisfied.

Inequality 1
x + y ≤ 6
Inequality 2
x - y ≥ 2
Constraints
x ≥ 0, y ≥ 0
Step 1: Graph x + y ≤ 6

Draw solid line x + y = 6

Test (0,0): 0 + 0 ≤ 6 → 0 ≤ 6 ✓

Shade below the line

Step 2: Graph x - y ≥ 2

Draw solid line x - y = 2

Test (0,0): 0 - 0 ≥ 2 → 0 ≥ 2 ✗

Shade above the line

Step 3: Graph x ≥ 0, y ≥ 0

Shade to the right of y-axis and above x-axis

Step 4: Find intersection

The feasible region is where all four conditions overlap

Step 5: Verify with test point

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 ✓

Feasible region: Bounded polygon in first quadrant
Final answer:

The solution is the triangular region bounded by the three constraints.

Applied rules:

• 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

3 Unbounded System
Exercise 3
Solve the system of inequalities by graphing:
\(y \geq x - 2\)
\(y \leq 3x + 1\)
Definition:

Unbounded region: A feasible region that extends infinitely in one or more directions.

Inequality 1
y ≥ x - 2
Inequality 2
y ≤ 3x + 1
Result
Unbounded region
Step 1: Graph y ≥ x - 2

Draw solid line y = x - 2

Test (0,0): 0 ≥ 0 - 2 → 0 ≥ -2 ✓

Shade above the line

Step 2: Graph y ≤ 3x + 1

Draw solid line y = 3x + 1

Test (0,0): 0 ≤ 3(0) + 1 → 0 ≤ 1 ✓

Shade below the line

Step 3: Find intersection

The feasible region is between the two lines

Step 4: Analyze the region

The region extends infinitely upward and downward

Step 5: Verify with test point

Point (0, 0) is in the feasible region:

y ≥ x - 2: 0 ≥ 0 - 2 → 0 ≥ -2 ✓

y ≤ 3x + 1: 0 ≤ 0 + 1 → 0 ≤ 1 ✓

Unbounded feasible region between y = x - 2 and y = 3x + 1
Final answer:

The solution is the unbounded region between the two lines.

Applied rules:

• 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

Systems of Inequalities: Comprehensive Guide
\(\begin{cases} a_1x + b_1y \leq c_1 \\ a_2x + b_2y \geq c_2 \\ \vdots \end{cases}\)
General System of Linear Inequalities
Feasible Region
Intersection of all constraints
All points satisfy all inequalities
Bounded Region
Finite area
Enclosed by constraints
Unbounded Region
Extends infinitely
At least one direction unlimited
Key definitions:

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

Graphing methodology:
  1. Graph each boundary line: Convert each inequality to an equation
  2. Determine line type: Solid for ≤ or ≥, dashed for < or >
  3. Test a point: Use a test point to determine which side to shade
  4. Shade appropriately: Shade the correct half-plane for each inequality
  5. Find intersection: The feasible region is where all shadings overlap
  6. Verify solution: Test points in the feasible region
Tip 1: Always use (0,0) as a test point when possible, unless it's on the boundary line.
Tip 2: Solid lines include the boundary, dashed lines exclude it.
Tip 3: The feasible region is always on the same side of all boundary lines.
Tip 4: Corner points of the feasible region are important for optimization.
Common errors: Wrong line type, incorrect shading direction, missing constraints, forgetting corner points.
Key insight: The feasible region represents all possible combinations that satisfy all constraints.
Critical rules to remember:

• 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

Solution: Exercises 4 to 5
4 Real-World Application
Exercise 4
A company makes two products A and B. Each unit of A requires 2 hours of labor and 1 hour of machine time. Each unit of B requires 1 hour of labor and 3 hours of machine time. The company has 100 hours of labor and 90 hours of machine time available daily. Write and graph the system of inequalities for the possible production levels.
Definition:

Linear programming constraints: Inequalities that represent limitations on resources in optimization problems.

Define Variables
x = units of A, y = units of B
Set Up System
2x + y ≤ 100, x + 3y ≤ 90, x ≥ 0, y ≥ 0
Feasible Region
Quadrilateral with vertices
Step 1: Define variables

Let x = number of units of product A, y = number of units of product B

Step 2: Set up the system of inequalities

Labor constraint: 2x + y ≤ 100

Machine time constraint: x + 3y ≤ 90

Non-negativity: x ≥ 0, y ≥ 0

Step 3: Graph each constraint

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

Step 4: Find corner points

(0,0), (0,30), (42,16), (50,0)

Step 5: Verify a point in the region

Point (20, 20): 2(20) + 20 = 60 ≤ 100 ✓, 20 + 3(20) = 80 ≤ 90 ✓

Feasible region: Convex quadrilateral with vertices (0,0), (0,30), (42,16), (50,0)
Final answer:

The company can produce any combination of products A and B that lies within the feasible region.

Applied rules:

• Constraint modeling: Translate resource limitations into inequalities

• Non-negativity: Production levels cannot be negative

• Feasible region: Intersection of all constraints

5 Investment Optimization
Exercise 5
An investor has $10,000 to invest in two stocks. Stock X yields 5% annually and Stock Y yields 8% annually. The investor wants to invest at least $2,000 in Stock X and at least $3,000 in Stock Y. Additionally, the investment in Stock X should not exceed twice the investment in Stock Y. Write and graph the system of inequalities for possible investment amounts.
Definition:

Investment constraints: Inequalities that represent limitations on investment allocations based on risk, minimums, and ratios.

Define Variables
x = Stock X, y = Stock Y
Set Up System
x + y ≤ 10000, x ≥ 2000, y ≥ 3000, x ≤ 2y
Feasible Region
Polygonal region
Step 1: Define variables

Let x = dollars invested in Stock X, y = dollars invested in Stock Y

Step 2: Set up constraints

Total investment: x + y ≤ 10000

Minimum in X: x ≥ 2000

Minimum in Y: y ≥ 3000

Ratio constraint: x ≤ 2y

Step 3: Graph each constraint

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

Step 4: Find corner points

Intersections of constraint boundaries

Step 5: Verify a point in the region

Point (4000, 4000): 4000 + 4000 = 8000 ≤ 10000 ✓

4000 ≥ 2000 ✓, 4000 ≥ 3000 ✓, 4000 ≤ 2(4000) = 8000 ✓

Feasible region: Polygonal area satisfying all investment constraints
Final answer:

The investor can choose any investment combination within the feasible region.

Applied rules:

• Investment modeling: Translate financial requirements into mathematical constraints

• Ratio constraints: Represent proportional relationships between investments

• Minimum requirements: Represent minimum investment thresholds

Complete Summary: Solving Systems of Inequalities
\(\begin{cases} a_1x + b_1y \leq c_1 \\ a_2x + b_2y \geq c_2 \\ \vdots \end{cases}\)
General System of Linear Inequalities
Key definitions:

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

Complete graphing methodology:
  1. Identify constraints: List all inequalities in the system
  2. Graph boundary lines: Convert each inequality to an equation and graph the line
  3. Determine line type: Use solid lines for ≤ or ≥, dashed lines for < or >
  4. Test points: Choose a test point (often (0,0)) to determine which side to shade
  5. Shade regions: Shade the appropriate half-plane for each inequality
  6. Find intersection: The feasible region is where all individual shaded regions overlap
  7. Identify corner points: Find intersection points of constraint boundaries
  8. Verify solutions: Test points in the feasible region to confirm they satisfy all constraints
  9. Interpret results: Connect the mathematical solution back to the problem context
Tip 1: Always use (0,0) as a test point when it's not on any boundary line.
Tip 2: Solid lines include boundary points, dashed lines exclude them.
Tip 3: For optimization problems, focus on corner points of the feasible region.
Tip 4: The feasible region is always convex (no inward curves).
Tip 5: Non-negativity constraints (x ≥ 0, y ≥ 0) restrict the region to the first quadrant.
Common applications: Resource allocation, production planning, investment optimization, diet problems, transportation.
Key insight: The feasible region represents all possible combinations that satisfy all constraints simultaneously.
Essential rules and conditions:

• 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

Visualization: Inequality Regions
Feasible Region Visualization
Visualizing inequality regions:
• 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

Questions & Answers

Question: How do I know whether to use a solid or dashed line when graphing inequalities?

Answer: The type of line depends on the inequality symbol:

  • Solid line: Use for ≤ (less than or equal to) and ≥ (greater than or equal to)
  • Dashed line: Use for < (less than) and > (greater than)

Memory aid: The equal sign (=) in ≤ and ≥ means the boundary line is included in the solution, so use a solid line. The absence of an equal sign in < and > means the boundary is not included, so use a dashed line.

Example: For y ≤ 2x + 1, use a solid line because points on the line y = 2x + 1 satisfy the inequality. For y > -x + 3, use a dashed line because points on the line y = -x + 3 do NOT satisfy the inequality.

Question: What happens if the feasible region is empty? How do I know if there's no solution?

Answer: An empty feasible region means there's no solution to the system of inequalities. This occurs when the constraints are contradictory and no point can satisfy all of them simultaneously.

How to identify:

  1. When graphing, you'll notice that the shaded regions don't overlap at all
  2. There will be no area that satisfies all inequalities simultaneously
  3. Any attempt to find a point that satisfies all constraints will fail

Example: The system y > x + 2 and y < x - 1 has no solution because no point can be both greater than x + 2 and less than x - 1 at the same time.

An empty feasible region indicates that the constraints are incompatible or too restrictive.

Question: How do I find the corner points of a feasible region? Are they important?

Answer: Corner points (also called vertices) are extremely important in linear programming and optimization problems.

How to find corner points:

  1. Identify which constraint boundary lines intersect at each corner
  2. Solve the system of equations formed by those two lines
  3. The solution is the coordinates of that corner point

Importance: According to the Corner Point Theorem, if an optimization problem has an optimal solution, it will occur at one of the corner points of the feasible region.

Example: If your constraints are y ≤ -x + 6 and y ≥ x - 2, one corner point is where these lines intersect: solve -x + 6 = x - 2 to get x = 4, then y = 2, so the corner point is (4, 2).

For optimization problems, you only need to evaluate the objective function at the corner points rather than at every point in the feasible region.