- [Weight:15 points - Suggested time: 15 min] The table below shows an iteration of the simplex method in a maximization linear programming problem. a s2 s3 A1 RHS Basic Z X1 0 X2 -55 0 |-15 115 30 s1 0 4 2 -2 12 -000 1 1/2 0 1/2 1/2 1 X1 s3 0 0 10 1 0 2 The new pivot row is the following: Continue iterating by calculating ONLY the new Z row and provide the following: i) The coefficients of the new Z row. ii) Does the new Z row show optimality? *Formulas New pivot row = Current pivot row - Pivot element New row = (Current row) - (pivot column coefficient) X (New pivot row)