Below is a complete O-Level mathematics project on the tuckshop profit question.
It follows a
clear structure with: problem identification, investigation of related ideas, possible solutions,
refinement of the chosen solution (using linear programming), presentation of results, and
evaluation & recommendations. You can copy this into a document and format it as required
(title page, contents, page numbers).
Title
Maximising Profit for the School Tuckshop
O-Level Mathematics Project
1. Introduction
This project investigates how the school tuckshop can choose daily production quantities of two
items — samosas and sausage rolls — to maximise profit given limited resources. The study uses
algebra and linear programming (graphical method) to model the situation, find the optimal
solution, and make practical recommendations.
2. Problem Identification
- Background: The tuckshop sells samosas and sausage rolls. Both items require ingredients,
preparation time, and cooking time. The tuckshop has limited quantities of ingredients and a
fixed amount of time available each day.
- Problem statement: Determine how many samosas and sausage rolls the tuckshop should
produce each day to maximise total profit, subject to resource limits.
- Objectives:
1. Model the problem using variables, constraints and an objective function.
2. Solve the model using graphical linear programming.
3. Interpret the solution in practical terms and give recommendations.
3. Assumptions and Definitions
- Items:
- x = number of samosas produced per day
- y = number of sausage rolls produced per day
- All quantities x and y are non-negative integers (we will first treat them as real numbers for the
linear programming solution; final answers can be rounded if required).
- Resource constraints are assumed constant each day.
- Profit per item = selling price − production cost (including ingredient and labour cost allocated
per item).
4. Investigation of Related Ideas (Data & Parameters)
To make the problem concrete we use reasonable sample data (you can replace these values with
actual tuckshop data if available).
- Selling prices:
- Samosa selling price = $1.50 each
- Sausage roll selling price = $1.20 each
- Production costs (ingredients, packaging, portion of utilities and labour):
- Samosa cost = $0.60 each
- Sausage roll cost = $0.50 each
- Profit per item:
- Profit_samosa = 1.50 − 0.60 = $0.90
- Profit_sausage = 1.20 − 0.50 = $0.70
- Resource usage per item:
- Dough per samosa = 30 g
- Dough per sausage roll = 45 g
- Preparation & cooking time per samosa = 1.5 minutes
- Preparation & cooking time per sausage roll = 2 minutes
- Daily resource availability:
- Total dough available = 5 000 g
- Total tuckshop time available = 480 minutes (8 hours)
- Additional practical constraints (examples):
- Minimum demand constraint: at least 20 sausage rolls are required to meet regular orders.
- Production capacity: oven limit might restrict total items; for simplicity we use the time
constraint above.
5. Mathematical Model
- Variables:
x ≥ 0 : number of samosas
y ≥ 0 : number of sausage rolls
- Objective function (maximise profit P):
P = 0.90x + 0.70y
- Constraints:
1) Dough constraint: 30x + 45y ≤ 5000
2) Time constraint: 1.5x + 2y ≤ 480
3) Demand constraint: y ≥ 20
4) Non-negativity: x ≥ 0, y ≥ 0
6. Possible Solution Methods (brief)
- Method A: Trial and improvement — test plausible combinations (works for small problems).
- Method B: Algebraic elimination — solve pairs of constraints for boundary points.
- Method C: Linear programming (graphical) — plot feasible region, evaluate objective at corner
(extreme) points. (We use Method C.)
7. Refinement: Solve by Graphical Linear Programming
7.1 Convert constraints to boundary lines
- Dough: 30x + 45y = 5000 → divide by 15 → 2x + 3y = 333.333...
For plotting, use intercepts:
x-intercept: y=0 → x = 5000/30 ≈ 166.67
y-intercept: x=0 → y = 5000/45 ≈ 111.11
- Time: 1.5x + 2y = 480
Multiply by 2 to avoid decimals: 3x + 4y = 960
x-intercept: y=0 → x = 960/3 = 320
y-intercept: x=0 → y = 960/4 = 240
- Demand line: y = 20 (horizontal line)
7.2 Feasible region
- Plot the lines on x-y axes (x horizontal, y vertical) and shade the region satisfying all inequalities:
- Below or on the dough line
- Below or on the time line
- Above or on y = 20
-x≥0
- The feasible region is a convex polygon bounded by intersection points of the lines and axes
where all constraints hold.
7.3 Find corner (intersection) points
Compute intersections of the lines that form corners of the feasible region.
A: Intersection of y = 20 with dough constraint:
30x + 45(20) = 5000
30x + 900 = 5000
30x = 4100 → x = 136.666... ≈ 136.67
Point A: (136.67, 20)
B: Intersection of y = 20 with time constraint:
1.5x + 2(20) = 480
1.5x + 40 = 480
1.5x = 440 → x = 293.333... ≈ 293.33
Point B: (293.33, 20)
Which of A and B is feasible? Both satisfy y ≥ 20; we must check they satisfy both constraints.
Point B likely violates dough (check): 30(293.33) + 45(20) = 8800 + 900 = 9700 > 5000, so B is not
feasible (exceeds dough). Therefore the intersection with the time line at y=20 is outside due to
dough limit; so the boundary along y=20 will end where it meets the dough/time intersection,
not at B.
C: Intersection of dough and time constraints:
Solve simultaneously:
30x + 45y = 5000 (1)
1.5x + 2y = 480 (2) → multiply (2) by 20 to clear decimals: 30x + 40y = 9600
Subtract (1) from scaled (2):
(30x + 40y) − (30x + 45y) = 9600 − 5000
−5y = 4600 → y = −920
This gives negative y, which indicates inconsistent algebra due to erroneous scaling. Let's instead
scale (2) correctly:
Multiply (2) by 20: (1.5*20)x + (2*20)y = 480*20 → 30x + 40y = 9600 (this is correct)
Equation (1) is 30x + 45y = 5000
Subtract (1) from the scaled (2):
(30x + 40y) − (30x + 45y) = 9600 − 5000
−5y = 4600 → y = −920
A negative y means the two constraints do not intersect in the positive quadrant — i.e., the time
line is far to the right (or above). This indicates one constraint may be redundant. To check which
constraint is binding, evaluate the resources at some reasonable point.
Check which constraint is tighter at typical values:
- If y = 20 and x = 136.67 (point A), time used = 1.5(136.67) + 2(20) ≈ 205 + 40 = 245 min ≤ 480 (so
time is not tight).
- Dough is tight at A by construction.
Thus dough constraint is the limiting resource; time constraint is not binding for points near the
dough limit. The feasible region is bounded by dough constraint and y ≥ 20, with time constraint
not active for the maximum profit.
Therefore the corner points of interest are:
- Point on dough line with y = 20: A = (136.67, 20)
- Intersection of dough line with x axis: D = (166.67, 0) — but y must be ≥ 20, so D is not allowed.
- Intersection of dough line with y such that time constraint becomes binding might produce a
corner in negative quadrant (not relevant).
- Also consider where y = 20 and x = 0: E = (0,20) — check dough: 30(0)+45(20)=900 ≤ 5000 and
time: 1.5(0)+2(20)=40 ≤ 480, so E is feasible.
Feasible corner points that satisfy all constraints:
- E: (0, 20)
- A: (136.67, 20)
- Possibly the intersection of time line with x-axis that also has y ≥ 20? But its y is 0 so invalid.
- The feasible maximum along the dough line subject to y ≥ 20 occurs at A (since dough line
decreases as y increases).
7.4 Evaluate the objective function at feasible corner points
- At E: x=0, y=20 → P = 0.90(0) + 0.70(20) = $14.00
- At A: x ≈ 136.67, y=20 → P ≈ 0.90(136.67) + 0.70(20) = 123.00 + 14.00 = $137.00
Because x and y should be integers, consider nearest integer feasible solutions:
- Round A down: x = 136, y = 20 → check dough: 30(136)+45(20)=4080+900=4980 ≤ 5000, time:
1.5(136)+2(20)=204+40=244 ≤ 480 → P = 0.90(136)+0.70(20)=122.4+14=136.4 → $136.40
- Round A up: x = 137, y = 20 → dough: 30(137)+45(20)=4110+900=5010 > 5000 → infeasible.
So the best integer solution near A is (136, 20) with profit $136.40.
7.5 Check if producing fewer than 20 sausage rolls yields higher profit (if demand constraint not
binding)
If the demand constraint y ≥ 20 is removed, the dough line allows a larger x:
- Set y = 0 on dough: x = 5000/30 ≈ 166.67 → integer x = 166 gives dough used = 4980, profit P =
0.90(166) = $149.40 — larger than with y = 20.
But if demand requires y ≥ 20, we must produce at least 20 sausage rolls. If demand can be
relaxed and there is no contractual need for sausage rolls, producing only samosas gives a greater
profit.
8. Presentation of Results
- Continuous optimum on the dough constraint with y = 20 occurs at roughly (136.67, 20) with
profit $137.00.
- Best nearby integer feasible solution: produce 136 samosas and 20 sausage rolls → profit ≈
$136.40.
- If the minimum demand constraint (y ≥ 20) did not exist, producing only samosas (166 units)
would give profit ≈ $149.40, which is higher than producing 136 samosas + 20 sausage rolls.
9. Evaluation
- Strengths of the model:
- Uses a clear objective function and realistic resource constraints.
- Linear programming gives a simple graphical solution that identifies resource bottlenecks.
- Limitations:
- Model uses assumed values; actual tuckshop data may differ (prices, costs, resource usage).
- Ignores integer packaging or batch sizes beyond simple rounding.
- Does not consider demand elasticity: selling price may drop if too many items are offered.
- Labour availability might vary during the day; some tasks are not perfectly divisible.
- Quality, spoilage, and leftover stock issues are not modeled.
- Sensitivity observations:
- Dough is the binding (limiting) resource in the example; improving dough supply raises the
optimal samosa production.
- If samosa profit margin fell below that of sausage rolls, the optimal mix would shift towards
sausage rolls.
- Time constraint in this data set is not binding — adding time-consuming procedures or limiting
oven slots could change the solution.
10. Recommendations
- Short-term (operational):
- Produce 136 samosas and 20 sausage rolls daily, based on current assumptions, to
approximate the maximum profit while satisfying demand.
- Monitor actual sales: if sausage rolls sell less than 20, consider lowering minimum production
if acceptable.
- Track ingredient use and costs to update the model monthly.
- Medium-term:
- If possible, increase dough availability (purchase more dough or change dough allocation) to
increase total profit.
- Re-negotiate ingredient prices or reduce production costs to increase profit margins.
- Long-term:
- Collect real sales data (daily quantities sold, unsold stock) and update the model with realistic
demand constraints and possible price changes.
- Consider building a simple spreadsheet that computes optimal production automatically when
parameters change.
11. Extension Ideas (for further study)
- Introduce demand functions: model revenue as price × quantity but allow price to drop when
quantity increases.
- Use integer programming to force integer solutions and batch sizes.
- Include multiple resources such as oven capacity, staff shifts, or budget for ingredients.
- Compare profit under different pricing strategies (discounts, combo deals).
12. Conclusion
Using linear programming and the data provided, the tuckshop’s daily profit is maximised (under
the demand constraint y ≥ 20) by producing approximately 136 samosas and 20 sausage rolls.
This uses the available dough fully while remaining well under the time limit. The model should
be updated with actual tuckshop figures and sales data for most accurate recommendations.
Appendix (calculation summary)
- Profit per unit: samosa = $0.90, sausage roll = $0.70
- Constraints:
30x + 45y ≤ 5000
1.5x + 2y ≤ 480
y ≥ 20
- Best integer feasible solution found: x = 136, y = 20 → P ≈ $136.40
If you want, I can:
- Replace the sample numbers with real data you provide.
- Create a neat printable PDF or Word layout of this project.
- Produce a graph of the feasible region and objective lines to include in your project. Which
would you prefer?