Overview

This unit provides an introduction to optimisation over discrete domains using integer programming and combinatorial methods. Discrete optimisation is frequently used to model decision problems in business and industry. This unit covers some of the mathematical tools required to solve these types of problems in practice. Building on linear programming, … For more content click the Read More button below.

Rules

Enrolment Rule

Contacts

Chief Examiner(s)

Professor Andreas Ernst

Unit Coordinator(s)

Professor Andreas Ernst

Notes

This unit is offered in alternate years commencing Semester 1, 2021

Learning outcomes

On successful completion of this unit, you should be able to:
1.

Develop specialised mathematical knowledge in discrete optimisation.

2.

Understand the profound connections between discrete optimisation, continuous optimisation and combinatorics.

3.

Apply sophisticated combinatorial optimisation and integer programming methods to a variety of practical optimisation problems.

4.

Translate practical problem descriptions into mathematical formulations as discrete optimisation problems and communicate the results to non-technical audiences.

5.

Apply critical thinking in the field of operations research.

Assessment summary

Examination (3 hours and 10 minutes): 60% (Hurdle)

Continuous assessment: 40%

Hurdle requirement: If you would otherwise have passed the unit but who do not achieve at least 45% of the marks available for the end-of-semester examination will receive a Hurdle Fail (NH) grade and a mark of 45 on your transcript.

Workload requirements

Workload

Availability in areas of study

Master of Mathematics