MTH5333 - Discrete optimisation

There is a more recent version of this academic item available.

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.

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, the unit will cover dynamic programming, branch-and-bound, polyhedral analysis, decomposition methods and an introduction to heuristic search for combinatorial optimisation problems.

Offerings

S1-01-CLAYTON-ON-CAMPUS

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

This unit is offered at both Level 4 and Level 5, differentiated by the level of the assessment. If you are enrolled in MTH5333 you will be expected to demonstrate a higher level of learning in this subject than those enrolled in MTH4333. The assignments and exam in this unit will use some common items from the MTH4333 assessment tasks, in combination with several higher level questions and tasks.

Assessment

1 - Continuous assessment

2 - Examination (3 hours and 10 minutes)

Scheduled and non-scheduled teaching activities

Applied sessions

Lectures

Workload requirements

Workload

Availability in areas of study

Master of Mathematics