Optimization problem and illustrative examples, convexity, optimality conditions and duality, linear and multidimensional search methods, penalty and barrier functions, methods of feasible directions, linear complementary problems, quadratic, separable, fractional and geometric programming.
