Criteria of saddle points for the general form of vector optimization problem in complex space

Abstract

In this paper, the criteria of the saddle point type for a general form of complex multi-objective programming problems are derived where the objective function of the problem is considered full complex. The criteria with/without differentiability assumptions imposed in the involved functions are developed. It is shown that the efficient solutions can be characterized in terms of saddle points whether the functions are differentiable or not. The obtained theoretical results are generalizations of their real correspondents in
literature and complete the results in complex space.