After successful completion of the course, students are able to create optimization models, to formulate necessary and sufficient optimality conditions, to understand and develop numerical algorithms for mathematical programming problems.
Mathematical programming, Karush-Kuhn-Tucker theorem, regularity, duality, sensitivity, simplex method, method of the admissible directions, conjugate gradient ethod
