Show simple item record

dc.contributor.authorLittle, J.
dc.contributor.authorTopal, Erkan
dc.date.accessioned2017-01-30T12:59:24Z
dc.date.available2017-01-30T12:59:24Z
dc.date.created2011-10-16T20:01:16Z
dc.date.issued2011
dc.identifier.citationLittle, Jade and Topal, Erkan. 2011. Strategies to assist in obtaining an optimal solution for an underground mine planning problem using Mixed Integer Programming. International Journal of Mining and Mineral Engineering. 3 (2): pp. 152-172.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/27503
dc.identifier.doi10.1504/IJMME.2011.042429
dc.description.abstract

Mixed Integer Programming (MIP) models are recognised as possessing the ability to optimise underground mine planning. However, MIP's use for optimising underground mine planning has often been restricted to problems of certain sizes and/or simplicity. This is because the number of variables and complex constraints in MIP formulations influences the model's ability to generate optimal results. This paper reviews optimisation studies, focusing on model reduction approaches, which employ MIP techniques for simultaneous optimisation of stope layouts and underground production scheduling. Four theories are presented to reduce the number of variables and complex constraints without comprising its mathematical integrity.

dc.publisherINDERSIENCE
dc.titleStrategies to assist in obtaining an optimal solution for an underground mine planning problem using Mixed Integer Programming
dc.typeJournal Article
dcterms.source.volume3
dcterms.source.number2
dcterms.source.startPage152
dcterms.source.endPage172
dcterms.source.issn1754-8918
dcterms.source.titleInternational Journal of Mining and Mineral Engineering
curtin.departmentWASM Mining Engineering Teaching Area
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record