Multiobjective optimization problems with modified objective functions and cone constraints and applications

摘要

In this paper, we consider a differentiable multiobjective optimization problem with generalized cone constraints (for short, MOP). We investigate the relationship between weakly efficient solutions for (MOP) and for the multiobjective optimization problem with the modified objective function and cone constraints [for short, (MOP),, (x)] and saddle points for the Lagrange function of (MOP)_η(x) involving cone invex functions under some suitable assumptions. We also prove the existence of weakly efficient solutions for (MOP) and saddle points for Lagrange function of (MOP)_η(x) by using the Karush-Kuhn-Tucker type opti-mality conditions under generalized convexity functions. As an application, we investigate a multiobjective fractional programming problem by using the modified objective function method.