Edexcel D1 — Question 7

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicLinear Programming
TypeConstraint derivation verification
DifficultyModerate -0.5 This is a standard D1 linear programming question covering routine tasks: explaining constraint formation from a word problem, setting up a Simplex tableau, applying the Simplex algorithm mechanically, finding vertices graphically, and relating Simplex iterations to graph vertices. All parts are textbook exercises requiring procedural application rather than problem-solving insight, though the multi-part nature and Simplex algorithm steps place it slightly below average difficulty overall.
Spec7.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 coefficients7.07a Simplex tableau: initial setup in standard format7.07b Simplex iterations: pivot choice and row operations7.07c Interpret simplex: values of variables, slack, and objective

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}$$ 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. Solve the problem using the Simplex algorithm. Figure 4 shows a graphical representation of the feasible region for this problem. \begin{figure}[h]
    \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-008_686_1277_1319_453} \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. 6689 Decision Mathematics 1 (New Syllabus) Order of selecting edges
    Final tree
    (b) Minimum total length of cable
    Question 4 to be answered on this page
    (a) \(A\)
    Question 5 to be answered on this page
    Key
    (a) Early
    Time
    Late
    Time \includegraphics[max width=\textwidth, alt={}, center]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-011_433_227_534_201} \(F ( 3 )\) \includegraphics[max width=\textwidth, alt={}, center]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-011_117_222_1016_992}
    H(4) K(6)
    (b) Critical activities
    Length of critical path \(\_\_\_\_\) (c) \includegraphics[max width=\textwidth, alt={}, center]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-011_492_1604_1925_266} Question 6 to be answered on pages 4 and 5
    (a) (i) SAET \(\_\_\_\_\) (ii) SBDT \(\_\_\_\_\) (iii) SCFT \(\_\_\_\_\) (b) \begin{figure}[h]
    \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-012_691_1307_893_384} \captionsetup{labelformat=empty} \caption{Diagram 1}
    \end{figure} (c) \begin{figure}[h]
    \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-013_699_1314_167_382} \captionsetup{labelformat=empty} \caption{Diagram 2}
    \end{figure} Flow augmenting routes
    (d) \begin{figure}[h]
    \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-013_693_1314_1368_382} \captionsetup{labelformat=empty} \caption{Diagram 3}
    \end{figure} (e) \(\_\_\_\_\)

Question 7:
Parts (a) and (b):
AnswerMarks Guidance
AnswerMark Guidance
Any two of four arcs (E, F, I, dummy) drawn correctlyB1 Activities labelled with correct letter; dummy shown as dashed line
All four arcs (E, F, I, dummy) drawn correctlyB1 Activities labelled correctly; dummy as dashed line
CAO – all three activities (E, F, I) and dummy drawn correctly with correct arrowsB1 All arrows must be present; condone incorrect weights on activity arcs
All top boxes complete, values generally increasingM1 Condone lack of 0; dependent on first mark in (a)
All top box values correctA1 Dependent on first two marks in (a)
All bottom boxes complete, values generally decreasingM1 Condone one rogue value; dependent on first mark in (a)
All bottom box values correctA1 Dependent on first two marks in (a)
Part (c):
AnswerMarks Guidance
AnswerMark Guidance
Lower bound \(= \dfrac{92}{39} = 2.35\ldots\) so 3 workersM1 A1 M1: value in interval \([80-104]\) divided by finish time, or sum of activities divided by finish time; A1: correct calculation or awrt 2.4, then 3
Part (d):
AnswerMarks Guidance
AnswerMark Guidance
Not a cascade chart; 4 workers used at most; at least 8 activities placedM1
Critical activities (C, H, J, L) and A, B, D correctA1 A completed by late finish time (22); B completed by late finish (13); D starts after A, finishes before late finish (32)
3 workers; all 12 activities present once; condone one error on E, F, G, I, K onlyA1 One error = precedence OR time interval OR activity length
3 workers; all 12 activities present once; no errors on E, F, G, I, KA1
## Question 7:

