Finding representative systems for discrete bicriterion optimization problems

Authors:
Horst W. Hamacher;Christian Roed Pedersen;Stefan Ruzika
Affiliations:
Fachbereich Mathematik, Universität Kaiserslautern, Postfach 3049, Kaiserslautern, Germany;Department of Operations Research, University of Aarhus, Aarhus, Denmark;Fachbereich Mathematik, Universität Kaiserslautern, Postfach 3049, Kaiserslautern, Germany
Venue:
Operations Research Letters
Year:
2007

Citing 3
Cited 4

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Multicriteria Optimization

Multicriteria Optimization
The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm

Management Science

Constrained optimization using multiple objective programming

Journal of Global Optimization
Equity portfolio construction and selection using multiobjective mathematical programming

Journal of Global Optimization
Finding Efficient Solutions by Free Disposal Outer Approximation

SIAM Journal on Optimization
Generating equidistant representations in biobjective programming

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a discrete bicriterion optimization problem, we propose two box algorithms to compute a finite representative system for the non-dominated set satisfying a number of quality features. Its cardinality N and the accuracy @D satisfy the relation O(A/@D), where A is the area of a starting box defined by the ideal and the nadir point.