Duality results for stationary problems of open pit mine planning in a continuous function framework

AUTOR(ES)

Griewank, A., Strogies, N.

FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2011

RESUMO

Open Pit Mine Planning problems are usually considered in a Mixed Integer Programming context. Characterizing each attainable profile by a continuous function yields a continuous framework. It allows for a more detailed modeling of slope constraints and other material properties of slanted layers. Although the resulting nonlinear programming problems are in general non-convex and non-differentiable, they provide certain advantages as one can directly compute sensitivities of optimal solutions w.r.t. small data perturbations. In this work duality results are derived for the stationary problems of the continuous framework employing an additional condition called convex-likeness.

Documentos Relacionados

• Comparison between the application of the conventional mine planning and of the direct block scheduling on an open pit mine Project
• Discrete approximations for strict convex continuous time problems and duality
• The impact of payload truck factor use in mine performance reports for an open pit copper mine in Brazil
• The impact of haulroad geometric parameters on open pit mine strip ratio
• An integrated pit-to-plant approach using technological models for strategic mine planning of copper and gold deposits