[Coin-discuss] COIN algorithm selection

[David T]

Hello,

My name is David Trainor, and I am conducting bioinformatics research at the 
University of Waterloo.

I am using COIN, and I have a question which *should* be trivial to answer.  
I would be very grateful for any insights you can provide.

Basically, I'm designing an application which must solve very large linear 
programming problems.  Depending on the problem instance, there will be 
times when I will want to call each of the following algorithms:

1.  Primal Simplex algorithm
2.  Dual Simplex algorithm
3.  Interior Point algorithm (in IBM OSL, ekk_barrier and ekk_crossover)
4.  Something equivalent to ekk_eitherSimplex

We are using COIN-OSI because we don't want to limit our software to any 
particular simplex implementation.  How do you suggest dealing with this?  
initialSolve() seems too abstract, but I don't want to devote myself to a 
particular LP package.

Thank you in advance for your help.

Best regards,

Dave.

_________________________________________________________________
The new MSN 8: advanced junk mail protection and 2 months FREE*  
http://join.msn.com/?page=dept/bcomm&pgmarket=en-ca&RU=http%3a%2f%2fjoin.msn.com%2f%3fpage%3dmisc%2fspecialoffers%26pgmarket%3den-ca