Modified-Tree Graph Algorithms For Ultimate Pit Limit Analysis

The use of computer models to design ultimate pit limits during feasibility study and long range mine planning is becoming a significant practice in open pit mining. One of the problems in determining optimal ultimate pit limits using true optimization techniques has been they require a great deal of computer memory and execution time. In this paper, the maximum closure of a graph, which is a true optimizing model developed by Lerchs and Grossmann, is modified for solving ultimate pit limit problems. By using some properties of the original L&G graph algorithm, the tree configuration can be reduced to only connections between positive ore nodes. The modified algorithm is shown to require less memory and processing time while still yielding an optimal solution.