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.

Study Plan

A.A. 2024/2025 A.A. 2023/2024 A.A. 2022/2023 A.A. 2021/2022 A.A. 2020/2021 A.A. 2019/2020 A.A. 2018/2019 A.A. 2017/2018 A.A. 2016/2017 A.A. 2015/2016 A.A. 2014/2015 A.A. 2013/2014 A.A. 2012/2013 A.A. 2011/2012 A.A. 2010/2011 A.A. 2009/2010

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.

The Study plan 2008/2009 will be available by May 2nd. While waiting for it to be published, consult the Study plan for the current academic year at the following link.

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.

A Basic activities
B Characterizing activities
C Related or complementary activities
D Activities to be chosen by the student
E Final examination
F Other training activities
S Placements in companies, public or private institutions and professional associations

Operations Research  (2010/2011)

Teaching code

4S00001

Teacher

Letizia Pellegrini

Coordinator

Letizia Pellegrini

Credits

6

Also offered in courses:

Language

Italian

Scientific Disciplinary Sector (SSD)

MAT/09 - OPERATIONS RESEARCH

Period

II semestre dal Mar 1, 2011 al Jun 15, 2011.

Seminars 0

Learning outcomes

This course aims to introduce the student to some basic problems in the optimization field, with a particular attention towards the linear programming and some network optimization problems. Besides, basic notions of integer and combinatorial programming will be outlined. The course also includes some hours dedicated to practical exercises, with the aim of addressing the student to the mathematical formulation of a problem and its subsequent solution.

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.

Reference texts
Author Title Publishing house Year ISBN Notes
FISCHETTI M. Lezioni di Ricerca Operativa Edizioni Libreria Progetto Padova 1999 8887331049

Examination Methods

Written final examination.

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

Teaching materials e documents