An interactive algorithm for multicriteria decision making: the attainable reference point method
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and HumansPublished 1 May 2001
X.M. Wang, Ze Qin, Yankai Hu
Citations14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An interactive algorithm, the attainable reference point method, is proposed for finding a satisfactory solution to a general multicriteria decision making problem, where the decision-maker is only required to modify the reference value of the satisfactory objectives to generate a new attainablereference point in each iteration step.
Abstract
An interactive algorithm, the attainable reference point method, is proposed for finding a satisfactory solution to a general multicriteria decision making problem. The decision-maker is only required to modify the reference value of the satisfactory objectives to generate a new attainable reference point in each iteration step. The lexicographic weighted Tchebycheff program associated with the attainable reference point is constructed to guarantee the efficiency of all the discussed points. The value of the unsatisfactory objective chosen by the decision-maker is improved to be satisfactory. Thus its reference value does not need to be modified again in later iterations, and a satisfactory solution can be derived in finite steps. A numerical example is presented to demonstrate the feasibility and efficiency of the proposed method.
Keywords
Computer ScienceDecision SciencesEngineering
Multiple Criteria Optimization: Theory, Computation, and Application
3,446 Citations1989Richard Laundy
Mathematical ProgrammingLinear programming with multiple objective functions: Step method (stem)
921 Citations1971R. Benayoun, Jean de Montgolfier +2 more
In this man-model symbiosis, phases of computation alternate with phases of decision, which allows the decision-maker to “learn” to recognize good solutions and the relative importance of the objectives.
Management ScienceAn Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
879 Citations1972Arthur M. Geoffrion, James S. Dyer +1 more
An interactive mathematical programming approach to multi-criterion optimization is developed, and then illustrated by an application to the aggregated operating problem of an academic department.
Lecture notes in economics and mathematical systemsThe Use of Reference Objectives in Multiobjective Optimization
866 Citations1980Andrzej P. Wierzbicki
Any point in the objective space can be used instead of weighting coefficients to derive scalarizing functions which have minima at Pareto points only, and entire basic theory of multiobjective optimization can be developed with the help of reference objectives.
Management ScienceAn Interactive Programming Method for Solving the Multiple Criteria Problem
761 Citations1976Stanley Zionts, Jyrki Wallenius
A man-machine interactive mathematical programming method for solving the multiple criteria problem involving a single decision maker is presented, it is assumed that all decision-relevant criteria or objective functions are concave functions to be maximized, and that the constraint set is convex.
Mathematical ProgrammingAn interactive weighted Tchebycheff procedure for multiple objective programming
705 Citations1983Ralph E. Steuer, Eng Ung Choo
The procedure samples the efficient set by computing the nondominated criterion vector that is closest to an ideal criterion vector according to a randomly weighted Tchebycheff metric.
Management ScienceAn Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
394 Citations1983Stanley Zionts, Jyrki Wallenius
This paper develops a method for interactive multiple objective linear programming assuming an unknown pseudo concave utility function satisfying certain general properties and presents the supporting theory and algorithm.
Management ScienceSolving the Discrete Multiple Criteria Problem using Convex Cones
234 Citations1984Pekka Korhonen, Jyrki Wallenius +1 more
Computers & Operations ResearchInteractive multiple objective optimization: Survey I—continuous case
179 Citations1991Wan Seon Shin, A. Ravindran
The interactive methods developed for solving continuous multiple objective optimization problems and their applications are surveyed, based on the nature of preference assessments, functional assumptions and relationships between the methods.
Lecture notes in economics and mathematical systemsSatisficing Trade-off Method for Multiobjective Programming
164 Citations1984Hirotaka Nakayama, Yoshikazu SAWARAGI
It seems that many of existing interactive optimization methods require too high degree of judgment to decision makers, and too large number of auxiliary optimizations to be applied to practical problem.
Theory of multiobjective optimization
148 Citations1985Sawaragi, Yoshkazu, Nakayam, Hirotaka +1 more
European Journal of Operational ResearchInteractive decision making in fuzzy linear optimization problems
78 Citations1989Heinrich Rommelfanger
An interactive method for solving a (multi-criteria) linear program, where coefficients of the objective functions and/or of the constraints are known exactly but imprecisely and the original fuzzy problem is transformed into a crisp satisfactory model.
European Journal of Operational ResearchInteractive multiobjective decision making by the sequential proxy optimization technique: SPOT
65 Citations1982Masatoshi Sakawa
Journal of the Operational Research SocietyUnified Interactive Multiple Objective Programming: An Open Architecture For Accommodating New Procedures
51 Citations1994Lorraine R. Gardiner, Ralph E. Steuer
This paper shows how four additional procedures can be similarly included in the unified approach and presents a procedure-switching matrix that depicts the possibilities for switching from one procedure to another, one iteration to the next, in the unified algorithm if so directed by a user.
Operations ResearchA Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization
40 Citations1987G. V. Loganathan, Hanif D. Sherali
The proposed algorithm requires no line searches, and generates iterates that are all contained in the efficient frontier, which facilitates the preference judgment of the decision maker, and permits an analyst to terminate short of optimality with an efficient near-optimal solution.
European Journal of Operational ResearchComparative studies in interactive multiple objective mathematical programming
37 Citations1996Yasemin Erkal Aksoy, Timothy W. Butler +1 more
The scope is limited to the comparisons of interactive procedures for solving deterministic, linear, integer or nonlinear constrained multiple objective optimization problems involving a single decision maker.
Journal of the Operational Research SocietyAn Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
31 Citations1978John H. Walker
In this paper, a man-machine interactive method is presented as an aid in solving the bicriterion mathematical programming problem and a numerical example is presented in order to demonstrate its applicability.