Courses Master Display 2020-2021
|Course Description||To PDF|
|Course title||Modelling and Solver Technology|
For more information: email@example.com
|Language of instruction||English|
After this course, the student is able to model (hard) optimisation problems as mathematical programs and knows several techniques to solve these problems. Moreover, the student can use general purpose software tools to solve these problems.
PLEASE NOTE THAT THE INFORMATION ABOUT THE TEACHING AND ASSESSMENT METHOD(S) USED IN THIS COURSE IS WITH RESERVATION. THE INFORMATION PROVIDED HERE IS BASED ON THE COURSE SETUP PRIOR TO THE CORONAVIRUS CRISIS. AS A CONSEQUENCE OF THE CRISIS, COURSE COORDINATORS MAY BE FORCED TO CHANGE THE TEACHING AND ASSESSMENT METHODS USED. THE MOST UP-TO-DATE INFORMATION ABOUT THE TEACHING/ASSESSMENT METHOD(S) WILL BE AVAILABLE IN THE COURSE SYLLABUS. This course is devoted to mathematical modelling of hard optimisation problems. We focus on integer programming techniques to solve these optimisation problems. During this course techniques as branch and bound, cutting panes and column generation will be discussed as well as the theory needed to understand these techniques. Furthermore, partially by using LP and ILP solvers, some of these techniques will be implemented.
Recommended background literature : L.A. Wolsey, "Integer Programming", 1998, ISBN 0-471-28366-5.
Linear programming (including the simplex method), duality, basics in integer programming, combinatorial optimisation, graph theory, C++, Java (or some other programming language). Exchange students need to have obtained a Bachelor degree and an advanced level in mathematics.
An advanced level of English
|Teaching methods||PBL / Presentation / Lecture / Assignment / Papers / Groupwork|
|Assessment methods||Attendance / Participation / Assignment / Presentation|
|Evaluation in previous academic year||For the complete evaluation of this course please click "here"|
|This course belongs to the following programmes / specialisations||