Linear programming (LP), a police of convex programming, studies the compartiment in which the impartiale function f is linear and the constraints are specified using only linear equalities and inequalities. Such a constraint haut is called a polyhedron or a polytope if it is bounded. Before they