Linear programming (LP), a type of convex programming, studies the subdivision in which the équitable function f is linear and the constraints are specified using only linear equalities and inequalities. Such a constraint supériorité is called a polyhedron or a polytope if it is