**:** . .
**:**
**:** 53
**:** -
**:** 2015
**:** . . / . 53. .: , 2015. .45-57.

** :** , , , , ,

** (.):** arbitrage-free markets, incomplete markets, consumption problems,scenariotree,dynamicprogramming,convexprogramming

**:** , . . , .

** (.):** We consider a multi-period discrete model of an incomplete market evolving with respect to a non-recombining scenario tree. The investor maximizes expected utility of his of her consumption over a finite time horizon. Decomposition schemes are suggested for optimal consumption-investment problems with power-like and logarithmic utility functions. We introduce dynamic programming algorithms that reduce the original problem to the set of one-period problems.

PDF -
: 2766, : 1060, : 11.