Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
From MaRDI portal
Publication:1737503
Recommendations
- scientific article; zbMATH DE number 1530366
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- Determination of the efficient set in multiobjective linear programming
- Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
- An approach for finding efficient points in multiobjective linear programming
Cites work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A new preference handling technique for interactive multiobjective optimization without trading-off
- A parametric simplex algorithm for linear vector optimization problems
- A regression study of the number of efficient extreme points in multiple objective linear programming
- A revised simplex method for linear multiple objective programs
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Analysis of the objective space in multiple objective linear programming
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Determination of the efficient set in multiobjective linear programming
- Finding all efficient extreme points for multiple objective linear programs
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- Linear multiobjective programming
- Multiobjective linear and integer programming
- Multiple criteria decision making, multiattribute utility theory: recent accomplishments and what lies ahead
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Optimization over the efficient set: overview
- Optimizing a linear function over an efficient set
- Optimizing a linear function over an integer efficient set
- Outcome space partition of the weight set in multiobjective linear programming
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
Cited in
(1)
This page was built for publication: Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737503)
