Let P R^n be a (not necessarily standard) polyhedron. Suppose you have the set of extreme points and of a complete set of extreme rays of P. Let x P .

A) Formulate a linear programming model that allows us to determine the coefficients to express x as a convex combination of the extreme points of P plus a non-linear combination negative of the extreme rays of P.

B) Formulate the dual of the model from part A).

C) Describe how you would solve the model in part A)