ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Algorytm Lerchs-Grossmann×Model granicy opłacalności Lane'a×
DziedzinaInżynieria górniczaInżynieria górnicza
RodzinaProcess / pipelineProcess / pipeline
Rok powstania19651988
TwórcaHelmut Lerchs and Israel GrossmannK. F. Lane
TypGraph-theoretic algorithm for pit limit optimizationEconomic optimization framework for ore classification
Źródło pierwotneLerchs, 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 ↗
Inne nazwyLerchs-Grossmann Method, LG AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization Model
Pokrewne43
PodsumowanieThe 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.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Lerchs-Grossmann Algorithm · Cut-off Grade (Lane). Pobrano 2026-06-17 z https://scholargate.app/pl/compare