Linear Programming
Office hours
Tuesday, 31/03/09, 16-18,
Sunday, 5/04/09, 14-16
Room -125, bld. 58
Syllabus
Literature
Convex sets
Duality
Basic solutions
The Simplex Method 1
The Simplex Method 2
Karmarkar's algorithm
Assignment 1
Assignment 2
Solutions
Exam examples
1. 2. 3.
There are 2 assignments in the course with 20% of the final grade.