Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home Academic Courses Course Profile

COMP- 566: DISCRETE OPTIMIZATION 1

Course Summary

Use of computers in solving problems in discrete optimization. Linear programming and extensions. Network simplex method. Applications of linear programming. Vertex enumeration. Geometry of linear programming. Implementation issues and robustness. Students will give a presentation on an application of their choice.


McGill Course Description (Click Here)