Quantcast

Norm–based approximation in E-[0,1] convex multi-objective programming

Research paper by Tarek Emam, S. I. Ali

Indexed on: 29 Nov '16Published on: 01 Dec '16Published in: CALCOLO



Abstract

This paper addresses the problem of capturing nondominated points on non-convex pareto frontier, which are encountered in E-[0,1] convex multi-objective programming problems. We use E-[0,1] map to transfer non-convex pareto frontier to convex pareto frontier, then An algorithm to find a piecewise linear approximation of the nondominated set of convex pareto frontier are applied. Finally, the inverse map of E-[0,1] is used to get the nondominated set of non-convex pareto frontier. This paper addresses the problem of capturing nondominated points on non-convex pareto frontier, which are encountered in E-[0,1] convex multi-objective programming problems. We use E-[0,1] map to transfer non-convex pareto frontier to convex pareto frontier, then An algorithm to find a piecewise linear approximation of the nondominated set of convex pareto frontier are applied. Finally, the inverse map of E-[0,1] is used to get the nondominated set of non-convex pareto frontier.E-[0,1]E-[0,1]E-[0,1]