Linear programming (LP), a caractère of convex programming, studies the case in which the objective function f is linear and the constraints are specified using only linear equalities and inequalities. Such a constraint dessus is called a polyhedron pépite a polytope if it is bounded.