### Parts (a) and (b):

| Answer | Mark | Guidance |
|--------|------|----------|
| Any two of four arcs (E, F, I, dummy) drawn correctly | B1 | Activities labelled with correct letter; dummy shown as dashed line |
| All four arcs (E, F, I, dummy) drawn correctly | B1 | Activities labelled correctly; dummy as dashed line |
| CAO – all three activities (E, F, I) and dummy drawn correctly with correct arrows | B1 | All arrows must be present; condone incorrect weights on activity arcs |
| All top boxes complete, values generally increasing | M1 | Condone lack of 0; dependent on first mark in (a) |
| All top box values correct | A1 | Dependent on first two marks in (a) |
| All bottom boxes complete, values generally decreasing | M1 | Condone one rogue value; dependent on first mark in (a) |
| All bottom box values correct | A1 | Dependent on first two marks in (a) |

### Part (c):

| Answer | Mark | Guidance |
|--------|------|----------|
| Lower bound $= \dfrac{92}{39} = 2.35\ldots$ so 3 workers | M1 A1 | M1: value in interval $[80-104]$ divided by finish time, or sum of activities divided by finish time; A1: correct calculation or awrt 2.4, then 3 |

### Part (d):

| Answer | Mark | Guidance |
|--------|------|----------|
| Not a cascade chart; 4 workers used at most; at least 8 activities placed | M1 | |
| Critical activities (C, H, J, L) and A, B, D correct | A1 | A completed by late finish time (22); B completed by late finish (13); D starts after A, finishes before late finish (32) |
| 3 workers; all 12 activities present once; condone one error on E, F, G, I, K only | A1 | One error = precedence OR time interval OR activity length |
| 3 workers; all 12 activities present once; no errors on E, F, G, I, K | A1 | |
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}$$

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.
\item Solve the problem using the Simplex algorithm.

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

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-008_686_1277_1319_453}
\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.

6689 Decision Mathematics 1 (New Syllabus)

Order of selecting edges\\

Final tree\\
(b) Minimum total length of cable\\

Question 4 to be answered on this page\\
(a) $A$

\begin{itemize}
  \item Monday (M)\\
$B$ ◯
  \item Tuesday (Tu)\\
$C \odot$
  \item Wednesday (W)\\
$D$ ◯
  \item Thursday (Th)\\
$E$ -
  \item Friday (F)\\
(b)\\
(c)
\end{itemize}

Question 5 to be answered on this page\\
Key\\
(a)

Early\\
Time\\
Late\\
Time\\
\includegraphics[max width=\textwidth, alt={}, center]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-011_433_227_534_201}\\
$F ( 3 )$\\
\includegraphics[max width=\textwidth, alt={}, center]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-011_117_222_1016_992}\\
H(4)

K(6)\\
(b) Critical activities\\

Length of critical path $\_\_\_\_$\\

(c)\\
\includegraphics[max width=\textwidth, alt={}, center]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-011_492_1604_1925_266}

Question 6 to be answered on pages 4 and 5\\
(a) (i) SAET $\_\_\_\_$\\
(ii) SBDT $\_\_\_\_$\\
(iii) SCFT $\_\_\_\_$\\
(b)

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-012_691_1307_893_384}
\captionsetup{labelformat=empty}
\caption{Diagram 1}
\end{center}
\end{figure}

(c)

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-013_699_1314_167_382}
\captionsetup{labelformat=empty}
\caption{Diagram 2}
\end{center}
\end{figure}

Flow augmenting routes\\

(d)

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{12f9ae59-b2ff-4a03-9ac9-c61dbaf8c9f5-013_693_1314_1368_382}
\captionsetup{labelformat=empty}
\caption{Diagram 3}
\end{center}
\end{figure}

(e) $\_\_\_\_$
\end{enumerate}

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