In this course I will introduce basic concepts in global (i.e., multimodal) optimization. First we will define global optimization problems and present differences between convex and non convex problems. Then heuristic algorithms for global optimization methods which will be introduced, both within the family of methods which can exploit the availability of local optimization tools as well as methods devoted to expensive objective functions. Finally some basic ideas in exact methods will be introduced