a Suppose we are given the extreme points and extreme rays of a pointed polyhedron P CR”. Let ĉ E IR". Construct a linea
Posted: Thu Feb 17, 2022 11:06 am
a Suppose we are given the extreme points and extreme rays of a pointed polyhedron P CR”. Let ĉ E IR". Construct a linear programming problem whose solution provides us with an inequality gfx > głê that is satisfied by all x E P and violated by ê, or allows us to conclude that no such inequality exists. What is the dual of your LP? Give an interpretation of the dual LP. (Such an inequality defines a separating hyperplane that separates î from P. Note that the variables in the LP will include g.)