Dynamic Programming Applied To The Mining Sequence Optimization In A Sublevel Stoping Exploitation - Introduction

Dynamic programming is based on the-, application of a simple property formulated by Bellman in his principle of optimality (Bellman, 1957): "An optimal policy has the property that whatever the initial state and initial decision are, the-remaining decisions must constitute an optimal policy with regard to the state resulting from the first decision". The method is charaterised by: (Dowd, 1979) a) A function defining the total value at each decision time of the system. b) The set of permissible decisions. c) The present state of the system. d) The number of steps remaining before the procedure is terminated.