Edexcel D2 2006 June — Question 8

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2006
SessionJune
TopicThe Simplex Algorithm
8. The tableau below is the initial tableau for a maximising linear programming problem.
Basic variable\(x\)\(y\)\(z\)r\(s\)\(t\)Value
\(r\)710101003600
\(s\)69120103600
\(t\)2340012400
\(P\)-35-55-600000
  1. Write down the four equations represented in the initial tableau above.
    (4)
  2. Taking the most negative number in the profit row to indicate the pivot column at each stage, solve this linear programming problem. State the row operations that you use.
  3. State the values of the objective function and each variable.
    b.v.\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)ValueRow Operations
    b.v.\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)ValueRow Operations
    b.v.\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)ValueRow Operations
    b.v.\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)ValueRow Operations
    b.v.\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)ValueRow Operations
This paper (8 questions)
View full paper
Q1 Q3 Q4 Q5 Q6 Q7 Q8 Q9