Real-World Applications of Inequalities Systems and Graphs

Master real-world applications of inequalities: systems, graphs, and mathematical modeling through these 3 detailed exercises with comprehensive solutions.

Solution: Exercises 1 to 3
1 Business Constraints
Exercise 1
A company produces two types of products: Product A and Product B. Each unit of Product A requires 2 hours of labor and $3 of materials. Each unit of Product B requires 1 hour of labor and $5 of materials. The company has 100 hours of labor and $150 available for materials per day. If the company wants to produce at least 10 units of Product A and at least 5 units of Product B daily, write a system of inequalities representing the constraints and find the feasible region.
Definition:

System of inequalities: A set of mathematical conditions that define constraints in real-world problems. Each inequality represents a limitation on resources or requirements.

Problem-solving method:
  1. Identify variables and what they represent
  2. Translate constraints into mathematical inequalities
  3. Graph each inequality on coordinate plane
  4. Find intersection of all constraints (feasible region)
  5. Interpret the solution in context
Variables
Let x = units of A, y = units of B
Constraints
2x + y ≤ 100, 3x + 5y ≤ 150
Step 1: Define variables

Let x = number of units of Product A produced daily
Let y = number of units of Product B produced daily

Step 2: Identify all constraints

Labor constraint: 2x + y ≤ 100 (hours)
Material constraint: 3x + 5y ≤ 150 (dollars)
Minimum production: x ≥ 10, y ≥ 5
Non-negativity: x ≥ 0, y ≥ 0

Step 3: Write the complete system

2x + y ≤ 100
3x + 5y ≤ 150
x ≥ 10
y ≥ 5
x ≥ 0
y ≥ 0

System: {2x + y ≤ 100, 3x + 5y ≤ 150, x ≥ 10, y ≥ 5}
Final answer:

The feasible region is bounded by the intersection of all constraints. Any point (x,y) within this region represents a valid production plan that satisfies all constraints.

Applied rules:

• Constraint modeling: Convert verbal descriptions into mathematical inequalities

• Graphing inequalities: Shade regions that satisfy each inequality

• Feasible region: Intersection of all constraint regions

• Optimization: Solutions lie at vertices of feasible region

2 Transportation Planning
Exercise 2
A delivery company has trucks that can carry up to 2000 pounds and 200 cubic feet of cargo. Small packages weigh 20 pounds and take 2 cubic feet of space, while large packages weigh 50 pounds and take 8 cubic feet of space. The company needs to deliver at least 15 small packages and at least 10 large packages. Write a system of inequalities for this situation and determine if delivering 25 small packages and 15 large packages is possible.
Definition:

Transportation constraints: Mathematical relationships that limit capacity, weight, volume, or other physical limitations in logistics problems.

Variables
Let s = small packages, l = large packages
Weight constraint
20s + 50l ≤ 2000
Volume constraint
2s + 8l ≤ 200
Step 1: Define variables

Let s = number of small packages
Let l = number of large packages

Step 2: Identify constraints

Weight constraint: 20s + 50l ≤ 2000
Volume constraint: 2s + 8l ≤ 200
Minimum delivery: s ≥ 15, l ≥ 10

Step 3: Test specific solution

Check (s,l) = (25,15):
Weight: 20(25) + 50(15) = 500 + 750 = 1250 ≤ 2000 ✓
Volume: 2(25) + 8(15) = 50 + 120 = 170 ≤ 200 ✓
Min requirements: 25 ≥ 15 ✓, 15 ≥ 10 ✓

(25,15) satisfies all constraints - YES, it's possible
Final answer:

Yes, delivering 25 small packages and 15 large packages is possible as it satisfies all constraints. The system is: {20s + 50l ≤ 2000, 2s + 8l ≤ 200, s ≥ 15, l ≥ 10}

Applied rules:

• Capacity constraints: Total usage cannot exceed maximum capacity

• Substitution test: Plug values into inequalities to verify solutions

