Search    Print

Ricerca Operativa
OPERATIONS RESEARCH
Ferdinando Pezzella

Seat Ingegneria
A.A. 2015/2016
Credits 6
Hours 48
Period II
Language ENG

Prerequisites
Linear algebra, mathematical analysis

Learning outcomes
The course aims to intoduce the models of mathematical programming for decision optimization problems in business management and to provide the students with mathematical and application tools for solving linear programming problems with special reference to the computational aspects

Program
- Introduction to management decision-making problems - Formulation of optimization models in management decision-making problems - Linear programming model - Graphical resolution of linear programs - Solving systems of linear equations and review of convex analysis - The simplex method in tableau form and pivot matrix method - Revised simplex methods - Two-phase simplex method - Duality theory and its applications - Sensitivity analysis and stability analysis - Dual simplex method - Transportation problems: linear programming formulation and proprieties of the A matrix - Assignment problems : mathematical model - Application of the linear programming in production management problems - Software LINDO (Linear INteractive Discrete Optimization)

Development of the examination
LEARNING EVALUATION METHODS
The evaluation of the students’ learning level consists of: -- A written examination that requires solving a linear programming problem via several solution methods, studied during the course. Its duration is two hours. -- An oral examination that requires discussing two or more themes, analyzed during the course. Only the students who have reached a sufficient level in the written examination are allowed accessing the oral one. The students have to do the oral test in the same exam of the writing one. In the case of the oral examination is negatively evaluated, the result of the writing test will be maintained only for the next exam.

LEARNING EVALUATION CRITERIA
In order to pass the learning evaluation, the student, through both the examination tests, has to prove that he/she has understood the arguments, addressed during the course, among which: --Mathematical optimization models; --The Linear Programming model and its applications to some decisional problems; --The Linear Programming theory and the solution proprieties; --The Simplex method and its different versions; --The theorems of the Dual Theory and the Sensitivity Analysis; --Linear Programming applications to some production management problems

LEARNING MEASUREMENT CRITERIA
Both the writing and the oral examination are scored out of a maximum of thirty points (i.e., the score is between zero and thirty). The total score, for a maximum of thirty points, is the rounded up average value of the previous two scores.

FINAL MARK ALLOCATION CRITERIA
The result of the learning evaluation will be positive if the student reaches a sufficient level (equal to eighteen points) in both the two examinations (such as in both the writing and the oral test). The evaluation of thirty points is reached by proving, in both the examinations, a deep knowledge of the arguments, addressed during the course, together with the ability to efficiently solve the Linear Programming problems. The evaluation of thirty points cum laude is for students who have carried out both the examinations in a correct and complete way, showing a particular clarity during the oral discussion and in the writing test.

Recommended reading
- F. Pezzella, Elementi di Programmazione Lineare, Liguori Editore, Napoli - Photocopies of the slides of the lessons

Courses

• Ingegneria Biomedica (Corso di Laurea Triennale (DM 270/04))
• Ingegneria Informatica e dell'Automazione (Corso di Laurea Triennale (DM 270/04))