Abstract We give necessary and sufficient conditions for finite detection of an optimal initial decision for infinite horizon optimization under a broad set of assumptions and provide an algorithm that is guaranteed to solve every solvable problem under these assumptions. We illustrate the theory and algorithms developed with applications in production planning.
- Dynamic programming
- Forecast horizons
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics