Information technology capital budgeting using a knapsack problem

International Transactions in Operational Research

Volumn 13, Issue 4, 2006, Pages 333-351

  Pendharkar, Parag C ^a   Rodger, James A ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b INDIANA UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Artificial intelligence heuristics; Capital budgeting; It investments; Knapsack optimization; Object oriented programming; Simulated annealing; UML modeling

Indexed keywords

EID: 85015448265     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2006.00551.x     Document Type: Article

References (22)

1. Abramson, D., Randall, M.A., (1999). A simulated annealing code for general integer linear programs. Annals of Operations Research 86, 3-21.
2. Al-Tabtabai, H., Alex, A.P., (1998). An evolutionary approach to the capital budgeting of construction projects. Cost Engineering 40, 28-34.
3. Babusiaux, D., Pierru, A., (2001). Capital budgeting, investment project valuation and financing mix: methodological proposals. European Journal of Operational Research 135, 326-337.
4. Berry, R.H., Smith, G.D., 1993. Using a genetic algorithm to investigate taxation induced interactions in capital budgeting. InAlbrecht, R.F., Reeves, C.R., Steele, N.C.(eds) Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference. Wien, Springer-Verlag, pp.567-574.
5. Connolly, D., (1992). General purpose simulated annealing. Journal of Operational Research Society 43, 495-505.
6. Dos Santos, B.L., (1991). Justifying investments in new information technologies. Journal of Management Information Systems 7, 71-90.
7. Glover, F., Laguna, M., (1997). Tabu Search. Kluwer Academic Publishers, Norwell, MA.
8. Goldberg, D.E., (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading, MA.
9. Gurbaxani, V., Kraemer, K., Vitalari, N., (1997). Note: an economic analysis of IS budgets. Management Science 43, 1745-1755.
10. Gurgur, C.Z., Luxhoj, J.T., (2003). Application of chance-constrained programming to capital rationing problems with asymmetrically distributed cash flows and available budget. The Engineering Economist 48, 241-258.
11. Gurunani, C., (1984). Capital budgeting: theory and practice. The Engineering Economist 30, 19-46.
12. Hao, J.H., Pannier, J., (1998). Simulated annealing and tabu search for constraint solving. Fifth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, pp. 1-15.
13. Hinkle, D.E., Wiersma, W., Jurs, S.G., 1988. Applied Statistics for the Behavioral Sciences. Houghton Mifflin Company, Boston, MA.
14. Hofmann, P.B., (2000). Allocating limited capital resources. Healthcare Executive 15, 53-54.
15. Kaplan, S., (1966). Solution of the Lorie-Savage and similar integer programming problems by the generalized Lagrange multiplier method. Operations Research 14, 1130-1135.
16. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., (1983). Optimization by simulated annealing. Science 220, 671-679.
17. Lee, I., (2004). Evaluating business process-integrated information technology investment. Business Process Management Journal 10, 214-233.
18. Leon-Garcia, A., (1994). Probability and Random Processes for Electrical Engineering. Addison-Wesley Publishing Company, Reading, MA.
19. Lorie, J., Savage, L.J., (1955). Three problems in capital rationing. Journal of Business 28, 229-239.
20. Tobin, R.L., (1999). A fast interactive solution method for large capital expenditure selection problems. European Journal of Operational Research 116, 1-15.
21. Tobin, R.L., (2002). Relief period optimization under budget constraints. European Journal of Operational Research 139, 42-61.
22. Weingartner, H.M., (1963). Mathematical Programming and the Analysis of Capital Budgeting Problems. Prentice-Hall, Englewood Cliffs, NJ.