[Hales' proof](https://en.wikipedia.org/wiki/Kepler_conjecture#Hales'_proof) of the Kepler conjecture:

> "... he embarked on a research program to systematically apply linear programming methods to find a lower bound on the value of this function for each one of a set of over 5,000 different configurations of spheres. If a lower bound (for the function value) could be found for every one of these configurations that was greater than the value of the function for the cubic close packing arrangement, then the Kepler conjecture would be proved. To find lower bounds for all cases involved solving about 100,000 linear programming problems." [[Wikipedia](https://en.wikipedia.org/wiki/Kepler_conjecture#Hales'_proof)]