Discrete representation of non-dominated sets in multi-objective linear programming
From MaRDI portal
Publication:1751259
DOI10.1016/J.EJOR.2016.05.001zbMath1394.90519OpenAlexW2399429427MaRDI QIDQ1751259
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/79745/1/RNBIforEJORRevision.pdf
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items (10)
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Multi-criteria optimization and decision-making in radiotherapy ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Uses Software
Cites Work
- Unnamed Item
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- On finding representative non-dominated points for bi-objective integer network flow problems
- Representation of the non-dominated set in biobjective discrete optimization
- Global and well-distributed Pareto frontier by modified normalized normal constraint methods for bicriterion problems
- On the quality of discrete representations in multiple objective programming
- Novel insights for multi-objective optimisation in engineering using normal boundary intersection and (enhanced) normalised normal constraint
- A modified NBI and NC method for the solution of \(N\)-multiobjective optimization problems
- Generating equidistant representations in biobjective programming
- The normalized normal constraint method for generating the Pareto frontier
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Approximation methods in multiobjective programming
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Multicriteria Optimization
- Mathematical optimization in intensity modulated radiation therapy
- Approximation of geometric dispersion problems
This page was built for publication: Discrete representation of non-dominated sets in multi-objective linear programming
