An interval version of separation by semispaces in max-min convexity
classification
🧮 math.MG
keywords
separationmax-minconvexconditionintervalsemispaceboxescase
read the original abstract
We study separation of a closed box from a max-min convex set by max-min semispace. This can be regarded as an interval extension of known separation results. We give a constructive proof of the separation in the case when the box and the max-min convex set satisfy certain condition, and we show that separation is never possible if this condition does not hold. We also study separation of max-min convex sets by boxes and by box and semispace.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.