Applications of Integer Programming in Open Pit Mining
by Chris Fricke
Abstract: We consider the application of integer programming to solve the open pit mine production scheduling (OPMPS) problem. The state of the art integer
programming formulation for the OPMPS problem is often intractable for solution by commercial solvers, due to the very large number of decision
variables in the model. We derive a relationship between the OPMPS problem and the well-known precedence constrained knapsack (PCK)
problem, and show how PCK cover-based inequalities can strengthen the integer programming formulation of the OPMPS problem. We also derive a new class of facet-defining inequalities for the PCK problem, and show how the application of these inequalities can improve the computational performance of the OPMPS problem for certain pits.