I'm interested in understanding column generation algorithms for
linear programs, but from what I've read, we need to know EVERY
EXTREME POINT of the polyhedron of the LP. Isn't this a complex
procedure in itself? How can execute the Dantzig Wolfe generation? How
can we generate these extreme points?