首页> 外文会议>Applications of Computers and Operations Research in the Minerals Industry International Symposium >Linear Programming Approximations for Modeling Instant-Mixing Stockpiles
【24h】

Linear Programming Approximations for Modeling Instant-Mixing Stockpiles

机译:用于建模即时混合库存的线性编程近似

获取原文

摘要

Stockpiles are a crucial part of mine planning. However, they are often ignored in long-term planning due to the difficulty of correctly evaluating their impact in mine scheduling. This difficulty arises mainly because materials of different grades are mixed in a stockpile, and the final grade of the material leaving the stockpile is a complex non-linear function of the material inside the stockpile. In practice, computational software uses different (usually linear) approximations for estimating this grade, but it is not clear how good these approximations are.In this paper, we discuss different optimization models to approximate the real impact of a stockpile on long-term mine planning. We discuss the properties of these models and compare the quality of the approximations computationally. We show that it is possible to obtain good upper and lower bounds on the resulting grade of the stockpile, and realistic and accurate estimations of the behavior of the stockpile. We also discuss how to extend these models to address different minerals and their corresponding grades.
机译:库存是矿山规划的重要组成部分。然而,由于难以正确评估其在矿井调度的影响,它们通常会在长期规划中忽略。这种困难主要是因为不同级别的材料在储存中混合,并且留下储存储存的材料的最终等级是储物内部材料的复杂非线性函数。在实践中,计算软件使用不同的(通常是线性的)近似值来估计该等级,但目前尚不清楚这些近似值的良好。在本文中,我们讨论了不同的优化模型,以估计库存对长期矿井的真正影响规划。我们讨论了这些模型的属性,并计算了计算上近似的质量。我们表明,可以获得储存等级的良好的上限和下限,以及对储存行为的现实和准确估计。我们还讨论如何扩展这些模型以解决不同的矿物质及其相应的等级。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号