I have heard claims that for a certain class of optimization problems, one can re-write the problem as a linear-programming problem on the convex hull of the solution space of the original problem (even though enumerating the constraints that define the polytope could be computationally very expensive). Is this correct? If so, what class of optimization problems can be re-written this way? and what references can I use to back up this claim?
Optimization as LP on the convex hull of its solution space
optimization;linear programming;convex optimization