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

This paper presents a deterministic global optimization algorithm for solving generalized linear multiplicative programming problem with multiplicative constraints (GLMP). By utilizing equivalent transformation and linear relaxation method, a linear relaxation programming (LRP) of equivalent problem (GLMPH) is established. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems (LRP). Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

A Deterministic Global Optimization Method for Solving Generalized Linear Multiplicative Programming Problem with Multiplicative Constraints