Beskjeder
The exams have now been corrected and the results should be available very soon. There were many "standard" questions, but also some harder problems. A minor typo in the hint in 5a (right hand side b should be c) may have confused some. So we generally gave some extra points to everyone here, and rounded up in final grading. Still, the general impression is that some students do not work enough with the course, and are too focused on previous exams. For instance, very few can define "polyhedron" etc. Still, many people know the simplex theory/algorithm well. The grades were: 3 A's, 4 B's, 13 C's, 5 D's and 2 E's (none failed). Have a nice summer!
The last lecture was today, May 13. There will be a class with Nikolai on Thurday May 16 and even on Thursday May 23 (usual time/place) where you can ask questions. You may also contact us directly for questions. Good luck on the exam!
On May 6 (after the final lecture on Shortest paths) we will have a guest lecture by Solveig Bruvoll. Solveig has a PhD in applied mathematics from UiO, and is now a researcher at FFI. She works on interesting optimization problems in applications. She will give a presentation of possible projects at FFI (Master thesis and other projects). For possible Master thesis, you may contact Solveig at solveig.bruvoll@ffi.no (or see www.ffi.no).
The week after Easter: The plan is an extra lecture Wednesday April 3., 08.15-10; NOTE the time! Unfortunately, the room was occupied 10.15-12.
Compulsory project 2 is now posted: deadline April 12.
Nikolai says that in class/lab one may run OPL-CPLEX on the linux computers, so you may run "oplide" via the terminal.
Compulsory project 1 is now posted: deadline Febr. 16. Please read general information on such projects as well. In class on Thursday Nikolai will explain OPL-CPLEX with examples. Since we have a limited amount of OPL-CPLEX licences, don't wait till the last couple of days to do the project!
The weekly assignments (exercises): see Time and place, rightmost column (Class:).
VELKOMMEN til INF-MAT3370 Line?r optimering v?ren 2013! WELCOME: the lectures are in English if there are foreign exchange-students asking for it!
Here you will learn about linear optimization (also called linear programming, LP) and the simplex algorithm; this is one of the most used algorithms in the world! LP is very useful in many areas, for instance in mathematical (and computational) finance, transportation analysis/planning, scheduling etc. You will also gain insight into applications and the theory of polyhedra (geometrical objects, examples include triangles, pyramids, cubes ...). If you like linear algebra and matrices, there is a good chance that you'll like this course as well! By the way, the book we use (Vanderbei, Linear Programming) may be read for free online (see this page), or you may buy a copy at Akademika. The lectures are given by Geir Dahl [geird@math.uio.no] and responsible for the class (exercises...