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

In this study, we propose an effective algorithm for globally solving the sum of linear ratios problems. Firstly, by introducing new variables, we transform the initial problem into an equivalent nonconvex programming problem. Secondly, by utilizing direct relaxation, the linear relaxation programming problem of the equivalent problem can be constructed. Thirdly, in order to improve the computational efficiency of the algorithm, an out space pruning technique is derived, which offers a possibility of pruning a large part of the out space region which does not contain the optimal solution of the equivalent problem. Fourthly, based on out space partition, by combining bounding technique and pruning technique, a new out space branch-and-bound algorithm for globally solving the sum of linear ratios problems (SLRP) is designed. Finally, numerical experimental results are presented to demonstrate both computational efficiency and solution quality of the proposed algorithm

An Effective Algorithm for Globally Solving Sum of Linear Ratios Problems