Lane’s Algorithm Revisited

References

• Asad M, Topal E (2011) Net present value maximization model for optimum cut-off grade policy of open pit mining operations. J. South African Institute Mining Metallurgy 111(11):741–750.Google Scholar
• Asad M, Qureshi M, Jang H (2016) A review of cut-off grade policy models for open pit mining operations. Resources Policy 49:142–152.Crossref, Google Scholar
• Azimi Y, Osanloo M (2011) Determination of open pit mining cut-off grade strategy using combination of nonlinear programming and genetic algorithm. Arch. Mining Sci. 56(2):189–212.Google Scholar
• Bellman R (1957) Dynamic Programming (Princeton Univ. Press, NJ).Google Scholar
• Dagdelen K (1992) Cut-off grade optimization. Proc. 23rd Internat. Sympos. on the Application of Computers and Operations Research in the Mineral Industry, 157–165.Google Scholar
• Dagdelen K (1993b) An NPV optimization algorithm for open pit mine design. Jorgen Elbrond J, Tang X, eds. Proc. 24th Internat. Sympos. Appl. Comput. Oper. Res. Mineral Indust. (Canadian Institute of Mining, Metallurgy, and Petroleum, Montreal), 257–263.Google Scholar
• Dagdelen K, Kawahata K (2008) Value creation through strategic mine planning and cutoff-grade optimization. Mining Engrg. 60(1):39–45.Google Scholar
• Duran M, Grossmann I (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3):307–339.Crossref, Google Scholar
• Espinoza D, Goycoolea M, Moreno E, Newman A (2013) MineLib: a library of open pit mining problems. Ann. Oper. Res. 206(1):93–114.Crossref, Google Scholar
• Githiria J, Musingwini C, Muriuki J (2016) Development of a computer-aided application using lane’s algorithm to optimize cut-off grade. J. South African Inst. Mining Metall. 116(11):1027–1035.Crossref, Google Scholar
• Henning U (1963) Calculation of cut-off grade. Canadian Mining J. 84(3):54–57.Google Scholar
• Hustrulid W, Kuchta M, Martin R (2013) Open Pit Mine Planning and Design (CRC Press, Boca Raton, FL).Google Scholar
• Johnson T (1968) Optimum Open Pit Mine Production Scheduling (Univ. of California Berkeley).Crossref, Google Scholar
• Kelley JE (1960) The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4):703–712.Crossref, Google Scholar
• King B (2001) Optimal mine scheduling policies. Unpublished PhD thesis, Royal School of Mines, Imperial College, London.Google Scholar
• Lane K (1964) Choosing the optimum cut-off grade. Colorado School Mines Quart. 59(4):811–829.Google Scholar
• Lane KF, Hamilton D, Parker JJB (1984) Cutoff grades for two minerals. Proc. 18th Internat. Sympos. Appl. Comput. Oper. Res. Minerals Indust. (Institution of Mining and Metallurgy, London), 485–492.Google Scholar
• Lane KF (2018) The Economic Definition of Ore: Cut-off Grades in Theory and Practice (Comet Strategy Pty Ltd, Cleveland, Australia).Google Scholar
• Leake R, Liu RW (1967) Construction of suboptimal control sequences. SIAM J. Control 5(1):54–63.Crossref, Google Scholar
• Lubin M, Yamangil E, Bent R, Vielma JP (2018) Polyhedral approximation in mixed-integer convex optimization. Math. Programming 172(1–2):139–168.Crossref, Google Scholar
• Mortimer G (1950) Grade control. Trans. Inst. Mining Metallurgy 59:357–399.Google Scholar
• Vickers E (1961) Marginal analysis-its application in determining cutoff grade. Mining Engrg. 13(6):578–582.Google Scholar
• Westerlund T, Pettersson F (1995) An extended cutting plane method for solving convex MINLP problems. Comput. Chemical Engrg. 19(1):131–136.Crossref, Google Scholar