Subject: Integer Programming	Code: MO041	

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

Teaching Staff in Charge	Prof. LUPSA Liana, Ph.D., llupsa@math.ubbcluj.ro	
Aims	Familiarizing with the notion of an integer programming problem and the main methods for solving such problems, together with various special cases	
Content	Formulation of the integer programming problem; presentation of some explicit problems allowing a mathematical model based on integer programming problems. Methods of solving integer programming problems. Special cases of integer programming problems and their solutions. Integer multiple criteria programming problems. Vectorial integer programming problems	
Selective References	1) Espinoza D.G., On linear Programming, Integer Programming and Cutting Planes. Thesis Georgia Institute of Technology, 2006.
2) Kaufmann A., Henry-Labordere A., Metode si modele ale cercetarii operationale (Programare in numere intregi), vol III Bucuresti: Ed. Stiintifica si Enciclopedica, 1975.
3) Lupsa L., Numerical Optimization Methods. Special issue in discrete optimization. Cluj-Napoca: Risoprint, 2005.
4) Reiner H., Panos M. P., Handbook of Global Optimization. Dordrecht-Boston-London: Kluwer Academic Publishers, 1995.
5) Varga J., Angewandte optimierung. Budapest: Akademiai Kiado, 1991.	
Assessment	Project + Exam