[Coin-discuss] Questions about bounds and model options
John J Forrest
jjforre at us.ibm.com
Fri Nov 23 06:26:26 EST 2007
Christian,
Probably the best bet is to use an event handler derived from
ClpEventHandler. Look at Clp/src/unitTest.cpp and
Clp/src/MyEventHandler.?pp. I would test if endOfFactorization and then
see if feasible and objective looks okay.
John Forrest
woelliusm at aol.com
Sent by:
coin-discuss-boun To
ces at list.coin-or. coin-discuss at list.coin-or.org
org cc
Subject
11/22/2007 06:44 [Coin-discuss] Questions about
AM bounds and model options
Please respond to
Discussions about
open source
software for
Operations
Research
<coin-discuss at lis
t.coin-or.org>
Dear all,
I got two questions, one about a lower bound and one about model options:
1.) I have a CBC-minimizing problem. I know the minimal value of the
objective function before starting the optimization. The solver will not
find a lower value than for example 100. If the solver finds a solution
with the objective function value 100, it should stop searching. There is
no need to prove that the solution is optimal. What is the best way to
"tell" the solver to stop if he finds such a solution?
2.) I want to set a time limit of for example 6 hours (this is not a
problem). Within the six hours, the solver searchs the best solution
possible. If the best solution is not found after six hours, it is only
necessary to find a solution which is about ten percent away form the best
objective function value. How do I do this?
Thanks in advance,
Christian Woellenstein
Bei AOL gibt's jetzt kostenlos eMail für alle! Was es sonst noch umsonst
bei AOL gibt, finden Sie hier heraus AOL.de.
_______________________________________________
Coin-discuss mailing list
Coin-discuss at list.coin-or.org
http://list.coin-or.org/mailman/listinfo/coin-discuss
More information about the Coin-discuss
mailing list