You need to activate javascript for this site.
Menu Conteúdo Rodapé
  1. Home
  2. Courses
  3. Economics
  4. Operational Research

Operational Research

Code 12107
Year 3
Semester S1
ECTS Credits 6
Workload TP(60H)
Scientific area Mathematics
Entry requirements Not applicable.
Mode of delivery theoretical and practical
Work placements not applicable
Learning outcomes This course aims to familiarize students with solving problem method used by the Operational Research and to show the most relevant of Operational Research technics used to solve problems in the fields of Economics and Management.
Provide the students with skills to:
1. Identify decision/optimization problems in a structured way;
2. Build models of optimization problems;
3. Use algorithms that produce optimal solutions for these models, such as support for informed decisions;
4. Use the information to induce and motivate organizational change.
Syllabus 1. Introduction
2. Linear Programming
2.1 The general problem of linear programming;
2.2 Graphical representation;
2.3 Standard Form of Linear Programming problem;
2.4 Fundamental concepts.
3. Linear Programming - Simplex Algorithm
3.1 Primal Simplex Algorithm;
2.3 Techniques artificial bases;
3.3 Duality;
3.4 Dual Simplex Algorithm;
3.5 Economic Interpretation.
4. Reoptimizationin in Linear Programming
4.1 Sensitivity Analysis;
4.2 Parametric Analysis.
5. Particular cases in Linear Programming
5.1 Transportation Problem;
5.2 Assignment problemProblem.
Main Bibliography 1. Bazaraa, M. S., Jarvis, J. J. e Sherali, H. D. (1990) Linear Programming and Network Flows, John Wiley & Sons, New York.
2. Ramalhete, M., Guerreiro, J. e Magalhães, A. (1985) Programação Linear, Vol. 1 e 2, McGraw-Hill, Lisboa
3. Hillier, F. e Lieberman, G. (1995) Introduction to Operations Research, McGRAW-HILL International Editions, sixth edition.
4. Tavares, L., Oliveira, R., Themido, I. e Correia, F. (1996) Investigação Operacional, McGraw-Hill





Language Portuguese. Tutorial support is available in English.
Last updated on: 2020-06-30

The cookies used in this website do not collect personal information that helps to identify you. By continuing you agree to the cookie policy.