IA idea · Optimisation & linear programming
How many of each? Planning a charity bake sale with linear programming
Research question
With limited oven time, ingredient budget and preparation time, how many batches of each of two or three bakes should a charity stall make to maximise profit, and which constraint is worth relaxing first?
Make it yours, then agree it with your teacher.
Next step: plan this IA free — the planner opens with this question filled in. For feedback on your own draft, the IA package (€39 once) gives you 5 AI feedback credits and every annotated exemplar in full.
Why it makes a good exploration
A small, real business decision with every number under your control. The method (draw the constraints, find the corners) is new but accessible, and the question of which constraint to relax gives a natural second layer.
The mathematics you'll need
- Linear inequalities and feasible regions
- Vertices found by simultaneous equations
- Objective function and iso-profit lines
- Sensitivity: how the optimum moves when a constraint changes
Where the data comes from
Time your own baking, price the ingredients and use the real oven capacity; run the stall if you can and record sales.
- Desmos graphing calculator — Free graphing and regression (y₁ ~ ax₁ + b) — fit models to your data and show residuals.
- GeoGebra — Free geometry and graphing software — Voronoi diagrams, loci and regression built in.
A possible outline
- Measure times and costs for each bake.
- Write and graph the constraints; find the vertices.
- Find the maximum profit and check it with an iso-profit line.
- Relax each constraint in turn and measure the gain.
- Compare the plan with what actually sold.
Pitfalls that cost marks
- Assuming you can sell everything you make; consider a demand constraint.
- Rounding the optimum without checking feasibility.
- Too few constraints, so the answer is obvious without the method.
Showing personal engagement
- Run the stall and compare plan with reality.
- Ask friends how many they'd buy at a given price to set a demand limit.
- Decide which constraint you would pay to relax (an extra oven hour?).
See Criterion C: personal engagement for what examiners look for.
Which course is it for?
| Course | Fit | Maths to lean on |
|---|---|---|
| AA SL | Good fit | Linear inequalities and feasible regions; Vertices found by simultaneous equations |
| AA HL | Not a natural fit | The mathematics is mainly from the AI course; at AA HL the exploration would need an AA-level approach (calculus, proof or probability theory) to reach the top of Criterion E. |
| AI SL | Good fit | Linear inequalities and feasible regions; Vertices found by simultaneous equations |
| AI HL | Not a natural fit | The mathematics is mainly from the AA course; an AI HL version would need modelling with technology, statistics or networks at HL level. |
Level: Accessible. A good first extended piece of maths, with room to go deeper. See how the IA differs between AA and AI, SL and HL.
How this idea reaches the top bands
Reflection (D)
For this idea, start with the weak points: assuming you can sell everything you make; consider a demand constraint; and rounding the optimum without checking feasibility. Say how each one affects your answer.
Use of mathematics (E)
SL: linear inequalities and feasible regions; vertices found by simultaneous equations; objective function and iso-profit lines; sensitivity: how the optimum moves when a constraint changes, each explained in your own words and carried out correctly.
How optimisation explorations reach the top bands in general: Optimisation & linear programming IA ideas. Guides: A · B · C · D · E · self-grade sheet.
Taking it further
Let the selling price vary and model demand with a linear function, so the profit becomes quadratic; compare the two approaches.
Extending it for HL
Add an HL technique the question genuinely needs: what an HL optimisation exploration adds.
See a complete IA, marked
Should I lease or buy my first car? (AI SL) is a complete optimisation exploration, marked on every criterion.
Frequently asked questions
Which IB Maths course is this IA idea for?
It works for AA SL and AI SL. We rate it Accessible: a good first extended piece of maths, with room to go deeper.
What mathematics does this IA use?
Linear inequalities and feasible regions, vertices found by simultaneous equations, objective function and iso-profit lines and sensitivity: how the optimum moves when a constraint changes.
Where can I get data for this IA?
Time your own baking, price the ingredients and use the real oven capacity; run the stall if you can and record sales. Checked sources and tools: Desmos graphing calculator and GeoGebra.
Turn this idea into your IA
The planner opens with “How many of each? Planning a charity bake sale with linear programming” filled in: the question, the maths and the data sources.
Your plan is kept in this browser. A free account keeps it with your drafts on any device: Join free · Sign in
Also: free IA self-check · A–E checklist (PDF) · have a draft? AI feedback or a review with Pete (€100)
Writing it up: how to write a Maths IA, step by step · structure and format · mistakes that cost marks · IA modelling, step by step
Similar ideas
- How few staff can a café roster? An integer programming rotaAI SLAI HLAA SLSolid
- The cheapest healthy weekly shop: a linear programming diet problemAI SLAI HLAA SLSolid
- What speed minimises the total cost of a long drive?AA SLAI SLAA HLAI HLSolid
- What price maximises profit at our school bake sale?AA SLAI SLAA HLAI HLSolid
All optimisation ideas · AA SL ideas · AI SL ideas · All 239 IA ideas