2x + y ≤ 12
Each loaf uses 2 flour units and each tray uses 1. The total cannot exceed 12.
Senior 4 • Linear Programming • Showcase mission
The school enterprise club has limited flour and oven time. Choose the production plan that earns the greatest profit without breaking either limit.
Open the mission →The situation
The club can bake banana loaves and mandazi trays. One loaf uses 2 flour units and 1 oven unit. One mandazi tray uses 1 flour unit and 2 oven units. Only 12 flour units and 12 oven units are available. Profit is UGX 6,000 per loaf and UGX 5,000 per tray.
Foundation • A constraint is a limit
Let x be banana loaves and y be mandazi trays. A feasible plan uses no more flour or oven time than the club has. Linear programming compares all feasible choices efficiently by testing the corner points.
Each loaf uses 2 flour units and each tray uses 1. The total cannot exceed 12.
Each loaf uses 1 oven unit and each tray uses 2. This total also cannot exceed 12.
Use this rule to compare the profit earned at every feasible corner.
Worked example • Follow the reasoning
The boundary lines meet the axes and each other at (0,0), (6,0), (4,4) and (0,6). Evaluate P at each point.
Six loaves use all 12 flour units.
This plan uses exactly 12 flour units and 12 oven units.
The largest tested profit is UGX 44,000 at (4,4).
QUICK CHECK 1
QUICK CHECK 2
QUICK CHECK 3
QUICK CHECK 4
QUICK CHECK 5
QUICK CHECK 6
QUICK CHECK 7
QUICK CHECK 8
QUICK CHECK 9
QUICK CHECK 10
QUICK CHECK 11
QUICK CHECK 12
QUICK CHECK 13
QUICK CHECK 14
QUICK CHECK 15
Final scenario challenge
Every option below is a corner point. Choose the plan with the greatest verified profit.
Explain your thinking
Write two or three sentences. Use the mathematical steps from the mission as evidence—not only the final answer.
Take the mission offline
Continue on paper, teach it in class, or send the guided activity home.
A strong answer does not guess. It represents, calculates and explains.
Choose another room →