The program is the following:

1. Operations Research Models
2. Graphical solution of MP problem in two variables
3. Convex and concave optimization
4. Unconstrained optimization: first and second order optimality conditions
5. Constrained optimization: optimality conditions  on a convex set, optimality conditions  in the case of linear constraints: the Karush-Kuhn-Tucker conditions (Alternative theorems: Farkas Lemma)
6. Linear Programming Theory: vertex and main LP theorem
7. Duality theory for LP: economic use of shadow prices
8. Integer Linear Programming: connection LP and ILP (unimodularity); Branch and Bound algorithm
9. Multiobjective optimization
For more details see the Lectures page.