Systems of Linear Inequalities - Complete Guide

Master systems of linear inequalities: feasible regions, corner points, and applications through these 5 detailed exercises.

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

System of linear inequalities: A set of two or more linear inequalities with the same variables.

Feasible region: The area of the coordinate plane that satisfies all inequalities in the system.

Graphing method:
  1. Graph each inequality separately
  2. Identify the region that satisfies all inequalities
  3. The intersection of all regions is the feasible region
Inequality 1
\(y \leq x + 2\)
Inequality 2
\(y \geq -x + 1\)
Solution
Intersection region
Step 1: Graph first inequality \(y \leq x + 2\)

Boundary line: \(y = x + 2\) (solid line)

Slope = 1, y-intercept = 2

Test point (0, 0): \(0 \leq 0 + 2 = 2\) ✓

Shade below the line

Step 2: Graph second inequality \(y \geq -x + 1\)

Boundary line: \(y = -x + 1\) (solid line)

Slope = -1, y-intercept = 1

Test point (0, 0): \(0 \geq -0 + 1 = 1\) ✗

Shade above the line

Step 3: Find the feasible region

The feasible region is where both conditions are satisfied

This is the intersection of both shaded regions

Step 4: Identify the region

The feasible region is the area above \(y = -x + 1\) and below \(y = x + 2\)

Step 5: Verify with test points

Point (0, 1.5): \(1.5 \leq 0 + 2 = 2\) ✓ and \(1.5 \geq -0 + 1 = 1\) ✓

Point (0, 0): \(0 \leq 0 + 2 = 2\) ✓ but \(0 \geq -0 + 1 = 1\) ✗

Feasible region: bounded by both lines
Final answer:

The feasible region is the area above \(y = -x + 1\) and below \(y = x + 2\), including the boundary lines.

Applied rules:

• System solution: Intersection of all individual solution regions

• Feasible region: Contains all points satisfying all constraints

• Verification: Check with points in the region

2 Three Inequalities System
Exercise 2
Graph the system: \( \begin{cases} x \geq 0 \\ y \geq 0 \\ 2x + y \leq 6 \end{cases} \)
Definition:

Non-negative constraints: Inequalities of the form \(x \geq 0\) and \(y \geq 0\).

Constraint 1
\(x \geq 0\)
Constraint 2
\(y \geq 0\)
Constraint 3
\(2x + y \leq 6\)
Step 1: Graph first constraint \(x \geq 0\)

Boundary line: \(x = 0\) (the y-axis)

Since \(x \geq 0\), shade to the right of the y-axis

Step 2: Graph second constraint \(y \geq 0\)

Boundary line: \(y = 0\) (the x-axis)

Since \(y \geq 0\), shade above the x-axis

Step 3: Graph third constraint \(2x + y \leq 6\)

Convert to slope-intercept: \(y \leq -2x + 6\)

Boundary line: \(y = -2x + 6\) (solid line)

Test point (0, 0): \(2(0) + 0 = 0 \leq 6\) ✓

Shade below the line

Step 4: Find the feasible region

The feasible region must satisfy all three constraints:

• \(x \geq 0\) (right of y-axis)

• \(y \geq 0\) (above x-axis)

• \(2x + y \leq 6\) (below line)

Step 5: Identify the shape

The feasible region is a triangle in the first quadrant bounded by:

• x-axis (\(y = 0\))

• y-axis (\(x = 0\))

• Line \(2x + y = 6\)

Step 6: Verify with test points

Point (1, 1): \(1 \geq 0\) ✓, \(1 \geq 0\) ✓, \(2(1) + 1 = 3 \leq 6\) ✓

Point (-1, 1): \(-1 \not\geq 0\) ✗

Point (2, 3): \(2 \geq 0\) ✓, \(3 \geq 0\) ✓, \(2(2) + 3 = 7 \not\leq 6\) ✗

Feasible region: triangle in first quadrant
Final answer:

The feasible region is a triangle in the first quadrant bounded by the axes and the line \(2x + y = 6\).

Applied rules:

• Non-negative constraints: Restrict to first quadrant

• Multiple constraints: Intersection of all regions

• Verification: Check multiple points in different areas

3 Unbounded System
Exercise 3
Graph the system: \( \begin{cases} y \geq x - 1 \\ y \leq 2x + 3 \end{cases} \)
Definition:

Unbounded feasible region: A region that extends infinitely in some direction.

Inequality 1
\(y \geq x - 1\)
Inequality 2
\(y \leq 2x + 3\)
Result
Unbounded region
Step 1: Graph first inequality \(y \geq x - 1\)

Boundary line: \(y = x - 1\) (solid line)

Slope = 1, y-intercept = -1

Test point (0, 0): \(0 \geq 0 - 1 = -1\) ✓

Shade above the line

Step 2: Graph second inequality \(y \leq 2x + 3\)

Boundary line: \(y = 2x + 3\) (solid line)

Slope = 2, y-intercept = 3

Test point (0, 0): \(0 \leq 2(0) + 3 = 3\) ✓

