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