McConnell 103 Tu,
Discrete Optimization - 1
No class Thursday September 1
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
Students will do a project on an application of their choice.
summaries and links: 2005 2004
Presentations: 2005 2004 2003 2002 2001
[ SOCS HOME ]
Send comments/questions to email@example.com
August 26, 2005