Computer Science 308-566A
Leacock 14 Tu, Th 1:05-2:25
Discrete Optimization - 1
Instructor: Prof. D. Avis
Description: 3 credits; 3 hours; Prerequisites: 308-360
(or 308-405) 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: 2002
Class Presentations: 2002
[ Academic Programs
] [ SOCS HOME ]
Send comments/questions to firstname.lastname@example.org