Use of Convex Cones in Interactive Multiple Objective Decision Making

DOI10.1287/MNSC.43.5.723MaRDI QIDQ4356652zbMATH OpenOpenAlexFDO

Authors Srinivas Y. Prasad, Mark H. Karwan, Stanley Zionts

Publication date 22 June 1998

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.43.5.723

zbMATH Keywords

interactive proceduresmultiple criteria decision makingpreference representation

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 4133856
• Convex preference cone-based approach for many objective optimization problems
• Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
• A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
• Cone contraction method with visual interaction for multiple‐objective non‐linear programmes

Cited in

(15)

• Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
• Testing the efficiency of two pairwise comparison methods in discrete multiple criteria problems
• Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems
• Convex preference cone-based approach for many objective optimization problems
• scientific article; zbMATH DE number 4133856 (Why is no real title available?)
• scientific article; zbMATH DE number 2159094 (Why is no real title available?)
• Dual cone approach to convex-cone dominance in multiple criteria decision making
• Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
• An interactive algorithm to find the most preferred solution of multi-objective integer programs
• Cone contraction and reference point methods for multi-criteria mixed integer optimization
• Tradeoff-based decomposition and decision-making in multiobjective programming
• The use of quasi-concave value functions in MCDM: some theoretical results
• CUT: A Multicriteria Approach for Concavifiable Preferences
• Graphically structured value-function compilation
• An interactive approximation algorithm for multi-objective integer programs

This page was built for publication: Use of Convex Cones in Interactive Multiple Objective Decision Making

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