D2 June 2019 Q5
5. A linear programming problem in \(x\), \(y\) and \(z\) is described as follows.
Maximise \(P = 2x + 3y + z\)
subject to \[\begin{aligned} 2y - 3z &\leqslant 30 \\ -3x + y + z &\leqslant 60 \\ x + 4y - z &\leqslant 80 \end{aligned}\]
The following tableau is obtained after further iterations.
| Basic variable | \(x\) | \(y\) | \(z\) | \(r\) | \(s\) | \(t\) | Value |
|---|---|---|---|---|---|---|---|
| \(r\) | 0 | 2 | –3 | 1 | 0 | 0 | 30 |
| \(s\) | 0 | 13 | –2 | 0 | 1 | 3 | 300 |
| \(x\) | 1 | 4 | –1 | 0 | 0 | 1 | 80 |
| \(P\) | 0 | 5 | –3 | 0 | 0 | 2 | 160 |
| Scheme | Marks | ||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| M1 A1 B1 | ||||||||||||||||||||||||||||||||||||||||
| (3) |
Notes
a1M1: Any one row correct (but ignore b.v. column)
a1A1: All four rows correct (but ignore b.v. column)
a1B1: b.v. column correct
| Scheme | Marks | |||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| M1 A1 M1 A1ft A1 | |||||||||||||||||||||||||||||||||||||||||||||
| (5) |
Notes
b1M1: Correct pivot located (2 in column \(y\)), attempt to divide row
b1A1: Pivot row correct including change of b.v
b2M1: All values in one of the non-pivot rows correct or one of the non zero and one columns (\(x\), \(z\), \(r\) or value) correct following through their choice of pivot from column \(y\)
b2A1ft: Row operations used correctly at least twice, i.e. two of the non zero and one columns (\(x\), \(z\), \(r\) or value) correct following through their choice of pivot from column \(y\)
b3A1: CAO – no follow through – all values and row operations correctly stated – allow if row operations given in terms of old row 1 – ignore b.v. column for this mark
| Scheme | Marks |
|---|---|
| \(P - 2x - \dfrac{11}{2}z + \dfrac{3}{2}r = 45\) | B1ft |
| \(r = 0, s = 45, t = 20\) | B1 |
| (2) |
Notes
c1B1ft: Follow their profit equation from (b) dependent on scoring both M marks in (b)
c2B1: CAO (no follow through) for slack variables (\(r = 0\), \(s = 45\), \(t = 20\))
| Scheme | Marks |
|---|---|
| All values in the (next) pivot column (the \(z\) column) are negative and so no further iterations can occur or no viable pivot. | B1 |
| (1) | |
| 11 marks |
Notes
d1B1: CAO