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
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/2026The 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 2007/2008 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.
Operations Research (2009/2010)
Teaching code
4S00001
Teacher
Coordinator
Credits
6
Also offered in courses:
- Operations Research of the course Bachelor in Computer Science (until 2008-2009 academic year)
Language
Italian
Scientific Disciplinary Sector (SSD)
MAT/09 - OPERATIONS RESEARCH
Period
1st Semester dal Oct 1, 2009 al Jan 31, 2010.
Location
VERONA
Learning outcomes
The course aims to supply some basic notions in the field of Optimization and the related solution algorithms, with particular emphasis on linear programming, network optimization and an outline of integer and combinatorial optimization.
It includes 32 hours of class lectures (4 CFU) and 30 hours of practical exercises (2 CFU).
Program
Basic terminology and some simple models.
Linear programming and duality: standard forms and correspondence primal-dual; linear programming on cones; optimality conditions; the primal-dual simplex algorithm; basic solutions; the primal simplex algorithm; the dual simplex algorithm; problems with limited variables; some cases of post-optimization.
Network optimization: minimum cost flux; maximum flux; the shortest path problem.
Integer/combinatorial programming: cutting-plane methods; branch and bound.
Examination Methods
The final examination consists in a written test, that typically involves the solution by hand of 2/3 problems in 2/3 hours time.
An oral examination can follow, on the student's request, provided the result of the written test is not highly negative.
