Quick Review from Lesson One
A tuck-shop sells chapatis (
- Decision variables:
= chapatis/day, = mandazis/day - Objective: Maximize
Today: turn the shop's limits into inequalities.
Translating Words to Inequality Symbols
Whenever you see these phrases in a constraint, use the symbol on the right.
At Most vs At Least: Key Contrast
| Phrase | Symbol | Example |
|---|---|---|
| "at most" / "no more than" | ||
| "at least" / "no fewer than" |
"At least 10" = floor (
Quick Check: Match Phrase to Symbol
Match each phrase to the correct inequality for
- "Total items cannot exceed 40"
- "At least 15 items must be made"
- "Exactly 30 items produced"
Which symbol —
Answers: Match Phrase to Symbol
- "Cannot exceed 40" →
(ceiling) - "At least 15 items" →
(floor) - "Exactly 30 items" →
(fixed)
"Cannot exceed" = at most =
Worked Example: Translating a Budget Constraint
Context: A tuck-shop has a daily ingredient budget of 12,000 UGX.
Each chapati costs 500 UGX; each mandazi costs 300 UGX.
Step 1: Total spending =
Step 2: "Cannot exceed 12,000" →
Worked Example: Translating a Time Constraint
Context: The tuck-shop has 8 hours of preparation time per day.
Each chapati takes 2 hours to prepare; each mandazi takes 1 hour.
Step 1: Total time =
Step 2: "Available time" sets a ceiling →
Worked Example: Minimum Quantity Requirements
Context: The owner must stock at least 5 chapatis and at least 3 mandazis each day to meet customer demand.
Minimum requirements produce
Quick Check: Write the Inequality
Context: A farmer can plant at most 20 acres in total.
Let
Write the constraint inequality for total acreage.
What is the combined expression? What is the limit? What is the direction?
Answer: Writing the Total Acreage Constraint
Total acreage:
"At most 20 acres" →
Check: if
Non-Negativity Constraints Are Always Required
— you cannot produce a negative number of chapatis — you cannot stock a negative number of mandazis
Add these to every LP model, even when the problem does not mention them.
Why Non-Negativity Constraints Always Matter
Without
- A mathematical solution might say "produce −8 chapatis"
- This satisfies other constraints but is physically impossible
- The feasible region would extend into negative quadrants
These two constraints confine solutions to the real world.
Complete Constraint System for Tuck-Shop
All five constraints together form the complete system.
Validating Your Inequalities: Three-Step Check
To verify each inequality is correct, apply three checks:
- Units match — left side units = right side units
- Direction correct — test a value that should be valid; it must satisfy the inequality
- Context sensible — the constraint captures the real-world limit described
Worked Example: Validating a Constraint
Constraint:
Check 1 (units):
Check 2 (direction): Try
Check 3 (context): "Cannot exceed budget" — constraint prevents overspending ✓
Guided Practice: Forming Farm Constraints
A farmer plants maize (
- Total land: at most 20 acres
- Maize requires at least 6 acres
- Budget 200,000 UGX; maize 15,000/acre, beans 8,000/acre
Write all constraints and validate each one.
Quick Check: Spot the Error
A student wrote these constraints for the farm scenario:
Which inequality is wrong? Why?
Check each one against the context before advancing.
Guided Practice: School Supplies Constraint System
A school buys chairs (
- Total furniture: at most 60 pieces
- Desks: at least 20
- Budget 500,000 UGX; chairs 5,000, desks 18,000
Write the complete inequality system (include non-negativity).
Exit Task: Write All Inequalities
A vendor makes samosas (
- Total items: at most 80 per day
- Samosas: at least 20 per day
- Budget 14,000 UGX; samosas 200 UGX, mandazis 150 UGX each
Write all inequalities (include non-negativity).
Exit Task: Check Your Answers
Five inequalities. Non-negativity always included.
Key Takeaways From Today's Lesson
✓ "At most" →
✓ Left side = coefficient × variable (units must match)
✓ Always include
✓ Validate: check units, direction, and context
Use
Next Lesson: Graphing the Constraints
In Lesson 3, we will:
- Convert each inequality into a boundary line equation
- Graph the line and shade the correct half-plane
- Identify the feasible region where all constraints are satisfied
Today's inequalities become tomorrow's graph.