We are going to discuss different methods for constructing extended formulations such as those based on disjunctive programming, dynamic programming, LP-duality, combinatorial redundancy, and reflections. Along with the methods we present several classical and not so classical formulations as well as some more recent ones, e.g. related to non-linear spanning tree problems.