Studying at the University of Verona

Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.

This information is intended exclusively for students already enrolled in this course.
If you are a new student interested in enrolling, you can find information about the course of study on the course page:

Laurea in Matematica applicata - Enrollment from 2025/2026

The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.

2° Year  activated in the A.Y. 2012/2013

ModulesCreditsTAFSSD
6
A
MAT/02
6
B
MAT/03
6
B
MAT/06
Uno tra i seguenti due insegnamenti
6
C
SECS-P/01
6
C
FIS/01
Uno tra i seguenti due insegnamenti
6
C
SECS-P/01

3° Year  activated in the A.Y. 2013/2014

ModulesCreditsTAFSSD
6
C
MAT/06 ,SECS-P/05
Uno da 12 cfu o due da 6 cfu tra i seguenti tre insegnamenti
Prova finale
6
E
-
activated in the A.Y. 2012/2013
ModulesCreditsTAFSSD
6
A
MAT/02
6
B
MAT/03
6
B
MAT/06
Uno tra i seguenti due insegnamenti
6
C
SECS-P/01
6
C
FIS/01
Uno tra i seguenti due insegnamenti
6
C
SECS-P/01
activated in the A.Y. 2013/2014
ModulesCreditsTAFSSD
6
C
MAT/06 ,SECS-P/05
Uno da 12 cfu o due da 6 cfu tra i seguenti tre insegnamenti
Prova finale
6
E
-
Modules Credits TAF SSD
Between the years: 1°- 2°- 3°
Ulteriori conoscenze
6
F
-
Between the years: 1°- 2°- 3°

Legend | Type of training activity (TTA)

TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S00001

Teacher

Romeo Rizzi

Coordinator

Romeo Rizzi

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

MAT/09 - OPERATIONS RESEARCH

Period

II semestre dal Mar 3, 2014 al Jun 13, 2014.

Learning outcomes

This course aims to introduce the student to some basic problems in the optimization field, with a particular attention to dynamic programming, combinatorial optimization, graphs, linear programming. Complexity theory is introduced and used as a tool and the role of integer linear programming within the OR community is illustrated.

Program

Basic notions: convex sets, polyhedra and cones; convex functions and convex programming.
Linear programming: mathematical formulation of linear programming problems; equivalent forms, standard form; mathematical structure, geometry of linear programming, properties.
The simplex algorithm: vertices and basic solutions; optimality conditions; tableau method, auxiliary problem, two-phases method.
Duality theory: the fundamental duality theorem of linear programming, the dual simplex algorithm; economic interpretation; sensitivity analysis.
Integer linear programming: the cutting plane method; the branch and bound.
Network optimization: the minimum spanning tree problem, the shortest path problem, the maximum flow problem.

A more detailed program as intended, the day-by-day program of the last edition of the course, and the ongoing program of the current edition are available at the web-page of the course:

http://profs.sci.univr.it/~rrizzi/classes/RO/index.html

Examination Methods

Written final examination.

Past exams with answers can be found at the web-page of the course:
http://profs.sci.univr.it/~rrizzi/classes/RO/index.html

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE