Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
From MaRDI portal
Publication:1737503
DOI10.1016/j.ejor.2019.02.042zbMath1430.90515OpenAlexW2916726515MaRDI QIDQ1737503
Ralph E. Steuer, Craig A. Piercy
Publication date: 23 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.042
multiple objective programmingdistributed processingefficient extreme pointscriterion conesnondominated vertices
Uses Software
Cites Work
- Unnamed Item
- Multiobjective linear and integer programming
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A parametric simplex algorithm for linear vector optimization problems
- Optimization over the efficient set: overview
- A regression study of the number of efficient extreme points in multiple objective linear programming
- A new preference handling technique for interactive multiobjective optimization without trading-off
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Analysis of the objective space in multiple objective linear programming
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Linear multiobjective programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Determination of the efficient set in multiobjective linear programming
- Optimizing a linear function over an efficient set
- Outcome space partition of the weight set in multiobjective linear programming
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- The vector linear program solver Bensolve -- notes on theoretical background
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Optimizing a linear function over an integer efficient set
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead
- 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
- A revised simplex method for linear multiple objective programs
