Optimization

Code	16681
Year	2
Semester	S2
ECTS Credits	6
Workload	TP(60H)
Scientific area	Mathematics
Entry requirements	does not apply
Learning outcomes	It is intended that students characterize, model and solve classic Linear Programming / Optimization problems and also adapt the methods addressed for these problems in the exact and/or approximate resolution of new problems. At the end of the Optimization Curricular Unit, the student must be able to: 1) Model problems in Linear Programming; 2) Use algorithms that produce optimal solutions for these models, as support for informed decisions; 3) Model problems in Networks; 4) Distinguish elementary concepts from Graph Theory 5) Apply and distinguish Network Optimization algorithms; 6) Build models of optimization problems;
Syllabus	1. Linear Programming 1.1 Introduction; 1.2 Linear Algebra, Convex Analysis and Polyhedra; 1.3 Simplex Algorithm; 1.4 Duality; 2. Network optimization 2.1 Graphs and Networks: notation and elementary concepts; 2.2 Shortest Path Problem; 2.3 Maximum Flow Problem; 2.4 Minimum Cost Flow Problem;
Main Bibliography	- Bazaraa, M., Jarvis, J., Sherali, H. (2010). Linear Programming and Network Flows. Wiley. - Wolsey, L. (1998). Integer Programming. Wiley. - Ahuja, R., Magnanti, T., Orlin, J. (1993). Network Flows: Theory, Algorithms, and Applications. Pearson.
Language	Portuguese. Tutorial support is available in English.