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

For the one linear-fractional network programming problem with additional constraints of general kind and with inexact data we constructed a mathematical model for calculation of the new parameters of the restrictions for which the infeasible solution becomes feasible solution. For the selected feasible solution of this problem we minimally changed the parameters in the numerator of the linear-fractional objective function in order that the selected feasible solution has become an optimal. The measure proximity vectors estimated are using the norm l1. That has allowed to remain within the framework of linear programming in solving of inverse problems.

ABOUT ONE INVERSE PROBLEM OF THE LINEAR-FRACTIONAL PROGRAMMING ON GENERALIZED NETWORK