Answers are grounded in this paper and cite their sources.
Traditional replacement models assume unlimited capital. In practice, however, firms frequently use budgets to control their expenditures. Budget constraints necessitate that all replacement decisions be considered as a portfolio, creating a difficult combinatorial problem. In previous research, we developed a branch-and-bound algorithm for solving moderately-sized problems optimally. In this paper, we propose a dual heuristic for dealing with large, realistically sized problems. First, we solve the individual replacement problems ignoring the budget constraints. Then, we reduce, or eliminate, if possible, budget violations by solving a Lagrangian dual problem. The computational tests suggest that the effectiveness of the approach increases with problem size.
No takes yet. Share an insight, caveat, or question.
Karabakal et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: