Mathematical Sciences

Lund University

Linear and Combinatorial Optimization

Official Course Description

Description

In technology, science and economy linear and combinatorial optimisations problems appear more and more often. The most well known example is linear programming, where the so called simplex method has been of utmost importance in industry since it was invented in the middle of the 20th century. Other important problems, e.g. for effective data processing, contain discrete variables, for example integers. In connection with this, combinatorial methods have grown in importance. The aim of the course is to make the students aware of problems in linear and combinatorial optimisation which are important in the applications, and to give them knowledge about mathematical methods for their solution. The aim is also to make the students develop their ability in problem solving, with and without the use of a computer.

Finished Sessions

Examination


Previous exams

2016-03-07 Exam
2015-03-09 Exam
2005-03-11 Exam
2004-03-12 Exam
2003-03-13 Exam

Course Information

LTH Code:FMA240
PHD Code: FMA240F
Credits:6
Level:Upper Basic Level
Language:English

Prerequisites

Following courses

CEQ

CEQ - Linear and Combinatorial Optimization