I am trying to answer questions of a combinatorial nature about
- the number of hyperplanes we draw in an LP type problem such as finding the center point of a given point set P having n points.
- The number of faces of the convex polyhedron that we get finally as the feasible region.
- Detecting a point inside this region.
I would like to discuss the proofs of these questions on stackexchange. Kindly help.