1. Use the simplex method to solve the LP problem:
Maximize z = 20 x1 + 24 x2 + 15 x3 subject to
2 x1 + 4 x2 + x3 ≤ 80
2 x1 + 3 x2 + 3x3 ≤ 108
x1 ≥ 0, x2 ≥0, x3 ≥0.
[You need to introduce slack variables. In the answer I want to see: The initial simplex tableau, the solution
corresponding to the initial simplex tableau, the basic feasible solutions corresponding to the intermediate
tableaus (NOT the intermediate tableaus themselves), the final tableau, and the solution corresponding to the
final tableau. For each solution corresponding to a tableau, indicate explicitly which variables are basic and
which are non-basic. Your hand-in should fit on one page whether or not your supporting calculations do.]