Operations Research
3 Lecture/1 Practical
(MAT.430 / MAT.431)

E. Dragoti-Çela
Department of Discrete Mathematics
• Time and Place lecture ,
Time and Place practical ,

• Start: Wednesday, Oktober 4th, 2017, 14:15-16:00, SR AE06, Steyrergasse 30, ground floor
• Registration
• via TUGonline until October 26th 2017

• Contents and prerequisites
• Treatment of OR topics which are not covered in the optimization courses; The topics discussed in this lecture will be taken from the following list according to the contents of other courses on optimization: dynamical programming, inventory models, multicriteria optimization, metaheuristics, integer programming and if time permits it also decision analysis. Previous knowledge expected: Mathematical Optimization, Probability Theory Beyond the theoretical aspect we will discuss applications from different areas. The aim is to convey some of the most popular models and solution approaches on the subareas of operations research mentioned above.

Chapters:

• Dynamic programming
• Inventory models
• Multicriteria optimisation
• Heuristics

• Literature
• The main sources of literature

There are also some lecture notes in German written by Judith Kloas according to the lecture held by Eranda Dragoti-Çela in the winter term 2011/2012.

• Assessment
• The practical assessment will be permanent and based on a score of points collected as follows

• By solving exercise examples independently.
At the beginning of every practical class the participants have to declare which exercise examples they have solved and prepared for presentation.
• By presenting the solution of exercise examples in the class.
The instructor will select the candidates to present the solutions of the exercise examples on the board (among the students who have declared to have prepared the corrsesponding exercise example). The presentatation of an exercise example in the class will be credited with at most 2 points corresponding to the correctness and completeness of the solution as well as the quality of the presentation. Abuses of the system, e.g. false declarations about preparation of exercises, will be penalized: the overall amount of point collected till the abuse will be multiplied by 0.5 and in case of repetition even by a smaller factor.

The overall score is computed as follows

P= 30*(P+B)/A,

where

P     number of exercise examples prepared all along the course,

A   overall number of exercise examples which have been available during the course,

B     overall sum of points obtained by presenting exercise examples in the class

Grade obtained for the practical according to the overall score:

5    0 <= P < 15
4    15 <= P <= 18
3    18 < P <= 22
2    22 < P <=26
1    26< P

The lecture will be assessed by an oral examination.
The dates of the examinations will be specified in agreement with the students.

There will be up to 3 Dates per term if needed;
They will be announced in TUGonline on time;

The registration for the oral examination should be done via TUGonline.

• Work sheets (pdf)

cela@opt.math.tu-graz.ac.at.

Last update: January 2018