scientific article; zbMATH DE number 3856799
[For the entire collection see Zbl 0528.00011.] This paper describes nine multi-objective methods based on a combination of mathematical programming and interactions with the decision maker. The methods use information acquired from the decision maker on preferences between pairs of actions presented to a decision maker up to a given stage to produce surrogate optimization or efficient set problems, which are then used further to explore the action space, with the procedures repeated until optimal or acceptable solutions are obtained. The method of Dyer, Feinberg and Geoffrion assumes a convex compact action space, a concave and continuously differentiable value function, unknown explicitly, but governing the decision maker's responses. The surrogate optimization problem is the linear approximation at the current point. The method produces a sequence of improving actions, and limit points of sequences are optimal. The method of the author assumes a compact action space and continuous objective functions, with a linear value function, unknown explicitly, but governing the decision maker's responses. At each stage the surrogate optimization problem selects the next action to include, and the process stops at an optimal solution when the optimization index is zero. The information gained on preferences at each stage is used to determine the region of weighting factors consistent with preferences to date. Certain convergence results are presented. The remaining seven methods are those of Wallenius and Zionts, (with assumptions as for the author's method, but with the feasible action space being a polytope, and linear objective functions, and uses a vertex search procedure), Steuer (with assumptions as for Wallenius and Zionts, but with initial bounds on the weight factors, and with the conversion of the initial optimization problem into an efficient solution search problem), Gabbani and Magazine (with the same assumptions as for Wallenius and Zionts, but with integer restrictions, and using a simplicial generation procedure to restrict the feasible region of weighting factors), Morris and Oren (with polyhedral objective function space, continuous objective functions, and a quasi concave value function, and which allows the decision maker to move outside the feasible action space to provide useful information), Marcotte and Soland (which deals with finite action spaces, and introduces a type of branch and bound procedure), Stewart (which deals with finite action spaces, and a class of utility functions, with unknown parameter, subject to Bayesian updating on its likelihood function), and finally, Yu (who uses domination cone ideas, with the decision maker having an unknown, but implicit, domination cone governing his partial ordering of actions).
- An interactive method for multiple-objective mathematical programming problems
- scientific article; zbMATH DE number 3928712
- An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
- scientific article; zbMATH DE number 4156213
- Interactive multiple objective optimization: Survey. I: Continuous case
- Conjoint measurement in multiple objective decision making: A new approach
- The interface with decision makers and some experimental results in interactive multiple objective programming methods
- Multiplicative decision rules for multiobjective decision problems
- A comparative multiobjective programming study
- On the convergence of reference point methods in multiobjective programming
- Using weighting vectors to solve multiple attribute problems: A framework
- A Markovian process in interactive multiobjective decision-making
- Global optimization in practice: An application to interactive multiple objective linear programming
- An interactive approximation algorithm for multi-objective integer programs
- The compromise hypersphere for multiobjective linear programming
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
- An interactive multiobjective programming approach to combinatorial data analysis
- scientific article; zbMATH DE number 3845361 (Why is no real title available?)
- scientific article; zbMATH DE number 3860882 (Why is no real title available?)
- scientific article; zbMATH DE number 3860902 (Why is no real title available?)
- scientific article; zbMATH DE number 3869051 (Why is no real title available?)
- The multiobjective multistage impact analysis method: Theoretical basis
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- scientific article; zbMATH DE number 4204104 (Why is no real title available?)
- Interactive Multiobjective Optimization Under Uncertainty
- scientific article; zbMATH DE number 4156213 (Why is no real title available?)
- scientific article; zbMATH DE number 4164568 (Why is no real title available?)
- scientific article; zbMATH DE number 3924497 (Why is no real title available?)
- scientific article; zbMATH DE number 3930706 (Why is no real title available?)
- scientific article; zbMATH DE number 3928712 (Why is no real title available?)
- scientific article; zbMATH DE number 3970504 (Why is no real title available?)
- scientific article; zbMATH DE number 3974714 (Why is no real title available?)
- scientific article; zbMATH DE number 3976761 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- Interactive Compromise Programming
- scientific article; zbMATH DE number 956509 (Why is no real title available?)
- scientific article; zbMATH DE number 19069 (Why is no real title available?)
- Soviet multi-objective programming methods: An overview
- Interactive multiobjective optimization based on ordinal regression
- Multiobjective linear programming with context-dependent preferences
- scientific article; zbMATH DE number 4114360 (Why is no real title available?)
- Multiple choice programming: A state-of-the-art review
- Interactive multiple criteria decision making for large-scale multi-objective optimization problems
- An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
- Interactive methods
- Interactive multiple objective optimization: Survey. I: Continuous case
- A multiple objective interactive Lagrangean relaxation approach
- Constrained optimization using multiple objective programming
- An interactive method for multiple-objective mathematical programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325435)