1. Linear programming
2. Queueing theory
3. Projects Management
4. Simulation

Upon completion of this course it is intended that the student is able to:
• Recognize the utility linear optimization, queuing theory, project management and simulation;
• Apply the main linear optimization techniques, queuing theory and project management and simulation;
• solve specific practical problems in the context of operational research.
 

1 Introduction to Operations Research
2 Linear Programming. Introduction to linear programming, graphical method, the simplex method, duality theory.
3 Queueing theory. Introduction to queueing theory, queuing systems.
4 Project Management. Introduction to project management, critical path method, resource management.
5 Simulation

Mandatory:

• Araújo da Costa, Ruy (2002), Investigação Operacional, Universidade Aberta, Lisboa (http://hdl.handle.net/10400.2/16904)

Complementary:

• Hillier, F. S., Liberman, G. J. (2005). Introduction to Operations Research, 8ª edição, McGraw-Hill.

·         Taha, H. A. Operations Research: An Introduction, (6th edition), Macmillan & Collier, New York, 1997.

E-learning.

Continuous assessment is privileged: 2 digital written documents (e-folios) during the semester (40%) and a final digital test, Global e-folio (e-folio G) at the end of the semester (60%). In due time, students can alternatively choose to perform one final exam (100%).

Pre-requisites: not applicable