Local optimum

From Wikipedia, the free encyclopedia

Local optimum is a term in applied mathematics and computer science.

A local optimum of a combinatorial optimization problem is a solution optimal within a neighboring set of solutions. This is in contrast to a global optimum, which is the optimal solution among all possible solutions.

The locality of the optimum is dependent on the neighborhood structure as defined by the metaheuristic that is used for optimizing the solution.

Many so-called solutions to such optimization problems will find a local optimum, and thus are guaranteed to work only if the problem has one global optimum.

See also: Maxima and minima