Credits: 5

Schedule: 11.09.2019 - 12.12.2019

Teaching Period (valid 01.08.2018-31.07.2020): 

I-II Autumn (2018-2019, 2019-2020)

Learning Outcomes (valid 01.08.2018-31.07.2020): 

After completing this course the student 

1. can formulate a wide variety of optimization problems, which solutions can be used for making better decisions (e.g. allocating resources, selecting routes and assigning tasks), as (mixed integer) linear programming problems, 

2. understands the theoretical foundation of the Simplex algorithm and duality, and knows the special characteristics of network and integer programming problems, and 

3. can solve (mixed integer) linear programming problems using optimization software.

Content (valid 01.08.2018-31.07.2020): 

The simplex method, dual of the linear program, introduction to integer programming. Applications to transportation problems, network problems and production planning.

Assessment Methods and Criteria (valid 01.08.2018-31.07.2020): 

Exam and assignments. Bonus points from home work.

Workload (valid 01.08.2018-31.07.2020): 

Contact hours 48 h. Attendance is not compulsory.

Assignments 20h 

Autonomous studies 60h

Study Material (valid 01.08.2018-31.07.2020): 

D. Bertsimas, J.N. Tsitsiklis: Introduction to Linear Optimization, Athena Scientific 1997

Substitutes for Courses (valid 01.08.2018-31.07.2020): 

Mat-2.3140 Linear Programming P, MS-E2140 Linear Programming

Course Homepage (valid 01.08.2018-31.07.2020):

Prerequisites (valid 01.08.2018-31.07.2020): 

MS-A00XX Matrix Algebra, MS-A01XX Differential and integral calculus 1, and MS-A02XX Differential and integral calculus 2.

Grading Scale (valid 01.08.2018-31.07.2020): 



Registration and further information