Representing Partial Information on Preferences with the Help of Linear Transformation of Objective Space

• Autorzy: Dmitry Podkopaev
• Języki publikacji: EN

Abstrakty

EN

We consider the case in which information about preferences in a multiobjective optimization problem is represented in the form of upper bounds on trade-off coefficients, defined for any pair of objective functions. We introduce some requirements for this preference system and derive a system of constraints which should be put on the upper bounds. We use a matrix which elements are numbers inverse to upper bounds on trade-offs as the linear operator for transforming the objective space. The presented constraint system allows for proving that if a given evaluation is weakly Pareto optimal in the transformed space, then in the initial space it is Pareto optimal and satisfies the corresponding bounds on trade-off coefficients.(original abstract)

Słowa kluczowe

EN

Multiple criteria optimization; Decision making; Matrix; Pareto optimality; Solving problems

PL

Optymalizacja wielokryterialna; Podejmowanie decyzji; Macierze; Optimum Pareto; Rozwiązywanie problemów

• Czasopismo: Multiple Criteria Decision Making / University of Economics in Katowice
• Rocznik: 2008
• Tom: 3
• Strony: 175--194

Twórcy

autor

Dmitry Podkopaev

Bibliografia

• Kaliszewski I.: Soft Computing for Complex Multiple Criteria Decision Making. International Series in Operations Research & Management Science. Springer- -Verlag, Berlin 2006.
• Kaliszewski I., Michalowski W.: Efficient Solutions and Bounds on Tradeoffs. "Journal of Optimization Theory and Applications" 1997, 94, pp. 381-394.
• Kaliszewski I., Zionts S.: A Generalization of the Zionts-Wallenius Multiple Criteria Decision Making Algorithm. "Control and Cybernetics" 2004, 33, pp. 477-500.
• Podkopaev D.: An Approach to Finding Trade-Off Solutions by a Linear Transformation of Objective Functions. "Control and Cybernetics" 2007, 36, No. 2.