Operations Research
A.Y. 2018/2019
Learning objectives
Il corso si propone di introdurre i fondamenti della programmazione matematica e le relative tecniche algoritmiche, con particolare attenzione ai modelli di programmazione lineare e lineare intera. Vengono inoltre introdotti algoritmi per la programmazione non lineare non vincolata e algoritmi di ottimizzazione su grafo.
Expected learning outcomes
Undefined
Lesson period: Second semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Milan
Responsible
Lesson period
Second semester
Course syllabus
Linear programming (LP): grafic solution and simplex algorithm. Duality theory. Sensitivity analysis. Integer LP: unimodularity, cutting planes and Branch & Bound methods. LP and integer LP example models. Modelling of graph optimization problems: minimum spanning tree and min cost path. Network flow optimization algorithms: Max Flow and Min Cost Flow problems solved with the Ford-Fulkerson method.
Professor(s)