Consider the following linear programming problem:
Max s.t.
60x1 + 90x2
15x1 + 45x2 90
5x1 + 5x2 20
x1, x2 > 0
a. Write the problem in standard form.
b. Develop the portion of the simplex tableau involving the objective function coefficients, the coefficients of the variables in the constraints, and the constants for the right-hand sides.