AN Î·-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
In this paper, the so-called Î·-approximation approach is used to obtain the sufficient conditions for a nonlinear multiobjective programming problem with univex functions with respect to the same function Î·. In this method, an equivalent Î·-approximated vector optimization problem is constructed by a modification of both the objective and the constraint functions in the original multiobjective programming problem at the given feasible point. Moreover, to find the optimal solutions of the original multiobjective problem, it sufficies to solve its associated Î·-approximated vector optimization problem. Finally, the description of the Î·-approximation algorithm for solving a nonlinear multiobjective programming problem involving univex functions is presented.
Multiobjective programming, (weak) Pareto optimal point, univex function with respect to Î·, Î¦, and b, Î·-approximated vector optimization problem
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.