SOME COMPUTATIONAL EXPERIENCES WITH A MATHEMATICAL PROGRAMMING MODEL FOR OPTIMUM DESIGN OF OPEN PIT ORE MINES.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1967
Accession Number
AD0649539

Entities

People

  • Manfred Meyer

Organizations

  • Carnegie Institute of Technology

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Convex Programming
  • Goal Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Simplex Method
  • Systems Science

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Parallel and Distributed Computing.
  • Theoretical Analysis.