\(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows

DOI10.1007/BF02247962zbMath0694.90092MaRDI QIDQ909586

N. E. Zubov

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

multicriteria optimizationbicriteria linear programming\(\epsilon\)-optimalitybicriteria minimum cost flowpseudopolynomial approximation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Related Items (17)

Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ On several concepts for \(\varepsilon\)-efficiency ⋮ Multiple objective minimum cost flow problems: a review ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ On approximate efficiency in multiobjective programming ⋮ A bicriteria approach to robust optimization ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ Convergence of stochastic search algorithms to finite size Pareto set approximations ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ The convergence rate of the sandwich algorithm for approximating convex functions ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Stochastic convergence of random search methods to fixed size Pareto front approximations ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ How Good is the Chord Algorithm? ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ Approximation methods in multiobjective programming ⋮ On the efficient point set of tricriteria linear programs

Cites Work

• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• An efficient implementation of the network simplex method
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows