Budget constraint: Total spending ≤ Available money
Cost model: Total cost = (Price per book × Number of books) + (Price per magazine × Number of magazines)
- Identify the variables and their meanings
- Identify the constraint (limitation)
- Write the mathematical relationship
- Translate to inequality form
Let x = number of books (costs $8 each)
Let y = number of magazines (costs $3 each)
Sarah cannot spend more than $50
Total cost must be less than or equal to $50
Cost of books: 8x
Cost of magazines: 3y
Total cost: 8x + 3y
Constraint: 8x + 3y ≤ 50
Any combination of (x, y) that satisfies 8x + 3y ≤ 50 is possible
Examples: (4, 6) because 8(4) + 3(6) = 32 + 18 = 50 ≤ 50 ✓
Examples: (3, 8) because 8(3) + 3(8) = 24 + 24 = 48 ≤ 50 ✓
The inequality representing possible combinations is: 8x + 3y ≤ 50
Where x = number of books and y = number of magazines
• Constraint modeling: Convert real-world limit to mathematical inequality
• Variable definition: Clearly define what each variable represents
• Inequality direction: "at most", "cannot exceed" → ≤
Compound inequality: Two inequalities combined with "and" or "between"
Speed constraints: Minimum safe speed ≤ Actual speed ≤ Maximum legal speed
Let s = speed of the car (in mph)
Car must travel at least 45 mph
This means s ≥ 45
Car must not exceed 65 mph
This means s ≤ 65
Both conditions must be satisfied simultaneously
So: 45 ≤ s ≤ 65
Acceptable speeds range from 45 mph to 65 mph
Examples: 50 mph, 55 mph, 60 mph are all acceptable
Examples: 40 mph (too slow) and 70 mph (too fast) are not acceptable
The compound inequality for acceptable speeds is: 45 ≤ s ≤ 65
Where s represents the speed of the car in mph
• Compound inequality: When multiple constraints apply simultaneously
• Word-to-inequality translation: "at least" → ≥, "not exceed" → ≤
• Range notation: a ≤ x ≤ b represents values between a and b
System of inequalities: Multiple constraints that must all be satisfied simultaneously
Resource constraint: Limited resources impose upper bounds on production
Let x = number of units of Product A
Let y = number of units of Product B
Product A requires 2 hours per unit
Product B requires 3 hours per unit
Total labor: 2x + 3y
Maximum available: 120 hours
So: 2x + 3y ≤ 120
Company wants at least 10 units of Product A
So: x ≥ 10
Cannot produce negative quantities
So: x ≥ 0 and y ≥ 0
System of inequalities:
2x + 3y ≤ 120 (labor constraint)
x ≥ 10 (minimum Product A)
x ≥ 0 (non-negative A)
y ≥ 0 (non-negative B)
x ≥ 10
x ≥ 0
y ≥ 0
The system of inequalities is:
2x + 3y ≤ 120 (labor constraint)
x ≥ 10 (minimum Product A requirement)
x ≥ 0, y ≥ 0 (non-negativity)
• System modeling: Multiple constraints form a system of inequalities
• Resource allocation: Limited resources create upper bounds
• Non-negativity: Physical quantities cannot be negative
Constraint: A limitation or restriction in a real-world situation
Feasible region: Set of all possible solutions that satisfy all constraints
Optimization: Finding maximum or minimum values within constraints
- Read carefully: Identify what is being asked and constraints
- Define variables: Assign letters to unknown quantities
- Translate words: Convert verbal descriptions to mathematical expressions
- Set up inequalities: Express constraints mathematically
- Solve systematically: Find solution set
- Interpret results: Check if solution makes sense in context
• Budget constraint: Total cost ≤ Available funds
• Resource constraint: Total usage ≤ Available resources
• Production constraint: Output ≤ Capacity
• Time constraint: Total time ≤ Available time
• Compound inequality: a ≤ x ≤ b means x is between a and b
Budget constraint: Total spending ≤ Budget limit
Ratio constraint: One quantity must be a multiple of another
Let x = number of sandwiches
Let y = number of drinks
Each sandwich costs $4, each drink costs $2
Total cost: 4x + 2y
Budget limit: $200
So: 4x + 2y ≤ 200
Need at least 30 sandwiches
So: x ≥ 30
Want at least twice as many drinks as sandwiches
This means: y ≥ 2x
Cannot order negative quantities
So: x ≥ 0 and y ≥ 0
x ≥ 30
y ≥ 2x
x ≥ 0, y ≥ 0
The system of inequalities is:
4x + 2y ≤ 200 (budget constraint)
x ≥ 30 (minimum sandwiches)
y ≥ 2x (ratio constraint)
x ≥ 0, y ≥ 0 (non-negativity)
• Ratio constraints: "at least twice as many" → y ≥ 2x
• Multiple constraints: Each requirement creates an inequality
• Logical relationships: Express ratios as inequalities
Time allocation: Distributing limited time among activities
Ratio constraint: Relationship between amounts of time spent
Let x = hours spent on Math
Let y = hours spent on Science
Student has 24 hours total
Time for Math + Time for Science ≤ 24
So: x + y ≤ 24
Must spend at least 6 hours on Math
So: x ≥ 6
Must spend at least 8 hours on Science
So: y ≥ 8
Wants no more than twice as much time on Math as on Science
This means: x ≤ 2y
Cannot spend negative time
So: x ≥ 0, y ≥ 0
Any (x,y) satisfying all constraints is valid
Example: (8, 10) because 8+10=18 ≤ 24, 8≥6, 10≥8, 8≤2(10)=20 ✓
x ≥ 6
y ≥ 8
x ≤ 2y
x ≥ 0, y ≥ 0
The system of inequalities is:
x + y ≤ 24 (time availability)
x ≥ 6 (minimum Math)
y ≥ 8 (minimum Science)
x ≤ 2y (ratio constraint)
x ≥ 0, y ≥ 0 (non-negativity)
• Time allocation: Sum of activity times ≤ available time
• Ratio constraints: "no more than twice" → ≤ 2y
• Validation: Always check potential solutions against all constraints
Constraint: A condition that limits possible solutions in a real-world scenario
Feasible region: The set of all points that satisfy all given constraints
Objective function: A function to maximize or minimize subject to constraints
- Understand the problem: Read carefully and identify what is being asked
- Identify constraints: List all limitations and requirements
- Define variables: Assign symbols to unknown quantities
- Translate to math: Convert verbal constraints to mathematical inequalities
- Set up system: Organize all inequalities together
- Solve systematically: Find the feasible region
- Interpret results: Make sure solution makes sense in context
• Budget constraints: Σ(price × quantity) ≤ total budget
• Resource constraints: Σ(resource needed per unit × quantity) ≤ total available
• Ratio constraints: If "at least twice as much A as B", then A ≥ 2B
• Time constraints: Σ(time per activity) ≤ total available time
• Compound inequalities: a ≤ x ≤ b represents bounded intervals
x + y ≤ 24
x ≥ 6
y ≥ 8
x ≤ 2y
Analysis: The feasible region represents all possible study time combinations that satisfy all constraints.
- The region is bounded by the four constraints
- Any point inside or on the boundary is a valid solution
- Corner points often represent optimal solutions