Babes-Bolyai University of Cluj-Napoca
Faculty of Mathematics and Computer Science
Study Cycle: Graduate

SUBJECT

Code
Subject
MO014 Special Topics in Operations Research
Section
Semester
Hours: C+S+L
Category
Type
Applied Mathematics
7
2+2+0
optional
Teaching Staff in Charge
Prof. DUCA Dorel, Ph.D.,  dducamath.ubbcluj.ro
Prof. KASSAY Gabor, Ph.D.,  kassaymath.ubbcluj.ro
Aims
Presentation of the main results and algorithms concerning transportation problem, network flows, dynamic optimization, vectorial optimization and theory of games.
Content
The transportation problem: definition, examples. Alorithms for solving the transportation problem. Convergence of the algorithm. Applications.
Network flows: basic notions of the graph theory. The theorems of Ford, Ford-Fulkerson and Konig.
Dimamical optimization: basic concepts; Bellman's algorithm for solving dinamical optimization problems.
Game theory: matrix games, John von Neumann's minimax theorem. Methods for solving matrix games.
References
1. BACIU A., PASCU A., PUSCAS E.: Aplicatii ale cercetarii operationale. Bucuresti, Editura Militara, 1988.
2. W.W. BRECKNER: Cercetare operationala, Univ. Babes-Bolyai Cluj Napoca, 1980.
3. GALPERIN G. A.: Nonscalarized Multiobjective Global Optimization. J.O.T.A., 75 (1992), 1, 69-85.
Assessment
The activity during the seminars (20% of the final grade), and an oral exam at the end of the semester (80% of the final grade).
Links: Syllabus for all subjects
Romanian version for this subject
Rtf format for this subject