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

New versions and extensions of Benson's outer approximation algorithm forsolving linear vector optimization problems are presented. Primal and dualvariants are provided in which only one scalar linear program has to be solvedin each iteration rather than two or three as in previous versions. Extensionsare given to problems with arbitrary pointed solid polyhedral ordering cones.Numerical examples are provided, one of them involving a new set-valued riskmeasure for multivariate positions.

Benson type algorithms for linear vector optimization and applications