Tu, Th 1:05-2:25
Discrete Optimization - 1
McConnell 103 from September 9
Instructor: Prof. David Avis
Description: 3 credits; 3 hours; Prerequisites: 308-360
(or 308-362) and 189-223.
Use of the computer in solving deterministic problems in operations
research. Linear programming and extensions.
Network simplex method. Applications of linear programming. Geometry
of linear programming.
Students will do a project on an application of their choice.
Lecture summaries and links: 2004
Class Presentations: 2003
[ SOCS HOME ]
Send comments/questions to email@example.com