Consider applying revised simplex Algorithm 5C to the tabulated standard-form LP min c =

x1 x2 x3 x4 x5 5 4 3 2 16 b A = 2 0 1 0 6 8 0 1 1 2 3 12 starting with x1 and x2 basic.

(a) Determine the corresponding starting basis matrix and its inverse, along with the associated primal basic solution and pricing vector.

(b) Use appropriate column pricing to decide which nonbasics are eligible to enter the basis, pick the one with most negative cQ j, and generate its simplex direction.

(c) Complete the rest of one iteration by (i)

choosing a step size and leaving basic variable, (ii) updating the current basis matrix, (iii) updating the corresponding basis inverse with an appropriate E-matrix, and (iv) updating the primal solution and the pricing vector.