Solve the following problem using the simplex algorithm. Be sure to state clearly your optimal solution and it's objective value. For full credit write out each canonical form; identify the basic feasible solution you are considering at each iteration; comput it's objective value; and show your ration test.
Maximize:
x1+9x2+x3
Subject to:
x1 + 2x2 + 3x3 <= 9
3x1 + 2x2 + 2x3 <=15
x1,x2,x3, >= 0