MAT-INF9110 – Mathematical Optimization
Course description
Course content
The course treats selected topics in convexity, optimization and matrix theory. Possible topics include: combinatorial optimization, combinatorial matrix theory, convex analysis, and convex optimization. Usually the version with combinatorial optimization and matrix theory, convexity and polyhedral theory, and also an introduction to polyhedral combinatorics.
Learning outcome
The goal of this course is for students to:
- have knowledge of basic convex analysis and combinatorial optimization
- understand the basic theory of polyhedra and polytopes
- know basic theory combinatorial matrix theory and network flows
- be able to develop algorithms, exact and approximate for some types of combinatorial optimization
In addition, each PhD student will be given an extended curriculum within the field/research area of the course. The syllabus must be approved by the lecturer so that the student can be admitted to the final exam.
Admission
PhD candidates from the University of Oslo should apply for classes and register for examinations through Studentweb.
If a course has limited intake capacity, priority will be given to PhD candidates who follow an individual education plan where this particular course is included. Some national researchers’ schools may have specific rules for ranking applicants for courses with limited intake capacity.
PhD candidates who have been admitted to another higher education institution must apply for a position as a visiting student within a given deadline.
Prerequisites
Recommended previous knowledge
MAT2400 – Real Analysis, MAT-INF1100 – Modelling and Computations (discontinued), MAT-INF3100 – Linear Optimization (continued).
Overlapping courses
- 10 credits overlap with MAT-INF4110 – Mathematical Optimization (discontinued)
- 10 credits overlap with INF-MAT5360 – Mathematical optimization (discontinued)
- 10 credits overlap with INF-MAT9360 – Mathematical Optimization (discontinued)
The information about overlaps is not complete. Contact the Department for more informat