**This is an old revision of the document!**

# Homework Assignment #22

## Objective

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

## Exercises

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

### Question 1

LP: Exercise 7.5 in the textbook.

### Question 2

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

### Question 3

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

Back to top