CS 795Fundamentals of Optimization
- Units
- 0.50
- Level
- Graduate
- Faculty
- Mathematics
- Subject
- Computer Science
CS 795 as listed in the Spring 2025 Graduate Calendar. The main page has the current version, when it runs, and seats.
Linear optimization: Farkas' Lemma, duality, Simplex method, geometry of polyhedra. Combinatorial optimization: integrality of polyhedra, total unimodularity, flow problems, weighted bipartite matching. Continuous optimization: convex sets, Separation Theorem, convex functions, analytic characterizations of convexity, Karush-Kuhn-Tucker Theorem.
Prerequisites
None listed.
Antirequisites
None listed.
Leads to
No course lists it as a requisite.
Check it elsewhere for Spring 2025
- Graduate Calendar, Spring 2025The archived entry
- Requirements for Spring 2025Waterloo’s requisite checker
- Course outlinesSyllabi from past terms (UW login)
- UW FlowStudent ratings and reviews
- WClassesPast sections back to 2004, and who taught them