The idea, step by step
A fractional decision may be impossible
A continuous model allows every real feasible point. Counts of workers or vehicles usually require integers. The continuous optimum gives a bound, but rounding both coordinates can break a constraint or miss a better plan. State integrality before solving and check the original conditions after choosing a candidate.
Turn a small integer problem into a finite search
For each permitted integer x, find the allowable integer y-range. If profit increases with y, test the largest permitted y for that x; otherwise choose the appropriate endpoint or compare all candidates. A table of values proves which tested decision is best. Report ties honestly and use another practical criterion only when it is explicitly stated.
A common trap
Round the continuous optimum to the nearest whole pair and stop.
Instead: The rounded pair may be infeasible or suboptimal; justify a search over the permitted integer decisions.
See the thinking
Rounding can fail
Maximise for non-negative integers with and .
| x | Largest feasible integer y | P |
|---|---|---|
| 0 | 3 | 12 |
| 1 | 3 | 15 |
| 2 | 2 | 14 |
| 3 | 1 | 13 |
- The continuous corner is ; rounding up to violates both constraints.
- For x=0,1,2,3, the largest permitted y-values are 3,3,2,1.
- The corresponding objectives are 12,15,14,13.
Whole vehicles
At least 46 seats are needed. A small vehicle has 8 seats and costs AUD 70; a large vehicle has 14 seats and costs AUD 110. At most 5 vehicles are allowed. Minimise cost.
- Let x and y count small and large vehicles: , , both non-negative integers.
- For y=0, no plan fits five vehicles. For y=1,2,3,4,5 the least required x-values are 4,3,1,0,0.
- Costs are 390,430,400,440,550. Every cheaper x at each fixed y would fail seating.
Check your understanding
A model gives 4.2 workers. Is 4 automatically acceptable?
Show answer
No.
Four may fail the workload requirement; original constraints determine the valid integer choices.
Your turn
6 questions · 12 marks · Work at your own pace.
Read the questions online
- Find the greatest integer x with and .2 marks
- At least 25 items are packed in boxes of 6. Find the least number of boxes.2 marks
- Maximise for non-negative integers with , .2 marks
- Is feasible for , ?2 marks
- Two integer plans share the greatest profit. What should a recommendation explain?2 marks
- For x=0,1,2,3, the largest feasible integer y-values are 4,3,2,0. Maximise .2 marks
Read the worked solutions
Equivalent correct methods earn the corresponding marks. Include units where asked.
- Find the greatest integer x with and .2 marks
; choose the largest permitted integer below that bound.
6. - At least 25 items are packed in boxes of 6. Find the least number of boxes.2 marks
, so ; round up to meet the minimum.
5. - Maximise for non-negative integers with , .2 marks
Increasing y in place of x increases profit.
Use y=3 and the remaining capacity for x=2.
13 at . - Is feasible for , ?2 marks
The resource totals are 8 and 10, exceeding both limits.
No. - Two integer plans share the greatest profit. What should a recommendation explain?2 marks
A secondary criterion such as fewer staff hours can break the tie only if it matters in the stated situation.
Report both optima and any explicitly justified practical preference. - For x=0,1,2,3, the largest feasible integer y-values are 4,3,2,0. Maximise .2 marks
The four objective values are 16,17,18,15.
18 at .
Curriculum reference & lesson scope
SACE Board of South Australia
Stage 2 General Mathematics: Modelling with Linear Relationships, a compulsory school-assessed topic. The external examination scope differs from the full course.
Official curriculum source ↗