Rehabilitation sciences and techniquesModule Operations Research
Academic Year 2022/2023 - Teacher: GABRIELLA COLAJANNIExpected Learning Outcomes
The course aims at presenting linear programming problems in healthcare. The course provides students with the analytic tools to model and to foresee situations in which a single decision-maker must find the best choice. At the end of the course, the students will be able to formulate mathematically linear programming problems in healthcare, solve numerically the problems, and realize what the optimal choice is.
The goals of the course are:
Knowledge and understanding: to acquire base knowledge that allows students to study optimization problems and apply opportune techniques to solve the decision-making problems. The students will be able to use algorithms for linear programming problems.- Applying knowledge and understanding: to identify and model real-life decision-making problems. In addition, through real examples, the student will be able to find correct solutions for complex problems.
- Making judgments: to choose and solve autonomously complex decision-making problems and to interpret the solutions.
- Communication skills: to acquire base communication and reading skills using technical language.
- Learning skills: to provides students with theoretical and practical methodologies and skills to deal with optimization problems in healthcare; to acquire further knowledge on mathematics applied to healthcare.
Course Structure
There will be classroom lessons and exercises.
Should teaching be carried out in mixed mode or remotely, it may be necessary to introduce changes with respect to previous statements, in line with the programme planned and outlined in the syllabus.
Learning assessment may also be carried out on line, should the conditions require it.
Required Prerequisites
Mathematics
Attendance of Lessons
Mandatory
Detailed Course Content
- LINEAR PROGRAMMING
- Linear programming models. Graphical method. Primal simplex method.
- INTEGER PROGRAMMING
- Interger programming models. Branch and Bound method in integer programming, Knapsack problem.
- EXCEL FOR LINEAR PROGRAMMING PROBLEMS
- APPLICATIONS TO HEALTHCARE
Textbook Information
- R. Tadei, F. Della Croce, “Elementi di Ricerca Operativa”, Società Editrice Esculapio, 2005;
- R. Tadei, F. Della Croce, A. Grosso, “Fondamenti di Ottimizzazione”, Società Editrice Esculapio, 2005;
- F. Hillier, G.J. Liebermann, “Ricerca Operativa”, McGraw-Hill, 2006
- F. Fumero, Metodi di ottimizzazione. Esercizi ed applicazioni, Società Editrice Esculapio, 2013
- F.S. Hillier, G.J. Lieberman, Introduction to Operations Research, Mc Graw Hill.
Course Planning
| Subjects | Text References | |
|---|---|---|
| 1 | Linear Programming | 1,3,4,5 |
| 2 | graphic method | 1,3,4,5 |
| 3 | Simplex Algorithm | 1,3,4,5 |
| 4 | Integer Linear Programming | 2,3,4,5 |
| 5 | Branch and Bound method | 2,3,4,5 |
| 6 | Knapsack Problem | 2,3,4,5 |