Lexicographic problems of convex optimization: solvability and optimali-ty conditions, cutting plane method
Saved in:
Date: | 2021 |
---|---|
Main Authors: | N. V. Semenova, M. M. Lomaga, V. V. Semenov |
Format: | Article |
Language: | English |
Published: |
2021
|
Series: | International Scientific Technical Journal «Problems of Control and Informatics» |
Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001241581 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions
by: N. V. Semenova, et al.
Published: (2020) -
Cutting plane method for solving the problem in the best sense of the family of convex Lipschitz functions of uniform approximation of continuous display compact-dimensional subspace
by: V. O. Hnatiuk, et al.
Published: (2014) -
Direct cutting-out method in plane problems of elasticity theory
by: K. V. Vasiliev, et al.
Published: (2017) -
Conditions of pareto-optimal vector problem solvability
by: T. I. Sergienko
Published: (2015) -
Properties of Euclidean Problems of Lexicographic Combinatorial Optimization on Arrangements
by: T. M. Barbolina
Published: (2019)