Norm-Based Approximation in Bicriteria Programming

Authors:
Bernd Schandl;Kathrin Klamroth;Margaret M. Wiecek
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, USA;Department of Computer Science and Mathematics, University of Applied Sciences Dresden, Dresden, Germany;Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, USA
Venue:
Computational Optimization and Applications
Year:
2001

Citing 2
Cited 3

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

Operations Research
Reference point approximation method for the solution of bicriterial nonlinear optimization problems

Journal of Optimization Theory and Applications

Introducing oblique norms into multiple criteria programming

Journal of Global Optimization
Constrained optimization using multiple objective programming

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

SIAM Journal on Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

An algorithm to approximate the nondominated set of continuous and discrete bicriteria programs is proposed. The algorithm employs block norms to find an approximation and evaluate its quality. By automatically adapting to the problem's structure and scaling, the approximation is constructed objectively without interaction with the decision maker. Mathematical and practical examples are included.