Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Lanes Cut-off Grade Model× | Lerchs-Grossmann Algoritmen× | |
|---|---|---|
| Fagområde | Minedrift | Minedrift |
| Familie | Process / pipeline | Process / pipeline |
| Oprindelsesår≠ | 1988 | 1965 |
| Ophavsperson≠ | K. F. Lane | Helmut Lerchs and Israel Grossmann |
| Type≠ | Economic optimization framework for ore classification | Graph-theoretic algorithm for pit limit optimization |
| Oprindelig kilde≠ | Lane, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗ | Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54. link ↗ |
| Aliasser≠ | Lane Model, Cut-off Grade Optimization, Lane's Optimization Model | Lerchs-Grossmann Method, LG Algorithm |
| Relaterede≠ | 3 | 4 |
| Resumé≠ | Lane's Cut-off Grade Model, developed by Kenneth F. Lane and formalized in his 1988 book, provides a rigorous economic framework for determining the minimum grade at which ore should be mined and processed. It accounts for variable mining costs, metallurgical recovery, and commodity prices to optimize profit per unit processed. The model is foundational in mining economics and underpins daily operational decisions at thousands of mines worldwide. | The Lerchs-Grossmann Algorithm is a graph-theoretic method for determining the ultimate pit limit in open-pit mining operations. Introduced by Helmut Lerchs and Israel Grossmann in 1965, it maximizes the net present value of extracted ore while respecting slope stability constraints. This algorithm forms the theoretical foundation for most modern pit optimization software. |
| ScholarGateDatasæt ↗ |
|
|