Sign in
Norm-Based Approximation in E-Convex Multi-objective Programming
Journal article

Norm-Based Approximation in E-Convex Multi-objective Programming

Ars combinatoria, Vol.103, pp.161-173
01/01/2012

Abstract

Mathematics Physical Sciences Science & Technology
This paper addresses the problem of capturing nondominated points on non-convex Pareto frontiers, which are encountered in E-convex multiobjective optimization problems. We define nondecreasing map T which transfer non-convex Pareto frontier to convex Pareto frontier. An algorithm to find a piecewise linear approximation of the nondominated set of convex Pareto frontier are applied. Finally, the inverse map of T is used to get non-convex Pareto frontier.

Metrics

1 Record Views

Details