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

The aim of this study is to find the optimum of a linear fractional functionover the efficient set of a multi-objective linear fractional integer programwithout generating all efficient solutions. By its nature, it is a globaloptimization problem since the efficient set is discrete, hence not convex. Forthis purpose, a branch and bound based method is described with a doublemission to search for an optimal solution for a given linear fractionalfunction which is moreover, efficient for a multi-objective linear fractionalinteger programming problem. Tests performed on instances randomly generated upto 120 variables, 100 constraints and 6 criteria are successful.

Hyperbolic Optimization over the Integer Efficient Set of MOILFP