A local optimum of a combinatorial optimization problem is a solution that is 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.
Find more facts
Further reference
Remember what Local optimum means:
Other sources
Search for
Local optimum information on:
amazon.com
Your reference for information, definition
http://explanation-guide.info/meaning/Local-optimum.html
Licensing information:
This article uses material from
Wikipedia (
credits) and is made available under the terms of the
GNU FDL (
copy).
Image licensing information is accessible by clicking the image.