A new effective dynamic program for an investment optimization problem
After a series of publications of T.E. O’Neil et al. (e.g. in 2010), dynamic programming seems to be the most promising way to solve knapsack problems. Some techniques are known to make dynamic programming algorithms (DPA) faster. One of them is the graphical method that deals with piecewise linear Bellman functions. For some problems, it was previously shown that the graphical algorithm has a smaller running time in comparison with the classical DPA and also some other advantages. In this paper, an exact graphical algorithm (GrA) and a fully polynomial-time approximation scheme based on it are presented for an investment optimization problem having the best known running time. The algorithms are based on new Bellman functional equations and a new way of implementing the GrA.
Unable to display preview. Download preview PDF.
- 1.Li, X.M., Fang, S.-C., Tian, Y., and Guo, X.L., Expanded Model of the Project Portfolio Selection Problem with Divisibility, Time Profile Factors and Cardinality Constraints, J. Operat. Res., 2004, doi:10.1057/jors.2014.75.Google Scholar
- 15.Wu, F.L., Yen, Z., Hou, Y.H. and Ni, Y.X., Applications of AITechniques to Generation Planning and Investment, IEEE Power Engineering Society General Meeting, Denver, 2004, 936–940.Google Scholar
- 22.O’Neil, E.T. and Kerlin, S., A Simple 2O(x) Algorithm for PARTITION and SUBSET SUM, 2010, http://www.lidi.info.unlp.edu.ar/WorldComp2011-Mirror/FCS8171.pdf.Google Scholar
- 24.Eppstein, D., Galil, Z., and Giancarlo, R., Speeding up Dynamic Programming, Proc. 29th Symp. Found. Comput. Sci., 1988.Google Scholar