Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Optimizadores Economicos
Optimizadores Economicos
ECONOMICOS
Ejemplo:
-1
-1
-1
-1
-1
+1
-2
-2
+4
-2
-2
+7
+1
-3
-1
-1
-1
-1
-1
-2
-2
+4
-2
+7
+1
-3
-1
-2
-1
-1
-2
-1
-2
+7
-2
+1
-2
-3
-2
+1
-2
-3
-1
-1
-1
-1
-1
+1
-2
-2
+4
-2
-2
+7
+1
-3
-1
-1
-1
-1
-1
-1
-1
-2
-2
-2
-2
-2
+10
-3
+10
-1
-1
-1
-1
-1
-1
-2
-2
-2
-2
-2
+10
-3
+10
-1
pero:
-1
-1
-1
-1
-1
-1
-2
-2
-2
-2
-2
+10
-3
+10
-1
-1
-1
-1
-1
+5
-2
-2
-1
-1
-1
-1
-1
+5
-2
-2
+5
+5
-1-1-1-1-1+5-2-2+5 = +1 se extrae
todo
-1
-1
-1
-1
+5
-2
-2
-1-1-1+5 = +2 se extrae
+5
-1-1-2-2+5 = -1 no se extrae
-1
-1
Pr
Pr
Pr
1
2
3
4
5
6
7
8
9
G H
LL
M O
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
S
-1
A B
0
1
2
3
C D
F G H
L LL M O
P Q R
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+-1
0+2
0+3
0+3
0+0
-1-1
-1-1
-1-1
2-0
3+3
3+3
0+2
-2-1
4
5
6
7
8
9
Hacer clic
S
0
TAREA
-6
-6
-6
-6
12
18
18
-6
-6
-6
-6
-6
-6
-6
-6
-6
-6
-6
-6
18
18
12
-6
-6
-6
-6
-6
-6
-6
-6
-6
-6
-6
-6
12
18
18
-6
-6
-6
-6
-6
-6
-6
-6
-6
18
18
12
-6
-6
-6
-6
-6
-6
-6
-6
12
18
18
-6
-6
-6
-6
-6
18
18
12
-6
-6
-6
-6
12
18
18
-6
18
18
12
-6
Arc Relationships
Para que A sea
B
Arc from
A to B
A
minado, B debe
minarse para exponer
A.
No hay marcha hacia
atras
Si B es minado, puede
existir en caso de que A
pueda o no pueda ser
minado
Arc Chaining
C
B
If A is mined
so is C
A
Toda la inclinacion se
traduce en un numero
grande de relaciones de
bloques
Se necesita asumir un
arco de cada bloque a
cada bloque
Esto es poque los arcos
pueden encadenarse
Desired Slope
21
Start (partida)
23.
9
6.9
23.
9
Step 1
23.
9
6.9
23.
9
Step 2
23.
9
23.9 -1 =
6.9
23.
9
22.9
Step 3
23.
9
6.9
23.
9
20.9
Luego tratamos los 2 arcos de este bloque de la misma manera. El
valor total de la rama de los 4 bloques es 20.9.
Step 4
23.
9
6.9
23.
9
17.9
3.9
20.9
Step 5
23.
9
6.9
23.
9
17.9
3.9
20.9
Step 6
23.
9
6.9
23.
9
15.9
3.9
20.9
Step 7
23.
9
6.9
15.9
0.9
23.
9
-1 = -0.1
20.9
Continue adding links. The dotted link when added will change the
value of the branch to 0.1. All blocks in the model have their flags
turned off.
Step 8
23.
9
6.9
23.
9
15.9
-0.1
20.9
Este arco marca una evaluacin debil (- 0.1) por lo que puede ser
ayudado por el arco de la rama derecha
Step 9
23.
9
15.9
6.9
23.
9
20.8
Step 10
23.
9
8.9
6.9
23.
9
16.8
Lerchs-Grossman detects that the extra waste will remove the ability
of the centre branch to co-operate with the right hand branch in
paying for the mining of the circled block.
Step 11
23.
9
6.9
23.
9
8.9
-0.1
15.9
Step 12
23.
9
6.9
23.
9
-0.1
-0.1
8.9
Continue adding links and eventually the total value of the left-hand
branch becomes negative. The next arc after this is again between a
positive and negative branch.
Step 13
23.
9
6.9
23.
9
-0.1
8.8
This is dealt with in the same way as before, and the left and righthand branches are combined into one, with one total value.
Step 14
23.
9
6.9
23.
9
-0.1
0.8
The L-G program scans for arcs from blocks which are flagged to
blocks which are not flagged. We can see that in this instance it will
find none and the optimization is complete
Optimal Pit
23.
9
6.9
23.
9
The flagged blocks constitute the optimal pit. The W-shaped pit is
worth 0.8. The centre branch has a negative value so none of its
blocks are flagged and none are mined.
RESUMEN