TOP DIRECTIVES DE OPTIMISATION

Linear programming (LP), a fonte of convex programming, studies the compartiment in which the équitable function f is linear and the constraints are specified using only linear equalities and inequalities. Such a constraint set is called a polyhedron or a polytope if it is bounded.Optimization problems are often multi-modal; that is, they possess