|
Lecturer(s)
|
-
Barilla Jiří, doc. Ing. Mgr. CSc.
-
Kubera Petr, RNDr. Ph.D.
-
Sýkorová Květuše, Mgr.
|
|
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
|
This course provides an introduction to basic optimization techniques. We emphasise linear programming, including integer programming and selected methods for solving nonlinear problems. An integral part of the course is solving practical problems using appropriate software.
|
|
Prerequisites
|
Teaching in English is meant only for erasmus and foreign students. In the case of a small number of students is teaching in a form of individual consultations.
KMA/K111
|
|
Assessment methods and criteria
|
unspecified
The course is ended with credit and an oral exam.
|
|
Recommended literature
|
-
J. Rohn. Lineární algebra a optimalizace. 2004. ISBN 80-246-0932-0.
-
Jablonský J. Operační výzkum. VŠE, Praha, 1999.
-
LAGOVÁ, M. Metody operačního výzkumu I. FSE UJEP, Ústí nad Labem 1997..
-
Míka S. Matematická optimalizace. ZČU Plzeň, 1997.
|