A named algorithm whose defined job is finding a best, or near-best, solution to a problem under constraints, by systematic search or bounding rather than by learning from data. Belongs here: Branch and Bound Algorithm, Hill Climbing Algorithm and Simplex Algorithm, each defined by the optimization strategy it applies. Does not belong here: an algorithm that estimates a model from data and only incidentally involves an optimization step, filed under Machine Learning Algorithm.
Facts
Comparison
Era of Emergence Browse By
Sources
1. Wikipedia: Mathematical optimization
WikipediaMathematical optimization, History sectionQuote, Mathematical optimization, History section
The term "linear programming" for certain optimization cases was due to George B. Dantzig, although much of the theory had been introduced by Leonid Kantorovich in 1939.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.