D2 June 2015 Q1

EdexcelOld spec7 marksLinear Programming

1. The tableau below is the initial tableau for a linear programming problem in \(x\), \(y\) and \(z\). The objective is to maximise the profit, \(P\).

Basic variable\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)Value
\(r\)2–4110015
\(s\)42–801020
\(t\)1–140018
\(P\)–3270000
(a) Perform one iteration of the Simplex algorithm to obtain a new tableau, T. State the row operations you use. (5)
(b) Write down the profit equation given by T and state the current values of the slack variables. (2)