Optimisation

Course aim

Introduce students to basic concepts and methodologies for solving differentiable optimisation problems and discrete optimisation problems. Provide students with tools to produce a model, analyse it mathematically, and write computer code that solves the model using standard and specialised computer software.

Course content

Preliminary concepts from linear algebra, analysis and topology. Use of appropriate software.
Selected topics from: Optimality conditions for unconstrained optimisation. Least squares problem. The gradient method. Newton's method. Convex sets, convex functions, and convex optimisation. Karush-Kuhn-Tucker conditions. Duality. Network flow problems. Integrality of polyhdedra.

Textbook(s)

Nil

Prerequisite(s)

Corequisite(s)

Nil

Teaching method

Note: These components may or may not be scheduled in every study period. Please refer to the timetable for further details.

Assessment

Continuous assessment, Problem solving exercise, Test

Fees

EFTSL*: 0.125
Commonwealth Supported program (Band 1)
To determine the fee for this course as part of a Commonwealth Supported program, go to:
How to determine your Commonwealth Supported course fee. (Opens new window)

Fee-paying program for domestic and international students
International students and students undertaking this course as part of a postgraduate fee paying program must refer to the relevant program home page to determine the cost for undertaking this course.

Non-award enrolment
Non-award tuition fees are set by the university. To determine the cost of this course, go to:
How to determine the relevant non award tuition fee. (Opens new window)

Not all courses are available on all of the above bases, and students must check to ensure that they are permitted to enrol in a particular course.

* Equivalent Full Time Study Load. Please note: all EFTSL values are published and calculated at ten decimal places. Values are displayed to three decimal places for ease of interpretation.