Linear Programming | Lesson 2 of 10

Forming Linear Inequalities from Real Contexts

S4 Mathematics — Term 1, Topic 3

In this lesson:

  • Translate verbal constraints into linear inequalities
  • Write non-negativity restrictions for every model
  • Validate inequalities by checking against the context
S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

What You Will Learn Today

By the end of this lesson, you should be able to:

  1. Translate verbal constraints into linear inequalities (, , , )
  2. Add non-negativity restrictions (, ) to every model
  3. Check each inequality against the original context to validate it
S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Quick Review from Lesson One

A tuck-shop sells chapatis () and mandazis ().

  • Decision variables: = chapatis/day, = mandazis/day
  • Objective: Maximize

Today: turn the shop's limits into inequalities.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Translating Words to Inequality Symbols

Reference table: five key phrases in left column, matching inequality symbol and direction in right column

Whenever you see these phrases in a constraint, use the symbol on the right.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

At Most vs At Least: Key Contrast

Phrase Symbol Example
"at most" / "no more than"
"at least" / "no fewer than"

"At least 10" = floor (). "At most 50" = ceiling ().

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Quick Check: Match Phrase to Symbol

Match each phrase to the correct inequality for :

  1. "Total items cannot exceed 40"
  2. "At least 15 items must be made"
  3. "Exactly 30 items produced"

Which symbol — , , or — for each?

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Answers: Match Phrase to Symbol

  1. "Cannot exceed 40" → (ceiling)
  2. "At least 15 items" → (floor)
  3. "Exactly 30 items" → (fixed)

"Cannot exceed" = at most = . "At least" = minimum = .

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

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 = UGX

Step 2: "Cannot exceed 12,000" →

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

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 = hours

Step 2: "Available time" sets a ceiling →

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

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 constraints.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Quick Check: Write the Inequality

Context: A farmer can plant at most 20 acres in total.
Let = acres of maize, = acres of beans.

Write the constraint inequality for total acreage.

What is the combined expression? What is the limit? What is the direction?

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Answer: Writing the Total Acreage Constraint

Total acreage: acres

"At most 20 acres"

Check: if and , the total is 22 — that violates the constraint. ✓

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Non-Negativity Constraints Are Always Required

Number line showing x ≥ 0: left half shaded gray (invalid), right half white (valid), with a boundary marker at 0 labeled "x cannot go here"

  • — 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.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

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.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Complete Constraint System for Tuck-Shop

Full constraint system for the tuck-shop written as a structured list with variable definitions, four numbered inequalities, and non-negativity on the final line

All five constraints together form the complete system.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Validating Your Inequalities: Three-Step Check

To verify each inequality is correct, apply three checks:

  1. Units match — left side units = right side units
  2. Direction correct — test a value that should be valid; it must satisfy the inequality
  3. Context sensible — the constraint captures the real-world limit described
S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Worked Example: Validating a Constraint

Constraint:

Check 1 (units): shs/chapati chapatis shs ✓

Check 2 (direction): Try , :

Check 3 (context): "Cannot exceed budget" — constraint prevents overspending ✓

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Guided Practice: Forming Farm Constraints

A farmer plants maize ( acres) and beans ( acres):

  • 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.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

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.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Guided Practice: School Supplies Constraint System

A school buys chairs () and desks ():

  • 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).

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Exit Task: Write All Inequalities

A vendor makes samosas () and mandazis ():

  • 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).

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Exit Task: Check Your Answers

Five inequalities. Non-negativity always included.

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

Key Takeaways From Today's Lesson

✓ "At most" → ; "at least" →

✓ Left side = coefficient × variable (units must match)

✓ Always include ,

✓ Validate: check units, direction, and context

⚠️ Use or , not ; "at least 10" =

S4 Mathematics | NCDC Uganda
Linear Programming | Lesson 2 of 10

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.

S4 Mathematics | NCDC Uganda

Click to begin the narrated lesson

Forming Linear Inequalities