- Docente: Daniele Vigo
- Credits: 8
- SSD: MATH-06/A
- Language: Italian
- Moduli: Daniele Vigo (Modulo 1) Daniele Vigo (Modulo 2)
- Teaching Mode: In-person learning (entirely or partially) (Modulo 1); In-person learning (entirely or partially) (Modulo 2)
- Campus: Bologna
- Corso: Second cycle degree programme (LM) in Computer Engineering (cod. 6719)
Learning outcomes
Upon completion of the course, students will have in-depth knowledge of mathematical models for solving optimization problems. They will also have a basic understanding of linear and mixed integer programming theory and will be familiar with the main solution methods (the simplex algorithm, cutting plane method, branch-and-bound techniques, and dynamic programming). They will also understand the principles of discrete simulation and be able to define models based on the event programming technique.
Course contents
Models of continuous, integer, and mixed linear optimization problems.
Algorithms for continuous linear optimization (Simplex Algorithm).
Duality Theory (Dual Simplex Algorithm).
Algorithms for integer linear programming (Cutting Plane, Branch-and-Bound and Dynamic Programming Algorithms)
Outlines on the use of solvers for continuous and integer linear programming.
Module 2 will present the main techniques for heuristically solving integer linear optimization problems.
Teaching methods
Lezioni frontali ed esercitazioni in aula
Assessment methods
Prova Scritta e Prova Orale
Teaching tools
Dispense e slide a cura del docente
Office hours
See the website of Daniele Vigo