The student will learn how to formulating a discrete optimization model to maximize or minimize a function of many variables subject to (i) equality and inequality constraints, and (ii) integrality restrictions on some or all of the variables.
Mathematical Optimization
Learning Goals
Program in pills
Modeling techniques using integer and continuous variables. Optimality, relaxation, and bounds. Linear programming. Network flow problems. Integer Programming. Combinatorial optimization. Large-scale optimization.
Area
Mathematical and statistical modelling
Curriculum Foundations
TAF Type
Curriculum Industry
TAF Type
Curriculum Health
TAF Type
Curriculum Economy
TAF Type
SSD
ECTS
Semester
Lecturers
Lorenzo Castelli