A theorem about antiprisms (Q1058731)

For a d-polytope P and its algebraic dual \(P^*\) the polytope \(Q=conv(P\times \{1\}\), \(P^*\times \{0\})\) is called an antiprism if the faces of Q are precisely \(conv(F\times \{1\},F^*\times \{0\})\), where F is a face of P and \(F^*\) is the dual face of \(P^*.\) The author shows that Q is an antiprism iff P satisfies (PR) For each face F of P the orthogonal projection of the origin onto \(aff F\) lies in \(relint F.\) He also gives a fast algorithm for solving an LP whose polyhedron satisfies (PR). Replacing the algebraic by the combinatorial dual the characterization of antiprisms becomes an open problem.