An approximation method for the efficiency set of multiobjective programming problems

DOI10.1080/02331939008843621zbMath0722.90066OpenAlexW2089595094MaRDI QIDQ3211123

No author found.

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843621

zbMATH Keywords

dual simplex methodvector minimization\(\epsilon \) -approximationefficiency set

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Solving set-valued optimization problems using a multiobjective approach ⋮ Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ On several concepts for \(\varepsilon\)-efficiency ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Convergence of stochastic search algorithms to finite size Pareto set approximations ⋮ Stochastic convergence of random search methods to fixed size Pareto front approximations ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ Approximation methods in multiobjective programming

Cites Work

• \(\epsilon\)-solutions in vector minimization problems
• Proper efficiency and the theory of vector maximization
• Efficiency in multiple objective optimization problems

This page was built for publication: An approximation method for the efficiency set of multiobjective programming problems