Some Computational Experiences with a Mathematical Programming Model for Optimum Design of Open Pit Ore Mines

摘要

Some computational aspects of the Mathematical Programming Model for Optimum Design of Open Pit Ore Mines which has been described in Management Sciences Research Report No. 92 are explored. A small pilot problem reveals the possibilities for finding a removed extreme point which always allows for straightforward use of the simplex method in order to reach the global optimum of the one ore vein problem. It is further shown that the capacity restricted case and the multi vein case can be handled by introducing restrictions of the kind used in Goal Programming. (Author)