ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Алгоритъм на Лерхс-Гросман×Модел на пределния клас на Лейн×
ОбластМинно делоМинно дело
СемействоProcess / pipelineProcess / pipeline
Година на възникване19651988
СъздателHelmut Lerchs and Israel GrossmannK. F. Lane
ТипGraph-theoretic algorithm for pit limit optimizationEconomic optimization framework for ore classification
Основополагащ източник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 ↗
Други названияLerchs-Grossmann Method, LG AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization Model
Свързани43
Резюме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.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.
ScholarGateНабор от данни
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Lerchs-Grossmann Algorithm · Cut-off Grade (Lane). Извлечено на 2026-06-17 от https://scholargate.app/bg/compare