• Multiple constraints: All constraints must be satisfied simultaneously

• Feasibility: A solution is valid only if it satisfies ALL constraints

3 Investment Portfolio
Exercise 3
An investor has $10,000 to invest in two funds: Fund X offers 6% annual return and Fund Y offers 8% annual return. The investor wants to invest at least $2,000 in Fund X and at least $1,000 in Fund Y. Additionally, the investment in Fund Y should not exceed twice the investment in Fund X. The total return should be at least $600. Write a system of inequalities and determine the minimum amount that must be invested in Fund Y to meet the return requirement.
Definition:

Investment constraints: Mathematical relationships that govern financial allocation problems, including budget limits, risk tolerance, and return requirements.

Variables
Let x = amount in Fund X, y = amount in Fund Y
Budget constraint
x + y ≤ 10,000
Return constraint
0.06x + 0.08y ≥ 600
Step 1: Define variables

Let x = dollars invested in Fund X
Let y = dollars invested in Fund Y

Step 2: Identify all constraints

Budget: x + y ≤ 10,000
Minimum X: x ≥ 2,000
Minimum Y: y ≥ 1,000
Y vs X: y ≤ 2x
Return: 0.06x + 0.08y ≥ 600

Step 3: Solve for minimum Y with return constraint

From 0.06x + 0.08y ≥ 600: y ≥ (600 - 0.06x)/0.08
With x ≥ 2,000: y ≥ (600 - 0.06×2000)/0.08 = (600-120)/0.08 = 6,000
Combined with y ≥ 1,000: minimum y = 6,000

Step 4: Verify feasibility

Check x = 2,000, y = 6,000:
Budget: 2,000 + 6,000 = 8,000 ≤ 10,000 ✓
Y vs X: 6,000 ≤ 2×2,000 = 4,000 ✗
So y = 6,000 violates y ≤ 2x constraint

Minimum Y ≈ $4,000 when x = $2,000, y = $4,000
Final answer:

The system of inequalities is: {x + y ≤ 10,000, x ≥ 2,000, y ≥ 1,000, y ≤ 2x, 0.06x + 0.08y ≥ 600}. The minimum investment in Fund Y is $4,000 when investing $2,000 in Fund X.

Applied rules:

• Multiple constraint interaction: All constraints must be considered together

• Binding constraints: The most restrictive constraint determines the solution

• Return calculations: Amount × rate = return

• Linear optimization: Optimal solutions occur at vertices of feasible region

Key Concepts, Rules and Methods
\(ax + by \leq c\)
Linear Inequality
Standard Form
\(ax + by \leq c\)
Linear inequality in standard form
System of Inequalities
\(\begin{cases} ax + by \leq c \\ dx + ey \geq f \end{cases}\)
Multiple constraints simultaneously
Feasible Region
Intersection of all constraints
Solution area for system
Key definitions:

Linear inequality: Mathematical statement comparing a linear expression to a constant using inequality symbols

Feasible region: Area containing all points that satisfy all constraints simultaneously

Vertex: Corner point of the feasible region where optimal solutions often occur

Complete methodology:
  1. Define variables: Identify what quantities need to be determined
  2. Identify constraints: List all limitations and requirements
  3. Write inequalities: Convert verbal constraints to mathematical form
  4. Graph constraints: Plot each inequality on coordinate plane
  5. Find feasible region: Identify intersection of all constraints
  6. Interpret solution: Relate mathematical solution to real-world context
Tip 1: Always check non-negativity constraints (x ≥ 0, y ≥ 0) in real-world problems.
Tip 2: The feasible region is the intersection of all individual constraint regions.
Tip 3: Test boundary points to verify which side of line satisfies inequality.
Tip 4: Optimization occurs at vertices of the feasible region.
Common errors: Forgetting constraints, incorrect inequality direction, misinterpreting solutions in context.
Exam preparation: Practice translating word problems to inequalities, master graphing techniques, understand feasible regions.
Formulas to know by heart:

