ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Lerchs-Grossmann-algoritmen×Lanes modell for grenseverdigrad×
FagfeltBergteknikkBergteknikk
FamilieProcess / pipelineProcess / pipeline
Opprinnelsesår19651988
OpphavspersonHelmut Lerchs and Israel GrossmannK. F. Lane
TypeGraph-theoretic algorithm for pit limit optimizationEconomic optimization framework for ore classification
Opprinnelig kildeLerchs, 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 ↗
AliasLerchs-Grossmann Method, LG AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization Model
Relaterte43
SammendragThe 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.
ScholarGateDatasett
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Lerchs-Grossmann Algorithm · Cut-off Grade (Lane). Hentet 2026-06-17 fra https://scholargate.app/no/compare