Subject: Subject Sylbus: Optimization 1 - 098311 (Current)

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.


Timetable to semester 01/2020 2020/2021 Winter Semester
Room Building Hour day Lecturer Exercise
Lecture
no. Registering
Group
526 בלומפילד 12:30-15:30 Thursday Doctor Shtern Shimrit Lecture 10 11
526 בלומפילד 15:30-16:30 Thursday Mr. Gur Eyal Exercise 11

Created in 31/10/2020 Time 17:19:41