New Developments In Ultimate Pit Limit Problem Solution Methods

A short review of current practices and recent developments is followed by a description of a newly developed approach for solution of the optimum, ultimate pit limit problem. The new approach utilizes network modeling of the problem for solution by maximum flow algorithm. The latest developments in the implementation of maximum flow algorithm present significant time and memory savings as compared to initial development due to Ford and Fulkerson (1956). Results of a series of computational tests are presented to demonstrate how this approach performs as compared to the well-known Lerchs Grossman algorithm. It is also shown that the solution by the new method automatically includes several optimal solutions based on a predetermined number of benches to be included in the analysis.