COMP 566. Discrete Optimization 1.
Credits: 3
Offered by: Computer Science (Faculty of Science)
This course is not offered this catalogue year.
Description
Use of computer 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 do a project on an application of their choice.
- Prerequisites: COMP 360 and MATH 223
- 3 hours
- Prerequisites: COMP 360 and MATH 223