Faculty: ENGINEERING
First level degree Name: MANAGEMENT ENGINEERING
First level degree Internet Address: www.ingegneria.unical.it/cdl/ges
Course Title: OPERATIONS RESEARCH 1
GISS Codex: 27000130
Sharing: None
Composition in modules: NONE
Scientific Discipline Sector: MAT/09
Professor/Research in charge: PROF. LUCIO GRANDINETTI
Teaching Position
FULL PROFESSOR
ECTS: 9
Lectures Hours: 60
Teaching Hours: N° 85
Exercises Hours: 20
Laboratory Hours: 5
Self study hours: N° 140
Tipology: Base Activities
Teaching Language: Italian
Collocazione: 2th Year, 2th Semester
Prerequirement: LINEAR ALGEBRA AND GEOMETRY
Objectives of the course:
Operations Research is a branch of mathematics used to provide a scientific base to formulate and solve decisional
problems. The aim is to avoid the dangers from taking decisions merely by guessing or by using thumb rules.
This course is aimed at providing students with a knowledge of the fundamental principles of the Operations Research.
Particular attention will be focused on the Linear Programming and the Integer Programming.
At the end of the course the students are expected to be able to formulate practical problems into Operations Research
models and to determine the optimal solution of the developed models .
Lecture contents:
Introduction to Linear Programming
 Prototype Example
 The Linear Programming Model
 Assumptions of Linear Programming
 Additional Examples
 Some Case Studies
 Displaying and Solving Linear Programming Models on a Spreadsheet
 Formulating Very Large Linear Programming Models
Solving Linear Programming Problems: The Simplex Method
 The Essence of the Simplex Method
 Setting Up the Simplex Method
 The Algebra of the Simplex Method
 The Simplex Method in Tabular Form
 Tie Breaking in the Simplex Method
 Adapting to Other Model Forms
 Post-optimality Analysis
 The Interior-Point Approach to Solving Linear Programming Problems
 The Revised Simplex Method
Duality Theory and Sensitivity Analysis
 The Essence of Duality Theory
 Economic Interpretation of Duality
 Primal-Dual Relationships
 The Dual Simplex Method
 The Role of Duality Theory in Sensitivity Analysis
 The Essence of Sensitivity Analysis
 Applying Sensitivity Analysis
Integer Programming








Prototype Example
Some Binary Integer Programming Applications
Innovative Uses of Binary Variables in Model Formulation
Some Formulation Examples
Some Perspectives on Solving Integer Programming Problems
The Branch-and-Bound Technique and Its Application to Binary Integer Programming
A Branch-and-Bound Algorithm for Mixed Integer Programming
Other Developments in Solving Integer Problems
1
Exercises contents:
 The Simplex method to solve Linear Programming problems
 Application of the Duality theory to solve Linear Programming problems.
 Integer Linear Programming problem solving.
Laboratory contents: ******
Attendance in class: Required
Teaching performance: in the lecture hall or in the PC-laboratory, with the support of traditional methods and a projector
connected to computer; in laboratory, by using modeling software for case studies analyses.
Evaluation Assessement: Written and oral exam
Bibliografy and Recommended reading:
- F. Hillier, G. Lieberman, Ricerca Operativa, Nona Edizione, McGraw-Hill, 2010.
- Handouts prepared by professor.
Time table and Lesson Rooms:
www.ingegneria.unical.it/cdl/ges
Exams calendar:
2