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 of the whole solution space.

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

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