Linear programming (LP), a type 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 au-dessus is called a polyhedron or a polytope if it is bounded. asks expér