Cover Image

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

Saved in:

Bibliographic Details
Date:	2020
Main Authors:	N. V. Semenova, M. M. Lomaha, V. V. Semenov
Format:	Article
Language:	English
Published:	2020
Series:	Reports of the National Academy of Sciences of Ukraine
Online Access:	http://jnas.nbuv.gov.ua/article/UJRN-0001178675
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 | LibNAS

Similar Items

Lexicographic problems of convex optimization: solvability and optimali-ty conditions, cutting plane method
by: N. V. Semenova, et al.
Published: (2021)

Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
by: O. A. Emets, et al.
Published: (2017)

Probalistic-gradient method for solving certain problems convex optimization
by: A. F. Godonoga, et al.
Published: (2014)

An attempt to solve one lexicographic riddle
by: V. B. Zadorozhnyi
Published: (2014)

On method of solving the problem of convex programming
by: E. I. Nenakhov
Published: (2018)

Linearly convex and conjugated functions in hypercomplex space
by: M. V. Stefanchuk, et al.
Published: (2015)

An additive algorithm for solving vector linear optimization problem with boole variables
by: N. V. Semenova, et al.
Published: (2018)

On some criteria of convexity for compact sets
by: Vyhovs'ka, I. Yu., et al.
Published: (2011)

The existence and stability of relativistic shock waves: general criteria and numerical simulations for a non-convex equation of state
by: Tytarenko, P.V., et al.
Published: (1998)

Symmetric duality for lexicographic problems of linear programming
by: Eremin , I. I., et al.
Published: (1992)

Structural and stochastic properties of the lexicographic search algorithm for solution of a discrete optimization problem
by: S. V. Chupov
Published: (2016)

Extreme Sequence Criteria for the Problem of the Best in the Sense of the Convex Function of the Approximation of a Fixed Element by a Convex Set
by: U. V. Hudyma, et al.
Published: (2017)

New approaches to solving discrete programming problems based on lexicographic search
by: S. V. Chupov
Published: (2016)

Algorithm Solving the Problem of Optimal Function by Method of Branch and Bound
by: M. V. Leonova
Published: (2013)

Properties of Euclidean Problems of Lexicographic Combinatorial Optimization on Arrangements
by: T. M. Barbolina
Published: (2019)

A software complex for solving the multi-criteria optimization problem with stochastic constraints
by: L. M. Bogdanova, et al.
Published: (2018)

Algorithm for solving two-criteria problem of optimal portfolio of risky as-sets
by: F. G. Garashchenko, et al.
Published: (2018)

Classification of sets by the method of convex hulls linear separation
by: M. A. Ivanchuk
Published: (2015)

Criteria for the existence of an isolated solution of a nonlinear boundary-value problem
by: D. S. Dzhumabaev, et al.
Published: (2018)

Optimizations Methods for Solving Linear Systems Ax=b with Ill-conditioned Matrices
by: V. S. Abramchuk, et al.
Published: (2017)

Criteria for the existence of an isolated solution of a nonlinear boundary-value problem
by: Dzhumabaev, D. S., et al.
Published: (2018)

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A. V., et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A. V., et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: A. V. Pankratov, et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A.V., et al.
Published: (2015)

Properties of Euclidean Problems of Lexicographic Combinatorial Optimization on Arrangements
by: Барболіна, Тетяна Миколаївна
Published: (2019)

Methods for Solving One Type of Linear Integro-Functional Equation
by: Геселева, Катерина
Published: (2023)

Polynomial method of solving unconditional linear fractional problem of combinatorial optimization on arrangements
by: O. A. Emets, et al.
Published: (2017)

Hypercomplex method for solving linear PDEs
by: V. S. Shpakivskyi
Published: (2018)

Method of solving the problem of conditional optimization on a combinatorial set of arrangements
by: L. N. Kolechkina, et al.
Published: (2019)

The method optimization of linear function on combinatorial set of permutation
by: H. P. Donets, et al.
Published: (2018)

On Locally Linearly Convex Domains
by: Zelinskii, Yu. B., et al.
Published: (2002)

Optimization of linear dynamic systems by methods of functional analysis
by: A. A. Stenin, et al.
Published: (2019)

Stability and regularization of vector optimization problems with possible perturbations of criteria
by: T. T. Lebiedieva, et al.
Published: (2022)

On linearly convex domains with smooth boundaries
by: Mel’nik, V. L., et al.
Published: (1997)

Linearly convex domains with singularities on the boundary
by: Mel’nik, V. L., et al.
Published: (2000)

Klee Theorem for Linearly Convex Sets
by: Momot, I. V., et al.
Published: (2002)

Lexicographically ordered permutations
by: S. V. Chupov
Published: (2016)

Solving the Multi-Criteria Optimization Task of Efficiency of Enterprise&#039;s Performance with Use of the Genetic Algorithm
by: L. M. Maliarets, et al.
Published: (2017)

Conditions for the existence of basic solutions of linear multivalued differential equations
by: T. O. Komlieva, et al.
Published: (2021)