Norm-based approximation in E-convex multi-objective programming
From MaRDI portal
Norm-based approximation in \(E\)-convex multi-objective programming
Recommendations
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- An approximation algorithm for convex multi-objective programming problems
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- Approximation of multi-dimensional Edgeworth-Pareto hull in non-linear multi-objective problems
- Convexification of a noninferior frontier
Cited in
(13)- Exponential transformation in convexifying a noninferior frontier and exponential generating method
- A Benson type algorithm for nonconvex multiobjective programming problems
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
- Approximation of multi-dimensional Edgeworth-Pareto hull in non-linear multi-objective problems
- An approximation algorithm for convex multi-objective programming problems
- Convexification of a noninferior frontier
- Norm-based approximation in bicriteria programming
- 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
- Logarithmic E-convex multi-objective programming
- A combined interactive approach for solving E-convex multiobjective nonlinear programming problem
This page was built for publication: Norm-based approximation in \(E\)-convex multi-objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897475)
