MiningMath

MiningMath

Loading...

A unique approach to maximizing NPV

In the search for the upside potential for the NPV of a given project, this setup explores the whole solution space without any other constraints but processing capacities, in a global multi-period optimization fully focused on maximizing the project’s discounted cashflow.

As MiningMath optimizes all periods simultaneously, without the need for revenue factors, it has the potential to find higher NPVs than traditional procedures based on LG/Pseudoflow nested pits, which do not account for processing capacities (gap problems), cutoff policy optimization and discount rate. Traditionally, these, and many other, real-life aspects are only accounted for later, through a stepwise process, limiting the potentials of the project.

This setup serves as a reference to challenge the Best Case obtained by other means, including more recent academic/commercial DBS technologies available. The block periods and destinations optimized by MiningMath could be imported back into your preferred mining package, for comparison, pushback design or scheduling purposes. This is all available for free!

Or… keep reading for a much more advanced experience!…

With MM-FULL, you can go even further! Constrained Best Case scenarios could be found by adding more constraints, preferably one at a time to make your assessments more realistic and evaluate their financial impacts in the project, potential conflicts among them and so on:

• Simultaneous destination optimization for multiple processing/dump routes
• Average (blending) and Sum constraints
• Restrict mining aspects due to forbidden areas
• Stockpiling…

And if you wish to go beyond the unrealistic shapes of this approach, move next to the Pushback Optimization, or even go straight to your Optimized Schedules and Decisions Trees! It’s all available in MM-FULL!

Share This Article