Abstract
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.
Original language | English (US) |
---|---|
Article number | 5974 |
Pages (from-to) | 498-503 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 43 |
Issue number | 5 |
DOIs | |
State | Published - Aug 3 2015 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2015 Elsevier B.V.
Keywords
- Coalescence
- Dynamic programming
- Forecast horizons