An approximation method for the efficiency set of multiobjective programming problems
From MaRDI portal
Publication:3211123
DOI10.1080/02331939008843621zbMath0722.90066MaRDI 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
90C11: Mixed integer programming
90C29: Multi-objective and goal programming
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems, Solving set-valued optimization problems using a multiobjective approach, Stochastic convergence of random search methods to fixed size Pareto front approximations, Convergence of stochastic search algorithms to finite size Pareto set approximations, On several concepts for \(\varepsilon\)-efficiency, Advancing local search approximations for multiobjective combinatorial optimization problems, Approximation methods in multiobjective programming, An approximation to the nondominated set of a multiobjective linear fractional programming problem
Cites Work