JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech IV Year ADVANCED SURFACE MINING Previous Question Paper (February/March - 2022 - R18)

The Ultimate Pit Configuration represents the final geometric shape and extent of an open-pit mine that maximizes the total net profit from the extraction of mineral resources over the life of the mine. It defines the boundary where the cost of mining and processing the ore equals the revenue generated from the sale of the contained metal, subject to geotechnical stability constraints.

The determination of the ultimate pit involves the following key considerations:

• Economic Parameters: Estimation of commodity prices, mining costs (drilling, blasting, loading, hauling), processing costs, and refining charges.
• Geotechnical Constraints: Determination of the overall pit slope angle, which must ensure safety against wall failure while minimizing the stripping ratio.
• Cut-off Grade: Defining the minimum grade of ore that can be profitably extracted, which dictates the ore-waste boundary.
• Block Modeling: The deposit is discretized into a 3D grid of blocks, each assigned a value based on its grade, tonnage, and associated costs.

The determination process typically uses optimization algorithms to evaluate the Net Present Value (NPV) of various pit shells. By iteratively expanding the pit boundary until the marginal cost of removing an additional block of waste exceeds the marginal revenue of the ore exposed, the optimal pit limit is established.

The Lerchs-Grossmann (LG) algorithm is a rigorous mathematical approach used to determine the optimal pit limit in 2D or 3D, ensuring the maximum possible profit. It is based on Graph Theory, specifically the concept of the 'maximum weight closure' of a directed graph.

Key aspects of the algorithm include:

• Graph Representation: The ore body is represented as a set of nodes (blocks). Directed edges are drawn between blocks to represent precedence constraints; for instance, a block cannot be mined unless the blocks directly above it are removed to satisfy slope stability requirements.
• Optimization Logic: The algorithm identifies a subset of blocks (a closure) such that if a block is included, all its predecessors are also included. It seeks to maximize the sum of the values of these blocks.
• Dynamic Programming and Flow Networks: It effectively transforms the mining problem into a minimum-cut/maximum-flow problem. By finding the minimum cut in the network, the algorithm identifies the optimal boundary that separates the profitable pit from the surrounding waste rock.
• Advantages: Unlike heuristic methods (such as moving cones), the LG algorithm guarantees a mathematically optimal solution for a given set of economic and geotechnical inputs.
• Limitations: While computationally intensive for very large block models, modern computing power has made it the industry standard for strategic mine planning. It does not inherently account for the time value of money, which is typically addressed in subsequent production scheduling phases.