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.
Similar content being viewed by others
References
Jia-Wei, C., Jun, L., Jing-Nan, W.: Optimality conditions and duality for nonsmooth multiobjective optimization problems with cone constraints. Acta Math. Sci. 32(1), 1–12 (2012)
Youness, E.A., Emam, T.: Characterization of efficient solutions of multi-objective optimization problems involving semi-strongly and generalized semi-strongly e-convexity. Acta Math. Sci. 28 B(1), 7–16 (2008)
Schandl, B.: Norms-Based Evaluation and Approximation in Multicriteria Programming, Ph. D. Thesis, Clemson University, Clemson, SC (1999)
Schandl, B., Klamroth, K., Wiecek, M.M.: Norm-based in multicriteria programming. Comput. Math. Appl. 44, 925–942 (2002)
Emam, T.: Norm-based approximationin invex multi-objective programming problems. IJET/IJENS 14(6), 1–5 (2014)
Emam, T.: Optimality for E-[0,1] convex Multi-objective Programming Problems. J. Inequalities Appl. 2015:160
Chankong, V., Haimes, Y.Y.: Multiobjective decision making Theory and methodology. North-Holland, New York (1983)
Youness, E.A., El-Banna, A.Z., Zorba, Sh: E-[0,1] Convex Functions. Il Nuovo Cimento 120(4), 397–406 (2005)
Schandl, B., Klamroth, K., Wiecek, M.M.: Introducing Oblique Norms into Multiple Criteria Programming. J. Glob. Optim. 23, 81–97 (2002)
Pascoletti, A., Serafini, P.: Scalarizing vector optimization problems. J. Optim. Theory Appl. 42, 499–524 (1984)
Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation, and Application. Wiley, New York (1986)
Acknowledgments
We are grateful to everyone, who contributed, in one way or another, to the successful achievement of this paper for their help during the course of this work. Also, we would like to thank UoH to support us.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Emam, T., Ali, S.I. Norm–based approximation in E-[0,1] convex multi-objective programming. Calcolo 53, 723–735 (2016). https://doi.org/10.1007/s10092-015-0170-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10092-015-0170-z