Numerical methods in optimization 
ter 

Teaching Staff in Charge 

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.BabesBolyai, ClujNapoca ,1981
2. BRECKNER W.W., DUCA D.I.: Culegere de probleme de cercetare operationala, Universitatea, ClujNapoca, 1983 3. PADBERG M.: Linear Optimization and Extensions, SpringerVerlag,Berlin, 1995 4. PANIK M.J.: Linear Programming: mathematics, theory and algorithms, Kluwer Academic Publishers, Dordrecht, 1996 
Assessment 
Exam. 