In computer science and mathematical optimization, a heuristic is a procedure designed to find a good enough solution to an optimization problem when the classical methods (LP, QP, SOCP, SDP, and SQP) discussed in the past few chapters fail, are too slow, are infeasible, or are not applicable. This is especially true when the problem is too big (e.g., beyond the limited computation capacity), has incomplete or imperfect information (e.g., lack of structure for pruning), has a complex objective function (e.g., nondifferentiable), ...
11. Heuristics
Get Numerical Methods Using Kotlin: For Data Science, Analysis, and Engineering now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.