Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems

DOI10.1016/S0377-2217(02)00235-7zbMath1011.90027MaRDI QIDQ1869533

Ignacy Kaliszewski

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

efficiencynonconvex programmingmultiple objective programminglarge-scale modelsinteractive multiple criteria decision making

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Management decision making, including multiple objectives (90B50)

Related Items (3)

Out of the mist -- towards decision-maker-friendly multiple criteria decision making support ⋮ An improved algorithm for solving biobjective integer programs ⋮ Bound sets for biobjective combinatorial optimization problems

Cites Work

• Careful usage of pessimistic values is needed in multiple objectives optimization
• Efficient solutions and bounds on tradeoffs
• Searching for psychologically stable solutions of multiple criteria decision problems
• Using trade-off information in decision-making algorithms
• Proper efficiency and the theory of vector maximization
• An upper bound on properly efficient solutions in multiobjective optimization
• Proper Efficiency in Nonconvex Multicriteria Programming
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• Nonlinear and unconstrained multiple-objective optimization: Algorithm, computation, and application
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• Linear programming with multiple objective functions: Step method (stem)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems