OCR Further Discrete 2019 June — Question 3

Exam BoardOCR
ModuleFurther Discrete (Further Discrete)
Year2019
SessionJune
TopicGroups

3 A problem is represented as the initial simplex tableau below.
\(\mathbf { P }\)\(\mathbf { x }\)\(\mathbf { y }\)\(\mathbf { z }\)\(\mathbf { s }\)\(\mathbf { t }\)RHS
1- 201000
01111060
02340160
  1. Write the problem as a linear programming formulation in the standard algebraic form with no slack variables.
  2. Carry out one iteration of the simplex algorithm.
  3. Show algebraically how each row of the tableau found in part (b) is calculated.