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, we are interested in deriving the sufficient and necessary conditions for an optimal solution of special classes of programming problems. These classes involve generalized E-[0,1]$E\mbox{-}[0,1]$ convex functions. The characterization of efficient solutions for E-[0,1]$E\mbox{-}[0,1]$ convex multi-objective programming problems is obtained. Finally, sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are derived.

Optimality for E - [ 0 , 1 ] convex multi-objective programming problems