We present a method for approximating the solution of mixed integer nonconcave programming problems in bounded variables. We present computational results for 39 test problems which suggest that the ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback