You are here: >

Local optimum

In mathematics and computer science, a local optimum is the best solution to a problem within a small neighborhood of possible solutions. This concept is in contrast to the global optimum, which is the optimal solution when every possible solution is considered. When developing an algorithm to solve a problem, heuristics such as simulated annealing may be used to minimize solutions that are optimal locally, but not globally.

Also see: Computer Science, Programming terms