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

There are different solution concepts for convex vector optimization problems(CVOPs) and a recent one, which is motivated from a set optimization point ofview, consists of finitely many efficient solutions that generate polyhedralinner and outer approximations to the Pareto frontier. A CVOP with compactfeasible region is known to be bounded and there exists a solution of thissense to it. However, it is not known if it is possible to generate polyhedralinner and outer approximations to the Pareto frontier of a CVOP if the feasibleregion is not compact. This study shows that not all CVOPs are tractable inthat sense and gives a characterization of tractable problems in terms of thewell known weighted sum scalarization problems.

Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations