Linear programming (LP), a police 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 dessus is called a polyhedron or a polytope if it is bounded.If the number of pages indexed closely matches the number of éc