Courses / Modules / MATH3017 Mathematical Programming

Mathematical Programming

When you'll study it: Semester 2
CATS points: 15
ECTS points: 7.5
Level: Level 6
Module lead: Selin Ahipasaoglu
Academic year: 2027-28

Module overview

- Linear programs: their basic properties; the simplex algorithm. - Duality: the relationship between a linear program and its dual, duality theorems, complementarity, and the alternative; sensitivity analysis. - The interior point method for convex optimization: optimality conditions; the central path; convergence analysis; applications to linear programming and general convex optimization. - Integer Programming: Branch and bound algorithms and/or cutting plane methods. - The use of a computer software to solve mathematical programming problems.

Linked modules

Pre-requisite: MATH2013

Learning and Teaching

Teaching and learning methods

Lectures, computer workshops, problem sheets, private study.

Study time
Type	Hours
Independent Study	98
Teaching	52
Total study time	150

Resources & Reading list

Textbooks

SJ Wright (1997). Primal-dual interior-point methods. SIAM.

HILLIER F S & LIEBERMAN G J, (2010). Introduction to Operations Research. McGraw-Hill.

R. Vandrbei (2014). Linear Programming: Foundation and Extension. Springer.

Assessment

Summative

This is how we’ll formally assess what you have learned in this module.

Breakdown
Method	Percentage contribution
Exam	80%
Coursework	20%

Referral

This is how we’ll assess you if you don’t meet the criteria to pass this module.

Breakdown
Method	Percentage contribution
Coursework	20%
Exam	80%

Repeat

An internal repeat is where you take all of your modules again, including any you passed. An external repeat is where you only re-take the modules you failed.

Breakdown
Method	Percentage contribution
Coursework	20%
Exam	80%

Repeat Information

Repeat type: Internal & External