| OPERATIONAL RESEARCH I
(objectives)
The objective of the course is to endow the students with the key aspects of deterministic optimization, including linear programming and network optimization. Topics include basic theory, modeling, algorithms, and applications.
|
|
Code
|
20801777 |
|
Language
|
ITA |
|
Type of certificate
|
Profit certificate
|
|
Credits
|
6
|
|
Scientific Disciplinary Sector Code
|
MAT/09
|
|
Contact Hours
|
54
|
|
Type of Activity
|
Basic compulsory activities
|
Group: CANALE 1
|
Teacher
|
PACCIARELLI DARIO
(syllabus)
1. Introduction to Operations Research
Formulations, the five phases method
Elements of Linear Algebra
2. Formulation of typical optimization problems
Blending
Resource allocation
Lot sizing
Cutting stock
Assignment
Planning
3. Solution of Linear Programming problems
Geometry of LP
The simplex algorithm
The Fourier-Motzkin method
geometrical interpretation of the simplex algorithm
4. Duality theory
The dual problem
Duality theorems
Complementarity theorem
Economic interpretation of the dual problem
Sensitivity analysis
5. The simplex network algorithm
Minimum cost flow problem
Basis and spanning trees
Change of basis
Phase 1 and Phase 2
6. Network optimization
Maximum flow problem
Shortest path problem
Minimum spanning tree problem
(reference books)
Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014
|
|
Dates of beginning and end of teaching activities
|
From to |
|
Delivery mode
|
Traditional
|
|
Attendance
|
not mandatory
|
Group: CANALE 2
|
Teacher
|
PACCIARELLI DARIO
(syllabus)
1. Introduction to Operations Research
Formulations, the five phases method
Elements of Linear Algebra
2. Formulation of typical optimization problems
Blending
Resource allocation
Lot sizing
Cutting stock
Assignment
Planning
3. Solution of Linear Programming problems
Geometry of LP
The simplex algorithm
The Fourier-Motzkin method
geometrical interpretation of the simplex algorithm
4. Duality theory
The dual problem
Duality theorems
Complementarity theorem
Economic interpretation of the dual problem
Sensitivity analysis
5. The simplex network algorithm
Minimum cost flow problem
Basis and spanning trees
Change of basis
Phase 1 and Phase 2
6. Network optimization
Maximum flow problem
Shortest path problem
Minimum spanning tree problem
(reference books)
Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014
|
|
Dates of beginning and end of teaching activities
|
From to |
|
Delivery mode
|
Traditional
|
|
Attendance
|
not mandatory
|
|
|
Università Roma Tre