[Couenne] Lower bound

[Pietro Belotti]

Hi Akshay,

Couenne has no code in place for those options yet. However, the 
AMPL-Couenne option interface is derived from Bonmin's, so you may look 
for that option in the Bonmin documentation.

Regards,
Pietro

--
Pietro Belotti
Dept. of Mathematical Sciences
Clemson University
email: pbelott at clemson.edu
phone: 864-656-6765
web:   myweb.clemson.edu/~pbelott

On Wed, 31 Aug 2011, Akshay Gupte wrote:

> Hi,
> Assuming that Couenne did not solve my problem to optimality within a
> given time limit, how do I obtain the best lower bound from within AMPL
> ? Are there AMPL-Couenne suffixes such as .bestnode or .bestbound, which
> are available with AMPL-CPLEX.
>
> -- 
> Regards,
> Akshay Gupte
> Ph.D. student
> Operations Research
> Georgia Tech
>
> _______________________________________________
> Couenne mailing list
> Couenne at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/couenne
>