首页 | 本学科首页   官方微博 | 高级检索  
     


Using dynamic programming for aggregating cuts in a single drillhole
Authors:Mark E Gershon  Frederic H Murphy
Affiliation:School of Business, Temple University , Philadelphia, Pa., 19122, USA
Abstract:Abstract

In planning a mine with layered deposits one roust decide what to mine as ore or waste. Because there are minimum widths for waste and ore cuts, the decision for a depth interval depends on the ore quality of neighboring intervals. We present a dynamic programming approach that optimizes the cuts for a single drillhole from which the ore qualities are evaluated. We implement a trial version using Lotus 123 to illustrate the properties of the solution.
Keywords:Tailings  cyanide  closure
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号