Program Overview

---

OPERATIONS RESEARCH

Overview

Operations Research (OR) consists of a set of mathematical models and methods for solving decision problems in a wide number of application sectors. The purpose of this course is to provide students with competences in using a set of models for problem solving. In particular, the course mainly considers optimization problems faced by mathematical programming techniques and problems on graph and networks.

Aims and Content

Learning Outcomes

The course aims to provide students with the skills to model decision-making problems by means of optimisation methods and to use appropriate algorithms for their solution. The learning outcomes include acquiring familiarity with the basic elements of Operations Research, with particular reference to linear programming and integer linear programming, and learning the main algorithms and their properties.

Aims and Learning Outcomes

The course presents a set of mathematical models and methods from Operations Research for solving decision-making problems. The aim of the course is thus to provide students with the skills to model decision-making problems by means of optimisation methods and to use appropriate algorithms for their solution.

Prerequisites

Basic knowledge of linear algebra and calculus is required.

Teaching Methods

Lectures in class using blackboard or slides.

Syllabus/Content

• Introduction to problems and decision-making models
• The process of formulating problems using quantitative models
• Linear mathematical programming
• Graphical formulation and solution of linear programs
• The simplex algorithm
• Sensitivity analysis and its economic interpretation
• Non-linear mathematical programming
• Convex programming
• Descent methods
• Unconstrained non-linear programming
• Integer programming and combinatorial optimisation
• Example formulations and solving methods (branch and bound)
• Graph theory: shortest path problems, minimum spanning tree
• Network flow models
• Examples of the use of a mathematical formulation language and a solver for mixed integer problems (OPL-Cplex)

Recommended Reading/Bibliography

• Frederick S Hillier, Gerald J Lieberman, Introduction to Operations Research, 9/e, McGraw-Hill Higher Education, 2010
• Teachers' notes and material

Teachers and Exam Board

• SILVIA VILLA
• MASSIMO PAOLUCCI

Exam Board

• SILVIA VILLA (President)
• CESARE MOLINARI
• MASSIMO PAOLUCCI (President Substitute)

Lessons

Lessons Start

According to the calendar approved by the Degree Program Board.

Class Schedule

The timetable for this course is available.

Exams

Exam Description

Written exam and oral exam (optional after passing the written part).

Assessment Methods

Students will be asked about theoretical concepts related to topics covered in the course. They will be asked to solve operations research problems using the algorithms introduced in the course and applying theoretical concepts.

Exam Schedule

• 15/01/2026, 09:00, GENOVA, Scritto
• 02/02/2026, 09:00, GENOVA, Scritto
• 08/06/2026, 16:00, GENOVA, Scritto
• 29/06/2026, 15:00, GENOVA, Scritto
• 15/09/2026, 09:30, GENOVA, Scritto

Further Information

For further information, please refer to the course's module or contact the instructor.