An algorithm for approximating nondominated points of convex multiobjective optimization problems

MaRDI QIDQ4613616zbMATH OpenFDO

Authors Zohre Azizi, M. Ghaznavi

Publication date 24 January 2019

Full work available at URL http://bims.iranjournals.ir/article_1032.html

zbMATH Keywords

approximation algorithmconvexityefficient solutionmultiobjective optimizationnondominated pointdifferentiable problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• An approximation algorithm for convex multi-objective programming problems
• A Benson type algorithm for nonconvex multiobjective programming problems
• Norm-based approximation in \(E\)-convex multi-objective programming
• Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
• Finding non dominated points for multiobjective integer convex programs with linear constraints

Cited in

(17)

• An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
• A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem
• Approximating the nondominated set of an MOLP by approximately solving its dual problem
• An approximation algorithm for multiobjective mixed-integer convex optimization
• A norm minimization-based convex vector optimization algorithm
• A Benson type algorithm for nonconvex multiobjective programming problems
• On the number of non-dominated points of a multicriteria optimization problem
• An approximation algorithm for convex multi-objective programming problems
• Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
• scientific article; zbMATH DE number 5630417 (Why is no real title available?)
• The modified objective-constraint scalarization approach for multiobjective optimization problems
• Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
• Norm-based approximation in \(E\)-convex multi-objective programming
• Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets
• A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems
• A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems

This page was built for publication: An algorithm for approximating nondominated points of convex multiobjective optimization problems

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