English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

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