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, a new concept of generalized convexity is introduced for not necessarily dierentiable vector optimization problems. For an  E -dierentiable function, the concept of  E -invexity is introduced as a generalization of the  E -dierentiable  E -convexity notion. In addition, some properties of  E -dierentiable  E -invex functions are investigated. Furthermore, the so-called  E -Karush-Kuhn-Tucker necessary optimality conditions are established for the considered  E -dierentiable vector optimization problems with both inequality and equality constraints. Also, the suciency of the  E -Karush-Kuhn-Tucker necessary optimality conditions are proved for such  E -dierentiable vector optimization problems in which the involved functions are  E -invex and/or generalized  E -invex.

E-invexity and generalized E-invexity in E-differentiable multiobjective programming