Edexcel D1 2003 June — Question 6

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2003
SessionJune
TopicLinear Programming

6. A company produces two types of self-assembly wooden bedroom suites, the 'Oxford' and the 'York'. After the pieces of wood have been cut and finished, all the materials have to be packaged. The table below shows the time, in hours, needed to complete each stage of the process and the profit made, in pounds, on each type of suite.
\cline { 2 - 3 } \multicolumn{1}{c|}{}OxfordYork
Cutting46
Finishing3.54
Packaging24
Profit \(( \pounds )\)300500
The times available each week for cutting, finishing and packaging are 66, 56 and 40 hours respectively. The company wishes to maximise its profit.
Let \(x\) be the number of Oxford, and \(y\) be the number of York suites made each week.
  1. Write down the objective function.
  2. In addition to $$\begin{gathered} 2 x + 3 y \leq 33 ,
    x \geq 0 ,
    y \geq 0 , \end{gathered}$$ find two further inequalities to model the company’s situation.
  3. On the grid in the answer booklet, illustrate all the inequalities, indicating clearly the feasible region.
  4. Explain how you would locate the optimal point.
  5. Determine the number of Oxford and York suites that should be made each week and the maximum profit gained.
    (3) It is noticed that when the optimal solution is adopted, the time needed for one of the three stages of the process is less than that available.
  6. Identify this stage and state by how many hours the time may be reduced.
    (3)