A linear programming model has been formulated and implemented for modernization problems with constraints. The complexity of the model is studied analytically and empirically as a function of problem size. A heuristic has been specified and implemented for solving the same problem. The solutions obtained by the linear program and the heuristic are compared for a modernization problem of current interest. The comparison is made on the basis of net present value of the policies selected and the time required to perform the calculations.
['Lorne G. Mason']
An Aggregate Model for Network Modernization with Constraints