Homework Assignment #22

To apply the simplex method using the geometric approach and the algebraic approach to solving linear programming problems. Also, to review recurrence relations.

Show all work. i.e., justify your answers.

LP: Exercise 7.5 in the textbook.

Now solve Question (1) using the algebraic version of the simplex algorithm. (You should get the same answer for questions (1) and (2).)

Divide and Conquer: Solve the recurrence relation: $T(n) = 7 T(\frac{n}{3}) + n$. Use the theorems for solving recurrence relations and NOT the Master Theorem. You may check your result with the Master Theorem.