(Solved): The initial tableau of a linear programming problem is given. Use the simplex method to solve the ...

The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem. x2 X3 3 6 1 3 - 1 - 3 X? 1 4 - 5 ???? 5010 1 The maximum is when = X1 (Type integers or simplified fractions.) $2 X2 = NOOT 0 X3 = 12 40 0 S? = and S2 =