A theorem on strict separability of convex polyhedra and its applications in optimization (Q535082)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A theorem on strict separability of convex polyhedra and its applications in optimization |
scientific article; zbMATH DE number 5886731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A theorem on strict separability of convex polyhedra and its applications in optimization |
scientific article; zbMATH DE number 5886731 |
Statements
A theorem on strict separability of convex polyhedra and its applications in optimization (English)
0 references
11 May 2011
0 references
The author gives necessary and sufficient conditions of strict separability of convex polyhedra and presents many applications in optimization.
0 references
convex polyhedra
0 references
Euclidean space
0 references
hyperplane
0 references
distance function
0 references
0.90520877
0 references
0.9046065
0 references
0.90266067
0 references
0.89920366
0 references
0.8974396
0 references
