Thesis (M.A.I.S.)--Oregon State University, 2004. / Typescript (photocopy). Includes bibliographical references (leaves 116-125). Also available online.

The 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.