Dynamic Programming Principles

Optimal substructure and overlapping subproblems Linear constraints and a convex objective function Fixed input size and deterministic output Divide-and-conquer structure and logarithmic depth