The aim of the thesis is to understand the Minkowski-Weyl theorem for polyhedra. This will be achieved by constructing a complete proof of the theorem and implementing an algorithm that uses the proof to convert a system of linear inequalities into a finite set of vertices and extreme rays of the polyhedron.