Shade below the line

Step 3: Find the feasible region

The feasible region is where both conditions are satisfied

This is the area above \(y = x - 1\) and below \(y = 2x + 3\)

Step 4: Analyze the region

The lines intersect at: \(x - 1 = 2x + 3\)

\(-1 - 3 = 2x - x\)

\(-4 = x\), so \(y = -4 - 1 = -5\)

Intersection point: (-4, -5)

Step 5: Identify the shape

The feasible region is unbounded - it extends infinitely upward between the two lines

Since the slope of the upper bound (2) is greater than the lower bound (1), the region opens upward

Step 6: Verify with test points

Point (-3, 0): \(0 \geq -3 - 1 = -4\) ✓ and \(0 \leq 2(-3) + 3 = -3\) ✗

Point (-3, -1): \(-1 \geq -3 - 1 = -4\) ✓ and \(-1 \leq 2(-3) + 3 = -3\) ✗

Point (0, 0): \(0 \geq 0 - 1 = -1\) ✓ and \(0 \leq 2(0) + 3 = 3\) ✓

Unbounded feasible region between lines
Final answer:

The feasible region is unbounded, located between the lines \(y = x - 1\) and \(y = 2x + 3\), extending infinitely upward.

Applied rules:

• 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

System Properties & Techniques
\( \begin{cases} a_1x + b_1y \, \text{operator}_1 \, c_1 \\ a_2x + b_2y \, \text{operator}_2 \, c_2 \\ \vdots \\ a_nx + b_ny \, \text{operator}_n \, c_n \end{cases} \)
General System of Linear Inequalities
Feasible Region
Intersection of all regions
All points satisfying all constraints
Corner Points
Vertices of feasible region
Intersections of boundary lines
Bounded Region
Finite area
Enclosed by boundary lines
Key Definitions:

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.

System Graphing Process:
  1. Graph each inequality: Draw boundary lines and shade appropriate regions
  2. Identify intersection: Find area satisfying all inequalities
  3. Determine boundedness: Check if region is finite or infinite
  4. Find corner points: Calculate intersections of boundary lines
  5. Verify solution: Test points in the feasible region
Solution: Exercises 4 to 5
4 No Solution System
Exercise 4
Graph the system: \( \begin{cases} y > 2x + 1 \\ y < 2x - 3 \end{cases} \)
Definition:

Empty feasible region: A system with no solution because the constraints contradict each other.

Inequality 1
\(y > 2x + 1\)
Inequality 2
\(y < 2x - 3\)
Result
No solution
Step 1: Graph first inequality \(y > 2x + 1\)

Boundary line: \(y = 2x + 1\) (dashed line)

Slope = 2, y-intercept = 1

Test point (0, 0): \(0 > 2(0) + 1 = 1\) ✗

Shade above the line

Step 2: Graph second inequality \(y < 2x - 3\)

Boundary line: \(y = 2x - 3\) (dashed line)

Slope = 2, y-intercept = -3

Test point (0, 0): \(0 < 2(0) - 3 = -3\) ✗

Shade below the line

Step 3: Analyze the situation

Both lines have the same slope (2) but different y-intercepts (1 and -3)

This means the lines are parallel

The first inequality wants points above the first line

The second inequality wants points below the second line

Step 4: Determine feasibility

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

Step 5: Verify with algebra

For a point to satisfy both: \(2x + 1 < y < 2x - 3\)

This implies: \(2x + 1 < 2x - 3\)

Simplifying: \(1 < -3\), which is false

Therefore, no solution exists

No solution (empty feasible region)
Final answer:

The system has no solution because the constraints are contradictory (parallel lines with no overlapping region).

Applied rules:

• 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

5 Real-World Application
Exercise 5
A factory produces two products. Product A requires 2 hours of labor and 1 hour of machine time per unit. Product B requires 1 hour of labor and 2 hours of machine time per unit. The factory has 100 hours of labor and 80 hours of machine time available per day. Write and graph the system of inequalities for daily production.
Definition:

Real-world constraints: Practical limitations that translate to mathematical inequalities.

