ScholarGate
Assistent

Võrdle meetodeid

Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.

Lerchs-Grossmanni algoritm×Lane'i piirihinna mudel×
ValdkondMäendusMäendus
PerekondProcess / pipelineProcess / pipeline
Tekkeaasta19651988
LoojaHelmut Lerchs and Israel GrossmannK. F. Lane
TüüpGraph-theoretic algorithm for pit limit optimizationEconomic optimization framework for ore classification
AlgallikasLerchs, 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 ↗
RööpnimetusedLerchs-Grossmann Method, LG AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization Model
Seotud43
KokkuvõteThe 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.
ScholarGateAndmestik
  1. v1
  2. 2 Allikad
  3. PUBLISHED
  1. v1
  2. 2 Allikad
  3. PUBLISHED

Mine otsingusse Laadi slaidid alla

ScholarGateVõrdle meetodeid: Lerchs-Grossmann Algorithm · Cut-off Grade (Lane). Loetud 2026-06-17 aadressilt https://scholargate.app/et/compare