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).