Convexity is an extremely important notion in the study of optimisation problems. Indeed, convex sets, polyhedra, separation and disjoint convex sets are often used to tackle optimisation problems. This chapter is devoted to give a summary of the most important geometric and algebraic properties of convex sets and to show the proof of the most important tools that are going to be used in the analysis of optimisation problems.