A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
From MaRDI portal
Publication:3635203
DOI10.1287/opre.51.3.427.14951zbMath1163.90741OpenAlexW1976632410MaRDI QIDQ3635203
Publication date: 5 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.51.3.427.14951
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (19)
Bi-objective robust optimisation ⋮ Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ On the quality of discrete representations in multiple objective programming ⋮ Computing representations using hypervolume scalarizations ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Generating equidistant representations in biobjective programming ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Fair resource allocation: using welfare-based dominance constraints ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ An a posteriori decision support methodology for solving the multi-criteria supplier selection problem ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level ⋮ Approximation methods in multiobjective programming
This page was built for publication: A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
