Differentiate between optimization problems that fall into the complexity classes P, NP, and NP-Complete. Provide examples of problems that fit into each category (e.g., Linear Programming in P, Traveling Salesman Problem in NP-Hard). Discuss the theoretical significance of polynomial-time solvability in optimization.