02 03 LG2D

Download as pdf or txt
Download as pdf or txt
You are on page 1of 10

ULTIMATE PIT LIMIT

LERCHS GROSSMANN (LG) 2D ALGORITHM

1
PRESENTATION OUTLINE
▪ Introduction
▪ LG 2D algorithm

2
INTRODUCTION
▪ Ultimate pit limit identifies the size or extent of extraction
▪ Objective
▪ Maximises the undiscounted value of future cash flows
▪ Constraints
▪ Satisfies the precedence – slope constraint

3
LG 2D ALGORITHM – PROCEDURE
▪ Steps of the algorithm
▪ Represent row as i and column as j
-1 -1 -1 -1 -1 1 -1
▪ Add a row i = 0 and calculate cumulative profit for each
column from level or bench 1 to I -2 -2 4 -2 -2

▪ Calculate overall cumulative sum by moving laterally from left 7 1 -3


to right across the section
▪ Assign arrows from-to blocks given cumulative sum

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1

2 -2 -2 4 -2 -2 2 -3 -3 3 -3 -1

3 7 1 -3 3 4 4 -6

4
LG 2D ALGORITHM – PROCEDURE

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1

2 -3 -3 3 -3 -1 2 -4 -3 3 -3 -1

3 4 4 -6 3 4 4 -6

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1

2 -3 -3 3 -3 -1 2 -4 -3 3 -3 -1

3 4 4 -6 3 4 4 -6

5
LG 2D ALGORITHM – PROCEDURE

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1

2 -4 -4 3 -3 -1 2 -4 -4 3 -3 -1

3 4 4 -6 3 0 4 -6

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1

2 -4 -4 3 -3 -1 2 -4 -4 3 -3 -1

3 0 4 -6 3 0 4 -6

6
LG 2D ALGORITHM – PROCEDURE

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 2 1 -1

2 -4 -4 3 -3 -1 2 -4 -4 3 1 -1

3 0 4 -6 3 0 4 -6

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 2 1 -1 1 -1 -1 -1 -1 2 1 -1

2 -4 -4 3 -3 -1 2 -4 -4 3 1 -1

3 0 4 -6 3 0 4 -2

7
LG 2D ALGORITHM – PROCEDURE

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 2 3 -1 1 -1 -1 -1 -1 2 3 2

2 -4 -4 3 1 -1 2 -4 -4 3 1 1

3 0 4 -2 3 0 4 -2

i j 0 1 2 3 4 5 6 i j 0 1 2 3 4 5 6

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 -1 -1 -1 -1 2 3 -1 1 -1 -1 -1 -1 2 3 2

2 -4 -4 3 1 1 2 -4 -4 3 1 1

3 0 4 -2 3 0 4 -2

8
LG 2D ALGORITHM – PROCEDURE

-1 -1 -1 -1 -1 1 2

-2 -2 4 -2 -2

7 1 -3

9
REFERENCES AND FURTHER READING
▪ Open pit mine planning and design by Hustrulid and Kuchta, Pages: 429-456.

10

You might also like