A Dynamic Programming Solution Of A Block-Caving Mine Layout

INTRODUCTION Block-caving mines are generally large operations. Calculating the quantity and value of mineral present and determining the economic limits to mining are complicated processes requiring much time and effort. If these processes are to be worthwhile, they must be accurate and reliable. Success in planning may increase the economic returns significantly. Since capital investments in block-caving mines are generally quite large, and development may span several years, quicker and more accurate methods of mine layout are very worthwhile to the mining industry. The purpose of this study is to develop an approach to the evaluation and layout of block-caving mines. The study included development of a simple approach to modelling ore reserves and a rapid, dynamic programming solution for optimum ultimate mining limits. TRADITIONAL APPROACHES TO BLOCK-CAVING MINE LAYOUT General discussion of techniques of calculating and valuing ore reserves can be found in the literature, (1-4). Mining limit approaches have been investigated by many and follow five general methods: 1, Moving cone method (5) 2. Graphroriented technique (6,7) 3. Dynamic programming technique (7,8,9) 4. Network flow method (10,11) 5. Pillar method (12) Of these investigations, only two were developed for underground mining applications, those of Sharp (9) and Riddle (11).