| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2012 |
| Session | June |
| Marks | 13 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Linear Programming |
| Type | Constraint derivation verification |
| Difficulty | Moderate -0.8 This is a standard D1 linear programming question requiring routine constraint formulation from verbal descriptions and graphical interpretation. Part (b) involves simple algebraic manipulation (multiplying through by 6), and the optimization uses the ruler method which is a taught technique. All steps are procedural with no novel problem-solving required. |
| Spec | 7.06a LP formulation: variables, constraints, objective function7.06b Slack variables: converting inequalities to equations7.06d Graphical solution: feasible region, two variables7.06e Sensitivity analysis: effect of changing coefficients |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(y \leq x\) | B1 (1) | CAO |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(y \geq \frac{1}{6}(x+y)\), leading to \(6y \geq x+y\), giving \(5y \geq x\) | B2,1,0 (2) | b1B1: Either of first two lines; must have three terms, two in \(y\) and one in \(x\). b2B1: CSO, must have \(\geq\) throughout |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(5x + 6y \leq 300\) | B1 (1) | CAO |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Two lines and shading correctly added | B1 B1 (2) | \(5y = x\) drawn correctly, passes within small square of \((0,0)\) and \((50,10)\); \(5x+6y=300\) passes within small square of \((0,50)\), \((30,25)\) and \((60,0)\) |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| R correctly labelled | B1 (1) | CAO – must have scored both marks in (d) |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Objective line correctly drawn and labelled | M1 A1 | Drawing objective line with correct gradient; correct line drawn (no BOD) |
| Optimal vertex labelled | A1 (3) | V labelled or clearly indicated, or coordinates written to 1dp; awrt \((9.7, 48.4)\) |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Buy 48 standard and 10 luxury cars | 1B1 2B1 | g1B1: Finding vertex in R with integer coordinates, within 2 small squares of V; accept \((48,10)\), \((47,10)\), \((46,11)\), \((27,27)\), \((28,26)\). g2B1: CAO \((48,10)\) |
| Expected profit £4640 per week | 3B1 (3) | CAO 4640 |
| Total: 13 marks |
# Question 7:
## Part a:
| Answer | Marks | Guidance |
|--------|-------|----------|
| $y \leq x$ | B1 **(1)** | CAO |
## Part b:
| Answer | Marks | Guidance |
|--------|-------|----------|
| $y \geq \frac{1}{6}(x+y)$, leading to $6y \geq x+y$, giving $5y \geq x$ | B2,1,0 **(2)** | b1B1: Either of first two lines; must have three terms, two in $y$ and one in $x$. b2B1: CSO, must have $\geq$ throughout |
## Part c:
| Answer | Marks | Guidance |
|--------|-------|----------|
| $5x + 6y \leq 300$ | B1 **(1)** | CAO |
## Part d:
| Answer | Marks | Guidance |
|--------|-------|----------|
| Two lines and shading correctly added | B1 B1 **(2)** | $5y = x$ drawn correctly, passes within small square of $(0,0)$ and $(50,10)$; $5x+6y=300$ passes within small square of $(0,50)$, $(30,25)$ and $(60,0)$ |
## Part e:
| Answer | Marks | Guidance |
|--------|-------|----------|
| R correctly labelled | B1 **(1)** | CAO – must have scored both marks in (d) |
## Part f:
| Answer | Marks | Guidance |
|--------|-------|----------|
| Objective line correctly drawn and labelled | M1 A1 | Drawing objective line with correct gradient; correct line drawn (no BOD) |
| Optimal vertex labelled | A1 **(3)** | V labelled or clearly indicated, or coordinates written to 1dp; awrt $(9.7, 48.4)$ |
## Part g:
| Answer | Marks | Guidance |
|--------|-------|----------|
| Buy 48 standard and 10 luxury cars | 1B1 2B1 | g1B1: Finding vertex in R with integer coordinates, within 2 small squares of V; accept $(48,10)$, $(47,10)$, $(46,11)$, $(27,27)$, $(28,26)$. g2B1: CAO $(48,10)$ |
| Expected profit £4640 per week | 3B1 **(3)** | CAO 4640 |
| **Total: 13 marks** | | |
7.
\begin{figure}[h]
\begin{center}
\includegraphics[alt={},max width=\textwidth]{4ad45e8f-f50a-4125-866b-a6951f85600f-8_2491_1570_175_299}
\captionsetup{labelformat=empty}
\caption{Figure 6}
\end{center}
\end{figure}
A company is going to hire out two types of car, standard and luxury.
Let $x$ be the number of standard cars it should buy.\\
Let $y$ be the number of luxury cars it should buy.
Figure 6 shows three constraints, other than $x , y \geqslant 0$\\
Two of these are $x \geqslant 20$ and $y \geqslant 8$
\begin{enumerate}[label=(\alph*)]
\item Write, as an inequality, the third constraint shown in Figure 6.
The company decides that at least $\frac { 1 } { 6 }$ of the cars must be luxury cars.
\item Express this information as an inequality and show that it simplifies to
$$5 y \geqslant x$$
You must make the steps in your working clear.
Each time the cars are hired they need to be prepared. It takes 5 hours to prepare a standard car and it takes 6 hours to prepare a luxury car. There are 300 hours available each week to prepare the cars.
\item Express this information as an inequality.
\item Add two lines and shading to Diagram 1 in the answer book to illustrate the constraints found in parts (b) and (c).
\item Hence determine the feasible region and label it R .
The company expects to make $\pounds 80$ profit per week on each car.\\
It therefore wishes to maximise $\mathrm { P } = 80 x + 80 y$, where P is the profit per week.
\item Use the objective line (ruler) method to find the optimal vertex, V, of the feasible region. You must clearly draw and label your objective line and the vertex V.
\item Given that P is the expected profit, in pounds, per week, find the number of each type of car that the company should buy and the maximum expected profit.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2012 Q7 [13]}}