Edexcel D2 2015 June — Question 1

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2015
SessionJune
TopicThe Simplex Algorithm
  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
  1. Perform one iteration of the Simplex algorithm to obtain a new tableau, \(T\). State the row operations you use.
    (5)
  2. Write down the profit equation given by \(T\) and state the current values of the slack variables.
This paper (6 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6