Subject: Subject Sylbus: Optimization 1 - 098311

Optimization 1 - 098311
Credit
Points
3.5
 
Given In
Semester
a
 
  Lecture Exercise Laboratory Project or
Seminar		 House
Work
Weekly
Hours		 3 1     4

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: Deterministic Models in Oper.Research 094313
 
Identical Courses: Optimization 1 097311


Foundations of Convex Analysis. Convex Programming. Optimality Conditions: Duality and Sensitivity Analysis. Specific Examples: Linear Programming, Quadratic and Geometric Programming, Inequalities, Minimax Theorems and Applications to Game Theory. Elements of Nonsmooth Analysis, Subgradients and Conjugate Functions. Nonconvex Programming. Optimality Conditions. Conic Optimization.




System of hours to the semesters
Semester Previous Semester information 01/2020 2020/2021 Winter Semester

Created in 08/03/2021 Time 14:45:06