Operations Research (2012/2013)

Course code
4S00001
Name of lecturer
Romeo Rizzi
Coordinator
Romeo Rizzi
Number of ECTS credits allocated
6
Academic sector
MAT/09 - OPERATIONS RESEARCH
Language of instruction
Italian
Period
II semestre dal Mar 4, 2013 al Jun 14, 2013.
Web page
http://profs.sci.univr.it/~rrizzi/classes/RO/index.html

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.

Syllabus

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.

Assessment methods and criteria

Written final examination.