On estimates for solutions of systems of convex inequalities given point to the Lebesgue
set of
a convex function are obtained and sufficient conditions for
convex The punishing factors for convex pairs are 2n-1 with the
set A(Ω, ∏) of functions f : Ω → ∏ holomorphic on Ω and we prove estimates for |f(n)(z)|, f ∈
A(Ω, Ω
Convex and set-valued analysis of two important parts of contemporary mathematics:
convex and
set-valued analysis. In the first part
Convex Isoquants in DEA Models with Selective ConvexityAbstract: Models with selective
convexity are an important class of data envelopment analysis (DEA
Theorems of the Alternative for Systems of Convex InequalitiesSystems of
convex inequalities in function spaces are considered. Solvability conditions
The punishing factors for convex pairs are 2n-1 with the
set A(Ω, ∏) of functions f : Ω → ∏ holomorphic on Ω and we prove estimates for |f(n)(z)|, f ∈
A(Ω, Ω
On convex closed sets of measurable operatorsWe investigate "operator" intervals of three types and prove some
convexity and closedness theorems
Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets of new efficient optimality conditions without constraint qualifications. Given
a class of
convex SIP