Show simple item record

dc.contributor.authorMonarchi, David Edward, 1944-
dc.date.accessioned2016-09-13T22:21:02Z
dc.date.available2016-09-13T22:21:02Z
dc.date.issued1972-06
dc.identifier.urihttp://hdl.handle.net/10150/620100
dc.description.abstractThis research develops an algorithm for solving a class of multiple objective decision problems. These problems are characterized by continuous policy variables, nonlinear constraints, and nonlinear criterion functions. Our underlying philosophy is that of the Gestalt psychologists-- we cannot separate the problem and its solution from the environment in which the problem is placed. The decision maker is necessarily a part of this environment, thus implying that he, as an individual, must be part of the solution of the problem. Another central assumption in this research is that there is not an "optimal" answer to the problem, only "satisfactory" solutions. The reasons for this are based partly on the insensitivities of the body to minute changes and to the insensitivity of our preferences within certain ranges of acceptance. In addition, we assure that the individual is capable of solving decision situations involving a maximum of about 10 goals and that he operates upon them in some sort of serial manner as he searches for a satisfactory alternative. The serial manner is a reflection of his current ranking of the goals. Based on these assumptions we have developed a cyclical interactive algorithm in which the decision maker guides a search mechanism in attempting to find a satisfactory alternative. Each cycle in the search consists of an optimization phase and an evaluation phase, after which the decision maker can define a new direction of search or terminate the algorithm. The optimization phase is based on a linearization technique which has been quite effective in terms of the problems we have attempted to solve. It is capable of solving general nonlinear programming problems with a large number of nonlinear constraints. Although the constraint set must be convex in order to guarantee the location of a global optimum, we can use the method on concave sets recognizing that we may find only a local optimum. An extensive synthetic case study of a water pollution decision problem with 6 conflicting goals is provided to demonstrate the feasibility of the algorithm. Finally, the limitations of the research are discussed. We tentatively conclude that we have developed a method applicable to our research problem and that the method can be applied to "real world" decision situations.
dc.language.isoen_USen
dc.publisherDepartment of Hydrology and Water Resources, University of Arizona (Tucson, AZ)en
dc.relation.ispartofseriesTechnical Reports on Hydrology and Water Resources, No. 6en
dc.rightsCopyright © Arizona Board of Regentsen
dc.sourceProvided by the Department of Hydrology and Water Resources.en
dc.subjectDecision making -- Mathematical models.en
dc.subjectDigital computer simulation.en
dc.subjectNonlinear programming.en
dc.subjectWater -- Pollution -- Mathematical models.en
dc.titleAN INTERACTIVE ALGORITHM FOR MULTIOBJECTIVE DECISION MAKINGen_US
dc.typetexten
dc.typeTechnical Reporten
dc.contributor.departmentDepartment of Hydrology & Water Resources, The University of Arizonaen
dc.description.collectioninformationThis title from the Hydrology & Water Resources Technical Reports collection is made available by the Department of Hydrology & Atmospheric Sciences and the University Libraries, University of Arizona. If you have questions about titles in this collection, please contact repository@u.library.arizona.edu.en
refterms.dateFOA2018-05-28T13:11:51Z
html.description.abstractThis research develops an algorithm for solving a class of multiple objective decision problems. These problems are characterized by continuous policy variables, nonlinear constraints, and nonlinear criterion functions. Our underlying philosophy is that of the Gestalt psychologists-- we cannot separate the problem and its solution from the environment in which the problem is placed. The decision maker is necessarily a part of this environment, thus implying that he, as an individual, must be part of the solution of the problem. Another central assumption in this research is that there is not an "optimal" answer to the problem, only "satisfactory" solutions. The reasons for this are based partly on the insensitivities of the body to minute changes and to the insensitivity of our preferences within certain ranges of acceptance. In addition, we assure that the individual is capable of solving decision situations involving a maximum of about 10 goals and that he operates upon them in some sort of serial manner as he searches for a satisfactory alternative. The serial manner is a reflection of his current ranking of the goals. Based on these assumptions we have developed a cyclical interactive algorithm in which the decision maker guides a search mechanism in attempting to find a satisfactory alternative. Each cycle in the search consists of an optimization phase and an evaluation phase, after which the decision maker can define a new direction of search or terminate the algorithm. The optimization phase is based on a linearization technique which has been quite effective in terms of the problems we have attempted to solve. It is capable of solving general nonlinear programming problems with a large number of nonlinear constraints. Although the constraint set must be convex in order to guarantee the location of a global optimum, we can use the method on concave sets recognizing that we may find only a local optimum. An extensive synthetic case study of a water pollution decision problem with 6 conflicting goals is provided to demonstrate the feasibility of the algorithm. Finally, the limitations of the research are discussed. We tentatively conclude that we have developed a method applicable to our research problem and that the method can be applied to "real world" decision situations.


Files in this item

Thumbnail
Name:
HWR-1972-006.pdf
Size:
20.18Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record