On the topological properties of the attainability set of linear systems the controls u take values in a
convex closed finitely generated cone K. Sufficient conditions for openness
More accurate classes of jensen–type inequalities for convex and operator convex functions-adjoint operators. The first class refers to a usual
convexity, while the second one deals with the operator
A Subgradient Projection Method for Set-Valued Network Equilibrium ProblemsIn the present work, we describe a general
set-valued variant of the network equilibrium problem
One algorithm for branch and bound method for solving concave optimization problem the necessary and sufficient conditions of optimum for the original problem and for a
convex programming problem
Sharp Hardy type inequalities with weights depending on bessel function these inequalities for the case of
convex domains with a finite inner radius. The proved statements
The lagrange multiplier technique for variational inequalitiesFor variational inequalities with the feasible
set given by linear or nonlinear
convex constraints
Some Generalizations of the Shadow Problem in the Lobachevsky Space as the problem of finding conditions guaranteeing that points belong to the generalized
convex hull of a family