[Coin-discuss] using CLP barrier with OSI

[Kish Shen]

John J Forrest wrote:
> However the standard barrier in Clp is not good if you do not use a 
> third-party ordering and factorization code.  One from the University 
> of Florida is suitable.  If I get time next week I will try and make 
> it easier to use with the svn version of Coin - It was working in the 
> old cvs version.  This what you have to do - add to your configure
>
> ADD_CXXFLAGS="-DUFL_BARRIER -I(directory with amd.h) -L(directory with 
> libamd.a) -lamd
>
> You will get mild warnings that -lamd is being ignored for compilation.
>
I am trying to compile Clp with UFL_BARRIER as you suggested here, but 
have run into some
problems, and I had to hack the generated Makefile in the Clp directory 
the following way:

1. added ADD_CXXFLAGS to CXXCOMPILE and LTCXXCOMPILE, which is used to 
compile the code
2. added -L(directory with libamd.a) -lamd to clp_LDADD, after 
libClp.la. This is needed to linking.
I am not sure if I have added these correctly, but I got the code 
compiled.Should I have added it somewhere else?

Kish Shen





> Then play with clp using -chol UFL
>
> Barrier.cpp will also work but you have to add an extra -lamd in 
> Makefile (before -lm).  As I said I will try and make prettier next week.
>
> You might also try the dualCuts.cpp example in Clp/examples which 
> might work well with a problem of the shape you describe.  If you then 
> want to convert to Osi the function calls would be very similar.
>
> John Forrest
>
>
> *"Renaud Lepere" <renaud.lepere at alma.fr>*
> Sent by: coin-discuss-bounces at list.coin-or.org
>
> 10/16/2006 06:15 AM
> Please respond to
> Discussions about open source software for Operations Research       
>  <coin-discuss at list.coin-or.org>
>
>
> 	
> To
> 	<coin-discuss at list.coin-or.org>
> cc
> 	
> Subject
> 	[Coin-discuss] using CLP barrier with OSI
>
>
>
> 	
>
>
>
>
>
> I am using linear programing and COIN-OR (osi and clp) to optimize
> nesting problems. I have quite a lot of variables (up to 1000)
> representing positions of nested parts and approximatly the same
> order of magnitude of constaints (up to 5000). Those constraints
> corresponds to the non-overlapping condition between nested parts.
>
> I would like to solve those problems as fast as possible. I would like
> to know if a barrier algorihtm can speed up my computation time ; and
> if it is possible to use the barrier algorithm included in CLP with OSI
> ?
>
> Thanks
>
> Renaud
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-discuss
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-discuss
>