Show simple item record

dc.contributor.advisorDuckstein, Lucienen_US
dc.contributor.authorGershon, Mark Elliot
dc.creatorGershon, Mark Ellioten_US
dc.date.accessioned2013-04-18T09:22:34Z
dc.date.available2013-04-18T09:22:34Z
dc.date.issued1981en_US
dc.identifier.urihttp://hdl.handle.net/10150/281947
dc.description.abstractThe problem of model choice in multiobjective decision making, that is, the selection of the appropriate multiobjective solution technique to solve an arbitrary multiobjective decision problem, is considered. Classifications of the available techniques are discussed, leading to the development of a set of 27 model choice criteria and an algorithm for model choice. This algorithm divides the criteria into four groups, only one of which must be reevaluated for each decision problem encountered. Through the evaluation of the available multiobjective techniques with respect to each of the model choice criteria, the model choice problem is modeled as a multiobjective decision problem. Compromise programming is then used to select the appropriate technique for implementation. Two case studies are presented to demonstrate the use of this algorithm. The first is a river basin planning problem where a pre-defined set of alternatives is to be ranked with respect to a set of criteria, some of which cannot be quantified. The second is a coal blending problem modeled as a mathematical programming problem with two linear objective functions and a set of linear constraints. An appropriate multiobjective solution technique is selected for each of these case studies. In addition, an approach for the solution of dynamic multiobjective problems, one area where solution techniques are not available, is presented. This approach, known as dynamic compromise programming, essentially transforms a multiobjective dynamic programming problem into a classical dynamic programming problem of higher dimension. A dynamic programming problem, modeled in terms of three objectives, is used to demonstrate an application of this technique.
dc.language.isoen_USen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectDecision making -- Mathematical models.en_US
dc.subjectNatural resources -- Decision making.en_US
dc.titleMODEL CHOICE IN MULTIOBJECTIVE DECISION-MAKING IN NATURAL RESOURCE SYSTEMSen_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.identifier.oclc8699989en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.identifier.proquest8116693en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.namePh.D.en_US
dc.identifier.bibrecord.b1391084xen_US
refterms.dateFOA2018-09-12T12:24:08Z
html.description.abstractThe problem of model choice in multiobjective decision making, that is, the selection of the appropriate multiobjective solution technique to solve an arbitrary multiobjective decision problem, is considered. Classifications of the available techniques are discussed, leading to the development of a set of 27 model choice criteria and an algorithm for model choice. This algorithm divides the criteria into four groups, only one of which must be reevaluated for each decision problem encountered. Through the evaluation of the available multiobjective techniques with respect to each of the model choice criteria, the model choice problem is modeled as a multiobjective decision problem. Compromise programming is then used to select the appropriate technique for implementation. Two case studies are presented to demonstrate the use of this algorithm. The first is a river basin planning problem where a pre-defined set of alternatives is to be ranked with respect to a set of criteria, some of which cannot be quantified. The second is a coal blending problem modeled as a mathematical programming problem with two linear objective functions and a set of linear constraints. An appropriate multiobjective solution technique is selected for each of these case studies. In addition, an approach for the solution of dynamic multiobjective problems, one area where solution techniques are not available, is presented. This approach, known as dynamic compromise programming, essentially transforms a multiobjective dynamic programming problem into a classical dynamic programming problem of higher dimension. A dynamic programming problem, modeled in terms of three objectives, is used to demonstrate an application of this technique.


Files in this item

Thumbnail
Name:
azu_td_8116693_sip1_m.pdf
Size:
4.714Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record