Could you help me solving the following question? We have a polyhedron P which is described by its set of extreme points: {x1, x2, , xJ } and extreme rays: {d1, d2, , dI }. Given a vector x, create a linear program that will find a hyperplane separating x from P if x is not in P , or will conclude no such separation is possible if x P . Prove the validity of your LP.