<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><div>Hi Indrajit,</div><div><br></div><div>Can you send the model for a better understanding?</div><div><br></div><div>Thanks,</div><div><br></div><div>Mike<br><br><br></div><div><br>Am 02.12.2014 um 17:38 schrieb Indrajit Sen Gupta <<a href="mailto:indrajitsg@gmail.com">indrajitsg@gmail.com</a>>:<br><br></div><blockquote type="cite"><div><div dir="ltr"><div>Hi Mike,</div><div> </div><div>I am running CMPL on a small version of very big problem I need to solve. The current problem has 100 binary variables and about 20 constraints. The objective function is a bit non linear as it has a term x[i,j] * x[k, m]. The program has been running for about 3 hours now and the output is showing:</div><div> </div><div><font face="monospace">After 20300 nodes, 5239 on tree, -51762900 best solution, best possible -62975151 (10407.49 seconds)</font></div><div><font face="Courier New"></font> </div><div><font face="arial,helvetica,sans-serif">Any idea how much time it will take to complete? I understand, with binary variables it is difficult to predict, but supposing I were to stop in mid way, is there any way to get the current best solution?</font></div><div> </div><div>Regrads,</div><div>Indrajit</div></div>
</div></blockquote><blockquote type="cite"><div><span>_______________________________________________</span><br><span>Cmpl mailing list</span><br><span><a href="mailto:Cmpl@list.coin-or.org">Cmpl@list.coin-or.org</a></span><br><span><a href="http://list.coin-or.org/mailman/listinfo/cmpl">http://list.coin-or.org/mailman/listinfo/cmpl</a></span></div></blockquote></body></html>