COMP8691
Optimisation
- Credit
- 6 units
- Catalogue year
- 2027
- Recorded offerings
- None recorded
Course information
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.
Requisite and Incompatibility
To enrol in this course you must have completed COMP6320 or COMP3620. Incompatible with COMP4690.
Learning Outcomes
Upon successful completion, students will have the knowledge and skills to:
Be able to apply Linear Programming and Mixed-Integer Programming model to solve real-world problems.
Be able to recognize and formulate convex optimization problems arising in practice.
Demonstrate an understanding of theoretical foundations of convex optimization and be able to use it to characterize optimal solutions to general problems.
Be able to define an appropriate local search neighbourhood for a given problem.
Be able to use and reflect on a variety of meta-heuristics to escape local minima in a neighbourhood.
Demonstrate an understanding and reflect on of the propagation of a global constraint in a Constraint programming system.
Saved ANU Programs & Courses information, 2027. Future offerings are indicative. Checks use the saved requirements and your fictional academic record.
Saved requirements encoded for automatic checks. See your requirement checks for what can be decided.
Course library: sources, offering dates and related entries
Read the full published course information ↗
Who reviews permission requests?
Dr Rowan Ellis is the fictional reviewer assigned to COMP8691 in this prototype. The selected course determines where a request goes.
The saved page explicitly lists no current offerings. You can still read the course information.