ε-Optimality for bicriteria programs and its application to minimum cost flows

@article{Ruhe1990OptimalityFB,
title={ε-Optimality for bicriteria programs and its application to minimum cost flows},
author={G{\"u}nther Ruhe and Bernd Fruhwirth},
journal={Computing},
year={1990},
volume={44},
pages={21-34}
}

A subsetS⊂X of feasible solutions of a multicriteria optimization problem is called ε-optimal w.r.t. a vector-valued functionf:X→Y $$ \subseteq $$ ℝ K if for allx∈X there is a solutionz x∈S so thatf k(z x)≤(1+ε)f k (x) for allk=1,...,K. For a given accuracy ε>0, a pseudopolynomial approximation algorithm for bicriteria linear programming using the lower and upper approximation of the optimal value function is given. Numerical results for the bicriteria minimum cost flow problem on NETGEN… CONTINUE READING