Derived from
|
20801777 OPERATIONAL RESEARCH I in Computer science and engineering L-8 A - Z 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
|