CODE 111883 ACADEMIC YEAR 2025/2026 CREDITS 6 cfu anno 2 INGEGNERIA INFORMATICA 8719 (L-8) - GENOVA 6 cfu anno 3 INFORMATICA 8759 (L-31) - GENOVA SCIENTIFIC DISCIPLINARY SECTOR MAT/09 LANGUAGE Italian TEACHING LOCATION GENOVA SEMESTER 2° Semester TEACHING MATERIALS AULAWEB OVERVIEW Operations Research (OR) consists in 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 the 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 Acquisire familiarità con gli elementi di base della ricerca operativa, con particolare riferimento alla programmazione lineare e alla programmazione lineare intera, apprendendo i principali algoritmi e le loro proprietà. 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. In particular, the course mainly considers optimisation problems addressed by mathematical programming techniques and problems on graphs and networks PREREQUISITES Basic knowledge of linear algebra and calculus. 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, ISBN: 0073376299 Teachers' notes and material. TEACHERS AND EXAM BOARD SILVIA VILLA Ricevimento: By appointment wich can be fixed in person or via email : silvia.villa@unige.it MASSIMO PAOLUCCI Ricevimento: Students can ask appointments directly contacting the professor by email or phone LESSONS LESSONS START According to the calendar approved by the Degree Program Board: https://corsi.unige.it/corsi/8759/studenti-orario Class schedule The timetable for this course is available here: Portale EasyAcademy EXAMS EXAM DESCRIPTION Written exam and oral exam (optional after passing the written part). The students who want to take the exam must register online and send an email to the professor. ASSESSMENT METHODS Students will be asked about theoretical concepts related to topic covered in the course. They will be asked to operations research problems using the algorithms introduced in the course and applying theoretical concepts. FURTHER INFORMATION Contact the instructors for any additional information not included in the course description.
