Lexicographical separation in \({\mathbb{R}}^ n\) (Q1819730): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90312-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029950777 / rank | |||
Normal rank | |||
Revision as of 18:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lexicographical separation in \({\mathbb{R}}^ n\) |
scientific article |
Statements
Lexicographical separation in \({\mathbb{R}}^ n\) (English)
0 references
1987
0 references
In terms of lexicographical order of \({\mathbb{R}}^ n\) the authors give a new version of separation theorem for two sets with disjoint convex hulls by complementary hemi-spaces (hemi-space is a convex set with convex complement). For lexicographic separation of convex sets see also C. E. Moore (1973). Structure of hemi-spaces in linear space was investigated by G. Coquet, J.-C. Dupin (1973) and by M. Lassak in \({\mathbb{R}}^ n\) (1984).
0 references
lexicographic separation of convex sets
0 references
