by Gafarov, E.R., Dolgui, A., Lazarev, A.A., Werner, F..
Series: 2012-15, Preprints
We consider a Project Investment problem, where a set of projects and an overall budget are given. For each project, a profit function is known which describes the profit obtained if a specific amount is invested in this project. The objective is to determine the amount invested in each project such that the overall budget is not exceeded and the total profit is maximized. For this problem, we suggest an effective graphical algorithm which improves the pseudo-polynomial time complexity of dynamic programming algorithms. Based on this graphical algorithm, we also derive a fully polynomial time approximation scheme.
In addition, we also consider the related problem of finding lot-sizes and sequencing several products on a single imperfect machine.
Investment problem; Dynamic programming; Graphical algorithm, FPTAS