
On April 16, Maxim Babenko’s (MSU) linear programming course begins at the
CS club .
As part of the course, students will become familiar with the basic concepts of linear programming, learn theorems of separability, linear duality and discuss the polynomial solvability of a linear programming problem using the ellipsoid method. From the very beginning, much attention will be paid to the connection of linear programming with the theory of integer programming, combinatorics, and optimization.
')
Free admission. You do not need to register.
Date and place of the first lecture: 04/16/2011, 17:20, POMI RAS (Fontanka, 27).
Lectorium, a true friend of the St. Petersburg CS club, organizes online broadcast of the entire course.
Link to the online broadcast.
Schedule remaining lectures.