ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Algoritmul Lerchs-Grossmann×Modelul pragului de rentabilitate al lui Lane×
DomeniuInginerie minierăInginerie minieră
FamilieProcess / pipelineProcess / pipeline
Anul apariției19651988
Autorul originalHelmut Lerchs and Israel GrossmannK. F. Lane
TipGraph-theoretic algorithm for pit limit optimizationEconomic optimization framework for ore classification
Sursa seminalăLerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54. link ↗Lane, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗
Denumiri alternativeLerchs-Grossmann Method, LG AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization Model
Înrudite43
RezumatThe 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.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.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Lerchs-Grossmann Algorithm · Cut-off Grade (Lane). Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare