[Coin-lpsolver] Problem start position

[Kyle Ellrott]

I'm still trying to get a handle on some of the technical details in 
linear programming, so please excuse me if this question is out 
there...

 From what I under stand, simplex works by moving from vertex to vertex 
of possible solutions, until it finds the optimal one.  I was 
wondering, if I could produce a feasible answer (with dynamic 
programming), that is close to the optimal point (and would have been 
optimal save for some additional complexities added to the problem, 
which is why I'm using integer programming and not dynamic), could I 
use that as a start point in the search?  Would this improve the speed 
of the algorithm?  And if it is possible, how would I go about 
initializing CLP with this information?


Kyle