Is it likely that a proof of P!=NP will give insight into designing more efficient algorithms? Or mostly insight into proving other lower bounds?
Perhaps we could get new upper bounds out of it. Or---perhaps the eventual proof will establish a link between hitherto unrelated areas of mathematics. This link could be used to transform whole classes of theorems and proof structures / ideas from one field to another.
The point is that solutions to such problems as this do not exist in a vacuum: even with the million-dollar incentive for solving the particular stated problems we do not expect that they will be solved without building a network of related sub-theories and sub-theorems, reusable tools which will also help with solving future problems which we don't yet even know enough to formulate.
Fermat's Last Theorem was a good example of this: nobody cares about sums of nth powers, but everybody cares about the Mordell conjecture, Taniyama–Shimura–Weil conjecture etc. which were proved along the way. FLT itself is just a line in the sand to illustrate how far we've come since 1637.