Solved Exercises on Systems of Linear Inequalities in Algebra 1

Master systems of linear inequalities: solution regions, feasible regions, and constraint satisfaction through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic System
Exercise 1
Graph the system of inequalities: \(\begin{cases} y \leq x + 2 \\ y > -x + 1 \end{cases}\)
Definition:

System of linear inequalities: A set of two or more linear inequalities with the same variables. The solution is the intersection of all individual solution sets.

Solution method:
  1. Graph each inequality separately
  2. Shade the solution region for each inequality
  3. Find the intersection of all shaded regions
  4. This intersection is the solution to the system
Inequality 1
y ≤ x + 2
Inequality 2
y > -x + 1
Solution
Overlap region
Step 1: Graph first inequality y ≤ x + 2

Draw solid line y = x + 2 (slope 1, y-intercept 2), shade below line

Step 2: Graph second inequality y > -x + 1

Draw dashed line y = -x + 1 (slope -1, y-intercept 1), shade above line

Step 3: Find intersection of shaded regions

The solution is where both shadings overlap

Step 4: Verify with test point

Test point (0, 1.5): 1.5 ≤ 0 + 2 ✓ and 1.5 > -0 + 1 ✓

Step 5: Identify the feasible region

The overlapping area satisfies both inequalities simultaneously

The solution is the overlapping shaded region
Final answer:

The solution is the region where both inequalities are satisfied simultaneously

Applied rules:

• System solution: Intersection of all individual solution sets

• Line types: ≤ uses solid line, > uses dashed line

• Feasible region: Area satisfying all constraints

2 Triangular Region
Exercise 2
Graph the system of inequalities: \(\begin{cases} x \geq 0 \\ y \geq 0 \\ x + y \leq 4 \end{cases}\)
Definition:

Constraints: Restrictions that limit the possible solutions. Often used in optimization problems where variables represent physical quantities that cannot be negative.

Constraint 1
x ≥ 0
Constraint 2
y ≥ 0
Constraint 3
x + y ≤ 4
Step 1: Graph x ≥ 0

Shade to the right of vertical line x = 0 (y-axis), including the line

Step 2: Graph y ≥ 0

Shade above horizontal line y = 0 (x-axis), including the line

Step 3: Graph x + y ≤ 4

Draw solid line x + y = 4 (intercepts at (4,0) and (0,4)), shade below line

Step 4: Find intersection of all regions

The solution is the triangular region in the first quadrant bounded by x + y = 4

Step 5: Verify with test point

Test point (1, 1): 1 ≥ 0 ✓, 1 ≥ 0 ✓, 1 + 1 ≤ 4 ✓

Triangular feasible region in first quadrant
Final answer:

The solution is a triangular region with vertices at (0,0), (4,0), and (0,4)

Applied rules:

• Non-negativity constraints: x ≥ 0 and y ≥ 0 restrict to first quadrant

• Bounded region: Constraints create a finite feasible area

• Vertex points: Corners of feasible region are important for optimization

3 Three Constraints
Exercise 3
Graph the system of inequalities: \(\begin{cases} y \leq 2x \\ y \geq -x + 3 \\ x \leq 4 \end{cases}\)
Definition:

Feasible region: The area of the coordinate plane that satisfies all constraints simultaneously. This region may be bounded (finite area) or unbounded (infinite area).

Constraint 1
y ≤ 2x
Constraint 2
y ≥ -x + 3
Constraint 3
x ≤ 4
Step 1: Graph y ≤ 2x

Draw solid line y = 2x (passes through origin with slope 2), shade below line

Step 2: Graph y ≥ -x + 3

Draw solid line y = -x + 3 (slope -1, y-intercept 3), shade above line

Step 3: Graph x ≤ 4

Draw solid vertical line x = 4, shade to the left of the line

Step 4: Find intersection of all three regions

The solution is where all three shaded areas overlap

Step 5: Identify the feasible polygon

The resulting region is a polygon bounded by all three constraints

Polygonal feasible region defined by all constraints
Final answer:

The solution is a polygonal region bounded by all three constraints

Applied rules:

• Multiple constraints: Each adds a boundary to the feasible region

• Intersection principle: Solution must satisfy ALL constraints

• Polygonal regions: Linear constraints create polygonal feasible regions

