Boundedness of the Value Function of the Worst-Case Portfolio Selection Problem with Linear Constraints
22 Pages Posted: 25 Jan 2017
Date Written: January 25, 2017
We study the boundedness properties of the value function for a general worst-case scenario stochastic dynamic programming problem. For the portfolio selection problem,we present sufficient economically reasonable conditions for the finitness and uniform boundedness of the value function. The results can be used to decide if the problem is ill-posed and to correctly solve the Bellman-Isaacs equation with an appropriate numeric scheme.
Keywords: portfolio selection, Bellman-Isaacs equation, stochastic dynamic programming, value function, worst-case optimization
JEL Classification: C61, C63, G11
Suggested Citation: Suggested Citation