<div dir="ltr"><p style="margin-bottom:0cm">The problem is not the feasibility of
the problem but the time it takes to solve it. 130 sec is way above
what I would consider acceptable for the implementation I want to do.
As I stated before, a problem may be comprised of 300+ of these
dumps. Most of them will be solved in a fraction of a second, but if
every complex ones take 130 sec I will not be able to use this
implementation and will be forced revert to a simpler approach to the
problem that gives me lesser results.</p><p style="margin-bottom:0cm"> I will keep looking for another solution.<br></p><p style="margin-bottom:0cm"><br></p><div class="gmail_extra"><br><div class="gmail_quote">On Sat, May 17, 2014 at 1:22 AM, Rod Frowd <span dir="ltr"><<a href="mailto:rod@frowd.net" target="_blank">rod@frowd.net</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">
<div style="background-color:rgb(255,255,255);color:rgb(0,0,0)" bgcolor="#FFFFFF" text="#000000">
This problem seems to solve ok with cplex:<br>
<br>
Microsoft Windows [Version 6.1.7601]<br>
Copyright (c) 2009 Microsoft Corporation. All rights reserved.<br>
<br>
C:\Users\Rod Frowd>cd downloads<br>
<br>
C:\Users\Rod Frowd\Downloads>cplex<br>
<br>
Welcome to CPLEX Interactive Optimizer 12.1.0<br>
with Simplex, Mixed Integer & Barrier Optimizers<br>
5724-Y48 (c) Copyright IBM Corp. 1988, 2009. All Rights Reserved.<br>
CPLEX is a registered trademark of IBM Corp.<br>
<br>
Type 'help' for a list of available commands.<br>
Type 'help' followed by a command name for more<br>
information on commands.<br>
<br>
<br>
CPLEX> r dump-5-20121111.lp<br>
Warning, line 33970: Name 'tolerance_0' does not exist.<br>
Warning, line 33971: Name 'tolerance_0' does not exist.<br>
Warning, line 33972: Name 'tolerance_1' does not exist.<br>
Warning, line 33973: Name 'tolerance_1' does not exist.<br>
Warning, line 33986: Name 'tolerance_4' does not exist.<br>
Warning, line 33987: Name 'tolerance_4' does not exist.<br>
Warning, line 33988: Name 'tolerance_5' does not exist.<br>
Warning, line 33989: Name 'tolerance_5' does not exist.<br>
Warning, line 33996: Name 'tolerance_7' does not exist.<br>
Warning, line 33997: Name 'tolerance_7' does not exist.<br>
Warning, line 36312: Name 'tolerance_0' does not exist.<br>
Warning, line 36312: Name 'tolerance_1' does not exist.<br>
Warning, line 36313: Name 'tolerance_4' does not exist.<br>
Warning, line 36313: Name 'tolerance_5' does not exist.<br>
Warning, line 36314: Name 'tolerance_7' does not exist.<br>
Problem 'dump-5-20121111.lp' read.<br>
Read time = 0.08 sec.<br>
CPLEX> o<br>
Tried aggregator 1 time.<br>
MIP Presolve eliminated 367 rows and 2385 columns.<br>
Aggregator did 5 substitutions.<br>
Reduced MIP has 3344 rows, 20712 columns, and 69531 nonzeros.<br>
Reduced MIP has 20708 binaries, 4 generals, 0 SOSs, and 0
indicators.<br>
Presolve time = 0.33 sec.<br>
Clique table members: 3322.<br>
MIP emphasis: balance optimality and feasibility.<br>
MIP search method: dynamic search.<br>
Parallel mode: deterministic, using up to 8 threads.<br>
Root relaxation solution time = 1.34 sec.<br>
<br>
Nodes Cuts/<br>
Node Left Objective IInf Best Integer Best Node
ItCnt Gap<br>
<br>
0 0 0.0000 856 0.0000
4698<br>
0 0 0.0000 4 Fract: 2
4698<br>
0 0 0.0000 9 Cuts: 2
4702<br>
0 2 0.0000 9 0.0000
4702<br>
* 83 70 integral 0 5.0000 0.0000
58637 100.00%<br>
100 80 infeasible 5.0000 0.0000
66047 100.00%<br>
* 128 80 integral 0 3.0000 0.0000
89612 100.00%<br>
200 86 1.0000 4 3.0000 0.0000
126676 100.00%<br>
300 104 1.0000 4 3.0000 0.0000
176476 100.00%<br>
400 120 0.5000 59 3.0000 0.5000
225409 83.33%<br>
500 87 0.0000 33 3.0000 0.5000
284694 83.33%<br>
600 30 infeasible 3.0000 0.5000
345371 83.33%<br>
700 24 infeasible 3.0000 0.6667
409641 77.78%<br>
800 4 1.3333 100 3.0000 0.6667
439745 77.78%<br>
<br>
Zero-half cuts applied: 3<br>
Gomory fractional cuts applied: 5<br>
<br>
Root node processing (before b&c):<br>
Real time = 6.60<br>
Parallel b&c, 8 threads:<br>
Real time = 122.65<br>
Sync time (average) = 42.83<br>
Wait time (average) = 53.99<br>
-------<br>
Total (root+branch&cut) = 129.25 sec.<br>
<br>
Solution pool: 2 solutions saved.<br>
<br>
MIP - Integer optimal solution: Objective = 3.0000000000e+000<br>
Solution time = 129.65 sec. Iterations = 442232 Nodes = 823<br>
<br>
CPLEX><div><div class="h5"><br>
<div>On 14/05/2014 5:14 AM, Karl St-Cyr
wrote:<br>
</div>
</div></div><blockquote type="cite"><div><div class="h5">
<div dir="ltr">
<p style="margin-bottom:0cm">
<font color="#222222"><font face="Times New Roman, serif"><font size="3">Hello
again,</font></font></font></p>
<p style="margin-bottom:0cm">
<br>
</p>
<p style="margin-bottom:0cm">
<font color="#222222"><font face="Times New Roman, serif"><font size="3">First
of all, I would like to thanks the mailing list for the
support. I
realize I am quite new to this and your support has made
the whole
experience much more positive and has pointed me in the
right
direction.</font></font></font></p>
<p style="margin-bottom:0cm">
<br>
</p>
<p style="margin-bottom:0cm"><font color="#222222"><font face="Times New Roman, serif"><font size="3">I
realized I had some bugs in the creation of my linear
problem and I
hopefully fixed them. Even with the tips I got, the
"new"
problem is unsolvable in a decent amount of time. The
linear problem
take over 5 000 seconds to solve. I've read the
documentation and
tried different combination of arguments without any
luck. So, once
again, I'm asking for some help.</font></font></font></p>
<p style="margin-bottom:0cm"><br>
</p>
<p style="margin-bottom:0cm">
<font color="#222222"><font face="Times New Roman, serif"><font size="3">Here
is an instance I have issues with.</font></font></font></p>
<p style="margin-bottom:0cm">
<br>
</p>
<p style="margin-bottom:0cm"><a href="https://www.dropbox.com/sh/qh311l5gqt1mhcx/AABervHj6hcTmrIvyTFbsOxfa" target="_blank"><font color="#1155cc"><font face="Times New
Roman, serif"><font size="3">https://www.dropbox.com/sh/qh311l5gqt1mhcx/AABervHj6hcTmrIvyTFbsOxfa</font></font></font></a></p>
<p style="margin-bottom:0cm"><font face="Times New Roman, serif"><font size="3"><br>
</font></font><br>
</p>
</div>
<div class="gmail_extra"><br>
<br>
<div class="gmail_quote">On Thu, May 8, 2014 at 8:39 AM, Karl
St-Cyr <span dir="ltr"><<a href="mailto:karl@patrikdufresne.com" target="_blank">karl@patrikdufresne.com</a>></span>
wrote:<br>
<blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">
<div dir="ltr">
<div dir="ltr" style="font-family:arial,sans-serif;font-size:13px">
<p style="margin-bottom:0cm">Hi,</p>
<p style="margin-bottom:0cm">
I'm trying to use CBC to solve my linear problem.
After implementing a version of BigM I manage to find
a better solution but the time to solve it is a bit
too high for my needs. This is my first time using CBC
and I want to make sure I'm not doing something wrong
or missing a way to speed it up.</p>
<p style="margin-bottom:0cm">You'll find 3 dump examples
I have problems with in the link bellow (take note
that 1 problem can be composed of 300+ of theses dumps
and would need to execute all of them in more or less
7 min, some of the dumps are also taking close to no
time).</p>
</div>
<div class="gmail_extra"><br clear="all">
<div>
<div dir="ltr"><font face="arial, sans-serif"><a href="https://www.dropbox.com/sh/dff6h98qxhf7svy/AAC60y10SORx3b25P7bT2bAOa" target="_blank">https://www.dropbox.com/sh/dff6h98qxhf7svy/AAC60y10SORx3b25P7bT2bAOa</a></font><br>
</div>
<div dir="ltr"><font face="arial, sans-serif"><br>
</font></div>
<div><font face="arial, sans-serif">Thank you for your
help</font></div>
<span><font color="#888888">
<div><font face="arial, sans-serif">Karl</font></div>
<div dir="ltr">
<font face="arial, sans-serif"><br>
</font></div>
</font></span></div>
</div>
</div>
</blockquote>
</div>
<br>
<br clear="all">
<div><br>
</div>
-- <br>
<div dir="ltr">Karl St-Cyr
<div>Développeur logiciel<br>
</div>
<div>Patrik Dufresne Service Logiciel</div>
</div>
</div>
<br>
<fieldset></fieldset>
<br>
</div></div><pre>_______________________________________________
Cbc mailing list
<a href="mailto:Cbc@list.coin-or.org" target="_blank">Cbc@list.coin-or.org</a>
<a href="http://list.coin-or.org/mailman/listinfo/cbc" target="_blank">http://list.coin-or.org/mailman/listinfo/cbc</a>
</pre>
</blockquote>
<br>
<br><br>
<hr style="border:none;color:rgb(144,144,144);background-color:rgb(176,176,176);min-height:1px;width:99%">
<table style="border-collapse:collapse;border:none">
<tbody><tr>
<td style="border:none;padding:0px 15px 0px 8px">
<a href="http://www.avast.com/" target="_blank">
<img border="0" src="http://static.avast.com/emails/avast-mail-stamp.png">
</a>
</td>
<td>
<p style="color:rgb(61,77,90);font-family:Calibri,Verdana,Arial,Helvetica;font-size:12pt">
This email is free from viruses and malware because <a href="http://www.avast.com/" target="_blank">avast! Antivirus</a> protection is active.
</p>
</td>
</tr>
</tbody></table>
<br>
</div>
</blockquote></div><br><br clear="all"><div><br></div>-- <br><div dir="ltr">Karl St-Cyr<div>Développeur logiciel<br></div><div>Patrik Dufresne Service Logiciel</div></div>
</div></div>