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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For a given polyhedral convex set-valued mapping we define a polyhedralconvex cone which we call the natural ordering cone. We show that the solutionbehavior of a polyhedral convex set optimization problem can be characterizedby this cone. Under appropriate assumptions the natural ordering cone is provento be the smallest ordering cone which makes a polyhedral convex setoptimization problem solvable.

The natural ordering cone of a polyhedral convex set-valued objective mapping