Rules and methods, laws,...
\(\begin{cases} A_1x + B_1y < C_1 \\ A_2x + B_2y < C_2 \\ \vdots \\ A_nx + B_ny < C_n \end{cases}\)
System of Linear Inequalities
Feasible Region
Intersection of all constraints
Area satisfying all inequalities
Constraint Types
≤, ≥, <, >
Line type and shading direction
Solution Set
All (x,y) satisfying all constraints
Region where all shadings overlap
Key definitions:

System of linear inequalities: A collection of two or more linear inequalities with the same variables. The solution is the set of all ordered pairs that satisfy every inequality in the system.

Feasible region: The area of the coordinate plane that satisfies all constraints simultaneously. This region may be bounded or unbounded.

Constraint: An inequality that limits the possible solutions to a system.

Corner point (vertex): A point where boundary lines of the feasible region intersect.

Bounded region: A region that can be enclosed within a circle (finite area).

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

Complete methodology:
  1. Graph each inequality: Draw boundary lines and shade appropriate regions
  2. Determine line types: Solid for ≤ or ≥, dashed for < or >
  3. Determine shading: Test a point to decide which side to shade
  4. Find intersection: Identify where all shaded regions overlap
  5. Identify feasible region: The overlapping area is the solution
  6. Verify solution: Test a point in the feasible region
Tip 1: Start by graphing all boundary lines first, then shade the regions.
Tip 2: The feasible region is always where ALL constraints are satisfied.
Tip 3: Use different colors or patterns to distinguish different inequality shadings.
Tip 4: The feasible region is the darkest area where all shadings overlap.
Common errors: Forgetting to consider all constraints, incorrect shading direction, using wrong line type.
Exam preparation: Practice with different numbers of constraints, review line type rules, master test point method.
Solution: Exercises 4 to 5
4 Bounded Rectangle
Exercise 4
Graph the system of inequalities: \(\begin{cases} 1 \leq x \leq 3 \\ 2 \leq y \leq 4 \end{cases}\)
Definition:

Compound inequality: An inequality that combines two inequalities using "and". The system 1 ≤ x ≤ 3 is equivalent to x ≥ 1 AND x ≤ 3.

Constraint 1
1 ≤ x ≤ 3
Constraint 2
2 ≤ y ≤ 4
Shape
Rectangle
Step 1: Rewrite compound inequalities

1 ≤ x ≤ 3 becomes x ≥ 1 AND x ≤ 3
2 ≤ y ≤ 4 becomes y ≥ 2 AND y ≤ 4

Step 2: Graph x ≥ 1

Draw solid vertical line x = 1, shade to the right

Step 3: Graph x ≤ 3

Draw solid vertical line x = 3, shade to the left

Step 4: Graph y ≥ 2

Draw solid horizontal line y = 2, shade above

Step 5: Graph y ≤ 4

Draw solid horizontal line y = 4, shade below

Step 6: Find intersection of all regions

The solution is the rectangular region between these boundaries

Rectangular feasible region [1,3] × [2,4]
Final answer:

The solution is a rectangle with vertices at (1,2), (3,2), (3,4), and (1,4)

Applied rules:

• Compound inequalities: Can be split into separate constraints

• Bounded rectangle: Four constraints create rectangular feasible region

• Intersection principle: All constraints must be satisfied simultaneously

5 Unbounded Region
Exercise 5
Graph the system of inequalities: \(\begin{cases} y \geq x - 1 \\ y \leq -x + 3 \\ y \geq 0 \end{cases}\)
Definition:

Unbounded feasible region: A solution region that extends infinitely in one or more directions. The region is still constrained by the inequalities but has infinite area.

Constraint 1
y ≥ x - 1
Constraint 2
y ≤ -x + 3
Constraint 3
y ≥ 0
Step 1: Graph y ≥ x - 1

Draw solid line y = x - 1 (slope 1, y-intercept -1), shade above line

Step 2: Graph y ≤ -x + 3

Draw solid line y = -x + 3 (slope -1, y-intercept 3), shade below line

Step 3: Graph y ≥ 0

Draw solid horizontal line y = 0 (x-axis), shade above line

Step 4: Find intersection of all regions

The solution is where all three shaded areas overlap

Step 5: Analyze the feasible region

The region is bounded on the top but extends infinitely downward

Unbounded triangular region
Final answer:

The solution is an unbounded region with a vertex at (2,1) extending downward

