Edexcel D1 — Question 7

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
PaperDownload PDF ↗
TopicLinear Programming
TypeConstraint derivation verification
DifficultyModerate -0.8 This is a standard D1 linear programming question with routine constraint verification, Simplex tableau setup, and algorithm application. Part (a) requires simple explanation of given inequalities (2 marks), parts (b-c) follow textbook Simplex procedures, and parts (d-e) involve basic coordinate finding and matching algorithm stages to graph vertices. All components are procedural with no novel insight required, making it easier than average A-level questions.
Spec7.06a LP formulation: variables, constraints, objective function7.07a Simplex tableau: initial setup in standard format7.07b Simplex iterations: pivot choice and row operations7.07c Interpret simplex: values of variables, slack, and objective7.07e Graphical interpretation: iterations as edges of convex polygon

7. A tailor makes two types of garment, \(A\) and \(B\). He has available \(70 \mathrm {~m} ^ { 2 }\) of cotton fabric and \(90 \mathrm {~m} ^ { 2 }\) of woollen fabric. Garment \(A\) requires \(1 \mathrm {~m} ^ { 2 }\) of cotton fabric and \(3 \mathrm {~m} ^ { 2 }\) of woollen fabric. Garment \(B\) requires \(2 \mathrm {~m} ^ { 2 }\) of each fabric. The tailor makes \(x\) garments of type \(A\) and \(y\) garments of type \(B\).
  1. Explain why this can be modelled by the inequalities $$\begin{aligned} & x + 2 y \leq 70 \\ & 3 x + 2 y \leq 90 \\ & x \geq 0 , y \geq 0 \end{aligned}$$ (2 marks)
    The tailor sells type \(A\) for \(\pounds 30\) and type \(B\) for \(\pounds 40\). All garments made are sold. The tailor wishes to maximise his total income.
  2. Set up an initial Simplex tableau for this problem.
    (3 marks)
  3. Solve the problem using the Simplex algorithm.
    (8 marks) Figure 4 shows a graphical representation of the feasible region for this problem. \begin{figure}[h]
    \includegraphics[alt={},max width=\textwidth]{3147dad8-2d3c-42fd-b288-7017ff1fce16-004_452_828_995_356} \captionsetup{labelformat=empty} \caption{Fig. 4}
    \end{figure}
  4. Obtain the coordinates of the points A, \(C\) and \(D\).
  5. Relate each stage of the Simplex algorithm to the corresponding point in Fig. 4.
    (3 marks) Answer Book (AB12)
    Graph Paper (ASG2) Items included with question papers Answer booklet

7. A tailor makes two types of garment, $A$ and $B$. He has available $70 \mathrm {~m} ^ { 2 }$ of cotton fabric and $90 \mathrm {~m} ^ { 2 }$ of woollen fabric. Garment $A$ requires $1 \mathrm {~m} ^ { 2 }$ of cotton fabric and $3 \mathrm {~m} ^ { 2 }$ of woollen fabric. Garment $B$ requires $2 \mathrm {~m} ^ { 2 }$ of each fabric.

The tailor makes $x$ garments of type $A$ and $y$ garments of type $B$.
\begin{enumerate}[label=(\alph*)]
\item Explain why this can be modelled by the inequalities

$$\begin{aligned}
& x + 2 y \leq 70 \\
& 3 x + 2 y \leq 90 \\
& x \geq 0 , y \geq 0
\end{aligned}$$

(2 marks)\\
The tailor sells type $A$ for $\pounds 30$ and type $B$ for $\pounds 40$. All garments made are sold. The tailor wishes to maximise his total income.
\item Set up an initial Simplex tableau for this problem.\\
(3 marks)
\item Solve the problem using the Simplex algorithm.\\
(8 marks)

Figure 4 shows a graphical representation of the feasible region for this problem.

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{3147dad8-2d3c-42fd-b288-7017ff1fce16-004_452_828_995_356}
\captionsetup{labelformat=empty}
\caption{Fig. 4}
\end{center}
\end{figure}
\item Obtain the coordinates of the points A, $C$ and $D$.
\item Relate each stage of the Simplex algorithm to the corresponding point in Fig. 4.\\
(3 marks)

Answer Book (AB12)\\
Graph Paper (ASG2)

Items included with question papers Answer booklet
\end{enumerate}

\hfill \mbox{\textit{Edexcel D1  Q7}}