Let K be a bounded, d-dimensional convex polyhedron that is not simplex and P is a point on K. Show that if vertices P1,...,Pk are not all on the same face of K, then one of them can be omitted so that the convex hull of the remaining vertices of K still contains P.caratheodory's theorem might be useful. combinatorial geometryeuclidean geometryconvex geometry