Applied rules:

• Unbounded regions: Some constraints may allow infinite extension

• Intersection principle: Solution must satisfy ALL constraints

• Vertex identification: Important points where boundary lines meet

Systems of Linear Inequalities: Comprehensive Summary
\(\text{System: } \begin{cases} A_1x + B_1y \leq C_1 \\ A_2x + B_2y \geq C_2 \\ \vdots \\ A_nx + B_ny < C_n \end{cases}\)
General Form of Linear Inequality Systems
Key definitions:

System of linear inequalities: A set of two or more linear inequalities with the same variables. The solution is the intersection of all individual solution sets.

Feasible region: The set of all points that satisfy all constraints in the system simultaneously. This is the solution to the system.

Constraint: An inequality that restricts the possible solutions to the system.

Corner point (vertex): A point where boundary lines of the feasible region intersect. These points are important for optimization problems.

Bounded region: A region that can be enclosed within a circle, having finite area.

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

Empty solution set: When constraints are contradictory and no points satisfy all inequalities.

Complete solution procedure:
  1. Identify all constraints: List each inequality in the system
  2. Graph each boundary line: Convert each inequality to an equation and graph the line
  3. Determine line types: Use solid lines for ≤ or ≥, dashed lines for < or >
  4. Test points for shading: Choose a test point for each inequality to determine shading direction
  5. Shade solution regions: Shade the appropriate side of each boundary line
  6. Find intersection: The feasible region is where all shadings overlap
  7. Verify solution: Test a point in the feasible region to ensure it satisfies all constraints
Tip 1: The feasible region is the darkest area where all constraints overlap.
Tip 2: For compound inequalities like a ≤ x ≤ b, split into x ≥ a AND x ≤ b.
Tip 3: Always verify that a point in your solution region satisfies all original inequalities.
Tip 4: Use different colors or patterns to distinguish different inequality shadings.
Tip 5: Corner points occur where boundary lines intersect; find them by solving systems of equations.
Common error patterns: Not considering all constraints, incorrect line types, wrong shading directions, forgetting non-negativity constraints.
Key concepts to remember: Solution is intersection of all individual solutions; feasible region must satisfy ALL constraints; corner points are important for optimization.
Important rules:

• Intersection principle: System solution is intersection of all individual solution sets

• Line type rule: ≤ and ≥ use solid lines, < and > use dashed lines

• Shading rule: Test a point to determine which side to shade

• Feasible region: Must satisfy all constraints simultaneously

• Contradictory constraints: May result in empty solution set

Questions & Answers

Question: How do I know if a system of inequalities has no solution?

Answer: A system of inequalities has no solution when the constraints are contradictory and there's no region where all constraints overlap. This happens when:

  • Two constraints require incompatible conditions (e.g., x > 5 AND x < 3)
  • Parallel boundary lines with opposite shading directions
  • Constraints that exclude each other's solution regions

For example, the system {x > 2, x < 1} has no solution because no number can be both greater than 2 and less than 1.

When graphing, if you find that the shaded regions never overlap, the system has no solution (empty feasible region).

Question: What's the difference between a bounded and unbounded feasible region? How can I tell which one I have?

Answer: The key differences are:

Bounded feasible region:

  • Has finite area
  • Can be enclosed within a circle
  • All boundary lines converge to form a closed shape
  • Common in practical problems with limited resources

Unbounded feasible region:

  • Extends infinitely in one or more directions
  • Has infinite area
  • At least one direction is not restricted by constraints
  • Occurs when some variables aren't fully constrained

To identify: Look at your graph. If you can draw a circle large enough to contain the entire feasible region, it's bounded. If the region extends indefinitely in any direction, it's unbounded.

Question: Why are corner points important in systems of linear inequalities?

Answer: Corner points (vertices) are crucial for several reasons:

  • Optimization: In linear programming, optimal solutions occur at corner points
  • Boundary definition: They define the extreme limits of the feasible region
  • Verification: Testing corner points helps verify the solution region
  • Intersection points: They occur where constraint boundary lines intersect

To find corner points, solve the system of equations formed by the intersecting boundary lines. For example, if y = x + 1 and y = -x + 3 intersect, solve: x + 1 = -x + 3 to find x = 1, then y = 2, giving the corner point (1, 2).

In practical applications, corner points often represent critical scenarios like maximum profit or minimum cost situations.