Discrete representation of non-dominated sets in multi-objective linear programming
type: Item
instance of: scholarly article
title: Discrete representation of non-dominated sets in multi-objective linear programming
zbMATH Open document ID: 1394.90519
author: Lizhen Shao
author: Matthias Ehrgott
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
full work available at URL: RNBIforEJORRevision.pdf
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6872156
zbMATH Keywords: multi-objective optimisation
zbMATH Keywords: linear programming
zbMATH Keywords: non-dominated set
zbMATH Keywords: discrete representation
describes a project that uses: NBI
MaRDI profile type: Publication
OpenAlex ID: W2399429427
cites work: Approximation of geometric dispersion problems
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: Towards finding global representations of the efficient set in multiple objective mathematical programming
cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
cites work: Multicriteria Optimization
cites work: Mathematical optimization in intensity modulated radiation therapy
cites work: On finding representative non-dominated points for bi-objective integer network flow problems
cites work: On the quality of discrete representations in multiple objective programming
cites work: Generating equidistant representations in biobjective programming
cites work: Multiple criteria decision analysis. State of the art surveys. In 2 volumes
cites work: Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
cites work: Novel insights for multi-objective optimisation in engineering using normal boundary intersection and (enhanced) normalised normal constraint
cites work: Global and well-distributed Pareto frontier by modified normalized normal constraint methods for bicriterion problems
cites work: The normalized normal constraint method for generating the Pareto frontier
cites work: A modified NBI and NC method for the solution of \(N\)-multiobjective optimization problems
cites work: A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
cites work: Connectedness of the set of nondominated outcomes in multicriteria optimization
cites work: Q5638112
cites work: Approximation methods in multiobjective programming
cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
cites work: A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
cites work: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
cites work: Representation of the non-dominated set in biobjective discrete optimization
cites work: The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
DOI: 10.1016/J.EJOR.2016.05.001
description: scientific article; zbMATH DE number 6872156