1. Consider the following problem: Maximize Z — Зx1 - x2 - x3 subject to x1 – 2x2 + x3 <= 11 -4x1 + x2 + 2x3 >= 3 -

2x1 + x3 =1 x1, x2, x3 >= 0. (a) Using the Big M method, reformulate this problem to fit our augmented form for a linear programming model. (b) Construct the complete first simplex tableau for the simplex method. (c) Work through the simplex method step by step to solve the problem.