Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...

In this study, we introduce new generalizations of higher-order type-I functions and pseudo-convexity functions. The application the notion sublinear functionals to these is crucial our main findings. Furthermore, under functions, established studied six types duality models programs for multiple objective nonlinear programming problems. addition, use formulate prove theorems weak duality, stro...