Optimization and Separation
{"Image DocumentName": "Optimization and Separation", "Image ImageDescription": "Relates the complexity of a class of optimization problem over certain polyhedra with the separation problem for the polyhedra. Optimization, separation trivial if A: m\uf0b4n is given explicitly. But if polyhedron is given as conv(X) where X is set of feasible solutions, the story is different. ex) x  \uf0ce conv(X)? for node packing is nontrivial if x  is fractional. Separation problem: Given x  \uf0ce Rn, is x  \uf0ce conv(X)? If not, find an inequality \uf070x \uf0a3 \uf0700 satisfied by all points in X, but violated by the point x . Integer Programming 2011.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}