Linear Optimization (ADM II)Module description #20090 / Version 1
- 10 CP
- Oral exam
- Graded
- Summer semester
- German
| Module / Version | #20090 / #1 |
|---|---|
| Validity | Since SS 2014 |
| Available language(s) | English, German |
| Credit points | 10 |
| Person responsible for the module | Nabben, Reinhard |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät II |
|---|---|
| Institute | Not specified |
| Academic chair | Not specified |
Contact
| Office | Not specified |
|---|---|
| Contact person | Not specified |
| E-mail address | reinhard.nabben@tu-berlin.de |
| Website | Not specified |
Learning outcomes
This course aims to teach the algorithmic and structural fundamentals of linear and linear-integer optimization problems. This includes, in particular, the Simplex method, its
algebraic and geometric interpretation, and the theory and practice of solving integer optimization
problems
Subject-specific competence: 55% Methodological competence: 30% System competence: 10% Social competence: 5%
algebraic and geometric interpretation, and the theory and practice of solving integer optimization
problems
Subject-specific competence: 55% Methodological competence: 30% System competence: 10% Social competence: 5%
Content
Linear Programs: Structure, Modeling, Transformation to Standard Form, Bases, Primal and Dual
Feasibility of the Simplex Method, Basic Version/Tableaux, and Revised Simplex Algorithm
Pivoting rules, exponential examples, polyhedron theory, geometric interpretation of the Simplex method, duality theory, complementary slack, primal-dual algorithms with applications to graphs and networks
Applications: Network Problems, Planning Processes, Economic Interpretation (Shadow Prices)
Polynomial Methods: Ellipsoid Method, Interior-Point Methods
Integer Linear Optimization: Branch and Bound, Lagrange Relaxation, Cutting-Plane Method
Feasibility of the Simplex Method, Basic Version/Tableaux, and Revised Simplex Algorithm
Pivoting rules, exponential examples, polyhedron theory, geometric interpretation of the Simplex method, duality theory, complementary slack, primal-dual algorithms with applications to graphs and networks
Applications: Network Problems, Planning Processes, Economic Interpretation (Shadow Prices)
Polynomial Methods: Ellipsoid Method, Interior-Point Methods
Integer Linear Optimization: Branch and Bound, Lagrange Relaxation, Cutting-Plane Method
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Diskrete Optimierung (ADM II) (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 4 h | 60 h |
| Preparation and follow-up review | 15 | 4 h | 60 h |
| 120 h | |||
Diskrete Optimierung (ADM II) (Tutorial)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Preparation and follow-up review | 15 | 2 h | 30 h |
| 60 h | |||
Diskrete Optimierung (ADM II) (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Preparation and follow-up review | 15 | 2 h | 30 h |
| 60 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Exam Preparation | 1 | 60 h | 60 h |
| 60 h | |||
The workload of the module adds up to 300 hours. The module therefore comprises 10 credit points.
Description of teaching and learning methods
Lectures, exercises, programming exercises, small-group exercises
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Calculus, linear algebra, knowledge of a high-level programming language
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | German |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Will be announced in class.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
No recommended literature given
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computer Science Computer Science (B. Sc.) - StuPO 2025 | WS 2026/27 | Wahlpflichtbereich › Informatiknahe Bereiche › Informatiknahe Mathematik |
Miscellaneous
[Contains machine generated translations 2026-07-07 11:17, only the German version is legally binding]