Linear programming addresses the problem of optimising a linear function, either by minimising or maximising it, subject to linear constraints. The feasible region in such problems is therefore a polyhedron. In spite of the strong mathematical assumption of linearity, both for the objective function and the constraints, linear programming problems are extremely common in applications and, from a theoretical point of view, they also present techniques that can be exported to the more complex case of non-linear programs.