Group: sci.op-research
From: blakman211@hotmail.com
Date: Sunday, April 13, 2008 6:00 PM
Subject: Column Generation Algorithms

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?

Safety Articles | News in English | 20lbs in 30 days | Bluegrass | Usenet Newsfeeds