Operations Research (2013/2014)

Course code
Name of lecturer
Romeo Rizzi
Romeo Rizzi
Number of ECTS credits allocated
Academic sector
Language of instruction
II semestre dal Mar 3, 2014 al Jun 13, 2014.
Web page

Lesson timetable

II semestre
Day Time Type Place Note
Monday 4:30 PM - 6:30 PM lesson Lecture Hall G  
Thursday 11:30 AM - 1:30 PM lesson Lecture Hall G  

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.


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:


Assessment methods and criteria

Written final examination.

Past exams with answers can be found at the web-page of the course: