‎we consider nonconvex vector optimization problems with variable ordering structures in banach spaces‎. ‎under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems‎. ‎using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...

The following two propositions are true: (1) For every sequence s1 of real numbers and for every real number r such that s1 is bounded and 0 ≤ r holds lim inf(r s1) = r · lim inf s1. (2) For every sequence s1 of real numbers and for every real number r such that s1 is bounded and 0 ≤ r holds lim sup(r s1) = r · lim sup s1. Let X be a real Banach space. One can verify that MetricSpaceNormX is co...

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE functions. These new notions are robust in that there are equivalent formulations in terms of (1) Martin-Löf tests, (2) Kolmogorov complexity, and (3)...

A class G of graphs is said to be χ-bounded if there is a function f : N → R such that for all G ∈ G and all induced subgraphs H of G, χ(H) ≤ f(ω(H)). In this paper, we show that if G is a χ-bounded class, then so is the closure of G under any one of the following three operations: substitution, gluing along a clique, and gluing along a bounded number of vertices. Furthermore, if G is χ-bounded...