Dynamic programming (DP) is an important and frequent problem in competitive programming contests. Famous CLRS book categorize DP problems that have optimal substructure and overlapping sub-problems. Yet dynamic programming was invented for mathematical programming.
I believe from operational research perspective DP is more than “optimal substructure” and “overlapping sub-problems”.
So what are differences between DP in computer science and operational research?