Foundations of Operations Research -- Teaching material
The teaching material is in PDF format and can be viewed with
Acrobat Reader
Slides of the lectures
1. Introduction
2. Graph and network optimization
3. Fundamentals of computational complexity
4. Linear Programming (LP)
5. Integer Linear Programming (ILP)
Exam questions
Material for the exercises
Exercises 1.1-1.2 (Models I), solutions 1.1-1.2 if needed please review the basic concepts of gradient and level curves of a function of several variables, in particular for linear functions.
Exercises 2.1-2.4 (Optimal spanning trees), solutions 2.1-2.3 and 2.4
Exercises 1.3-1.4 (Models II), solutions 1.3-1.4
Exercises 2.5-2.9 (Shortest paths, dynamic programming and project planning), solutions 2.5-2.9
, detailed solution of exercise 2.7.
Exercises 2.10-2.13 (Network flows), solutions 2.10-2.13
Exercises
3.1-3.4 (Computational complexity) solutions 3.1-3.4
Exercises 4.1-4.3 (Linear Programming), solutions 4.1-4.3
Exercises 1.5-1.7 (Models III), solutions 1.5-1.7
Exercises 4.4-4.6 (Duality in Linear Programming), solutions 4.4-4.6
Additional exercises on Linear Programming, solutions additional exercises on LP
Exercises 1.8-1.10 (Models IV), solutions 1.8-1.10
Exercises 5.1-5.3 (Integer Linear Programming), solutions 5.1-5.3
Two additional exercises on the Branch and Bound method, with solutions
