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/uk/compare