Abstract

Recent advances in mathematical optimization have resulted in the development of superior techniques for solving realistic decision making problems. The technique called PARETO OPTIMAL SERIAL DYNAMIC PROGRAMMING is presented here as a tool for rational mine planning. This approach always enables the identification of a set of decision alternatives considered superior to the remaining feasible, usually numerous, decision alternatives, when a number of conflicting, noncommensurable, objectives are simultaneously optimized. It is further noted that the decision makers' truly preferred decision is always one of the members identified as the superior set.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.