Solving large replacement problems with budget constraints

Engineering Economist

Volumn 45, Issue 4, 2000, Pages 290-308

  Karabakal, Nejat ^a   Bean, James C ^b   Lohmann, Jack R ^c  

^a Crystallize Inc   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; BUDGET CONSTRAINT; COMBINATORIAL PROBLEM; COMPUTATIONAL TESTS; LAGRANGIAN DUAL PROBLEM; PROBLEM SIZE; REPLACEMENT MODELS;

ALGORITHMS; BUDGET CONTROL;

PROBLEM SOLVING;

EID: 23344438762     PISSN: 0013791X     EISSN: 15472701     Source Type: Journal    
DOI: 10.1080/00137910008967554     Document Type: Article

References (27)

1. ANEJA. Y.P., V. AGGARWAU and P.K. NAIR, "Shortest Chain Subject to Side Constraints," Networks, Vol. 13, 1983. pp. 295-302.
2. BEAN, J.C., J.R. LOHMANN. and R.L SMITH, "A Dynamic Infinite Horizon Replacement Economy Decision Model," The Engineering Economist, Vol. 30, 1985. pp. 99-120.
3. BEAN, J.C, J.R. LOHMANN, and R.L. SMITH. "Equipment replacement Under Technological Change," Naval Research Logistics. Vol. 41, 1994, pp. 117-128.
4. BEASLEY, J.E. and N. CHRISTOFIDES, "An Algorithm for the Resource Constrained Shortest Path Problem," Networks. Vol. 19, 1989, pp. 379-394.
5. BELLMORE, M., H.J. GREENBERG, and J.J. JARVIS, "Generalized Penalty Function Concepts in Mathematical Optimization," Operations Research. Vol. 18. 1970. pp. 229-252.
6. CHAN, T.J. and YANO C.A., "A Multiplier Adjustment Approach for the Set Partitioning Problem," Operations Research, Vol. 40, 1992, pp. S40-S47.
7. ERLENKOTTER, D., "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, Vol. 26, 1978. pp. 992-1009.
8. FISHER. M.L., "The Lagrangian Relaxation Method for Solving Integer Programming Problems." Management Science, Vol. 27, 1981. pp. 1-18.
9. FISHER, M.L., R. JAIKUMAR, and L.N. VAN WASSENHOVE. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, Vol. 32, 1986, pp. 1095-1103.
10. GEOFFRION, A.M., "Lagrangian Relaxation for Integer Programming," Mathematical Programming Study, Vol. 2, 1974, pp. 82-114.
11. GOPALAN, R., R. BATTA, and M.H. KARWAN, 'The Equity Constrained Shortest Path Problem," Computers and Operations Research, Vol. 17, 1990, pp. 297-307.
12. GUIGNARD, M. and M.B. ROSENWEIN, "An Improved Dual Based Algorithm for the Generalized Assignment Problem," Operations Research, Vol. 37, 1989, pp. 658-663.
13. GURNANI, C, "Capital Budgeting: Theory and Practice," The Engineering Economist, Vol. 30, 1984, pp. 19-46.
14. HANDLER, G.Y. and ZANG I., "A Dual Algorithm for the Constrained Shortest Path Problem," Networks, Vol. 10, 1980, pp. 293-310.
15. HASSAN, M.M.D., "Network Reduction for the Acyclic Constrained Shortest Path Problem," European Journal of Operational Research, Vol. 63, 1992, pp. 124-132.
16. International Business Machines, Optimization Subroutine Library, Guide and Reference, International Business Machines, Mechanicsburg, PA, 1990.
17. KARABAKAL, N., J.C. BEAN, and J.R. LOHMANN, "A Steepest Descent Multiplier Adjustment Method for the Generalized Assignment Problem," Technical Report 92-11, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, 1992.
18. KARABAKAL, N., J.R. LOHMANN and J.C. BEAN, "Parallel Replacement Under Capital Rationing," Management Science, Vol. 40, 1994, 305-319.
19. LEE, I.-S., "On Sensitivity Analysis for Shortest Path Dynamic Programming," Working Paper, University of California, Los Angeles, (1986).
20. MARTELLO, S. and P. TOTH, Knapsack Problems: Algorithms and Computer Implementations, John Wiley and Sons, 1990.
21. OAKFORD, R.V., Capital Budgeting: A Quantitative Evaluation of Investment Alternatives, The Ronald Press Co., New York, 1970.
22. OAKFORD, R.V., LOHMANN J.R., and SALAZAR A., "A Dynamic Replacement Economy Decision Model," HE Transactions, Vol. 16, 1984, pp. 65-72.
23. TERBORGH, G., Dynamic Equipment Policy, Machinery and Allied Products Institute, Washington D.C, 1949.
24. WAGNER, H.M., Principles of Operations Research, Prentice Hall Inc., 1975.
25. WEINGARTNER, H.M., Mathematical Programming and the Analysis of Capital Budgeting Problems, Prentice Hall, 1963.
26. WEINGARTNER, H.M., "Capital Budgeting of Interrelated Projects: Survey and Synthesis," Management Science, Vol. 12, 1966, pp. 485-516.
27. WEINGARTNER, H.M., "Capital Rationing: n Authors in Search of a Plot," The Journal of Finance, Vol. 32, 1977, 1403-1431.