In undergraduate CS, Dynamic Programming problems are often related to Overlapping Optimal Substructure (https://en.wikipedia.org/wiki/Optimal_substructure).Dynamic Programming is also often used in Convex Optimization. Under the context of Dynamic Programming or in general, does Optimal Substructure implies convexity?
Does Optimal Substructure implies Convexity and vice versa?
optimization;dynamic programming;convex hull