Subject: Subject Sylbus: Optimization 1 - 097311

Optimization 1 - 097311
Will not be given the year
Credit
Points
3.0
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
3       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 098311


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.


Created in 08/03/2021 Time 14:44:24