Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making

Authors:
Esra Karasakal;Murat Köksalan
Affiliations:
Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey;Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey
Venue:
Operations Research
Year:
2009

Citing 11
Cited 2

Determination of the efficient set in multiobjective linear programming

Journal of Optimization Theory and Applications
Random problem generation and the computation of efficient extreme points in multiple objective linear programming

Computational Optimization and Applications - Special issue dedicated to George Dantzig
Interactive approaches for discrete alternative multiple criteria decision making with monotone utility functions

Management Science
Hybrid approach for solving multiple-objective linear programs in outcome space

Journal of Optimization Theory and Applications
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Why Quality Assessment Of Multiobjective Optimizers Is Difficult

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors

Operations Research
Minimal sets of quality metrics

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
The measure of Pareto optima applications to multi-objective metaheuristics

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

Operations Research Letters

Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets

INFORMS Journal on Computing
Generating equidistant representations in biobjective programming

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we address the problem of generating a discrete representation of the nondominated frontier in multiple objective linear problems. We find a surface that approximates the shape of the nondominated frontier. Utilizing the surface, we generate a set of discrete points that is representative of the frontier. Our experience on randomly generated problems demonstrates that the approach performs well in terms of both the quality of the representation and the computation time.