An elementary proof of Paelinck's theorem on the convex hull of ranked criterion weights

DOI10.1016/0377-2217(91)90086-BzbMath0727.90040OpenAlexW2015841055MaRDI QIDQ804466

M. N. A. J. Claessens, F. J. Vogt, Freerk A. Lootsma

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90086-b

zbMATH Keywords

multicriteria analysiscriterion weights

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Related Items (6)

The SMAA-PROMETHEE method ⋮ Extreme point-based multi-attribute decision analysis with incomplete information ⋮ Multi-criteria analysis with partial information about the weighting coefficients ⋮ Analytical decision rules using importance-ordered criteria with a scale of the first ordinal metric ⋮ Assigning cardinal weights in multi-criteria decision making based on ordinal ranking ⋮ Fuzzy compromise programming with precedence order in the criteria.

Cites Work

• Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An elementary proof of Paelinck's theorem on the convex hull of ranked criterion weights