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

DOI10.1016/0377-2217(91)90086-BzbMATH Open0727.90040OpenAlexW2015841055MaRDI QIDQ804466FDOQ804466

Authors: 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

Recommendations

• Ranking by weighted sum
• scientific article; zbMATH DE number 4041560
• scientific article; zbMATH DE number 3908150
• A non-linear non-weight method for multi-criteria decision making
• Multi-criteria analysis with partial information about the weighting coefficients

zbMATH Keywords

multicriteria analysiscriterion weights

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Cites Work

• Title not available (Why is that?)
• Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804466)