Edexcel D1 2003 January — Question 8

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2003
SessionJanuary
TopicThe Simplex Algorithm
8. The tableau below is the initial tableau for a maximising linear programming problem.
Basic Variable\(x\)\(y\)\(z\)\(r\)\(s\)Value
\(r\)234108
\(s\)3310110
\(P\)- 8- 9- 5000
  1. For this problem \(x \geq 0 , y \geq 0 , z \geq 0\). Write down the other two inequalities and the objective function.
  2. Solve this linear programming problem.
  3. State the final value of \(P\), the objective function, and of each of the variables. END
This paper (6 questions)
View full paper
Q1 Q2 Q3 Q5 Q6 Q8