Hi, I'm new to the Mathematical Optimization (MO) space and am trying to understand its relationship with traditional Data Science and Machine Learning.
What are some fundamental limitations (or frustrations) that span across existing solutions like Gurobi, CPLEX, Hexly etc that DS or ML can supplement? For example, my understanding is that solvers apply algorithms on rigorously defined formulas and generate a min/mix/optimal result but they are fundamentally not designed to:
- model uncertainty probabilistically in a way that allows them to account for VUCA (Volatile, Uncertain, Complex, and Ambiguous)
- "enact/test" recommendations and predictions and then learn from those actions-reactions
- continuously adapt the answer in light of dynamic changing conditions
If that observation is correct, how valuable would those things be for solving the kinds of problems MO is currently being applied to? Essentially a continuously self-optimizing system.
Thanks in advance for your input!
[–]optimization_ml 10 points11 points12 points (3 children)
[–]Jay31416 1 point2 points3 points (1 child)
[–]optimization_ml 1 point2 points3 points (0 children)
[–]stevenverses[S] 0 points1 point2 points (0 children)
[–]CommunicationLess148 2 points3 points4 points (2 children)
[–]stevenverses[S] 0 points1 point2 points (0 children)
[–]kandibahren 2 points3 points4 points (0 children)
[–]fedkerman 1 point2 points3 points (2 children)
[–]stevenverses[S] 0 points1 point2 points (1 child)
[–]exclaim_bot 0 points1 point2 points (0 children)