作者: B. Malakooti
DOI: 10.1109/21.31039
关键词:
摘要: An interactive approach is developed to help decision-makers (DMs) find the best alternatives with few questions without making stringent assumptions about their behavior. Theories and procedures are for ranking eliminating suboptimal ones, assuming that DM can respond tradeoff- paired-comparison questions. It assumed wishes maximize an unknown quasiconcave utility function discrete multiple-criteria decision-making (MCDM) problems. Several tests based on convex dominating cones. Optimality conditions MCDM problems given extreme, nonextreme, convex-dominated points requiring enumerate remaining set of alternatives. These optimality a branching technique which converts nonextreme extreme points. This substantially reduces number asked DM. Finally, exact method developed. >