ε-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

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

A bicriteria approach to robust optimization

Computers & OR • 2016
View 3 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Approximation of Convex Curves with Applications to the Bicriterial Minimum Cost Flow Problem

B. Fruhwirth, R. E. Burkard, G. Rote
European J . of Oper . Res . • 1989

An efficient implementation of the network simplex method

M. D. Grigoriadis
Mathematical Programming Study • 1986

A Program for Generating Large Scale Capacitated Assignment , Transportation , and Minimum Cost Flow Problems

D. Klingman, K. Napier, J. Stutz
Management Science • 1974

Approximation of Convex Functions and Applications in Mathematical Programming

R. E. Burkard, H. Hamacher, G. Rote
Report 89 -

Similar Papers

Loading similar papers…