What makes an allocation problem dynamic over time?
An allocation problem is considered dynamic when the decisions made in one period directly influence the available options, constraints, or outcomes in subsequent periods.1
In the field of optimization, while standard allocation models focus on distributing resources among competing alternatives to maximize return or minimize cost, they often assume independence between periods. A problem becomes dynamic specifically because of this interdependency: the allocation of resources today changes the state of the system for the future, requiring time to be explicitly integrated into the mathematical solution.1
This temporal connection distinguishes dynamic problems from static models, where decisions are typically isolated to a single point in time.1