The Minkowskij distance between two disjoint convex polyhedral sets (Q2563378)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 957035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Minkowskij distance between two disjoint convex polyhedral sets |
scientific article; zbMATH DE number 957035 |
Statements
The Minkowskij distance between two disjoint convex polyhedral sets (English)
0 references
11 December 1996
0 references
This note generalizes the results of \textit{Eh. G. Davydov} [Operations Research, Moskva (1990)]. It is shown how to find in a direct way the distance between two nonintersected convex polyhedrals with respect to a Minkowskii norm.
0 references
convex polyhedra
0 references
Minkowskii distance
0 references
convex programming
0 references
linear programming
0 references
0.7817969918251038
0 references
0.7793722152709961
0 references
