| Course title | Optimization |
|---|---|
| Course code | KI/EOPT |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Summer |
| Number of ECTS credits | 7 |
| Language of instruction | English |
| Status of course | unspecified |
| Form of instruction | Face-to-face |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Course availability | The course is available to visiting students |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Mathematical properties of linear programming 2. Graphical solution of linear optimization problems 3. Primal simplex method 4. The duality theory in linear programming, the dual simplex method 5. The transportation problem, the assignment problem 6. Sensitivity analysis of LP 7. Integer programming (Gomory's cutting plane method, branch and bounds method) 8. Dynamic programming and application 9. Minimization in 1D (quadratic interpolation method, golden cut method, Fibonacci numbers method) 10. Nonlinear optimization problems without restrictions 11. Least squares method 12. Nonlinear optimization problems with restrictions
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
| Prerequisites |
|
unspecified
|
| Assessment methods and criteria |
|
unspecified
Basics from linear algebra and analysis (differential calculus). |
| Recommended literature |
|
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|