The parallel replacement problem with demand and capital budgeting constraints
✍ Scribed by Joseph C. Hartman
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 158 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0-1 variables are required. Examples are presented to provide insight into replacement rules, such as the ''no-splitting-rule'' from previous research, under various demand scenarios.