« Reminder:Syllabus for all sect | Main | Lecture #Syllabus for all sect »
April 14, 2006
Lecture #Syllabus for all sect
Lecture #37: Linear Programming: Simplex Method
Several have requested full-page slides. They are here Lecture #37: Linear Programming: Simplex Method (FULL PAGE)
Please note that the pseudo-code and the example in these slides come right out of the Linear Programming notes distributed on the blog here: Linear Programming Notes
Posted by ringger at April 14, 2006 05:30 PM
Comments
I'd love to see Dr. Jones' entries up here as well. Is there a chance that we'll see those soon?
Posted by: drfindley ![[TypeKey Profile Page]](http://vv.cs.byu.edu/cs312/nav-commenters.gif)
at April 11, 2006 01:06 AM
I did my lectures on the chalk board for linear programming so the only notes are what's in the typed pdf.
Posted by: Mike Jones at April 13, 2006 10:48 AM
The algorithm pseudo code in Dr. Ringger's slides is illegible, and I can't find the algorithm in the text book. Where can we get the algorithm?
Posted by: Andrew Arnott at April 14, 2006 03:32 PM
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)