D1 June 2018 Q7

EdexcelOld spec17 marksLinear Programming

7. A café sells two types of scone, plain and fruit.

The café manager knows that each week she should order

  • at least 400 scones in total
  • at most 350 fruit scones

In addition, for every 3 fruit scones ordered, at most 5 plain scones should be ordered.

Each plain scone costs £0.11 and is sold at a profit of £0.75

Each fruit scone costs £0.14 and is sold at a profit of £1

The manager has £77 to spend each week on scones. The manager wants to maximise her profit and it can be assumed that all scones ordered will be sold.

Let \(x\) represent the number of plain scones and let \(y\) represent the number of fruit scones that are sold.

(a) Formulate this information as a linear programming problem. State the objective and list the constraints as simplified inequalities with integer coefficients. (6)
(b) Represent these constraints on Diagram 1 in the answer book.
Hence determine the feasible region and label it R. (4)
(c) Use the objective line method to find the optimal vertex, V, of the feasible region. You must make your objective line clear and label the optimal vertex V. (3)
(d) Calculate the exact coordinates of V. (2)
(e) State the number of each type of scone that the manager should order and calculate the maximum profit. (2)