Determination of cut-off gradestrategy is one of the most important stages of open pit mine planning and design. It is the parameter directly influencing the financial, technical, economic, legal, environmental, social and political issues in relation to mining operation. Choosing the optimum cut-off grade strategy that maximises the economic outcome has been a major topic of research workers for nearly one century. Many researchers have contributed in devising methods and algorithms, such as dynamic programming, linear programming, optimal control and so on for various aspects of its determination._x000D_
In this paper, a non-linear mathematical programming for cut-off grade strategy optimisation is presented, considering the three main stages of mining operation introduced by K F Lane. In this model maximisation of net present value of mining operation, under the three constraints of mining stages' capacities, considered as the optimisation criteria. Due to the discrete representation of the mining resource, the proposed non-linear formulation is approximated by a non-linear signomial geometric programming. According to non-convexity and the complexity of the proposed model, an augmented Lagrangian genetic algorithm was used to find the optimum cut-off grade strategy under varying and fixed price circumstances. To validate the proposed non-linear model efficiency, the results were compared with the results obtained by the K F Lane methodology. It was found that the proposed non-linear model works efficiently in the determination of cut-off grade strategy. According to the simplicity of the structure of non-linear programming modelling in comparison with dynamic programming it is hoped that, further development of this model would certainly provide the ability of considering managerial and technical flexibilities as well as incorporating more real mining conditions in the determination of cut-off grade strategy optimisation.