Maximal Separation Theorems for Convex Sets.

Victor Klee

ResearchPublished 1967

Most previous applications of separation theorems for convex sets have depended on rather crude separation results. Recent developments, however, indicate a need for more refined theorems, particularly for ones involving stronger types of separation. The stronger types of separation considered in this study include nice, open, closed, strict, and strong. The attempt to obtain separation theorems under minimal hypotheses suggests a search for maximal theorems, since each such theorem is, in a sense, a best possible result. Eighteen maximal theorems for disjoint nonempty convex subsets are derived, involving open, nice, strong and strict separation. 39 pp. Refs.

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1967
  • Document Number: RM-5354-PR

Citation

Chicago Manual of Style

Klee, Victor, Maximal Separation Theorems for Convex Sets. Santa Monica, CA: RAND Corporation, 1967. https://www.rand.org/pubs/research_memoranda/RM5354.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.