We develop a new solution method for a broad class of discrete-time dynamic portfolio choice problems. The method efficiently approximates conditional expectations of the value function by using (i) a ...

The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...