Let $a_1,a_2,..,a_n\in\mathbb{R}^m$, $n>m$ and the points are in general position meaning, no hyperplane contains more than $m$ points. Define a polyhedron $$P=\{x\in\mathbb{R}^m:a_1'x\leq0, a_2'x\leq0,.., a_k'x\leq0, a_{k+1}'x\leq1,.., a_n'x\leq1\} \; .$$ Notice that $k$ inequalities are with $0$ and $n-k$ inequalities are with $1$. Assume that $ k < m$ and $P$ is bounded so that $P$ is a polytope. My question is how do I characterize all the faces of this polytope? Is the information given enough to do that?

More Info: I have a function that I want to optimize but it depends only on certain variables. So I thought, info should help than hinder. Incorporating the info in the problem brings me to the polytope above. Also I don't need all the faces. some face of this polytope whose dimension includes this $k$ some how does the job. What have I tried: Let $$Q=Conv\{a_1, a_2,.., a_n\} \; .$$ The polar of $Q$ turns out to be $$Q^*=\{x\in\mathbb{R}^m:a_1'x\leq1, a_2'x\leq1,.., a_n'x\leq1\} \; .$$ and If $0\in Q$ then $Q^*$ is also a polytope which is also dual to $Q$ and hence faces are related by dual relationship. The polytope $P$ above, is a face of this polar polytope right? If so, then I have to relate an r dimensional face $F$ of $Q$ using duality to a face of some dimensional face of $P$. Don't know from here.

any$m$-dimensional convex polytope with this construction. So there's unlikely to be a simple answer. – JeffE Apr 8 '12 at 16:17