Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming

DOI10.1287/MNSC.35.9.1092zbMATH Open0683.90089OpenAlexW2002772288MaRDI QIDQ4733690FDOQ4733690

Authors:

Publication date: 1989

Published in: Management Science (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 4133856
• Interactive multicriteria linear programming: An extension of the method of Zionts and Wallenius
• Use of Convex Cones in Interactive Multiple Objective Decision Making
• scientific article; zbMATH DE number 2159094
• Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria

zbMATH Keywords

convex conesComputational experiencemulticriteria integer programmingquasiconcave utility functioninteractive branch-and-bound method

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Individual preferences (91B08) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Utility theory (91B16)

Cited In (21)

• An improved algorithm for solving biobjective integer programs
• Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration
• Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
• Title not available (Why is that?)
• An improved interactive hybrid method for the linear multi-objective knapsack problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable preference modeling with ideal-symmetric convex cones
• Multiple criteria decision support -- a review
• Cone contraction and reference point methods for multi-criteria mixed integer optimization
• An interactive algorithm to find the most preferred solution of multi-objective integer programs
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Tradeoff-based decomposition and decision-making in multiobjective programming
• An interactive procedure for multiple objective integer linear programming problems
• CUT: A Multicriteria Approach for Concavifiable Preferences
• A reference direction approach to multiple objective integer linear programming
• A binary integer linear program with multi-criteria and multi-constraint levels
• Integer programming duality in multiple objective programming
• An interactive algorithm for solving multiple objective integer linear programming problems
• An interactive approximation algorithm for multi-objective integer programs
• An interactive procedure using domination cones for bicriterion shortest path problems

This page was built for publication: Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming

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