Dr Giacomo Zambelli NAB 3.36

This course is available on the MSc in Applicable Mathematics, MSc in Management, MSc in Management (CEMS MIM), MSc in Management (MiM Exchange), MSc in Management Science (Operational Research), MSc in Statistics, MSc in Statistics (Financial Statistics), MSc in Statistics (Financial Statistics) (Research) and MSc in Statistics (Research). This course is available as an outside option to students on other programmes where regulations permit.

Students must have sufficient knowledge of linear algebra (linear independence, determinants, matrix inversion and manipulation) and of basic multivariate calculus (derivatives and gradients).

Introduction to theory and the solution of linear and nonlinear programming problems: including linear programming, duality, the simplex method, lagrangian duality, convex programming and KKT conditions, algorithms for linear and convex optimisation problems, theory of good formulations for integer linear programming models, integer linear programming methods (branch and bound and cutting cutting planes).

20 hours of lectures and 15 hours of seminars in the LT.

A reading week will take place in W6. There will be no teaching during this week.

Extensive lecture notes covering all parts of the course will be provided. Students interested in further readings can look at the books below:

• D Bertsimas and J N Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997.
• S Boyd and L Vandenberghe, Convex Optimization, Cambridge University Press, 2004.
• M Conforti, G Cornuejols, G Zambelli, Integer Programming, Springer, 2014.

Exam (100%, duration: 3 hours) in the main exam period.