• Standard form: ax + by ≤ c or ax + by ≥ c

• Feasible region: intersection of all constraint regions

• Boundary line: ax + by = c (solid for ≤ or ≥, dashed for < or >)

• Vertex testing: optimal solutions occur at corner points

• Non-negativity: x ≥ 0, y ≥ 0 (for real-world problems)

Laws, Methods, Definitions, Expressions
\(\text{Constraints: } \{x + y \leq 10, x \geq 2, y \geq 1\}\)
System of Constraints
Key definitions:

Linear programming: Mathematical method for optimizing a linear objective function subject to linear constraints

Objective function: The quantity to be maximized or minimized

Constraints: Mathematical restrictions on the variables

Optimal solution: The best solution within the feasible region

Complete methodology:
  1. Problem identification: Recognize the optimization goal and constraints
  2. Variable definition: Assign variables to unknown quantities
  3. Constraint formulation: Write inequalities based on given conditions
  4. Graphical representation: Plot all constraints to visualize feasible region
  5. Optimal solution: Find vertex that optimizes the objective function
  6. Context interpretation: Translate mathematical solution back to real-world meaning
Tip 1: Always identify the objective function and constraints separately.
Tip 2: Check if the feasible region is bounded or unbounded.
Tip 3: Verify that corner points satisfy all constraints.
Tip 4: Consider practical limitations beyond mathematical constraints.
Common applications: Resource allocation, production planning, transportation, investment portfolio optimization.
Key insight: Real-world problems often involve multiple competing objectives requiring trade-offs.
Essential rules:

• Linearity: Both constraints and objective functions must be linear

• Convexity: The feasible region is always convex

• Optimality: If optimal solution exists, it occurs at a vertex

• Duality: Every primal problem has a dual optimization problem

• Feasibility: A solution exists only if the feasible region is non-empty

Questions & Answers

Question: I'm confused about how to determine which inequality symbol to use in real-world problems. Should I use ≤ or <, and how do I decide?

Answer: Great question! The choice depends on whether the boundary value is included or excluded:

  • ≤ (less than or equal to) or ≥ (greater than or equal to): Use when the boundary value IS allowed. Example: "at most $100" means ≤ 100, including exactly $100.
  • < (less than) or > (greater than): Use when the boundary value is NOT allowed. Example: "less than $100" means < 100, excluding $100.

Common keywords:

  • At most, no more than, maximum → ≤
  • At least, no less than, minimum → ≥
  • More than → >
  • Less than → <

In business contexts, ≤ and ≥ are more common since exact limits are often acceptable.

Question: When graphing systems of inequalities, how do I know which side of the boundary line to shade?

Answer: Use the test point method to determine shading:

  1. Graph the boundary line (solid for ≤ or ≥, dashed for < or >)
  2. Pick a test point NOT on the line (usually origin (0,0) if it's not on the line)
  3. Substitute the test point coordinates into the original inequality
  4. If the inequality is TRUE, shade the side containing the test point
  5. If FALSE, shade the opposite side

Example: For y ≤ 2x + 3, test point (0,0): 0 ≤ 2(0) + 3 → 0 ≤ 3 (TRUE), so shade below the line.

For systems, the feasible region is where ALL shadings overlap.

Question: How do I find the optimal solution when dealing with a system of inequalities in an optimization problem?

Answer: For linear programming problems, follow these steps:

  1. Graph all constraints to identify the feasible region
  2. Find all vertices (corner points) of the feasible region by solving intersections of boundary lines
  3. Identify the objective function (what you want to maximize or minimize)
  4. Evaluate the objective function at each vertex
  5. Select the optimal vertex based on whether you're maximizing or minimizing

Key theorem: If an optimal solution exists, it occurs at a vertex of the feasible region.

For example, if maximizing profit P = 3x + 4y, evaluate P at each vertex and choose the highest value.