Introduction: Mathematical Programming, Convex Programming, Linear Programming.

Models: models of (Integer) Linear Programming.

Essentials on Linear Programming: geometry of Linear Programming (vertices and basic solutions), Simplex Method; Duality in Linear Programming: Dual Problem, fundemantal properties, economic interpretation.

Essentials on Integer Linear Programming: Unimodularity, Branch and Bound Method.

Solution of (Integer) Linear Programming via Excel Solver.

Particular Cases and Alternative Solutions:

- Minimum Cost Path Problem: Djikstra Algorithm;

- Project Planning Problem: PERT Method;

- Maximum Flow Problem: Ford and Fulkerson Algorithm, Edmonds and Karp Algorithm;

- Production Planning Problem: Wagner and Whitin Method;

- Plant Location Problem: Local Search Algorithms.