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

Among vector problems, the lexicographic ones constitute a broad significant class of problems of optimization. Lexicographic ordering is applied to establish rules of subordination and priority. Hence, a lot of problems including the ones of complex system optimization, of stochastic programming under a risk, of the dynamic character, etc. may be presented in the form of lexicographic problems of optimization. We have revealed the conditions of existence of solutions of multicriteria of lexicographic optimization problems with an unbounded set of feasible solutions on the basis of applying the properties of a recession cone of a con vex feasible set, the cone which puts it in order lexicographically with respect to optimization criteria. The obtained conditions may be successfully used while developing algorithms for finding the optimal solutions of the mentioned problems of lexicographic optimization. A method of finding the optimal solutions of convex lexico graphic problems with the linear functions of criteria is built and grounded on the basis of ideas of the method of linearization and the Kelley cutting plane method.

Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions