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: $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.

cs-312/hw22.txt · Last modified: 2014/12/31 23:28 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0