OurBigBook About$ Donate
 Sign in Sign up

Full-dimensional linear polyhedron (aff(P)=Rn)

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Linear programming Linear polyhedron
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A linear polyhedron in Rn is full-dimensional when its affine hull is all of Rn. Equivalently, it contains an open Euclidean ball. An open Euclidean ball spans the ambient space. Conversely, a full-dimensional convex set contains n+1 affinely independent points; their convex hull is a simplex with nonempty interior, so the set contains an open Euclidean ball.

 Ancestors (6)

  1. Linear polyhedron
  2. Linear programming
  3. Mathematical optimization
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Full-dimensional relaxation of integer inequalities
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 37 / 2 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook