On Selecting a Subset Containing the Alternative with the Largest Priority

DOI10.1177/0008068319940104MaRDI QIDQ4320333zbMATH OpenOpenAlexFDO

Authors Tong-An Hsu

Publication date 12 March 1995

Published in Calcutta Statistical Association Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1177/0008068319940104

zbMATH Keywords

largest prioritymultiple decision problemSaaty's ratio scale methodsubset selection

Mathematics Subject Classification ID

Statistical decision theory (62C99) Statistical ranking and selection procedures (62F07)

Recommendations

• Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria
• Priority algorithms for the subset-sum problem
• Priority Algorithms for the Subset-Sum Problem
• scientific article; zbMATH DE number 3974711
• Selection of a version of priorities as a multicriterion optimization problem
• Finding preferred subsets of Pareto optimal solutions
• Choosing Subsets with Maximum Weighted Average
• Finding the set of alternatives in discrete multicriterion problems
• scientific article; zbMATH DE number 4149833

Cited in

(3)

• A method for selecting a subset of alternatives for future decision making
• Selective priorities in processing of big data
• Testing for the rank ordering of the priorities of the alternatives in Saaty's ratio-scale method

This page was built for publication: On Selecting a Subset Containing the Alternative with the Largest Priority

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