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

A primal cutting plane algorithm is proposed for the integer fractional programming problem: n n maximize (cO + L c.x.)/(do + L d.x.J j=l ] ] j=l ] ] n subject to L a .. x. ~ b. , i=1,2,···,m j=l ~J ] ~ x. > 0 , integer, j=1,2,··· ,n ] The algorithm is obtained by slightly modifying Young's simplified primal algorithm developed for the ordinary integer programming problem, and is based on the parametric programming approach to the fractional problem given by Jagannathan and Dinkelbach.

A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS