engleski

On Maximization of the Internal Rate of Return in the Choice of Independent Investment Projects

In this paper we consider the problem of choosing a combination of independent projects for which internal rate of return is maximized. In this problem the projects are divided into groups and only one project may be selected from each group. In addition, budget constraint for each time period must be considered. The problem is formulated as a non-linear mixed-integer mathematical programming problem with 0/1 variables. In order to solve the problem an algorithm is suggested and tested on some examples.

Internal rate of return; independent investment projects; budget constraint; non-linear mixed-integer 0/1 programming; algorithm

nije evidentirano