Validation of the corrected form of the Korobov algorithm with the Lerchs and Grossmann method based on graph theory

Open pit mining is one of the most important methods of surface mining in which extraction of mineral deposit is carried out in benches. Ultimate limits of an open pit which define its size and shape at the end of the mine’s life must be designed before to start the operation. Manual and computer methods can be used to determine optimum ultimate pit limits. Manual methods of designing pit limits are based on stripping ratios and involve determining break even pit limits. The objective of computer methods is to determine the optimum ultimate pit outline for which the net profit is maximized. A number of algorithms such as floating or moving cone method, the Korobov algorithm and the corrected form of this method and the Lerchs and Grossmann algorithm based on graph theory have been developed to find out the optimum final pit limits. Each of these methods has special advantages and disadvantages. The designers of the corrected form of Korobov algorithm claim that this method is able to yield the true optimum pit in all the cases. The aim of this paper is to examine this method for being as a true optimum pit algorithm. This method is compared with the Lerchs-Grossmann algorithm which is the only method that can be proved, rigorously, always to yield the true optimum pit. The results show that the corrected form of Korobov algorithm is not always able to find out a true optimum pit outline.