D1 June 2011 Q3

EdexcelOld spec8 marksLinear Programming

3.

Figure 2: graph with lines 6x + 5y = 60, 2x + 3y = 12, 3x = 2y and x = 2y, rejected sides hatched, feasible region R between them
Figure 2

Figure 2 shows the constraints of a linear programming problem in \(x\) and \(y\), where \(R\) is the feasible region.

(a) Write down the inequalities that form region \(R\). (2)

The objective is to maximise \(3x + y\).

(b) Find the optimal values of \(x\) and \(y\). You must make your method clear. (4)
(c) Obtain the optimal value of the objective function. (1)

Given that integer values of \(x\) and \(y\) are now required,

(d) write down the optimal values of \(x\) and \(y\). (1)