hello, I'm Fritz Eisenbrand

Professor of Mathematics at EPFL

and the instructor of this course on

linear and discrete optimisation

Linear optimisation is a fundamental part
of computational mathematics

and here you will learn the basics of this field

in the first half of this course we will focus on linear programming, the simplex method and duality

in the second half of the course we will cover discrete optimisation problems

like matchings, flows and integer programming problems

the material that we cover here constitutes about half of the material that I teach to

second year bachelor students of Mathematics and Computer Science here at EPFL

we will guide you through this material with video lectures

punctuated (in video??) quizes, weekly assignments

and occasionally programming exercises

the most important prerequisites for this course are linear algebra

and some proficiency in a programming language like Python

we will understand the basics of linear and discrete optimisation

from the viewpoint of a mathematician or a theoretical computer scientist

this means that we ask questions like
how we are (sic.) prove optimality of a solution?

how do I prove that a method works correctly?

and if yes, in what time?

and of course we prove theroems

so I'll hope you join us for this introduction to linear and discrete optimisation