Operations research Single channel
Chair (Coordinator) and Rapporteur: LAURA PALAGI
Lecturers
Objectives
The aim of the course is to introduce students to the knowledge of the optimization problems and of the mathematical modeling techniques of decision problems. Students are expected to acquire skills on Convex programming, Linear Programming and Integer Linear Programming models (theoretical properties and optimality conditions) and the basic elements of algorithms for their solution.
By the end of the course, students should be able to select the most suitable model for the problem at hand and identify the corresponding most suitable algorithm for the solution. They should also be able to state whether the solution provided by the chosen algorithm is certified to be the best one or if a tolerance on the improvement may exist.
- Academic year/1
- Lesson code1002027
- Year and semester3rd year - 1st semester
- Activity typeAttività formative affini ed integrative
- Academic areaAttività formative affini o integrative
- SSDMAT/09
- Mandatory presenceNo
- Languageita
- CFU6 CFU
- Total duration60 hours
- Hours distribution60 classroom hours