Edexcel D1 2003 June — Question 6 15 marks

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2003
SessionJune
Marks15
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicLinear Programming
TypeFormulation from word problem
DifficultyEasy -1.3 This is a standard textbook linear programming question requiring routine application of well-practiced techniques: formulating constraints from a table, graphing inequalities, and finding the optimal vertex. All steps are algorithmic with no novel problem-solving required, making it easier than average for A-level.
Spec7.06a LP formulation: variables, constraints, objective function7.06d Graphical solution: feasible region, two variables7.06e Sensitivity analysis: effect of changing coefficients

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.
OxfordYork
Cutting46
Finishing3.54
Packaging24
Profit (£)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. [1]
  2. In addition to $$2x + 3y \leq 33,$$ $$x \geq 0,$$ $$y \geq 0,$$ find two further inequalities to model the company's situation. [2]
  3. On the grid in the answer booklet, illustrate all the inequalities, indicating clearly the feasible region. [4]
  4. Explain how you would locate the optimal point. [2]
  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.
  1. Identify this stage and state by how many hours the time may be reduced. [3]

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.

\begin{tabular}{|l|c|c|}
\hline & Oxford & York \\
\hline Cutting & 4 & 6 \\
\hline Finishing & 3.5 & 4 \\
\hline Packaging & 2 & 4 \\
\hline Profit (£) & 300 & 500 \\
\hline
\end{tabular}

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.

\begin{enumerate}[label=(\alph*)]
\item Write down the objective function.
[1]
\item In addition to
$$2x + 3y \leq 33,$$
$$x \geq 0,$$
$$y \geq 0,$$
find two further inequalities to model the company's situation.
[2]
\item On the grid in the answer booklet, illustrate all the inequalities, indicating clearly the feasible region.
[4]
\item Explain how you would locate the optimal point.
[2]
\item Determine the number of Oxford and York suites that should be made each week and the maximum profit gained.
[3]
\end{enumerate}

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.

\begin{enumerate}[label=(\alph*)]
\setcounter{enumi}{5}
\item Identify this stage and state by how many hours the time may be reduced.
[3]
\end{enumerate}

\hfill \mbox{\textit{Edexcel D1 2003 Q6 [15]}}