Consideer the following problem:

a) Reformulate this problem (except for the equality restriction) so that it adjusts to the standard form of a linear programming model.

b) Using the Big M Method, construct the first Simplex Tableau and identify the corresponding basic feasible initial solution (artificial). Also, identify the basic variable that enters and the basic variable that goes out.

Maximizar Z = -2X, + X2 - 4X, + 3X4 Restricciones: X, + X2 + 3X2 + 2X4 54 X, - X+X_2-1 2X, +X, 52 X, + 2X2 + X2 + 2X2 = 2 X; , X, , XZ , X, 20