This paper describes a method for solving concave numerical dynamic programming problems which is based a pair of polyhederal approximations of concave functions. The method is robust in that (i) it is globally convergent, (ii) it produces exact error bounds on the computed value function which...