This article is an update of an article five of us published in 1992. The areas of Multiple Criteria Decision Making (MCDM) and Multiattribute Utility Theory (MAUT) continue to be active areas of management science research and application. This paper extends the history of these areas and discusses topics we believe to be important for the future of these fields.
Management science and decision science have grown exponentially since midcentury. Two closely-related fields central to this growth are multiple criteria decision making (MCDM) and multiattribute utility theory (MAUT). This paper comments on the history of MCDM and MAUT and discusses topics we believe are important in their continued development and usefulness to management science over the next decade. Our aim is to identify exciting directions and promising areas for future research.decision making, multiattribute, multiple criteria
In this paper a man-machine interactive mathematical programming method is presented for solving the multiple criteria problem involving a single decision maker. It is assumed that all decision-relevant criteria or objective functions are concave functions to be maximized, and that the constraint set is convex. The overall utility function is assumed to be unknown explicitly to the decision maker, but is assumed to be implicitly a linear function, and more generally a concave function of the objective functions. To solve a problem involving multiple objectives the decision maker is requested to provide answers to yes and no questions regarding certain trade offs that he likes or dislikes. Convergence of the method is proved; a numerical example is presented. Tests of the method as well as an extension of the method for solving integer linear programming problems are also described.
An interactive method employing pairwise comparisons of attainable solutions is developed for solving the discrete, deterministic multiple criteria problem assuming a single decision maker who has an implicit quasi-concave increasing utility (or value) function. The method chooses an arbitrary set of positive multipliers to generate a proxy composite linear objective function which is then maximized over the set of solutions. The maximizing solution is compared with several solutions using pairwise judgments asked of the decision maker. Responses are used to eliminate alternatives using convex cones based on expressed preferences, and then a new set of weights is found that satisfies the indicated preferences. The requisite theory and proofs as well as a detailed numerical example are included. In addition, the results of some computational experiments to test the effectiveness of the method are described.decision analysis, utility/preference: multiattribute, programming: multiple criteria, convex cones
This paper presents a class of methods, called constraint proposal methods, for generating Pareto-optimal solutions in two-party negotiations. In these methods joint tangents of the decision makers' value functions are searched by adjusting an artificial plane constraint. The problem of generating Pareto-optimal solutions decomposes into ordinary multiple criteria decision-making problems for the individual decision makers and into a coordination problem for an assisting mediator. Depending on the numerical iteration scheme used to solve the coordination problem, different constraint proposal methods are obtained. We analyze and illustrate the behaviour of some iteration schemes by numerical examples using both precise and imprecise answers from decision makers. An example of a method belonging to the class under study is the RAMONA method, that has been previously described from a practical point of view. We present the underlying theory for it by describing it as a constraint proposal method, and include some applications.negotiation analysis, Pareto optimality, joint problem solving, multiple criteria
In this paper, we develop a Lagrangean relaxation-based heuristic procedure to generate near-optimal solutions to very-large-scale capacitated lot-sizing problems (CLSP) with setup times and limited overtime. Our computational results show that large problems involving several thousand products and several thousand 0/1 integer variables can be solved in a reasonable amount of computer time to within one percent of their optimal solution. The proposed procedure is general enough to be applied directly or with slight modification to real-life production problems.inventory/production, deterministic models, inventory/production, material requirements planning, programming, large scale systems
This paper develops a method for interactive multiple objective linear programming assuming an unknown pseudo concave utility function satisfying certain general properties. The method is an extension of our earlier method published in this journal (Zionts, S., Wallenius, J. 1976. An interactive programming method for solving the multiple criteria problem. Management Sci. 22 (6) 652--663.). Various technical problems present in predecessor versions have been resolved. In addition to presenting the supporting theory and algorithm, we discuss certain options in implementation and summarize our practical experience with several versions of the method.programming: multiple criteria, utility/preference: multi-attribute
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.