An approximation method for the efficiency set of multiobjective programming problems

DOI10.1080/02331939008843621MaRDI QIDQ3211123zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• Publication:4733686
• On approximate efficiency in multiobjective programming
• Exact generation of epsilon-efficient solutions in multiple objective programming
• APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
• Approximation methods in multiobjective programming

Cites work

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

Cited in

(17)

• An approximation algorithm for multi-objective optimization problems using a box-coverage
• Computational study of the relationships between feasible and efficient sets and an approximation
• Exact generation of epsilon-efficient solutions in multiple objective programming
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
• 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
• Convergence of stochastic search algorithms to finite size Pareto set approximations
• Advancing local search approximations for multiobjective combinatorial optimization problems
• On several concepts for \(\varepsilon\)-efficiency
• Solving set-valued optimization problems using a multiobjective approach
• Joint efficient ordering method for group multiobjective programming
• -optimality for bicriteria programs and its application to minimum cost flows
• An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
• Approximation methods in multiobjective programming
• scientific article; zbMATH DE number 4119963 (Why is no real title available?)
• scientific article; zbMATH DE number 2067011 (Why is no real title available?)
• scientific article; zbMATH DE number 6612741 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211123)