OVERVIEW

The Course introduces to optimization models and methods for the solution of decision problems. It is structured according to the basic topics of problem modelling, its tractability, and its solution by means of algorithms that can be implemented on computers.  Case studies from IT are presented and investigated.

AIMS AND CONTENT

LEARNING OUTCOMES

The Course introduces optimization models and methods that can be used to solve decision-making problems. It is part of the fundamental themes of problem modeling, study of computational handling, and resolution through algorithms that can be implemented on a computer. Various application contexts are considered, and some "case studies" in the IT field are discussed in detail. The aim of the course is to acquire the skills to deal with application problems by developing models and methods that work efficiently in the presence of limited resources. Students will be taught to: interpret and shape a decision-making process in terms of an optimization problem, identifying decision-making variables, the cost function to minimize (or the merit digit to maximize) and constraints; Framing the problem in the range of problems considered "canonical" (linear / nonlinear, discrete / continuous, deterministic / stochastic, static / dynamic, etc.); Realizing the "matching" between the solving algorithm (to choose from existing or designing) and an appropriate processing software support.

AIMS AND LEARNING OUTCOMES

The students will be taught to:

- interpret and shape a decision-making process in terms of an optimization problem, identifying the decision-making variables, the cost function to minimize (or the figure of merit to maximize), and the constraints;

- framing the problem in the range of problems considered "canonical" (linear / nonlinear, discrete / continuous, deterministic / stochastic, static / dynamic, etc.);

- realizing the "matching" between the solving algorithm (to choose from existing or to be designed) and an appropriate processing software support.

The students will be taught to:

- interpret and shape a decision-making process in terms of an optimization problem, identifying decision-making variables, the cost function to minimize (or the merit digit to maximize) and constraints;

- framing the problem in the range of problems considered "canonical" (linear / nonlinear, discrete / continuous, deterministic / stochastic, static / dynamic, etc.);

- realizing the "matching" between the solving algorithm (to choose from existing or designing) and an appropriate processing software support.

TEACHING METHODS

Lectures and exercises

SYLLABUS/CONTENT

INTRODUCTION TO OPERATIONS RESEARCH AND MANAGEMENT SCIENCE

LINEAR PROGRAMMING

DUALITY

INTEGER PROGRAMMING

GRAPH AND NETWORK OPTIMIZATION

CASE STUDIES FROM ICT

COMPLEXITY THEORY

DYNAMIC PROGRAMMING

NONLINEAR PROGRAMMING

RECOMMENDED READING/BIBLIOGRAPHY

Lecture notes provided by the teacher

TEACHERS AND EXAM BOARD

Exam Board

MARCELLO SANGUINETI (President)

FEDERICA BRIATA

MAURO GAGGERO

DANILO MACCIO'

LESSONS

LESSONS START

September 18, 2017

Class schedule

The timetable for this course is available here: Portale EasyAcademy

EXAMS

EXAM DESCRIPTION

Written

Exam schedule