Multiple stages, which are solved sequentially one stage at a time.
States, which reflect the information required to assess the consequences that the current decision has on future actions.
Recursive optimization, which builds to a solution of the overall N-stage problem by first solving a one-stage problem and sequentially including one stage at a time and solving one-stage problems until the overall optimum has been found.
KeywordsDynamic Programming Decision Variable Formal Statement Previous Equation Simple Problem
- 1.Bellman R (2003) Dynamic programming. DenardoGoogle Scholar
- 3.Momoh JA (2005) Electric power system applications of optimization. Marcel Dekker, New YorkGoogle Scholar
- 4.Wood AJ, Woolenberg BF (1996) Power generation operation and control. Wiley, New YorkGoogle Scholar
- 5.Bradley S, Hax A, Magnanti T (1977) Applied mathematical programming. Addison-Wesley, Reading, MAGoogle Scholar
- 6.Dasgupta S, Papadimitriou CH, Vazirani UV (2008) Algorithms. McGraw-Hill, Boston, MAGoogle Scholar
- 7.Sniedovich M (2010) Dynamic programming: foundations and principles. Taylor & Francis.Google Scholar
- 8.Bertsekas DP (2007) Dynamic programming and optimal control. Athena Scientific, Belmont, MAGoogle Scholar
- 12.Hadley G (1962) Nonlinear and dynamic programming. Addison-Wesley, LondonGoogle Scholar
- 13.Zietz J (2004) Dynamic programming: an introduction by example. http://frank.mtsu.edu/~berc/working/Zietz-DP-1.pdf. Accessed 14 Jan 2011
- 14.Introduction to dynamic programming http://www.webmath.iitkgp.ernet.in/breadth/ma23011/lectnotes07/Dynamic_Programming-4.pdf. Accessed 14 Jan 2011
- 15.Chinneck JV (2006) Practical optimization: a gentle introduction. http://www.sce.carleton.ca/faculty/chinneck/po.html. Accessed 14 Jan 2011