← Back to catalog

MATH2320: Mathematical Programming and Optimisation

Formulating real decisions — scheduling, allocation, routing — as optimisation problems, then solving them with the standard methods and knowing why a solver's answer changed. Numerical assignments are marked on the formulation, not the solver output.

Learning objectives

By the end of this course, students will be able to:

• Formulate a real decision problem as a linear or integer program
• Solve small optimisation problems by hand and larger ones with a solver
• Explain why a solver's optimal solution changed after a small input change
• Recognise when integer constraints are necessary versus a relaxation would do

Assessment

• Formulation exercises25%Weekly exercises translating word problems into linear/integer programs.
• Assignment — solver project30%A scheduling or routing problem, formulated, solved with a solver, and written up.
• Final exam45%Closed-book exam covering formulation and solution methods.

The solver project is submitted as a written report; the exam is in-person and closed-book.

Timetable

Lecture: Thu 9am–10am, Haydon-Allen G45

2 tutorial option(s) — pick one on the timetable page after enrolling.

• Tutorial A: Tue 3pm–4pm, Haydon-Allen 103
• Tutorial B: Fri 2pm–3pm, Haydon-Allen 103

4/4 courses added.