- Docente: Daniele Vigo
- Credits: 6
- SSD: MAT/09
- Language: Italian
- Teaching Mode: Traditional lectures
- Campus: Cesena
-
Corso:
First cycle degree programme (L) in
Biomedical Engineering (cod. 9082)
Also valid for First cycle degree programme (L) in Electronics Engineering (cod. 5834)
-
from Sep 18, 2023 to Dec 11, 2023
Learning outcomes
At the end of the course the students are capable of defining mathematical models of optimization and decision problems using mathematical programming and graph theory. They will also be able to analyze the complexity of computational problems and will be able to solve also using computer solvers and interpret the solution of some classes of computational problems.
Course contents
Mathematical programming
Linear programming and simplex algorithm
Integer linear programming and branch and bound method
Duality theory (outline) and sensitivity analysis
Graph theory: shortest paths, shortest spanning trees, network flow problems.
Elements of computational complexity theory
Readings/Bibliography
Handouts by the teacher
Slides of the lessons by the teacher
M. Fischetti Lezioni di Ricerca Operativa (available on amazon)
S. Martello Ricerca Operativa, Esculapio
Teaching methods
Lectures and classroom exercises
Assessment methods
Written exam with exercises on the program carried out
Optional supplementary oral exam
Office hours
See the website of Daniele Vigo
SDGs
This teaching activity contributes to the achievement of the Sustainable Development Goals of the UN 2030 Agenda.