IA idea · Optimisation & linear programming
Cutting shelves from planks with the least waste
Research question
When shelves of several lengths must be cut from standard-length planks, which cutting patterns minimise the number of planks (and the waste), and how close does a simple 'longest first' rule get to the best possible answer?
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
The cutting-stock problem is used in real factories. A small version can be solved completely by listing patterns, which shows exactly why integer problems are harder than continuous ones, and lets you test a simple rule of thumb.
The mathematics you'll need
- Listing cutting patterns systematically (counting)
- Integer linear programming, explained on a small case
- Lower bounds: total length ÷ plank length
- Greedy algorithms and their worst cases
Where the data comes from
Use a real job: shelves for a room, a DIY project or the school's workshop, with real plank lengths from a hardware shop.
- Desmos graphing calculator — Free graphing and regression (y₁ ~ ax₁ + b) — fit models to your data and show residuals.
A possible outline
- State the order and plank length; find a lower bound.
- List all efficient cutting patterns.
- Find the optimum (by hand for a small order, then with a solver).
- Test the 'longest first' rule against it on several orders.
- Reflect on saw width, offcuts that can be reused and real cost.
Pitfalls that cost marks
- Missing cutting patterns because the listing is not systematic.
- Ignoring the width of the saw cut.
- Testing the rule on only one order.
Showing personal engagement
- Use a project you or your family are actually building.
- Invent an order that makes the greedy rule look as bad as possible.
- Check the plan by cutting card strips.
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 | Listing cutting patterns systematically (counting); Integer linear programming, explained on a small case |
| AA HL | Good fit | Listing cutting patterns systematically (counting); Integer linear programming, explained on a small case |
| AI SL | Good fit | Listing cutting patterns systematically (counting); Integer linear programming, explained on a small case |
| AI HL | Good fit | Listing cutting patterns systematically (counting); Integer linear programming, explained on a small case |
Level: Solid. Needs some independent work beyond class examples. 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: missing cutting patterns because the listing is not systematic; and ignoring the width of the saw cut. Say how each one affects your answer.
Use of mathematics (E)
SL: listing cutting patterns systematically (counting); integer linear programming, explained on a small case; lower bounds: total length ÷ plank length; greedy algorithms and their worst cases, 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
Prove a bound on how badly the greedy rule can do, or add a second plank length with a different price.
Extending it for HL
Add an HL technique the question genuinely needs: what an HL optimisation exploration adds.
See a complete IA, marked
How far can a stack of books lean over the edge of a table? (AA HL) 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, AA HL, AI SL and AI HL. We rate it Solid: it needs some independent work beyond class examples.
What mathematics does this IA use?
Listing cutting patterns systematically (counting), integer linear programming, explained on a small case, lower bounds: total length ÷ plank length and greedy algorithms and their worst cases.
Where can I get data for this IA?
Use a real job: shelves for a room, a DIY project or the school's workshop, with real plank lengths from a hardware shop. Checked sources and tools: Desmos graphing calculator.
Turn this idea into your IA
The planner opens with “Cutting shelves from planks with the least waste” 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
- Square or hexagonal? Packing tins into a boxAA SLAA HLAI SLSolid
- What speed minimises the total cost of a long drive?AA SLAI SLAA HLAI HLSolid
- What is the cheapest way to hire coaches for a school trip?AA SLAI SLAA HLAI HLAccessible
- Will the sofa fit round the corner? The longest object through a corridorAA SLAA HLAI SLAI HLSolid
All optimisation ideas · AA SL ideas · AA HL ideas · AI SL ideas · AI HL ideas · All 239 IA ideas