Matehmatical Programming
Cod: 22098
Department: DCET
Scientific area: Mathematics
Total working hours: 130
Total contact time: 20

The goal of Mathematical Programming is to provide to the students a solid background on fundamental topics of optimization and the programmatic approaches used to solve them.

Linear and non-linear programming
Graphs and networks
Concrete problem-solving

  1. Solve problems of linear, integer and non-linear programming.
  2. Equate suitable concrete optimization problems as mathematical programming problems.
  3. Understand and manipulate graphs.
  4. Solve graph and network problems with classical algorithms.
  5. Being able to assess the applicability of the studied methodologies to concrete problems on the fields of healthcare and biometry.


Linear programing and the simplex method. Methods of integer and non-linear programming and optimization of multivariate functions. Use of software solvers. Graphs and networks. Shortest path and minimum spanning tree problems. Flows on graphs, maximum flow and minimum cut theorems. Applications to concrete problems, with an emphasis on healthcare and biometry.

  1. Introduction to Operations Research, F.S. Hillier & G.J. Lieberman (10th ed). McGraw-Hill, 2015.
  2. Aplicações da Teoria de Sistemas, J.M. Coutinho Rodrigues (6th ed). Ediliber, no year. [In Portuguese.]


Evaluation is made on individual basis and it involves the coexistence of two modes: continuous assessment (60%) and final evaluation (40%). Further information is detailed in the Learning Agreement of the course unit.