Salta al contenuto principale della pagina

OPERATIONS RESEARCH

CODE 66204
ACADEMIC YEAR 2021/2022
CREDITS
  • 5 cfu during the 1st year of 10378 INTERNET AND MULTIMEDIA ENGINEERING(LM-27) - GENOVA
  • SCIENTIFIC DISCIPLINARY SECTOR MAT/09
    TEACHING LOCATION
  • GENOVA
  • SEMESTER 2° Semester
    MODULES This unit is a module of:
    TEACHING MATERIALS AULAWEB

    OVERVIEW

    Operations Research (OR) consists in a set of mathematical models and methods for solving decision problems in a very 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

    The students will learn a set of models and methods of Operations Research (linear mathematical programming models; integer programming methods; graphs and network flow models).
    They will be able to solve decision problems by applying the learnt models and using appropriate solution algorithms

    AIMS AND LEARNING OUTCOMES

    The main objective is to provide students with the skills to define mathematical programming models to solve a series of decision problems by formulating them as optimization problems. Students will be able to solve continuous and mixed integer programming problems using appropriate methods and algorithms. Students will be able to solve problems using networks flow models and graphs.The presented models and algorithms are fundamental tools for optimization in telecommunication.

    TEACHING METHODS

    The course consists of classroom lectures.

    SYLLABUS/CONTENT

    • Introduction to decisional problems and models. The process of problem formulation by means of quantitative models.
    • Mathematical programming
      • Basic definitions
      • Linear programming.
        • Graphic formulation and solution of linear programs.
        • The simplex algorithm.
        • Duality theory.
        • Sensitivity analysis and economic interpretation.
        • Integer programming and combinatorial optimization.
        • Methods of cutting-planes and branch-and-bound.
    • Graph and network theory.
      • Shortest paths problems.
      • Spanning tree problems..
      • Max-flow and min cut problems. Network simplex algorithm.
      • Introduction to TSP and routing problems.
    • Basic concepts of the theory of complexity.
    • Examples of heuristic algorithms for combinatorial problems
    • Basic concepts of multi-criteria decision making

    RECOMMENDED READING/BIBLIOGRAPHY

    Frederick S Hillier, Gerald J Lieberman, Introduction to Operations Research, 9/e, McGraw-Hill Higher Education, 2010, ISBN: 0073376299

     

    TEACHERS AND EXAM BOARD

    Exam Board

    MAURO GAGGERO (President)

    MASSIMO PAOLUCCI (President)

    MARCELLO SANGUINETI

    LESSONS

    Class schedule

    All class schedules are posted on the EasyAcademy portal.

    EXAMS

    EXAM DESCRIPTION

    Written exam text and oral exam (optional after passing the written text). The students who want to take the exam must register online and send an email to the professor.

    ASSESSMENT METHODS

    The students will be asked to solve linear and integer programming problems using the learnt algorithms and applying concepts from theory. They have to be able to sove problems on graphs and networks. They have to demostrate to know the basic concepts of multi-criteria decision making.

    Exam schedule

    Date Time Location Type Notes
    14/01/2022 09:00 GENOVA Esame su appuntamento
    14/01/2022 09:00 GENOVA Scritto
    04/02/2022 09:00 GENOVA Esame su appuntamento
    07/06/2022 08:30 GENOVA Orale
    10/06/2022 09:00 GENOVA Esame su appuntamento
    23/06/2022 08:30 GENOVA Orale
    05/07/2022 09:00 GENOVA Esame su appuntamento
    06/09/2022 09:00 GENOVA Esame su appuntamento
    15/09/2022 14:15 GENOVA Orale