D1.5.1 Formulation of problems as linear programs including the meaning…
Section
D1.5 Linear programming
Level
Partly A level only
Statement
Formulation of problems as linear programs including the meaning and use of slack, surplus and artificial variables.
Guidance
For example, 3x + 2y ≤ 20 ⇒ 3x + 2y + s₁ = 20; 2x + 5y ≤ 35 ⇒ 2x + 5y + s₂ = 35; x + y ≥ 5 ⇒ x + y − s₃ + t₁ = 5; where s₁, s₂ are slack variables, s₃ is a surplus variable and t₁ is an artificial variable.
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Once again, this question was accessible to the vast majority of responses and was well placed at the end of the paper with a range of marks being awarded. Full marks were seen, but not often. The question was still well attempted with no evidence that learners were running short of time. Part a) was generally completed well although some learners lost the mark by failing to find the integer coefficients or failing to multiply by 4 effectively ending up with a constant of 20 or 100. Part b) also provided marks for the majority of learners; most gained the first mark although although the 3x >= 2y inequality often caused the most issues and was therefore allocated two some used x instead of y for the first inequality. It was common to see errors of x >= 4 out of the three available marks for this part. Indeed, every combination of 3, x, 2, y and also scored the first B mark in bii) for drawing 2𝑥𝑥+ 𝑦𝑦 <= 28 and 𝑦𝑦 >= 4. However, direction of inequality was seen with reasonably even frequency. A large majority of learners unsurprisingly, the issues in finding the final constraint then led to further inaccuracies in drawing this constraint, and as such only a minority of learners scored the final B mark in b). A few also lost the final mark by failing to label their R. Part c) produced a range of responses with varying degrees of understanding as to the requirement. A significant number of learners did not follow the instruction to use vertex testing, and instead either used the objective line method or just focused on the optimal point and completed integer testing just around this point. If they had the correct optimal point then
Key points from the mark scheme and examiner's report
line through (0, 20) and (16, 0): 5x + 4y ≤ 80
constants 20 or 100 from failing to clear fractions
June 2025 · AS Paper 2 (Decision 1) · Q4(b)5 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
this could still score well, but if errors had been made in (b) it was common to see lots of incorrect working leading to only one mark in part (c), most commonly from testing (12,4)
Key points from the mark scheme and examiner's report
y ≥ 4, 2x + y ≤ 28, 3x ≥ 2y (this one most often wrong, every arrangement seen)
draw lines, shade out and label R
June 2025 · Paper 3D (Decision 1) · Q5(b)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Part (b) was well-attempted by most candidates. Those who gave equations with slack variables rather than inequalities were only penalised with one mark and this was seen in perhaps approximately 50% of responses. In other cases, marks were usually lost for forgetting to transform the objective function in terms of Q, or for algebraic slips made in the simplification of the substitutions.
Key points from the mark scheme and examiner's report
2X + 2Y − 2Z ≤ 17, 2X − Y + Z ≤ 8, −3X + Y + 2Z ≤ 6
maximise Q = 3X + 4Y − 2Z
X, Y, Z ≥ 0
give inequalities, not equations
objective must be in Q
June 2025 · Paper 3D (Decision 1) · Q7(a)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (a) the majority of candidates attempted to set up the initial tableau, mostly with reasonable success. Some marks were lost owing to (minor) slips in translating from their equations to the tableau. A small number of candidates confused which equations needed slack variables versus which needed surplus and artificial variables. A small number of candidates added surplus variables and subtracted artificial variables, rather than the reverse. Most understood the process of employing big-M, with occasional slips in gathering terms leading to an incorrect objective function, although some did not form an objective function of the right format. Populating the table correctly was achieved by many candidates – with errors in correct identification of basic variables in each row indicated perhaps a lack of depth of understanding of the overall approach and what the simplex tableau is achieving.
Key points from the mark scheme and examiner's report
read constraints from Figure 5: 3x + 4y ≤ 20, 3x + y ≤ 8 (slacks), x ≥ 1, 2x + 3y ≥ 6 (surplus and artificial)
P = 11x + ky − M(a₁ + a₂) with a₁ + a₂ = 7 − 3x − 3y + s₂ + s₃
P row −(11 + 3M), −(k + 3M), …, −7M
June 2024 · AS Paper 2 (Decision 1) · Q4(a)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question highlighted just how challenging many students find it to accurately use and understand inequalities in terms of shading regions. There may have also been an issue with time management with many incomplete or even blank responses. A majority of students in part a) understood how to find the line equations correctly but slipped up on one or more inequalities. Most achieved at least two of the required inequalities, however the equation 5y=2x-10 tended to be the one causing loss of the final mark, either due to poor multiplying from a fractional gradient or failing to multiply out to get integer coefficients. A not insignificant number of candidates stated all three inequalities the incorrect way around, however scored a generous M mark through the special case. Part b) saw a range of responses, with some candidates incorrectly confusing multiplication (e.g. y = 10x) and addition (y = x + 5 e.g.), whilst others continued to struggle with the inequalities, and many inverted the relationship between the stated x and y (e.g. y = x + 10 and x = 5y). The frequent errors in part b) led to further issues with candidates in part c) drawing an array of lines; scores of M1A1ftA0 were frequent as the MS generously allowed the ft on their erroneous lines if a line of gradients 1, 5 or 1/5 were seen. Line drawing and shading inequalities caused significant difficult for a large proportion of candidates. Drawing y =1 first, seemed to cause a lot of confusion between the line and the axis, although there were many x=1 lines drawn, even when the other diagonal lines were drawn correctly. It should be noted that a significant number of candidates either didn’t shade at all or shaded on the wrong side of the line. Some shading was difficult to follow, and general accuracy levels and clarity on the diagram was poor with many candidates failing to label the feasible region. It was also disheartening to see a number of candidates attempt to indicate a region already shaded out by the examiner as invalid. Part di) enforced the requirement for candidates to demonstrate their methods fully, and as such a large number of candidates scored zero despite their work indicating they may have identified the optimal vertex. A significant number of candidates did not know to (or chose not to) draw an OL on their graph to demonstrate the method. Of those who did, some drew the reciprocal so were only able to score one mark, and of those who got the correct objective line, many went on to find the correct optimal point. In part dii), very few candidates scored the final two marks, as tables of integer points and inequality testing were rarely seen. Those that did mostly identified the correct point, but then failed to calculate the total to achieve the final mark. Very few full mark responses were seen. A good number of candidates actually identified the optimal solution/value but without demonstrating how they had reached their integer solution. A number of candidates gave solutions outside the range, whilst others erroneously thought an integer solution just involved rounding their x, y and/or value obtained. Some candidates gave non-integer values, not appreciating the context of the question in this part.
Key points from the mark scheme and examiner's report
x + y ≤ 30, y ≤ 2x + 10, 5y ≥ 2x − 10
integer coefficients and non-strict
the 5y = 2x − 10 line caused most errors
x, y ≥ 0 not shown so not accepted
June 2024 · AS Paper 2 (Decision 1) · Q4(b)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question highlighted just how challenging many students find it to accurately use and understand inequalities in terms of shading regions. There may have also been an issue with time management with many incomplete or even blank responses. A majority of students in part a) understood how to find the line equations correctly but slipped up on one or more inequalities. Most achieved at least two of the required inequalities, however the equation 5y=2x-10 tended to be the one causing loss of the final mark, either due to poor multiplying from a fractional gradient or failing to multiply out to get integer coefficients. A not insignificant number of candidates stated all three inequalities the incorrect way around, however scored a generous M mark through the special case. Part b) saw a range of responses, with some candidates incorrectly confusing multiplication (e.g. y = 10x) and addition (y = x + 5 e.g.), whilst others continued to struggle with the inequalities, and many inverted the relationship between the stated x and y (e.g. y = x + 10 and x = 5y). The frequent errors in part b) led to further issues with candidates in part c) drawing an array of lines; scores of M1A1ftA0 were frequent as the MS generously allowed the ft on their erroneous lines if a line of gradients 1, 5 or 1/5 were seen. Line drawing and shading inequalities caused significant difficult for a large proportion of candidates. Drawing y =1 first, seemed to cause a lot of confusion between the line and the axis, although there were many x=1 lines drawn, even when the other diagonal lines were drawn correctly. It should be noted that a significant number of candidates either didn’t shade at all or shaded on the wrong side of the line. Some shading was difficult to follow, and general accuracy levels and clarity on the diagram was poor with many candidates failing to label the feasible region. It was also disheartening to see a number of candidates attempt to indicate a region already shaded out by the examiner as invalid. Part di) enforced the requirement for candidates to demonstrate their methods fully, and as such a large number of candidates scored zero despite their work indicating they may have identified the optimal vertex. A significant number of candidates did not know to (or chose not to) draw an OL on their graph to demonstrate the method. Of those who did, some drew the reciprocal so were only able to score one mark, and of those who got the correct objective line, many went on to find the correct optimal point. In part dii), very few candidates scored the final two marks, as tables of integer points and inequality testing were rarely seen. Those that did mostly identified the correct point, but then failed to calculate the total to achieve the final mark. Very few full mark responses were seen. A good number of candidates actually identified the optimal solution/value but without demonstrating how they had reached their integer solution. A number of candidates gave solutions outside the range, whilst others erroneously thought an integer solution just involved rounding their x, y and/or value obtained. Some candidates gave non-integer values, not appreciating the context of the question in this part.
Key points from the mark scheme and examiner's report
y ≥ 1, y + 10 ≥ x, y ≤ 5x
common errors y = 10x, y ≥ x + 10, x ≤ 5y (variables inverted)
June 2024 · Paper 3D (Decision 1) · Q5(a)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (a) many responses demonstrated that candidates understood how to use slack, surplus and artificial variables to construct their constraints successfully. However, there were errors seen in establishing the initial inequalities including a common error in translation of the multiplicative relationship between x and y resulting in rather than Errors in the direction of one or more inequalities were also seen which, of course, impacted on the introduction of the dummy variables. Setting up the new the objective function was the least successful part of the process, with seen frequently. Sign issues were almost usually the barrier here. In fact, many candidates omitted this step completely perhaps highlighting a lack of understanding for this aspect of the specification. In most cases, candidates could transfer their constraints to the tableau although, again, some issues with signs were seen, as were errors in the basic variable labels.
Key points from the mark scheme and examiner's report
x − y ≥ 100, x ≤ 5y, 2x + 3y ≥ 350
minimise x + y as maximise P = −x − y − M(a₁ + a₂) with a₁, a₂ substituted
P row 1 − 3M, 1 − 2M, M, 0, M, … −450M
x ≤ 5y often written y ≤ 5x
June 2024 · Paper 3D (Decision 1) · Q7(b)5 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question was attempted by most candidates, suggesting that they were able to complete the paper in time. Many candidates appeared unsure about parts (a) and (b) but were able to gain marks in the later parts. Part (b) proved to be the most challenging part of the paper. It was evident that many candidates found it difficult, or impossible, to apply their knowledge to work backwards towards the initial tableau. Some recognised how to deduce two constraints, and/or , from the tableau rows involving one slack variable only, gaining just one mark for either. Examiners commented that a remarkable proportion of candidates failed to multiply the RHS of the first constraint, so they often saw “ ”. A pleasing number of candidates were successful though, using one of two possible methods, either reverse row operations or the algebraic approach eliminating s2 from equations for the third constraint and the objective. Some used a hybrid of the two methods but got there in the end.
Key points from the mark scheme and examiner's report
x-row gives 4x + y − z ≤ 40, s₃ row y + z ≤ 26
eliminate s₂ from the s₁ and P rows: 2x + z ≤ 50, maximise P = 3x + y + 2z
hardest part of the paper
June 2023 · AS Paper 2 (Decision 1) · Q4(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (a) most candidates scored at least one mark for stating at least two correct inequalities that defined the given feasible region. Even though the stem specifically said that the feasible region included its boundaries several candidates used strict inequalities.
Key points from the mark scheme and examiner's report
x ≤ 8, 3x + 8y ≥ 32, 3y ≤ 4x + 5, 4x + 15y ≤ 120
boundaries included so no strict inequalities
June 2023 · Paper 3D (Decision 1) · Q7(a)5 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates attempted this question, though it seemed that some ran out of time part way through. Only a few candidates gained full marks. There were several common mistakes occurring in candidates’ responses to part (a). These were: failing to state “maximise” when defining the objective function, failing to convert the 150 and 60 hours to 9000 and 3600 minutes when defining the constraints, and writing the constraint “at least three times as many paperbacks as hardcovers” incorrectly as 3x >= y rather than x >= 3y. Errors in part (a) then led to incorrect responses in part (b). In general, most candidates were confident using
Key points from the mark scheme and examiner's report
maximise P = 8x + 20y + 40z
4x + 8y + 15z ≤ 9000, x + 5y + 12z ≥ 3600 (hours into minutes), x + y + z ≥ 1600, x ≥ 3y
"maximise" omitted and 3x ≥ y were common errors
June 2023 · Paper 3D (Decision 1) · Q7(b)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates attempted this question, though it seemed that some ran out of time part way through. Only a few candidates gained full marks. There were several common mistakes then led to incorrect responses in part (b). In general, most candidates were confident using slack, surplus and artificial variables. One recurrent error was to rearrange the constraint x >= 3y as x – 3y >= 0 so that a third artificial variable was incorrectly introduced, in spite of the question stating, “using exactly two artificial variables”. Those candidates who did have two artificial variables usually went on to set up an equation for I using their a1 and a2, gaining the associated method mark. But the correct corresponding accuracy mark was frequently lost by candidates not explicitly stating the correct equations for both I and P, with variables on one side and constant on the other, before filling in the tableau. Most candidates managed to complete the tableau and achieve the method mark for two completely correct rows, though the associated accuracy mark was often lost due to prior errors. For a few candidates their only error was to write surplus variables, rather than artificial variables, in the basic variable column. The answer to part (c) was independent of the earlier parts of the question, providing
Key points from the mark scheme and examiner's report
slacks s₁, s₄, surplus s₂, s₃ and artificials a₁, a₂
I = −(a₁ + a₂) gives I − 2x − 6y − 13z + s₂ + s₃ = −5200
equations must be shown, not just the tableau
June 2023 · Paper 3D (Decision 1) · Q7(e)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates attempted this question, though it seemed that some ran out of time part way through. Only a few candidates gained full marks. There were several common mistakes number of candidates earned the final mark in (e), but a significant proportion gave spurious answers about the efficiency of the machines or other costs that might arise, rather than considering the direct context of the question.
Key points from the mark scheme and examiner's report
not all the books may be sold
comments on machine efficiency or other costs scored 0
June 2022 · AS Paper 2 (Decision 1) · Q4(a)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
A surprising number of candidates failed to gain the three marks in (a), for listing the three inequalities shown on the graph. Many candidates attempted to write down the equations of the 14 x y three lines, but many had difficulties at this stage. The inequality was mostly stated correctly, though some candidates struggled to arrive at the corresponding equation for this inequality. Algebraic errors sometimes produced 2 6 rather than 2 12, y x y x or similar. A good number of candidates, in (b), went on to solve the correct pair of simultaneous
Key points from the mark scheme and examiner's report
x + y ≤ 14, 2y − x ≤ 12, 3x − y ≤ 15
integer coefficients
line through (0, 6) often mis-derived (e.g. y ≤ 2x + 6)
June 2022 · Paper 3D (Decision 1) · Q4(a)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question proved to be a good discriminator between candidates. A not-insignificant number of candidates left this question out entirely, but the vast majority attempted it and were able to access one or more marks, with a reasonable number achieving full marks. The first half of (a) was generally answered well. A significant majority of candidates were able to give the correct inequalities for the three constraints, and the modal score for the two independent accuracy marks was full marks by some margin. The mistakes that were seen, with relatively low frequency, were to use strict inequalities, to reverse the direction of the inequality or, most commonly of these, to include the use of slack/artificial variables in their inequalities, thereby losing both marks. A small number of numerical slips were also seen.
Key points from the mark scheme and examiner's report
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Candidates found this to be one of the most challenging questions on the paper, with very few candidates scoring full marks. Each part of this question was independent of each other and therefore candidates who performed poorly, or didn’t attempt some parts, were in some cases still able to score on other parts of the question. For (a), many candidates chose not to write down the equations for the feasible region, choosing otherwise to complete the tableau immediately. For these candidates, the tableau had to be completely correct, whereas those candidates who had written down their equations with slack variables could gain some credit for these even if their tableau was incorrect. There were obviously many correct variations other than the one shown in the mark scheme which were perfectly acceptable, as the order of equations was not specified in the question. The main errors in the tableau involved sign errors, usually in the objective line or in the inequality 2 1 y x - „ where several candidates failed to appreciate that negative values are not acceptable.
Key points from the mark scheme and examiner's report
read the four constraints from Figure 5: x + y ≤ 8, x + 2y ≤ 12, 7x + 2y ≤ 46, y − 2x ≤ 1 with slacks
P − x − ky = 0 objective row
Nov 2021 · Paper 3D (Decision 1) · Q8(a)5 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
It wasn’t obvious if time was a factor in why a few attempts at the final question were left blank or whether it was the demand(s) of the question itself. Most candidates who did attempt this question scored a good number of marks in (a) and (b) for setting up the linear programming problem and the corresponding two-stage Simplex tableau. Most candidates knew what to do in
Key points from the mark scheme and examiner's report
maximise P = y + z
x + y + z ≤ 39
2/5(x + y + z) ≤ x i.e. −3x + 2y + 2z ≤ 0
x + z ≥ 28
"maximise" must be stated
Nov 2021 · Paper 3D (Decision 1) · Q8(b)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
It wasn’t obvious if time was a factor in why a few attempts at the final question were left blank or whether it was the demand(s) of the question itself. Most candidates who did attempt this question scored a good number of marks in (a) and (b) for setting up the linear programming problem and the corresponding two-stage Simplex tableau. Most candidates knew what to do in
Key points from the mark scheme and examiner's report
slacks s₁, s₂, surplus s₃ and artificial a₁ for x + z ≥ 28
I = −a₁ gives I − x − z + s₃ = −28
five-row tableau
Oct 2020 · AS Paper 2 (Decision 1) · Q49 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
It was noted by examiners that this final question was attempted by most candidates and thus indicated that time pressure was unlikely to have been an issue for many. Some responses were incomplete but most of the time it seems that candidates completed as much as they were able to do. This question provided a variety of responses due to its unfamiliarity when compared to what has been seen on previous assessments. Candidates were given a linear programming problem in two variables graphically, the value of the objective at the optimal vertex, and were then asked to form the linear programming problem in algebraic form. Most candidates who attempted this question realised that they had to find the equations of the lines and hence inequalities that defined the feasible region. The most common errors were with forming the equation of the line passing through the points (7, 2) and (9, 8) and with incorrect inequality signs. While many candidates correctly found the inequalities that defined the feasible region only a small percentage could find the correct expression for the objective function. Most candidates believed that because the given objective line passed through 5 on the y-axis and 3 on the x-axis that therefore the objective function was simply 5 3 x y + when in fact the objective could be any multiple of this expression (also candidates should have realised that if the objective was 5 3 x y + then the information given in the question regarding the value of the objective at V was 556 was therefore irrelevant). What candidates had to do was to find the exact coordinates of the optimal point, substitute these values into 5 3 x y + and solve ( ) 5 3 P k x y = + with P = 556 which would have led them to the correct objective function of 60 36 . P x y = + Finally candidates are reminded that when they are asked to define a linear programming problem that they must state whether the objective is to be maximised or minimised (in this case maximised).
Key points from the mark scheme and examiner's report
lines 2x + y ≥ 12, 6x + 5y ≤ 60, 3x − y ≤ 19 (line through (7, 2) and (9, 8) often wrong
inequality signs from the shading)
V = (155/21, 22/7)
objective line gives P = k(5x + 3y), 556 at V so maximise P = 60x + 36y
few found the objective
Oct 2020 · Paper 3D (Decision 1) · Q7(a)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Only a few candidates were unable to make any attempt here. The two stage simplex is another recent addition to the specification, but a good proportion of candidates showed at least some understanding of the method. Many candidates realised what was required to formulate the linear programming problem and were able to interpret the content of the simplex tableau accordingly, though some had all three constraint inequalities reversed. Candidates should recognise that it is essential to state whether the objective is to be maximised or minimised and failure to do so will always result in one mark lost. It was pleasing to see a proportion of candidates showing clear working in order to go
Key points from the mark scheme and examiner's report
read the tableau back: maximise P = 2x + y + 3z subject to x + 2y + 3z ≤ 45, 3x + 2y ≥ 9, −x + 4z ≥ 4
must say maximise
reversed inequalities seen
June 2019 · AS Paper 2 (Decision 1) · Q5(a)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
at least initially in part (a), was standard and the question gave rise to the usual errors that have been observed over many previous sessions. Almost all candidates worked with the provided variables x, y and z. Some candidates initially began formulating the problem in terms of r, p and h although usually they switched to x, y and z and rewrote their work with the required variables. Those that didn’t convert their variables usually petered out before getting very far with the question. Most candidates stated the objective function correctly and many remembered to ‘minimise’ although this was certainly not universally the case. Many candidates were able to state the equality constraint for the total number of flowers although some candidates believed there were 100 flowers rather than the given 1000. As is usually the case, the inequality constraints were generally more problematic. Most x 600. candidates had success with the roses constraint and many immediately deduced that Sometimes though, this inequality was in the wrong direction and les able candidates gave other 3 5 . x y z incorrect interpretations including By far the most challenging constraint was the hydrangea/peony constraint which was often incorrect. It was common to see the incorrect inequality 2 3 y z but also 3 2 y z or 2 3 . y z Sometimes all the constraints were stated as equations with no inequalities and examiners also observed strict inequalities being used from time to time. Often candidates did not seem to realise that they had been asked to eliminate z and many simply worked with the constraints in all three variables. Of those that did attempt to eliminate z however, some candidates set the hydrangea/peony constraint to be an equality and used this to eliminate z rather than using the correct x + y + z = 1000 constraint. Some candidates who did make headway eliminating z from the constraints, neglected to eliminate z from the objective function. Often candidates were able to pick up marks in part (b) despite incomplete responses to part (a). Most recognised the need for the total number of flowers to equal 1000 and correspondingly stated values to fit their constraints. Occasionally though, the minimum value of x was not used as had been stipulated and quite often candidates did not state their solution in context despite being asked for the number of each type of flower. Indeed, some candidates seemed to become muddled with the variables and flowers and stated solutions that were not compatible with their constraints - seemingly mixing up hydrangeas and peonies. On several occasions, examiners saw responses where candidates had only stated the required values for x and y and omitted the value for z. Occasionally the total cost was not stated. Overall, the question performed well providing a wide range of marks and the opportunity for differentiation amongst the candidates.
Key points from the mark scheme and examiner's report
minimise x + 5y + 4z with x ≥ 3/5(x + y + z), 3y ≥ 2z, x + y + z = 1000
eliminate z: minimise y − 3x (+4000) subject to x ≥ 600, 2x + 5y ≥ 2000
"minimum" not accepted for minimise
2y ≥ 3z reversal common
100 for 1000
June 2019 · AS Paper 2 (Decision 1) · Q5(b)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Often candidates were able to pick up marks in part (b) despite incomplete responses to part (a). Most recognised the need for the total number of flowers to equal 1000 and correspondingly stated values to fit their constraints. Occasionally though, the minimum value of x was not used as had been stipulated and quite often candidates did not state their solution in context despite being asked for the number of each type of flower. Indeed, some candidates seemed to become muddled with the variables and flowers and stated solutions that were not compatible with their constraints - seemingly mixing up hydrangeas and peonies. On several occasions, examiners saw responses where candidates had only stated the required values for x and y and omitted the value for z. Occasionally the total cost was not stated. Overall, the question performed well providing a wide range of marks and the opportunity for differentiation amongst the candidates.
Key points from the mark scheme and examiner's report
x = 600 gives y = 160, z = 240: 600 roses, 160 hydrangeas, 240 peonies, £2360
give the answer in context and include z
June 2019 · Paper 3D (Decision 1) · Q6(b)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (b) most candidates made a good attempt at setting up the initial tableau, generally converting the three constraints into equations of the correct form. Most used the notation provided in the question, although a small number used r, s and t instead of 1 2 , s s and 3, s although only some candidates changed the headings in their tableau. A small number made sign errors with the second and third constraints, adding surplus variables and subtracting artificial variables. A significant number of candidates made mistakes with their objective function, ranging from the basic form with errors such as 1 2 2 2 0 P x y z M a a or 1 2 2 2 P x y z M a a seen or an expression with the equals sign omitted. Other errors followed when attempting to substitute for 1 2 a a or when simplifying the equation. There were some common errors seen in the three constraints when they were written in the tableau, such as 0 4 2 in the third row being entered as 4 2 0, the b.v. column being left empty or an x, y or z appearing in a cell. Some candidates left one or more cells blank. There were a significant number of errors made in the objective row, many of which came from simplification errors noted above. Common errors included 0 instead of 23M in the value column and M instead of M in the 2s and 3s columns.
Key points from the mark scheme and examiner's report
slack s₁, surplus s₂ s₃ and artificial a₁ a₂
P = 2x + 2y − z − M(a₁ + a₂) with a₁ + a₂ = 23 − x − 3y − 3z + s₂ + s₃ substituted
objective row errors were common
June 2019 · Paper 3D (Decision 1) · Q7(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (a) the first constraint (based on the manager ordering at least 60 watches) was usually stated correctly. The constraint which required “at most 80% of the watches to be digital” was either dealt with very well by candidates or not attempted at all with only a minority giving either the inequality or the variables transposed. Most candidates were able to draw the required lines correctly in (b) although some were unable to
Key points from the mark scheme and examiner's report
x + y ≥ 60
y ≤ 4/5(x + y) (not strict)
the 80% constraint was often omitted or transposed
June 2018 · AS Paper 2 (Decision 1) · Q4(a)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question proved to be very challenging for most students. Even the familiar parts of the question were not well answered and many students did not define the variables correctly. Many believed they referred to ‘cost’ or ‘time taken’ or simply stated ‘x = week one’ without referring to the fact that x is the number of cabinets produced in week 1, etc.
Key points from the mark scheme and examiner's report
x, y, z are the NUMBER of cabinets produced in weeks 1, 2, 3
"x = week 1" or cost/time answers score 0
June 2018 · AS Paper 2 (Decision 1) · Q4(b)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In (b) the inequalities were not always stated correctly but the vast majority of students got at least one correct. Often errors arose from students stating 2z <= y and the direction of the inequalities caused a number of problems too. For (c), the vast majority of students were simply unable to deal with the conversion of the 3-variable
Key points from the mark scheme and examiner's report
x + y ≤ z, z ≤ 2y, y + z ≤ 125 (with non-negativity)
2z ≤ y was a common reversal
June 2018 · AS Paper 2 (Decision 1) · Q4(c)8 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
For (c), the vast majority of students were simply unable to deal with the conversion of the 3-variable problem to a 2-variable problem even though all the constraints had been done for the students. All students had to do was to realise that the information in the question implied that x + y + z = 150, re-write this equation in terms of z, substitute for z in the original objective function and then obtain a new objective function in terms of x and y only. The most common approach, however, was to simply ignore the z term in the objective function and to work with the constraint 250x + 275y. Some students were even more creative and eliminated z using one of the inequality constraints. Some students kept z in the objective function and ignored the fact that it was effectively then a variable and would take different values at different vertices. Most surprisingly of all, a significant number of students never stated an objective function at all. For the remaining part of this question candidate responses were split between the methods of objective line and point testing. For the objective line method, most students drew an acceptable line based on their objective function although the scale on the graph seemed to cause some difficulties. Furthermore, the often fairly complex gradients that students had produced for themselves provided a challenge for some. For those point testing, it was unfortunate that so many students took so long to calculate the coordinates of their vertices and then rounded to integer values before evaluating in the objective function. Some students calculated the coordinates of the vertices and then ruled out all vertices except (25, 50) because they were not integer-valued. There were quite a few students who did work with the exact coordinates and evaluated them correctly in the objective function but then did not consider the context that an integer solution was required. Examiners noted that a small minority of students calculated the z-values at each vertex although this also often involved premature rounding too. By the nature of the problem, even with incorrect objective functions, inaccurate objective line drawings and incorrect point testing, most students were able to get to the correct optimum vertex. The vast majority however did not give their solution in context and many forgot to reintroduce z at this point.
Key points from the mark scheme and examiner's report
substitute z = 150 − x − y to get P = 50x + 75y + 30000
optimal vertex (25, 125/3) then integer point (25, 42), rejecting (26, 41)
25, 42, 83 cabinets, £34 400
most ignored z or kept it constant
Find an Edexcel Further Maths tutor
Stuck on this? Book a trial lesson with our Further Maths tutor.