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

Numerical methods in optimization
Code
Semes-
ter
Hours: C+S+L
Credits
Type
Section
MO260
2
2+2+0
9
compulsory
Analiză Reală şi Complexă - în limba engleză
Teaching Staff in Charge
Assoc.Prof. LUPSA Liana, Ph.D.,  llupsamath.ubbcluj.ro
Aims
Getting to know some numerical methods for solving the optimization problems.
Content
1. Numerical methods to minimize the unimodal functions.
2. Numerical methods to minimize the unconstrained function: decreasing methods, conjugated directions methods, relaxation methods, methods whithout the hypothesis of differentiability.
3. Numerical methods with feasible directions,
4 .Numerical methods based on reducing constrained problems to unconstrained ones
5. Cutting methods,
6. Inner point methods
7. Branch and bound methods.
8. Specific methods to solve fractional, hyperbolic and quadratic programming problems are studied, too.
9. Methods to solve liniar optimisation problems: simplex mthods, Karmarkar's method.
References
1. BRECKNER W.W.: Cercetare operationala, Univ.Babes-Bolyai, Cluj-Napoca ,1981
2. BRECKNER W.W., DUCA D.I.: Culegere de probleme de cercetare operationala, Universitatea, Cluj-Napoca, 1983
3. PADBERG M.: Linear Optimization and Extensions, Springer-Verlag,Berlin, 1995
4. PANIK M.J.: Linear Programming: mathematics, theory and algorithms, Kluwer Academic Publishers, Dordrecht, 1996
Assessment
Exam.