MiningMath

MiningMath

Loading...

Unlimited scenarios and decision trees for your strategic evaluations

Guaranteed Solutions

Estimated reading: 2 minutes 1548 views

Multiple, complex constraints increase the likelihood of not finding or not existing feasible solutions. Nonetheless, MiningMath always delivers a solution, even if it could not honor the entire set of constraints imposed or had to reduce the NPV to find a feasible solution.

When dealing with highly constrained problems, other technologies might take hours or days to realize there is no feasible solution. The reason for that is because they usually employ generic optimization algorithms, not suitable to take decisions in a mining problem. In this case, the only option is to prepare a second execution with more flexible constraints, but still with no guarantee of feasibility.

On MiningMath, once an infeasible solution is detected, the algorithm takes decisions on which (less relevant) constraints should be flexible, returning some warnings to the user at the report. This is performed along the optimization process, without compromising the runtimes. 

The constraints priority order, from the highest to the lowest, is depicted in Figure 1.

Constraint order
  1. Force+Restrict Mining together using the same surface.

  2. Slope Angles.

  3. Force mining or Restrict Mining, same concept as above, but the surfaces here are corrected according to slopes and it might have some differences.

  4. Minimum Bottom and Mining width, mining length.

  5. Total Production Capacity (or the sum of the capacities across all destinations.)

  6. Vertical rate of advance.

  7. Average and Sum, modeled as strong penalties in the objective function

  8. Time limit

  9. Improve the NPV

Figure 1: Constraints hierarchy order.

Share this Doc

Guaranteed Solutions

Or copy link

CONTENTS
Chat Icon

Hi, it's Mima here 😇 Ask me any questions!