"Babes-Bolyai" University of Cluj-Napoca
Faculty of Mathematics and Computer Science

Selected topics in operations research
Code
Semes-
ter
Hours: C+S+L
Credits
Type
Section
MO014
8
2+2+0
10
optional
Informatică
Teaching Staff in Charge
Assoc.Prof. KASSAY Gabor, Ph.D., kassay@math.ubbcluj.ro
Assoc.Prof. LUPSA Liana, Ph.D., llupsa@math.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
Exam.