Define variables
\(x = \text{Product A}, y = \text{Product B}\)
Set up system
\( \begin{cases} 2x + y \leq 100 \\ x + 2y \leq 80 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Feasible region
Quadrilateral in first quadrant
Step 1: Define variables

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

Step 2: Set up constraints

Labor constraint: \(2x + y \leq 100\) (2 hours for A + 1 hour for B ≤ 100 hours)

Machine time constraint: \(x + 2y \leq 80\) (1 hour for A + 2 hours for B ≤ 80 hours)

Non-negativity constraints: \(x \geq 0, y \geq 0\)

Step 3: Graph first constraint \(2x + y \leq 100\)

Convert: \(y \leq -2x + 100\)

Boundary: \(y = -2x + 100\)

Intercepts: (0, 100) and (50, 0)

Test (0, 0): \(2(0) + 0 = 0 \leq 100\) ✓

Shade below the line

Step 4: Graph second constraint \(x + 2y \leq 80\)

Convert: \(y \leq -\frac{1}{2}x + 40\)

Boundary: \(y = -\frac{1}{2}x + 40\)

Intercepts: (0, 40) and (80, 0)

Test (0, 0): \(0 + 2(0) = 0 \leq 80\) ✓

Shade below the line

Step 5: Graph non-negativity constraints

\(x \geq 0\): Shade to the right of y-axis

\(y \geq 0\): Shade above x-axis

Step 6: Find the feasible region

The feasible region is the intersection of all four constraints

It's a quadrilateral in the first quadrant bounded by all four lines

Corner points: (0, 0), (0, 40), (intersection point), (50, 0)

Find intersection of \(y = -2x + 100\) and \(y = -\frac{1}{2}x + 40\):

\(-2x + 100 = -\frac{1}{2}x + 40\)

\(-2x + \frac{1}{2}x = 40 - 100\)

\(-\frac{3}{2}x = -60\)

\(x = 40\), so \(y = -2(40) + 100 = 20\)

Intersection: (40, 20)

Feasible region: quadrilateral with vertices (0,0), (0,40), (40,20), (50,0)
Final answer:

The feasible region is a quadrilateral with vertices at (0,0), (0,40), (40,20), and (50,0), representing all possible daily production combinations that satisfy the constraints.

Applied rules:

• Variable definition: Clearly define what each variable represents

• Constraint identification: Translate each practical limitation into an inequality

• Non-negativity: Include physical constraints (cannot produce negative amounts)

Comprehensive Systems Inequalities Summary
\( \begin{cases} a_1x + b_1y \, \text{operator}_1 \, c_1 \\ a_2x + b_2y \, \text{operator}_2 \, c_2 \end{cases} \)
General System of Two Linear Inequalities
Key definitions:

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.

Complete solving approach:
  1. Graph each inequality: Draw boundary lines and determine shading
  2. Find intersection: Identify region satisfying all constraints
  3. Determine boundedness: Check if region is finite or infinite
  4. Calculate corner points: Find intersections of boundary lines
  5. Verify solution: Check with test points in the region
Tip 1: Always include non-negativity constraints in real-world problems.
Tip 2: Corner points are critical in optimization problems.
Tip 3: Parallel boundary lines may result in no solution.
Tip 4: The feasible region contains infinitely many solutions.
Common errors: Incorrect shading direction, missing constraints, forgetting non-negativity, wrong line type for boundary.
Exam preparation: Practice with various constraint types, master corner point calculation, focus on real-world applications.
Important properties:

• 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

Systems of Inequalities Properties Visualization

Key Properties of Systems of Inequalities:

  • 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

Questions & Answers

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

Answer: Corner points are found by solving systems of equations formed by the intersecting boundary lines:

  1. Identify boundary lines: Each inequality corresponds to a boundary line
  2. Find intersections: Solve pairs of boundary line equations simultaneously
  3. Verify feasibility: Check that the intersection point satisfies all constraints

For system: \( \begin{cases} y \leq x + 2 \\ y \geq -x + 1 \end{cases} \)

Boundary lines: \(y = x + 2\) and \(y = -x + 1\)

Find intersection: \(x + 2 = -x + 1\)

\(2x = -1\), so \(x = -\frac{1}{2}\)

\(y = -\frac{1}{2} + 2 = \frac{3}{2}\)

Corner point: \(\left(-\frac{1}{2}, \frac{3}{2}\right)\)

Question: How can I tell if a feasible region is bounded or unbounded?

Answer: A feasible region is:

  • Bounded: If it can be enclosed within a finite rectangle
  • Unbounded: If it extends infinitely in at least one direction

Characteristics:

Bounded:

  • Has finite area
  • Enclosed by boundary lines on all sides
  • Often occurs when constraints limit growth in all directions

Unbounded:

  • Has infinite area
  • Extends infinitely in one or more directions
  • Occurs when some constraints don't limit growth in certain directions

For example: \( \begin{cases} x \geq 0 \\ y \geq 0 \\ x + y \leq 10 \end{cases} \) is bounded

But: \( \begin{cases} x \geq 0 \\ y \geq 0 \\ x - y \leq 5 \end{cases} \) is unbounded

Question: How are systems of inequalities used in optimization problems?

Answer: Systems of inequalities define the constraints in linear programming:

Linear Programming Components:

  • Constraints: Inequalities that limit the solution space
  • Objective Function: A linear function to maximize or minimize
  • Feasible Region: The intersection of all constraint regions
  • Optimal Solution: Occurs at a corner point of the feasible region

Example:

Maximize: \(P = 5x + 3y\) (profit function)

Subject to: \( \begin{cases} 2x + y \leq 100 \text{ (labor)} \\ x + 2y \leq 80 \text{ (materials)} \\ x \geq 0, y \geq 0 \text{ (non-negativity)} \end{cases} \)

The maximum profit occurs at one of the corner points of the feasible region.

This is the foundation of operations research and resource allocation.