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.
Curriculum
teacher profile teaching materials
Formulations, the 5-step method
Preliminaries on Linear Algebra
Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations
Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex
Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis
Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree
Programme
Introduction to Operations Research:Formulations, the 5-step method
Preliminaries on Linear Algebra
Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations
Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex
Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis
Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree
Core Documentation
Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Operations Research", Isedi, Italia, 2014.Reference Bibliography
Material given by the professor via the e-learning page of the course, including lecture slidesType of delivery of the course
frontal lessons exercisesType of evaluation
intermediate / final, oral / written teacher profile teaching materials
Core Documentation
Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014. teacher profile teaching materials
Formulations, the 5-step method
Preliminaries on Linear Algebra
Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations
Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex
Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis
Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree
Mutuazione: 20801777 RICERCA OPERATIVA I in Ingegneria informatica L-8 D'ARIANO ANDREA, SAMA' MARCELLA
Programme
Introduction to Operations Research:Formulations, the 5-step method
Preliminaries on Linear Algebra
Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations
Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex
Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis
Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree
Core Documentation
Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Operations Research", Isedi, Italia, 2014.Type of delivery of the course
frontal lessons exercisesType of evaluation
intermediate / final, oral / written teacher profile teaching materials
Mutuazione: 20801777 RICERCA OPERATIVA I in Ingegneria informatica L-8 D'ARIANO ANDREA, SAMA' MARCELLA
Core Documentation
Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014.