Article
A Tie-Breaking Rule for Discrete Infinite Horizon Optimization
Operations Research
(1992)
Abstract
We study discrete infinite horizon optimization problems without the common assumption of a unique optimum. A method based on solution set convergence is employed for finding optimal initial decisions by solving finite horizon problems. This method is applicable to general discrete decision models that satisfy a weak reachability condition. The algorithm, together with a stopping rule, is applied to production planning and capacity expansion, and computational results are reported.
Keywords
- dynamic programming,
- deterministic,
- infinite horizon optimization,
- facilities/equipment planning,
- capacity expansion,
- infinite horizon models
Disciplines
Publication Date
1992
Publisher Statement
This is a manuscript published as Ryan, S. M., J. Bean and R. L. Smith, "A Tie-Breaking Algorithm for Discrete Infinite Horizon Optimization," Operations Research, 40, S117-S126 (1992). Available at http://dx.doi.org/10.1287/opre.40.1.S117. Posted with permission.
Citation Information
Sarah M. Ryan and James C. Bean. "A Tie-Breaking Rule for Discrete Infinite Horizon Optimization" Operations Research (1992) Available at: http://works.bepress.com/sarah_m_ryan/81/