The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 45 student(s).
Current registration and enrollment status: enrolled: 0/45, only registered: 0/45, only registered with preference (fields directly associated with the programme): 0/45
Fields of study the course is directly associated with
This is a basic course on methods of mathematical
optimization and their practical use.
Syllabus
Unconstrained optimization: Nelder--Mead method, steepest descent,
Newton methods, conjugate gradient, trust region methods.
Least squares problem and analysis of experimental data.
Linear programming, revised Simplex method, interior point methods.
Applications of linear programming. Integer programming, branch and bound
method. Dynamic programming.