A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
From MaRDI portal
Publication:684340
DOI10.1016/0377-2217(93)90013-DzbMath0778.90061OpenAlexW2035951439MaRDI QIDQ684340
Publication date: 15 September 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90013-d
Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal representation of convex polyhedral sets
- Redundant objective functions in linear vector maximum problems and their determination
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Stability of nondominated solutions in multicriteria decision-making
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- Multiple Objective Linear Programming with Interval Criterion Weights
- Identifying Efficient Vectors: Some Theory and Computational Results
- A Tradeoff Cut Approach to Multiple Objective Optimization
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Finding all efficient extreme points for multiple objective linear programs
This page was built for publication: A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
