Solving multiple criteria problems by interactive decomposition

DOI10.1007/BF01580884zbMath0599.90115MaRDI QIDQ3735500

Rafael Lazimy

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

interactive methodbicriterion subproblemsinteractive decompositionlinearly constrained multiple criteria optimizationpreference assessments

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items

ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ Algebra of efficient sets for multiobjective complex systems ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ A comparative study of interactive tradeoff cutting plane methods for MOMP ⋮ The interface between OR/MS and decision theory ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Goal programming and multiple objective optimizations. Part I
• Symmetric dual nonlinear programs
• Generalized Benders decomposition
• A duality theorem for non-linear programming
• Multi-Objective Interactive Programming
• A dual differentiable exact penalty function
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management
• A Proxy Approach to Multi-Attribute Decision Making
• Linear programming with multiple objective functions: Step method (stem)
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• Problems and methods with multiple objective functions
• A Time-Sharing Computer Program for the Solution of the Multiple Criteria Problem