[Coin-lpsolver] quadratic objective

[Matthew Guthaus]

Or am I supposed to declare a ClpInterior classs instead of a  
ClpSimplex class (which was in the last example)?

I've seen many different ways in testQP.c and unitTest.c and am  
confused...

Thanks,

Matt

On Aug 30, 2005, at 11:14 AM, Matthew Guthaus wrote:

> I know there's been messages on this before, but I'm confused what  
> works, what is implemented but not tested, etc.
>
> As far as I can tell, there are several methods to solve QP  
> objective problems:
>
> ONE WAY
>
> solvectl.setSolveType(ClpSolve::useDual); // very fast, but  
> getObjValue is always 0
> -OR-
> solvectl.setSolveType(ClpSolve::usePrimal); // slower, but  
> getObjValue looks reasonable (different than CPLEX)
> -OR-
> solvectl.setSolveType(ClpSolve::useBarrier); // very slow
> solvectl.setPresolveType(ClpSolve::presolveOn);
> model.initialSolve(solvectl);
>
> ANOTHER WAY
> model.nonlinearSLP(100,1.0e-4); //
>
>
> However, none of these methods get the same cost solution as  
> CPLEX... what is the preferred method?
>
> Thanks,
>
> Matt
> _______________________________________________
> Coin-lpsolver mailing list
> Coin-lpsolver at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-lpsolver
>