Instructor: | David P. Williamson |
---|---|
Office: | Rhodes 236 |
Office hours: | M 11-12, Thurs 1:30-2:30, and by appointment |
Office phone: | 255-4883 |
Email: | My three initials AT cs.cornell.edu |
Teaching Assistant: | Maurice Cheung |
Office: | Rhodes 291 |
Office hours: | Wednesdays 4:30-5:30, Thursdays 4:30-5 |
Email: | myc26 AT cornell.edu |
The course meets Tuesdays and Thursdays in Hollister 320 from 10:10-11:25 AM. There is a recitation section that meets Wednesdays 3:30-4:30PM in Hollister 401 Rhodes 253 Hollister 401.
This course gives a rigorous treatment of the theory and computational techniques of linear programming and its extensions, including formulation, duality theory, algorithms, sensitivity analysis, network flow problems and algorithms, theory of polyhedral convex sets, systems of linear equations and inequalities, Farkas' lemma, and exploiting special structure in the simplex method and computational implementation. Topics covered will include the ellipsoid method, interior-point methods, and computational complexity issues related to optimization problems.