A2 June 2023 Q6
6. Polly is a motivational speaker who is planning her engagements for the next four weeks.
Polly will
- visit four different countries in these four weeks
- visit just one country each week
- leave from her home, S, and return there only after visiting the four countries
- travel directly from one country to the next
Polly wishes to determine a schedule of four countries to visit.
Table 1 shows the countries Polly could visit each week.
| Week | 1 | 2 | 3 | 4 |
|---|---|---|---|---|
| Possible countries to visit | A or B | C, D or E | F or G | H, I or J |
Table 1
Table 2 shows the speaker fee, in £100s, Polly would expect to earn in each country.
| Country | A | B | C | D | E | F | G | H | I | J |
|---|---|---|---|---|---|---|---|---|---|---|
| Earnings in £100s | 47 | 45 | 48 | 47 | 49 | 44 | 45 | 47 | 49 | 48 |
Table 2
Table 3 shows the cost, in £100s, of travelling between the countries.
| A | B | C | D | E | F | G | H | I | J | |
|---|---|---|---|---|---|---|---|---|---|---|
| S | 5 | 2 | 7 | 8 | 8 | |||||
| A | 3 | 4 | 5 | |||||||
| B | 5 | 4 | 6 | |||||||
| C | 7 | 5 | ||||||||
| D | 6 | 7 | ||||||||
| E | 7 | 6 | ||||||||
| F | 6 | 7 | 8 | |||||||
| G | 7 | 8 | 6 |
Table 3
Polly’s expected income is the value of the speaker fee minus the cost of travel.
She wants to find a schedule that maximises her total expected income for the four weeks.
Use dynamic programming to determine the optimal schedule. Complete the table provided in the answer book and state the maximum expected income. (13)
[The table in the answer book has columns headed Stage, State, Action, Destination and Value.]
| Scheme | Marks | AO | |||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| B1 | 3.1a | |||||||||||||||||||||||||||||||||||
| M1 A1 A1 | 3.1a 1.1b 1.1b | |||||||||||||||||||||||||||||||||||
| M1 A1ft A1 | 1.1b 1.1b 1.1b | |||||||||||||||||||||||||||||||||||
| M1 A1ft A1 | 1.1b 1.1b 1.1b | |||||||||||||||||||||||||||||||||||
| A1 | 1.1b | |||||||||||||||||||||||||||||||||||
| Optimal schedule is SACGJS Optimal expected income (£) 16 100 | B1 B1 | 2.2a 3.2a | |||||||||||||||||||||||||||||||||||
| (13) | |||||||||||||||||||||||||||||||||||||
| (13 marks) |
Notes
- Condone lack of destination column
- Only penalise incorrect result in value – i.e. ignore working values
- Penalise absence of state or action column with first two A marks earned only
- Penalise empty/errors in stage column with first A mark earned only
For all M marks – must bring optimal results from previous stage into calculation at least once – so from Stage 1 if neither of their 40 or their 41 are used in Stage 2 then M0. Ignore extra rows. Must have correct ingredients (appearance fee, cost) at least once per stage. If no working seen then values in the Value column must be correct to imply these marks. Penalise lack of * only once per question.
B1: CAO (Stage 1)
M1: Second stage completed. At least six rows. Bod if something in each cell
A1: Any one state correct with no extra rows for this state
A1: Both states correct with no extra rows for Stage 2
M1: Third stage completed. At least six rows. Bod if something in each cell
A1ft: Any two states correct – ft their optimal values from Stage 2 (no extra rows)
A1: All three states correct for Stage 3 (no extra rows)
M1: Fourth stage completed. At least six rows. Bod if something in each column
A1ft: Any one state correct - ft their optimal values from Stage 3 (no extra rows)
A1: Both states correct (no extra rows)
A1: Final state correct (no extra rows)
B1: Correct route (dependent on all previous M marks earned). (start and/or finish at S may not be stated)
B1: CAO (dependent on all previous M marks earned) – units not required – but not for 161
Alternative with values added at subsequent Stage
| Scheme | Marks | AO | |||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| B1 | 3.1a | |||||||||||||||||||||||||||||||||||
| M1 A1 A1 | 3.1a 1.1b 1.1b | |||||||||||||||||||||||||||||||||||
| M1 A1ft A1 | 1.1b 1.1b 1.1b | |||||||||||||||||||||||||||||||||||
| M1 A1ft A1 | 1.1b 1.1b 1.1b | |||||||||||||||||||||||||||||||||||
| A1 | 1.1b | |||||||||||||||||||||||||||||||||||
| Optimal schedule is SACGJS Optimal expected income (£) 16 100 | B1 B1 | 2.2a 3.2a |
Notes: as above
Special Case – Working Forwards
| Scheme | Marks | AO | |||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| B1 | ||||||||||||||||||||||||||||||||||||
| M1 A1 A0 | ||||||||||||||||||||||||||||||||||||
| M1 A1 A0 | ||||||||||||||||||||||||||||||||||||
| M1 A0 A0 | ||||||||||||||||||||||||||||||||||||
| A0 | ||||||||||||||||||||||||||||||||||||
| Optimal schedule is SACGJS Optimal expected income (£) 16 100 | B0 B0 | ||||||||||||||||||||||||||||||||||||
| Max: 6/13 |
Special Case – ignore stars throughout
B1: CAO (Stage 1)
M1: Second stage completed. At least six rows. Bod if something in each cell
A1: Both states correct with no extra rows for Stage 2 then A0
M1: Third stage completed. At least six rows. Bod if something in each cell
A1: Two out of three states with all values correct (no follow through) Then A0
M1: Fourth stage completed. At least six rows. Bod if something in each column. No further marks can be awarded