Subject: Special Topics in Operations Research	Code: MO014	

Semester	 Hours: C+S+L	Type	 Section	
8	2+2+0	optional	Computer Science	
7	2+2+0	optional	Applied Mathematics	

Teaching Staff in Charge	Prof. DUCA Dorel, Ph.D., dduca@math.ubbcluj.ro
Prof. KASSAY Gabor, Ph.D., kassay@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	
Selective 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).