Useful links:

• Progams and Courses page: COMP4691, COMP8691.
• Course website, where materials such as lecture slides can be found.

Overview

This course provides foundations and plenty of exercises in practical optimisation problems, while covering all basic elements of optimisation including forms of constraint programming as well as variations on linear programming and convex optimisation.

Learning Outcomes:

1. Be able to apply Linear Programming and Mixed-Integer Programming model to solve real-world problems.
2. Be able to recognize and formulate convex optimization problems arising in practice.
3. Demonstrate an understanding of theoretical foundations of convex optimization and be able to use it to characterize optimal solutions to general problems.
4. Be able to define an appropriate local search neighbourhood for a given problem.
5. Be able to use a variety of meta-heuristics to escape local minima in a neighbourhood.
6. Demonstrate an understanding of the propagation of a global constraint in a Constraint programming system.