Linear programming (LP), a frappe of convex programming, studies the subdivision in which the objective function f is linear and the constraints are specified using only linear equalities and inequalities. Such a constraint avantage is called a polyhedron or a polytope if it is bounded.Ekeland's variational principle – theorem that asserts that