English

The course contains solution methods for linear optimization models. Topics that are covered include the simplex method and the interior point methods for linear programming, network algorithms, duality theory and sensitivity analysis.

Upon completion of INF270, the student is supposed to be able to

• formulate a combinatorial optimization problem efficiently
• explain the mathematical theory underlying the solution methods.
• analyze the solution to a linear optimization problem

At least 60 ECTS in computer science, preferably including some mathematics

Recommended mathematics: Calculus I and II and linear algebra.

Exercises.

Compulsory assignments are valid two semesters, the semester of the approval and the following semester.

Written exam. It is opportunity for grades on exercises, which can be included in the final grade. If less than 20 students are taking the course, it can be oral exam.

Aids allowed will be announced on Mitt UiB in the beginning of each semester.