Convex and discrete geometry Polytopes and polyhedra Concept
Simple polytope
Summary
A simple polytope is a convex polytope of dimension in which every vertex lies on exactly edges. Near each vertex it then looks like the corner of a cube. Simple polytopes are the duals of simplicial polytopes, so results about one class translate into results about the other. Polytopes given by inequalities in general position are simple, which makes them the generic case in linear programming.
Further reading
About this page
| Tag | 7E6FXTGH2Y |
|---|---|
| URI | m2://7E6FXTGH2Y |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52B05, 52B11, 52B12 |
| Specializes | Convex polytope |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.