WEBVTT 99:59:59.999 --> 99:59:59.999 hello, I'm Fritz Eisenbrand 99:59:59.999 --> 99:59:59.999 Professor of Mathematics at EPFL 99:59:59.999 --> 99:59:59.999 and the instructor of this course on 99:59:59.999 --> 99:59:59.999 linear and discrete optimisation 99:59:59.999 --> 99:59:59.999 Linear optimisation is a fundamental part of computational mathematics 99:59:59.999 --> 99:59:59.999 and here you will learn the basics of this field 99:59:59.999 --> 99:59:59.999 in the first half of this course we will focus on linear programming, the simplex method and duality 99:59:59.999 --> 99:59:59.999 in the second half of the course we will cover discrete optimisation problems 99:59:59.999 --> 99:59:59.999 like matchings, flows and integer programming problems 99:59:59.999 --> 99:59:59.999 the material that we cover here constitutes about half of the material that I teach to 99:59:59.999 --> 99:59:59.999 second year bachelor students of Mathematics and Computer Science here at EPFL 99:59:59.999 --> 99:59:59.999 we will guide you through this material with video lectures 99:59:59.999 --> 99:59:59.999 punctuated (in video??) quizes, weekly assignments 99:59:59.999 --> 99:59:59.999 and occasionally programming exercises 99:59:59.999 --> 99:59:59.999 the most important prerequisites for this course are linear algebra 99:59:59.999 --> 99:59:59.999 and some proficiency in a programming language like Python 99:59:59.999 --> 99:59:59.999 we will understand the basics of linear and discrete optimisation 99:59:59.999 --> 99:59:59.999 from the viewpoint of a mathematician or a theoretical computer scientist 99:59:59.999 --> 99:59:59.999 this means that we ask questions like how we are (sic.) prove optimality of a solution? 99:59:59.999 --> 99:59:59.999 how do I prove that a method works correctly? 99:59:59.999 --> 99:59:59.999 and if yes, in what time? 99:59:59.999 --> 99:59:59.999 and of course we prove theroems 99:59:59.999 --> 99:59:59.999 so I'll hope you join us for this introduction to linear and discrete optimisation