Interpreting Systems of Inequalities Word Problems - Complete Guide

Master interpreting systems of inequalities word problems: constraints, feasible regions, and applications through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Manufacturing Constraints
Exercise 1
A factory produces two products. Product A requires 2 hours of labor and 1 hour of machine time. Product B requires 1 hour of labor and 3 hours of machine time. If the factory has 20 hours of labor and 21 hours of machine time available, how many of each product can be made? Write the system of inequalities and interpret the feasible region.
Definition:

Word problem interpretation: Translating practical constraints into mathematical inequalities.

Feasible region: The set of all possible production combinations that satisfy the constraints.

Problem-solving method:
  1. Define variables for unknown quantities
  2. Identify all constraints from the problem
  3. Translate each constraint into an inequality
  4. Include non-negativity constraints
  5. Interpret the feasible region in context
Define variables
\(x = \text{Product A}, y = \text{Product B}\)
Set up system
\( \begin{cases} 2x + y \leq 20 \\ x + 3y \leq 21 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Interpret
All possible combinations
Step 1: Define variables

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

Step 2: Identify constraints

• Labor constraint: Product A uses 2 hours, Product B uses 1 hour, max 20 hours

• Machine time constraint: Product A uses 1 hour, Product B uses 3 hours, max 21 hours

• Non-negativity: Cannot produce negative units

Step 3: Write inequalities

• Labor constraint: \(2x + y \leq 20\)

• Machine time constraint: \(x + 3y \leq 21\)

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

Step 4: Interpret the feasible region

The feasible region represents all possible production combinations that satisfy:

• Do not exceed 20 hours of labor

• Do not exceed 21 hours of machine time

• Produce non-negative quantities of both products

Step 5: Find corner points

• \((0, 0)\): Produce nothing

• \((0, 7)\): Produce only Product B (0 units A, 7 units B)

• \((10, 0)\): Produce only Product A (10 units A, 0 units B)

• Intersection of constraints: Solve system to find \((7.8, 4.4)\)

Step 6: Interpret results

Any point in the feasible region represents a valid production plan

For example: \((5, 5)\) means 5 units of A and 5 units of B

Check: Labor: \(2(5) + 5 = 15 \leq 20\) ✓

Machine: \(5 + 3(5) = 20 \leq 21\) ✓

Feasible region: All combinations satisfying constraints
Final answer:

The feasible region represents all possible production combinations of Products A and B that satisfy the labor and machine time constraints.

Applied rules:

• Variable definition: Clearly define what each variable represents

• Constraint identification: Find all limiting factors in the problem

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

2 Nutrition Constraints
Exercise 2
A diet plan requires at least 40 units of protein and at least 30 units of vitamins per day. Food X provides 4 units of protein and 2 units of vitamins per serving. Food Y provides 2 units of protein and 3 units of vitamins per serving. Write the system of inequalities and interpret what the feasible region means.
Definition:

Minimum constraints: Inequalities of the form ≥ representing minimum requirements.

Define variables
\(x = \text{Food X servings}, y = \text{Food Y servings}\)
Set up system
\( \begin{cases} 4x + 2y \geq 40 \\ 2x + 3y \geq 30 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Interpret
Meets nutritional needs
Step 1: Define variables

Let x = number of servings of Food X, y = number of servings of Food Y

Step 2: Identify constraints

• Protein requirement: Need at least 40 units

• Vitamin requirement: Need at least 30 units

• Non-negativity: Cannot consume negative servings

Step 3: Write protein constraint

Food X provides 4 units per serving, Food Y provides 2 units per serving

Total protein: \(4x + 2y \geq 40\)

Step 4: Write vitamin constraint

Food X provides 2 units per serving, Food Y provides 3 units per serving

Total vitamins: \(2x + 3y \geq 30\)

Step 5: Include non-negativity constraints

\(x \geq 0, y \geq 0\)

Step 6: Interpret the feasible region

The feasible region represents all combinations of Food X and Food Y servings that:

• Provide at least 40 units of protein

• Provide at least 30 units of vitamins

• Consist of non-negative amounts of each food

Step 7: Verify with an example

Test point (8, 4):

Protein: \(4(8) + 2(4) = 32 + 8 = 40 \geq 40\) ✓

Vitamins: \(2(8) + 3(4) = 16 + 12 = 28 \not\geq 30\) ✗

Test point (10, 5):

Protein: \(4(10) + 2(5) = 40 + 10 = 50 \geq 40\) ✓

Vitamins: \(2(10) + 3(5) = 20 + 15 = 35 \geq 30\) ✓

Feasible region: Combinations meeting nutritional requirements
Final answer:

The feasible region represents all possible combinations of Food X and Food Y servings that meet both the protein and vitamin requirements.

Applied rules:

• Minimum constraints: Use ≥ for "at least" requirements

• Resource calculation: Multiply units per serving by number of servings

• Verification: Check sample points in the feasible region

3 Budget Constraints
Exercise 3
A student has $100 to spend on textbooks and notebooks. Each textbook costs $25 and each notebook costs $5. The student needs at least 2 textbooks and at least 3 notebooks. Write the system of inequalities and interpret the feasible region in terms of purchasing options.
Definition:

Budget constraint: An inequality representing a spending limit.

Define variables
\(x = \text{textbooks}, y = \text{notebooks}\)
Set up system
\( \begin{cases} 25x + 5y \leq 100 \\ x \geq 2 \\ y \geq 3 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Interpret
Affordable combinations
Step 1: Define variables

Let x = number of textbooks, y = number of notebooks

Step 2: Identify constraints

• Budget constraint: Cannot exceed $100

• Minimum textbook requirement: At least 2 textbooks

• Minimum notebook requirement: At least 3 notebooks

• Non-negativity: Cannot buy negative items

Step 3: Write budget constraint

Textbooks cost $25 each, notebooks cost $5 each

Total cost: \(25x + 5y \leq 100\)

Step 4: Write minimum requirements

Minimum textbooks: \(x \geq 2\)

Minimum notebooks: \(y \geq 3\)

Step 5: Include non-negativity constraints

Though redundant with minimum requirements, explicitly: \(x \geq 0, y \geq 0\)

Step 6: Simplify budget constraint

\(25x + 5y \leq 100\)

Divide by 5: \(5x + y \leq 20\)

Step 7: Interpret the feasible region

The feasible region represents all purchasing combinations that:

• Stay within the $100 budget

• Include at least 2 textbooks

• Include at least 3 notebooks

• Are physically possible (non-negative)

Step 8: Find specific examples

Point (2, 3): Cost = \(25(2) + 5(3) = 50 + 15 = 65 \leq 100\) ✓

Point (3, 4): Cost = \(25(3) + 5(4) = 75 + 20 = 95 \leq 100\) ✓

Point (4, 5): Cost = \(25(4) + 5(5) = 100 + 25 = 125 \not\leq 100\) ✗

Feasible region: Affordable purchase combinations meeting minimums
Final answer:

The feasible region represents all possible combinations of textbooks and notebooks that the student can afford while meeting their minimum requirements.

Applied rules:

• Budget constraint: Use ≤ for spending limits

• Minimum requirements: Use ≥ for "at least" conditions

• Verification: Check that sample points satisfy all constraints

Interpretation Techniques & Properties
\( \begin{cases} \text{Resource}_1: a_1x + b_1y \, \text{operator}_1 \, c_1 \\ \text{Resource}_2: a_2x + b_2y \, \text{operator}_2 \, c_2 \\ \text{Non-negativity}: x \geq 0, y \geq 0 \end{cases} \)
General System for Word Problems
Budget Constraint
≤
Maximum spending limit
Minimum Requirement
≥
At least amount needed
Capacity Limit
≤
Maximum capacity available
Key Definitions:

Constraint interpretation: Understanding what each inequality represents in the real-world context.

Feasible region interpretation: Explaining what the solution area means in terms of the original problem.

Corner point significance: Understanding the practical meaning of boundary solutions.

Interpretation Process:
  1. Identify constraints: Extract all limiting factors from the problem
  2. Translate to math: Convert each constraint into an inequality
  3. Graph the system: Visualize the feasible region
  4. Interpret meaning: Explain what the feasible region represents
  5. Verify solutions: Check that sample points make sense in context
Solution: Exercises 4 to 5
4 Transportation Constraints
Exercise 4
A delivery company has two truck types. Large trucks can carry 20 packages and require 2 workers. Small trucks can carry 8 packages and require 1 worker. The company has 10 workers available and needs to deliver at least 80 packages. Write the system of inequalities and interpret what the feasible region means in terms of truck assignments.
Definition:

Capacity constraints: Limits on resources that affect operational capability.

Define variables
\(x = \text{Large trucks}, y = \text{Small trucks}\)
Set up system
\( \begin{cases} 2x + y \leq 10 \\ 20x + 8y \geq 80 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Interpret
Valid truck assignments
Step 1: Define variables

Let x = number of large trucks, y = number of small trucks

Step 2: Identify constraints

• Worker constraint: Large trucks need 2 workers, small trucks need 1 worker, max 10 workers

• Package constraint: Need to deliver at least 80 packages

• Non-negativity: Cannot assign negative trucks

Step 3: Write worker constraint

Large trucks require 2 workers each, small trucks require 1 worker each

Total workers needed: \(2x + y \leq 10\)

Step 4: Write package constraint

Large trucks carry 20 packages each, small trucks carry 8 packages each

Total packages delivered: \(20x + 8y \geq 80\)

Step 5: Include non-negativity constraints

\(x \geq 0, y \geq 0\)

Step 6: Interpret the feasible region

The feasible region represents all possible truck assignment combinations that:

• Do not exceed the available workforce of 10 workers

• Deliver at least 80 packages

• Use non-negative numbers of each truck type

Step 7: Verify with examples

Point (3, 4): Workers = \(2(3) + 4 = 10 \leq 10\) ✓, Packages = \(20(3) + 8(4) = 60 + 32 = 92 \geq 80\) ✓

Point (2, 5): Workers = \(2(2) + 5 = 9 \leq 10\) ✓, Packages = \(20(2) + 8(5) = 40 + 40 = 80 \geq 80\) ✓

Step 8: Practical interpretation

For example, using 3 large trucks and 4 small trucks would use exactly 10 workers and deliver 92 packages

This satisfies all requirements and represents one valid operational plan

Feasible region: All valid truck assignment plans meeting constraints
Final answer:

The feasible region represents all possible combinations of large and small trucks that the company can use while staying within their worker limit and meeting the delivery requirement.

Applied rules:

• Resource allocation: Track how resources are consumed by each option

• Minimum delivery: Use ≥ for required minimums

• Practical meaning: Always interpret solutions in real-world context

5 Academic Requirements
Exercise 5
A student must take at least 12 credit hours per semester. Course A is worth 4 credits and requires 6 hours of study time per week. Course B is worth 3 credits and requires 4 hours of study time per week. The student can dedicate at most 30 hours per week to studying. Write the system of inequalities and interpret the feasible region in terms of course selection.
Definition:

Academic constraints: Requirements related to credit hours, study time, and academic progress.

Define variables
\(x = \text{Course A}, y = \text{Course B}\)
Set up system
\( \begin{cases} 4x + 3y \geq 12 \\ 6x + 4y \leq 30 \\ x \geq 0 \\ y \geq 0 \end{cases} \)
Interpret
Valid course combinations
Step 1: Define variables

Let x = number of Course A sections, y = number of Course B sections

Step 2: Identify constraints

• Credit hour requirement: At least 12 credits

• Study time constraint: At most 30 hours per week

• Non-negativity: Cannot take negative courses

Step 3: Write credit constraint

Course A is worth 4 credits, Course B is worth 3 credits

Total credits: \(4x + 3y \geq 12\)

Step 4: Write study time constraint

Course A requires 6 hours per week, Course B requires 4 hours per week

Total study time: \(6x + 4y \leq 30\)

Step 5: Include non-negativity constraints

\(x \geq 0, y \geq 0\)

Step 6: Interpret the feasible region

The feasible region represents all possible course load combinations that:

• Meet the minimum credit hour requirement of 12 credits

• Stay within the 30-hour weekly study time limit

• Consist of non-negative numbers of each course

Step 7: Verify with examples

Point (2, 2): Credits = \(4(2) + 3(2) = 8 + 6 = 14 \geq 12\) ✓, Study time = \(6(2) + 4(2) = 12 + 8 = 20 \leq 30\) ✓

Point (3, 1): Credits = \(4(3) + 3(1) = 12 + 3 = 15 \geq 12\) ✓, Study time = \(6(3) + 4(1) = 18 + 4 = 22 \leq 30\) ✓

Step 8: Practical interpretation

For example, taking 3 sections of Course A and 1 section of Course B would provide 15 credits while requiring 22 hours of study time per week

This satisfies all academic and time constraints

Feasible region: All valid course combinations meeting requirements
Final answer:

The feasible region represents all possible combinations of Course A and Course B sections that the student can take while meeting credit requirements and staying within their study time capacity.

Applied rules:

• Minimum credits: Use ≥ for required minimums

• Time limits: Use ≤ for maximum capacity constraints

• Academic planning: Consider both academic and practical constraints

Comprehensive Word Problem Interpretation Summary
\( \text{Resource consumed} = \text{Units per item} \times \text{Number of items} \)
Resource Calculation Formula
Key definitions:

Word problem interpretation: Translating real-world constraints into mathematical inequalities.

Feasible region interpretation: Understanding what the solution area means in the original context.

Constraint types: Budget limits, minimum requirements, capacity restrictions, and resource availability.

Complete interpretation approach:
  1. Read carefully: Identify all constraints and requirements
  2. Define variables: Assign letters to unknown quantities
  3. Translate constraints: Convert each constraint to an inequality
  4. Graph solution: Visualize the feasible region
  5. Interpret meaning: Explain what the solution means in context
  6. Verify solutions: Check sample points in the feasible region
Tip 1: Look for keywords like "at least", "at most", "maximum", "minimum".
Tip 2: Use ≥ for "at least" and ≤ for "at most" or "maximum".
Tip 3: Always include non-negativity constraints for physical quantities.
Tip 4: The feasible region represents all viable solutions to the problem.
Common errors: Misinterpreting inequality direction, forgetting non-negativity constraints, misreading problem requirements.
Exam preparation: Practice identifying constraint types, master variable definition, focus on interpretation skills.
Important properties:

• Resource calculation: Multiply units per item by number of items

• Constraint direction: Match inequality to problem requirements

• Feasible region: Contains all viable solutions to the problem

• Verification: Always check solutions in original problem context

Word Problem Interpretation Visualization

Key Interpretation Elements:

  • Constraint Types: Budget, minimum, capacity, resource limits
  • Variable Definition: What each variable represents
  • Feasible Region: All viable solutions
  • Corner Points: Boundary solutions with practical significance

Questions & Answers

Question: How do I identify all the constraints in a word problem?

Answer: Look for limiting factors and requirements:

  • Resources: Money, time, materials, workers, space
  • Requirements: Minimums ("at least", "more than"), maximums ("at most", "less than")
  • Physical limits: Capacity, availability, practical constraints
  • Keywords: "cannot exceed", "must be at least", "available", "require"

For example: "A company has $500 and needs at least 10 units" → Budget constraint ($500) and minimum requirement (10 units).

Always ask: "What limits what I can do?" and "What do I need to achieve?"

Question: What if I get a fractional answer in a word problem? Is that valid?

Answer: Fractional answers depend on the context:

Valid contexts:

  • Continuous quantities: Time, distance, money, liquid measurements
  • Average values: Average number of items per day
  • Planning purposes: Long-term averages

Invalid contexts:

  • Discrete items: People, cars, books, animals (cannot have 2.5 people)
  • Integer requirements: When problem asks for whole numbers

For discrete items, you might need to round to the nearest whole number or adjust to stay within constraints.

Question: How do systems of inequalities apply to real-world decision-making?

Answer: Systems of inequalities are fundamental to optimization and decision-making:

Business:

  • Production planning: Maximize profit subject to resource constraints
  • Portfolio optimization: Balance risk and return within budget
  • Staff scheduling: Meet coverage requirements with minimum staff

Engineering:

  • Design constraints: Physical limitations on dimensions, materials
  • Resource allocation: Distribute limited resources optimally

Personal decisions: Budgeting, time management, career choices subject to various constraints.

The feasible region represents all possible solutions, and optimization finds the best among them.