We don't know whether the exact boundary between solvable and unsolvable optimization problems can be mapped with full precision for every possible problem type.
open
Global / Unspecified, Global
WS01307
Some optimization problems are proven solvable efficiently, others proven intractable, but a complete boundary map covering every conceivable variation remains incomplete. This unresolved question is central to computational complexity theory.